CSE 260- 002

QUIZ-2– Propositional equivalences- ANSWER

(30 points/20 minutes)
NAME:

1. (8 points) Answer the following true/false.

(a) p ∧ ¬p is a contradiction
true
(b) (p ∧ ¬q) → (p ∨ q) is a tautology
true
(c) ¬ and ∧ form a functionally complete collection of logical operators.
true
(d) There are only FOUR possible different truth tables for compound propositions
involving two propositions p and q.
false

2. (10 points) Use truth tables to verify that the following three compound propositions
are equivalent:
p → q, ¬p ∨ q, and ¬q → ¬p (contrapositive)

p q -p -q p->q -pVq -q->-p

T T F F T T T
T F F T F F F
F T T F T T T
F F T T T T T

p → q, ¬p ∨ q and ¬q → ¬p are equivalent because the last three columns are the
same.

3. (6 points) Show by using the rules of logical equivalences that p ∧ (p → q) and p ∧ q

are logically equivalent.
Laws are given on the other side
p ∧ (p → q)
⇔ p ∧ (¬p ∨ q) implication law
⇔ (p ∧ ¬p) ∨ (p ∧ q) distrbutive law (distribute ∧ over ∨).
⇔ (F ∨ (p ∧ q) negation laws
⇔ (p ∧ q) identity laws
 4. (6 points) Give the compound proposition in disjunctive Normal Form for the following
truth table.

p q Result

T T T
T F T
F T F
F F T

Disjunctive Normal Form:

(p ∧ q) ∨ (p ∧ ¬q) ∨ (¬p ∧ ¬q)

—————————————

1. Identity Laws
p∧T ⇔p
p∨F ⇔p

2. Double negation law

¬(¬p) ⇔ p

3. Negation Laws
p ∨ ¬p ⇔ T
p ∧ ¬p ⇔ F

4. Distributive laws
p ∧ (q ∨ r) ⇔ (p ∧ q) ∨ (p ∧ r)
p ∨ (q ∧ r) ⇔ (p ∨ q) ∧ (p ∨ r)

5. Associative laws
(p ∨ q) ∨ r ⇔ p ∨ (q ∨ r)
(p ∧ q) ∧ r ⇔ p ∧ (q ∧ r)

6. De Morgan’s laws
¬(p ∧ q) ⇔ ¬p ∨ ¬q
¬(p ∨ q) ⇔ ¬p ∧ ¬q

7. Implication law
p → q ⇔ ¬p ∨ q