Scribd
Upload
6 views

DM Lecture 03

The document discusses propositional logic and equivalences. It introduces concepts like tautology, contradiction and contingency. It also discusses De Morgan's laws and using truth tables to show logical equivalences between compound propositions.

Uploaded by

WOLFIE GAMER
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
6 views

DM Lecture 03

The document discusses propositional logic and equivalences. It introduces concepts like tautology, contradiction and contingency. It also discusses De Morgan's laws and using truth tables to show logical equivalences between compound propositions.

Uploaded by

WOLFIE GAMER
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 11

Discrete Mathematics

IT -211
Lecture #03
Propositional Equivalences
A compound proposition that is always true, no
matter what the truth values of the propositional
variables that occur in it, is called a tautology.
A compound proposition that is always false is called
a contradiction.
A compound proposition that is neither a tautology
nor a contradiction is called a contingency.
Consider the truth tables of p ∨ ¬p and p ∧ ¬p.
Because p ∨ ¬p is always true, it is a tautology.
Because p ∧ ¬p is always false, it is a contradiction.
Logical Equivalences
Compound propositions that have the same truth
values in all possible cases are called logically
equivalent.
The notation p ≡ q denotes that p and q are logically
equivalent.
Logical Equivalences
Show that ¬(p ∨ q) and ¬p ∧ ¬q are logically
equivalent.
Logical Equivalences Involving
Conditional Statements.
Logical Equivalences Involving
Biconditional Statements.
De Morgan’s laws
Use De Morgan’s laws to express the negations of “Miguel
has a cellphone and he has a laptop computer”
Solution: Let p be “Miguel has a cellphone” and q be
“Miguel has a laptop computer.”
 “Miguel has a cellphone and he has a laptop computer”
can be represented by p ∧ q.
By the first of De Morgan’s laws, ¬(p ∧ q) is equivalent to
¬p ∨ ¬q.
Consequently, we can express the negation of our original
statement as “Miguel does not have a cellphone or he does
not have a laptop computer.”
Constructing New Logical Equivalences
Show that ¬(p → q) and p ∧ ¬q are logically
equivalent.
¬(p → q) ≡ ¬(¬p ∨ q)
≡ ¬(¬p) ∧ ¬q De Morgan law
≡ p ∧ ¬q Double negation law
Logical Equivalance
Show that ¬(p ∨ (¬p ∧ q)) and ¬p ∧ ¬q are logically
equivalent by developing a series of logical equivalences.
Logical Equivalance
Show that (p ∧ q) → (p ∨ q) is a tautology.

You might also like