Scribd
Upload
50 views

Exercises For Seminar and Homework 2

The document provides exercises for homework on propositional logic and quantificational logic. It includes exercises to use truth tables to verify logical equivalences and tautologies, as well as exercises involving predicates, quantifiers, and determining truth values of statements over various domains.

Uploaded by

Bimukhanbet Aitmaganbet
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
50 views

Exercises For Seminar and Homework 2

The document provides exercises for homework on propositional logic and quantificational logic. It includes exercises to use truth tables to verify logical equivalences and tautologies, as well as exercises involving predicates, quantifiers, and determining truth values of statements over various domains.

Uploaded by

Bimukhanbet Aitmaganbet
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Exercises for Seminar 2

2.1. Use truth tables to verify the following equivalences.


a) p∧T ⇔ p ; b) p∨F ⇔ p ; c) p∨T ⇔T ; d) p∧F ⇔ F ; e) p∧ p ⇔ p ; f) p∨ p ⇔ p .
2.2. Use truth tables to verify the commutative laws: a) p∨q ⇔ q∨p ; b) p∧q ⇔ q∧p .
2.3. Use truth tables to verify the following:
a) p∧(q∨r )⇔( p∧q )∨( p∧r ) ; b) p↔ q ⇔( p →q )∧( q → p ) .
2.4. Show that each of the following implications is a tautology by using truth tables.
a) ( p∧q )→ p ; b) p→( p∨q) ; c) ¬ p→( p →q) ; d) ( p∧q )→( p→q ) ; e) ¬( p →q )→ p .
2.5. Show that each implication in Ex. 2.4 is a tautology without using truth tables.
2.6. Verify the following equivalences, which are known as the absorption laws:
a) [ p∨( p∧q )]⇔ p ; b) [ p∧( p∨q )]⇔ p .
2.7. Determine whether (¬ p∧( p→q ))→¬q is a tautology.
2.8. Show that p↔ q and ( p∧q )∨(¬p∧¬q ) are logically equivalent.
2.9. Show that p→q and ¬q→¬ p are logically equivalent.
2.10. Find a compound proposition involving the propositions p, q and r that is true when p and q are
true and r is false, but is false otherwise.
2.11. Find a compound proposition involving the propositions p, q and r that is true when exactly
two of p, q and r are true and is false otherwise.

2.12. Let P(x) be the statement “the word x contains the letter a.” What are these truth values?
a) P(orange) b) P(lemon) c) P(true) d) P(false)
2.13. Let Q(x, y) denote the statement “x is the capital of y.” What are these truth values?
a) Q(Denver, Colorado) b) Q(Detroit, Michigan)
c) Q(Massachusetts, Boston) d) Q(NewYork, NewYork)
2.14. Let P(x) be the statement “x can speak Russian” and let Q(x) be the statement “x knows the
computer language C++”. Express each of the following sentences in terms of P(x), Q(x), quantifiers,
and logical connectives where the universe of discourse for x is the set 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 doesn’t 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++.
2.15. Let P(x) be the statement “x = x2.” If the domain consists of the integers, what are these truth
values?
a) P(0) b) P(1) c) P(2) d) P(−1) e) ∃xP(x) f ) ∀xP(x)

2.16. Let Q(x) be the statement “x + 1 > 2x.” If the domain consists of all integers, what are these
truth values?
a) Q(0) b) Q(−1) c) Q(1) d) ∃xQ(x) e) ∀xQ(x) f ) ∃x￢Q(x) g) ∀x￢Q(x)
2.17. Determine the truth value of each of these statements if the domain consists of all real numbers.
a) ∃x(x3 = −1) b) ∃x(x4 < x2) c) ∀x((−x)2 = x2) d) ∀x(2x > x)
2.18. Determine the truth value of each of these statements if the domain for all variables consists of
all integers.
a) ∀n∃m(n2 < m) b) ∃n∀m(n < m2) c) ∀n∃m(n + m = 0) d) ∃n∃m(n2 + m2 = 5)
e ) ∃n∃m(n2 + m2 = 6) f) ∃n∃m(n + m = 4 ∧ n − m = 1)
g) ∃n∃m(n + m = 4 ∧ n − m = 2) h) ∀n∀m∃p(p = (m + n)/2)
Exercise for Homework 2

2.1. Show that ¬(¬p) and p are logically equivalent.

2.2. Use truth tables to verify the associative laws:


a) ( p∨q )∨r ⇔ p∨(q∨r ) ; b) ( p∧q )∧r ⇔ p∧( q∧r ) .

2.3. Use truth tables to verify the equivalence: ¬( p∧q )⇔¬p∨¬q .

2.4. Show that each of the following implications is a tautology by using truth tables.
a) [¬p∧( p∨q )]→q ; b) ¬( p →q )→¬q ; c) [ p∧( p→q )]→q ;
d) [( p∨q )∧( p →r )∧(q→r )]→r .

2.5. Show that each implication in Ex. 2.4 is a tautology without using truth tables.

2.6. Determine whether (¬q∧( p →q))→¬ p is a tautology.

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

2.8. Show that ¬( p ⊕ q) and p↔ q are logically equivalent.

2.9. Find a compound proposition involving the propositions p, q and r that is true when p and q are
false and r is true, but is false otherwise.

2.10. Find a compound proposition involving the propositions p, q and r that is false when p is false
and q and r are true, but is true otherwise.

2.11. Express the negations of each of these statements so that all negation symbols immediately
precede predicates.
a) ∀x∃y∀zT (x, y, z) b) ∀x∃yP(x, y) ∨ ∀x∃yQ(x, y)
c) ∀x∃y(P(x, y) ∧ ∃zR(x, y, z)) d) ∀x∃y(P(x, y) → Q(x, y))

2.12. Determine the truth value of each of these statements if the domain of each variable consists of
all real numbers:
a) ∀ x ∃ y (x 2= y)
b) ∀ x ∃ y ( x = y 2)
c)∃ x ∀ y ( xy =0)
d) ∃ x ∃ y (x + y ≠ y + x)
e) ∀ x ∃ y (x + y =1)
f)∃ x ∃ y (x +2 y =2 2 x +4 y=5)
g) ∀ x ∃ y ( x + y =7)
h) ∃ x ∀ y ( x + y =7)
i) ∀ x ∀ y (x 2+ y 2=16)
j) ∃ x ∀ y (x 2 + y 2=16)

You might also like