Scribd
Upload
120 views9 pages

Mathematical Logic: Algebra and Geometry

The document discusses mathematical logic and proofs of logical equivalencies. It introduces De Morgan's Laws, which state that the negation of a disjunction is the conjunction of the negations, and the negation of a conjunction is the disjunction of the negations. It provides truth tables to prove these laws. The document also presents other basic logical equivalencies around concepts like idempotence, commutativity, associativity, distributivity, and double negation.

Uploaded by

Peter
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
120 views9 pages

Mathematical Logic: Algebra and Geometry

The document discusses mathematical logic and proofs of logical equivalencies. It introduces De Morgan's Laws, which state that the negation of a disjunction is the conjunction of the negations, and the negation of a conjunction is the disjunction of the negations. It provides truth tables to prove these laws. The document also presents other basic logical equivalencies around concepts like idempotence, commutativity, associativity, distributivity, and double negation.

Uploaded by

Peter
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/ 9

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

You might also like