Algebra and Geometry

Mathematical Logic
Prof.Nashat Faried
http://e-learning.bue.edu.eg
 De Morgan’s Law

Prove that :
¬ (p ∨q) ⇔ (¬ p) ∧(¬ q)

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

T T T F F F F

T F T F F T F

F T T F T F F

F F F T T T T
 De Morgan’s Law

Prove that :
¬ (p ∧ q) ⇔ (¬ p)∨(¬ q)

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

T T T F F F F

T F F T F T T

F T F T T F T

F F F T T T T
 De Morgan’s Law

Prove that :
(A∪B)C= (AC )∩(BC )
(A ∩ B)C= (AC ) ∪(BC )
Where,
AC= {x: x ∉A}
BC ={x: x ∉B}
 Example
Find the truth table for p→¬(p ∨ q):
p q p∨q ¬(p ∨ q) p→( p∨ q)

T T T F F

T F T F F

F T T F T

F F F T T
 Example
Prove the following equivalence (p∨ q) →r ⇔(p → r) ∧(q→ r)
p q r p∨ q (p∨ q) → r p→r q→ r (p → r)∧(q→ r)

T T T T T T T T

T T F T F F F F

T F T T T T T T

T F F T F F T F

F T T T T T T T

F T F T F T F F

F F T F T T T T

F F F F T T T T
 Example
Prove the following equivalence (p ∧q) →r ⇔(p → r) ∨ (q→ r)
p q r p∧ q (p∧ q) → r p→r q→ r (p→r) ∨ (q→ r)

T T T T T T T T

T T F T F F F F

T F T F T T T T

T F F F T F T T

F T T F T T T T

F T F F T T F T

F F T F T T T T

F F F F T T T T
 Some Basic Logical Equivalencies
• Idempotence: (p ∨ p) ⇔p
• (p ∧ p) ⇔p
• Comutativity:
• (p ∨ q) ⇔(q ∨ p)
• (p ∧ q) ⇔ (q ∧p)
• Associativity:
• ((p ∨ q) ∨ r) ⇔ (p ∨ (q∨ r))
• ((p ∧ q) ∧ r) ⇔ (p ∧ (q ∧ r))
• Distributivity:
• (p ∨ (q ∧ r)) ⇔ ((p ∨ q) ∧ (p ∨ r))
• (p ∧ (q ∨ r)) ⇔ ((p ∧ q) ∨ (p ∧ r))
• Double Negation: ¬(¬p) ⇔ p
• De Morgan’s Laws
• ¬ (p ∨q) ⇔ (¬ p) ∧(¬ q)
• ¬ (p ∧ q) ⇔ (¬ p)∨(¬ q)
• 1 stands for tautology 0 stands for contradiction
(p ∧ 1) ⇔ p (p ∨ 1) ⇔1
• (p ∧ 0) ⇔ 0 (p ∨ 0) ⇔p
• (p ∨ (¬p)) ⇔1 (p ∧ (¬p)) ⇔0
• ¬0 ⇔1 ¬1 ⇔ 0