Scribd
Upload
18 views10 pages

INT202 - 1.3 - Propositional Logic

The document covers propositional equivalences in discrete mathematics, including tautologies, contradictions, logical equivalence, and important logical laws such as De Morgan's Laws. It explains how to determine logical equivalence using truth tables and outlines key logical equivalences and their proofs. The content is intended for students in the College of Engineering and Information Technology.

Uploaded by

Esraa Zainelabdin
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
18 views10 pages

INT202 - 1.3 - Propositional Logic

The document covers propositional equivalences in discrete mathematics, including tautologies, contradictions, logical equivalence, and important logical laws such as De Morgan's Laws. It explains how to determine logical equivalence using truth tables and outlines key logical equivalences and their proofs. The content is intended for students in the College of Engineering and Information Technology.

Uploaded by

Esraa Zainelabdin
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/ 10

INT202 – Discrete Mathematics

Mohd Nadhir Ab Wahab, PhD, MIET, MIEEE


College of Engineering and Information
Technology
(c) MNAW 2024

Propositional Equivalences​
(c) MNAW 2024

Section Summary
 Tautologies, Contradictions, and  Conjunctive Normal Form
Contingencies.  Propositional Satisfiability
 Logical Equivalence
 Important Logical Equivalences
 Showing Logical Equivalence
 Normal Forms (optional, covered in
exercises in text)
 Disjunctive Normal Form
(c) MNAW 2024

Logically Equivalent
 Two compound propositions p and q are logically equivalent if p q is a tautology.
 We write this as p⇔q or as p≡q where p and q are compound propositions.
 Two compound propositions p and q are equivalent if and only if the columns in a truth
table giving theiruth values agree.
 This truth table show ¬p ∨ q is equivalent to p → q.
p q ¬p ¬p ∨ q p→ q
T T F T T
T F F F F
F T T T T
F F T T T
(c) MNAW 2024

De Morgan’s Laws
Augustus De Morgan
1806-1871

This truth table shows that De Morgan’s Second Law holds.


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

T T F F T F F

T F F T T F F

F T T F T F F

F F T T F T T
(c) MNAW 2024

Key Logical Equivalences


 Identity Laws: ,

 Domination Laws: ,

 Idempotent laws: ,

 Double Negation Law:

 Negation Laws: ,
(c) MNAW 2024

Key Logical Equivalences (Cont.)


 Commutative Laws: ,

 Associative Laws:

 Distributive Laws:

 Absorption Laws: ,
(c) MNAW 2024

More Logical Equivalences


(c) MNAW 2024

Equivalence Proofs
 Example: Show that is a tautology using truth table.
(c) MNAW 2024

Thank you!
Any question?
[email protected]
285-10

You might also like