Scribd
Upload
94 views

DMATH Lecture Notes 1.3

The document proves the logical equivalence of several logical statements using laws of logic. It shows that ¬ (p ⟶ q) and p ∧ ¬ q are equivalent, as are ¬ (p ∨ (¬ p ∧ q)) and ¬p ∧ ¬ q. It also proves that (p ∧ q) ⟶ (p ∨ q), (p ∨ q) ∧ (¬p ∨ r) ⟶ (q ∨ r), and (p ⟶ q) ∧ (q ⟶ r) ⟶ (p ⟶ r) are tautologies using laws like De Morgan's laws,

Uploaded by

Ellen Mae Olaguer
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
94 views

DMATH Lecture Notes 1.3

The document proves the logical equivalence of several logical statements using laws of logic. It shows that ¬ (p ⟶ q) and p ∧ ¬ q are equivalent, as are ¬ (p ∨ (¬ p ∧ q)) and ¬p ∧ ¬ q. It also proves that (p ∧ q) ⟶ (p ∨ q), (p ∨ q) ∧ (¬p ∨ r) ⟶ (q ∨ r), and (p ⟶ q) ∧ (q ⟶ r) ⟶ (p ⟶ r) are tautologies using laws like De Morgan's laws,

Uploaded by

Ellen Mae Olaguer
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

PROVING LOGICAL EQUIVALENCES

1. Show that ¬ (p ⟶ q) and p ∧ ¬ q are logically equivalent.


¬ (p ⟶ q) = ¬ (¬ p ∨ q) by Conditional law
= ¬ (¬p) ∧ ¬ q by the second De Morgan law
=p∧¬q by the double negation law

2. Prove that ¬ (p ∨ (¬ p ∧ q)) and ¬p ∧ ¬ q.


¬ (p ∨ (¬ p ∧ q)) = ¬p ∧ ¬ (¬ p ∧ q) by the second De Morgan law
= ¬ p ∧ [¬ (¬ p ) ∨ ¬ q ] by the first De Morgan law
= ¬ p ∧ (p ∨ ¬ q) by the double negation law
= (¬ p ∧ p ) ∨ (¬ p ∧ ¬ q) by the second distributive law
= F ∨ (¬ p ∧ ¬ q) because ¬p ∧ p = F
= (¬ p ∧ ¬ q) ∨ F by the commutative law for disjunction
=¬p∧¬q by the identity law for F

3. Show that (p ∧ q) ⟶ (p ∨ q) is a tautology.


(p ∧ q) ⟶ (p ∨ q) = ¬ (p ∧ q) ∨ (p ∨ q) by Conditional law
= (¬ p ∨ ¬ q) ∨ (p ∨ q) by the first De Morgan law
= (¬ p ∨ p) ∨ (¬ q ∨ q) by the associative and commutative laws for
disjunction
=T∨T by negation law
=T by disjunction law

4. Show that (p ∨ q) ∧ (¬p ∨ r) ⟶ (q ∨ r) is a tautology.


(p ∨ q) ∧ (¬p ∨ r) ⟶ (q ∨ r) = (p ∨ q) ∧ ¬ (¬p ∨ r) ∨ (q ∨ r) by Conditional law
= (p ∨ q) ∧ (¬ (¬p) ∧ ¬r) ∨ (q ∨ r) by De Morgan law
= (p ∨ q) ∧ (p ∧ ¬r) ∨ (q ∨ r) by Double negation law
= (p ∧ p) ∨ (q ∨ q) ∧ (¬r ∨ r) by Basic laws simplification
=p∨q∧T by Negation law
=T∧T by ā law
=T by Conjunction law

5. Show that (p ⟶ q) ∧ (q ⟶ r) ⟶ (p ⟶ r) is a tautology.


(p ⟶ q) ∧ (q ⟶ r) ⟶ (p ⟶ r)
= ¬ [(¬p ∨ q) ∧ (¬q ∨ r)] ∨ (¬p ∨ r) by Conditional law
= [¬ (¬p ∨ q) ∨ ¬ (¬q ∨ r)] ∨ (¬p ∨ r) by De Morgan law
= (¬ (¬p) ∧ ¬q)) ∨ (¬ (¬q) ∧ ¬r)) ∨ (¬p ∨ r) by De Morgan law
= (p ∧ ¬q) ∨ (q ∧ ¬r) ∨ (¬p ∨ r) by Double negation law
= (p ∨ ¬p) ∧ (¬q ∨ q) ∧ (¬r ∨ r) by Basic laws simplification
=T∧T∧T by Negation law
=T by Conjunction law

6. Prove that (p ⟶ q) ∧ (q ⟶ r) ⟶ (p ⟶ r) = T
(p ⟶ q) ∧ (q ⟶ r) ⟶ (p ⟶ r)
= (¬p ∨ q) ∧ ¬ (¬q ∨ r) ∨ (¬p ∨ r) by Conditional law
= (¬p ∨ q) ∧ (¬ (¬q) ∧ ¬r)] ∨ (¬p ∨ r) by De Morgan law
= (¬p ∨ q) ∧ (q ∧ ¬r)] ∨ (¬p ∨ r) by Double negation law
= (¬p ∨ ¬p) ∨ (q ∧ q) ∧ (¬r ∨ r) by Basic laws simplification
= ¬p ∨ q ∧ T by Idempotent and Negation law
=T∧T by ā law
=T by Conjunction law

You might also like