Scribd
Upload
106 views2 pages

Tutorial 03

This document provides examples and exercises involving propositional logic and predicate logic, including: 1) Using truth tables to verify logical equivalences and tautologies 2) Translating English language statements into logical expressions using predicates, quantifiers, and connectives 3) Determining the truth value of logical statements given a specified domain

Uploaded by

Jay Thakkar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
106 views2 pages

Tutorial 03

This document provides examples and exercises involving propositional logic and predicate logic, including: 1) Using truth tables to verify logical equivalences and tautologies 2) Translating English language statements into logical expressions using predicates, quantifiers, and connectives 3) Determining the truth value of logical statements given a specified domain

Uploaded by

Jay Thakkar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Tutorial 3

1. Use a truth table to verify the distributive law p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r).


2. Show that each of these conditional statements is a tautology by using truth tables.

a) (p ∧ q) → p e) ¬(p → q) → p
b) p → (p ∨ q) f) ¬(p → q) → ¬q
c) ¬p → (p → q) g) (p → q) ∧ (p → ¬q) ∧ (¬p → q) ∧ (¬p → ¬q)
d) (p ∧ q) → (p → q) h) (p ↔ q) ∧ (¬p ↔ q)

3. Show that (p → q) → r and p → (q → r) are not logically equivalent.


4. Find a compound proposition involving the propositional variables p, q, and r that is true when exactly
two of p, q, and r are true and is false otherwise.
5. The following sentence is taken from the specification of a telephone system: “If the directory database is
opened, then the monitor is put in a closed state if the system is not in its initial state.” This specification
is hard to understand because it involves two conditional statements. Find an equivalent, easier-to-
understand specification that involves disjunctions and negations but not conditional statements.
6. How many of the disjunctions p ∨ ¬q ∨ s, ¬p ∨ ¬r ∨ s, ¬p ∨ ¬r ∨ ¬s, ¬p ∨ q ∨ ¬s, q ∨ r ∨ ¬s, q ∨ ¬r ∨ ¬s,
¬p ∨ ¬q ∨ ¬s, p ∨ r ∨ s, and p ∨ r ∨ ¬s can be made simultaneously true by an assignment of truth values
to p, q, r, and s?
7. Let P (x) be the statement “x spends more than five hours every weekday in class,” where the domain for
x consists of all students. Express each of these quantifications in English.

a) ∃x P (x) c) ∃x ¬P (x)
b) ∀x P (x) d) ∀x ¬P (x)

8. Translate these statements into English, where C(x) is “x is a comedian” and F (x) is “x is funny” and
the domain consists of all people.

a) ∀x (C(x) → F (x)) c) ∃x (C(x) → F (x))


b) ∀x (C(x) ∧ F (x)) d) ∃x (C(x) ∧ F (x))

9. Let P (x) be the statement “x can speak Russian” and let Q(x) be the statement “x knows the com-
puter language C++.” Express each of these sentences in terms of P (x), Q(x), quantifiers, and logical
connectives. The domain for quantifiers consists of all students at your school.

a) There is a student at your school who can speak Russian and who knows C++.
b) There is a student at your school who can speak Russian but who does not know C++.
c) Every student at your school either can speak Russian or knows C++.
d) No student at your school can speak Russian or knows C++.

10. Determine the truth value of each of these statements if the domain consists of all integers.

a) ∀n (n + 1 > n) c) ∃n (n = −n)
b) ∃n (2n = 3n) d) ∀n (3n ≤ 4n)

1
11. Suppose that the domain of the propositional function P (x) consists of the integers 0, 1, 2, 3, and 4. Write
out each of these propositions using disjunctions, conjunctions, and negations.

a) ∃x P (x) c) ∃x ¬P (x) e) ¬∃x P (x)


b) ∀x P (x) d) ∀x ¬P (x) f) ¬∀x P (x)

12. For each of these statements find a domain for which the statement is true and a domain for which the
statement is false.

a) Everyone is studying discrete mathematics.


b) Everyone is older than 21 years.
c) Every two people have the same mother.
d) No two different people have the same grandmother.

13. Translate each of these statements into logical expressions using predicates, quantifiers, and logical con-
nectives.

a) No one is perfect.
b) Not everyone is perfect.
c) All your friends are perfect.
d) At least one of your friends is perfect.
e) Everyone is your friend and is perfect.
f) Not everybody is your friend or someone is not perfect.

14. Translate each of these statements into logical expressions in three different ways by varying the domain
and by using predicates with one and with two variables.

a) A student in your school has lived in Vietnam.


b) There is a student in your school who cannot speak Hindi.
c) A student in your school knows Java, Prolog, and C++.
d) Everyone in your class enjoys Thai food.
e) Someone in your class does not play hockey.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy