Assignment 1 1

Subject: Discrete Structure Program: BS(CS)

Please upload your handwritten solution on CUOnline Portal.

1. Use truth tables to verify these equivalences. 13. Use truth tables to verify the absorption laws.
a) p ∧ T ≡ p b) p ∨ F ≡ p a) p ∨ (p ∧ q) ≡ p b) p ∧ (p ∨ q) ≡ p
c) p ∧ F ≡ F d) p ∨ T ≡ T 14. Determine whether (¬p ∧ (p → q)) → ¬q is a tautol-
e) p ∨ p ≡ p f) p ∧ p ≡ p ogy.
2. Show that ¬(¬p) and p are logically equivalent. 15. Determine whether (¬q ∧ (p → q)) → ¬p is a tautol-
3. Use truth tables to verify the commutative laws ogy.
a) p ∨ q ≡ q ∨ p. b) p ∧ q ≡ q ∧ p. Each of Exercises 16–28 asks you to show that two compound
4. Use truth tables to verify the associative laws propositions are logically equivalent. To do this, either show
that both sides are true, or that both sides are false, for exactly
a) (p ∨ q) ∨ r ≡ p ∨ (q ∨ r).
the same combinations of truth values of the propositional
b) (p ∧ q) ∧ r ≡ p ∧ (q ∧ r). variables in these expressions (whichever is easier).
5. Use a truth table to verify the distributive law 16. Show that p ↔ q and (p ∧ q) ∨ (¬p ∧ ¬q) are logically
p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r). equivalent.
6. Use a truth table to verify the first De Morgan law 17. Show that ¬(p ↔ q) and p ↔ ¬q are logically equiva-
¬(p ∧ q) ≡ ¬p ∨ ¬q. lent.
18. Show that p → q and ¬q → ¬p are logically equivalent.
7. Use De Morgan’s laws to find the negation of each of the
19. Show that ¬p ↔ q and p ↔ ¬q are logically equivalent.
following statements.
20. Show that ¬(p ⊕ q) and p ↔ q are logically equivalent.
a) Jan is rich and happy. 21. Show that ¬(p ↔ q) and ¬p ↔ q are logically equiva-
b) Carlos will bicycle or run tomorrow. lent.
c) Mei walks or takes the bus to class. 22. Show that (p → q) ∧ (p → r) and p → (q ∧ r) are log-
d) Ibrahim is smart and hard working. ically equivalent.
8. Use De Morgan’s laws to find the negation of each of the 23. Show that (p → r) ∧ (q → r) and (p ∨ q) → r are log-
following statements. ically equivalent.
a) Kwame will take a job in industry or go to graduate 24. Show that (p → q) ∨ (p → r) and p → (q ∨ r) are log-
school. ically equivalent.
b) Yoshiko knows Java and calculus. 25. Show that (p → r) ∨ (q → r) and (p ∧ q) → r are log-
c) James is young and strong.
ically equivalent.
d) Rita will move to Oregon or Washington.
26. Show that ¬p → (q → r) and q → (p ∨ r) are logically
9. Show that each of these conditional statements is a tau- equivalent.
tology by using truth tables. 27. Show that p ↔ q and (p → q) ∧ (q → p) are logically
a) (p ∧ q) → p b) p → (p ∨ q) equivalent.
c) ¬p → (p → q) d) (p ∧ q) → (p → q) 28. Show that p ↔ q and ¬p ↔ ¬q are logically equivalent.
e) ¬(p → q) → p f ) ¬(p → q) → ¬q
29. Show that (p → q) ∧ (q → r) → (p → r) is a tautol-
10. Show that each of these conditional statements is a tau- ogy.
tology by using truth tables. 30. Show that (p ∨ q) ∧ (¬p ∨ r) → (q ∨ r) is a tautology.
a) [¬p ∧ (p ∨ q)] → q 31. Show that (p → q) → r and p → (q → r) are not log-
b) [(p → q) ∧ (q → r)] → (p → r) ically equivalent.
c) [p ∧ (p → q)] → q
d) [(p ∨ q) ∧ (p → r) ∧ (q → r)] → r 32. Show that (p ∧ q) → r and (p → r) ∧ (q → r) are not
11. Show that each conditional statement in Exercise 9 is a logically equivalent.
tautology without using truth tables. 33. Show that (p → q) → (r → s) and (p → r) →
12. Show that each conditional statement in Exercise 10 is a (q → s) are not logically equivalent.
tautology without using truth tables.