SESSION 4

Demorgans Laws
Statement
(1) (p v q) p ^ q
(2) (p ^ q) p v q by truth table
Proof
(1) (p v q) p ^ q
P
T
T
F
F

q
T
F
T
F

(p v q)
F
F
F
T

p^q
F
F
F
T

P^q
T
F
F
F

(p ^ q)
F
T
T
T

(2) (p ^ q) p v q
P
T
T
F
F

q
T
F
T
F

p v q
F
T
T
T

LAWS OF LOGIC
Logical Equivalences
1. Idempotent Laws
2.Associative Laws
3.Commutative Laws
4.Demorgans Laws
5.Distributive Laws

P ^ p p ; P v p p
(p^ q) ^ r p^(q ^ r)
(p v q)v r p v(q v r)
p^ q q ^ p
pvq qvp
(p^ q) (p v q)
(p v q) (p ^ q)
P^(q v r) (p ^ q) v (p ^ r)
P v (q ^ r) (p v q) ^ (p v r)

6.Component Laws
7.Dominance Laws
8.Identity Laws
9.Absorption Laws
10.Double negation
Law
11.Contrapositive Law
12.Exportation Laws
13.Conditional as
Disjunction
14.Biconditional as
Conditional

P ^ p F
P v p T
P v T T T:tautology
P ^ F F F:contradiction
P^T p
P ^ F p
P v (p ^ q) p
P ^ (p v q) p
( p) p
P q q p
P ( q r) (p ^ q) r
P q p v q
P q ( P q) ^ (q p)

Logical Implications
1. Detachment / Modus
ponens
2.Contrapositive /
Modus tollens
3.Disjunctive addtion
4.Conjunctive
simplication
5.Disjunctive syllogism

(P q)^ p q
(P q)^ q p
p ( p v q) ; q ( p v q)
(p^ q) p; ( p^ q) q;
(P v q )^ p q , (P v q )^ q
p
( P q) ^ (q r) ( P r)

6.Chain
rule/Hypothetical
Syllogism
7. p P q ; q P q ; p,q p ^ q

All the laws of equivalences & laws of implication were easily verified by
truth table technique.

Class Assignment
1. simplify [[(p v q) ^ r ] v q ]
Solution
Consider [[(p v q) ^ r ] v q ]
[(((p v q)) ^ (q)]
((p v q) ^ r) ^ q
(p v q) ^ ( r ^ q)
(p v q) ^ (q^ r)

((p v q) ^ q) ^ r
q^r

[ By Demorgans law]
[ By Double negation law]
[ By Associative law]
[ By Commutative law]
[ By Associative law]
[ By Absorption law]

2. Prove the equivalence

((p v q) q) ((p v p) r) q r
Proof:
Consider (p v q) q)
(p v q) v q
(p ^ q) v q
(p ^q) v q
q

Similarly we have
(p v p) r T r
T v r
F v r
r v F
F

[By conditional as Disjunction ]

[By Demorgans law ]
[By Double negation law]
[By Absorption law]
[ A v A is T A ^ A is F ]
[ Conditional as disjunction ]
[Commutative Law]

Thus we have, ((p v q) q) ((p v p) r) q r

3. Prove the following implication

(P q ) ^ q p
Proof :
To prove this implication ,we have to Show that (P q ) ^ q p is
equivalent to a tautology.
Consider (P q ) ^ q p
( p v q) ^ q p
(p ^ q ) v (q ^ q ) p

(p ^ q ) v F p
(p ^ q ) v p
(p ^ q ) v p
( p ^ q ) v p
(p v q) v p
p v (p v q)
(p v p) v q
T v q
T

[ Conditional as Disjunction]
[By Distributive Law]
[By Complement Law]
[By identity Law]
[ Conditional as Disjunction]
[By Demorgans Law]
[By Double negation Law]
[By Commutative Law]
[By Associative Law]
[By identity Law]
[ By Dominance Law]

Home Assignments:
1.Prove all the laws of equvilance & Laws of implications using truth table
2. Show that P v q , p r and q r implies r. or equivalently ,Show that
[ ( p v q) ^ (p r) ^ (q r) ] r is a tautology.