Logical Equivalences

CMPUT 272

Theorem 2.1.1 Logical Equivalences involving , , and

[Epp Chapter 2.1]
Given any statement variables p, q, and r, a tautology t and a contradiction c, the following
logical equivalences hold.
1. Commutative laws:
pq qp
pq qp
2. Associative laws
(p q) r p (q r)
(p q) r p (q r)
3. Distributive laws:
p (q r) (p q) (p r) p (q r) (p q) (p r)
4. Identity laws:
ptp
pcp
5. Negation laws:
ppt
ppc
6. Double negative law:
( p) p
7. Idempotent laws:
ppp
ppp
8. Universal bound laws: p t t
pcc
9. De Morgans laws:
(p q) p q
(p q) p q
10. Absorption laws:
p (p q) p
p (p q) p
11. Negations of t and c: t c
ct
Logical equivalences involving
12. Division into cases:
13. Representation of if-then as or:
14. Negation of conditional:
15. Contrapositive of conditional:

[Epp Chapter 2.2]

p q r (p r) (q r)
pq pq
(p q) p q
pq qp

Logical equivalences involving

16. Biconditional as and of conditionals:
17. Biconditional as or of ands:

p q (p q) (q p)
p q (p q) ( p q)