Professional Documents
Culture Documents
CS103 Slides Lecture 4 PDF
CS103 Slides Lecture 4 PDF
Logical Equivalences
77
Motivation
78
Logical Equivalency by Truth Tables
Truth Table for
• Logical equivalence between two compound p→q and pq
propositions p and q can be shown in many ways p q p p→q pq
• The easiest way is to show it by truth table T T F T T
• p and q are logically equivalent if their truth T F F F F
values are same for every rows in the table
F T T T T
• Example: Show that (pq) and (p→q) are
F F T T T
logically equivalent
• Combined truth table for (pq) and (p→q) is this
• The two right-side columns are same for every row =
• So, they are logically equivalent
• (pq) is used instead of (p→q) in many places and is
called a definition of implication
79
Logical Equivalency by Tautology
80
Logical Equivalency by Tautology
81
Logical Equivalency by Tautology
F F T T T T
82
Logical Equivalency by Tautology
83
Logical Equivalency by Tautology
84
Common Logical Logical Equivalence Name
Equivalences pT p
pF p
Identity law
pT T
Domination law
• So far, we have seen some pairs of pF F
85
Common Logical Equivalences
86
Logical Equivalence Name
Common Logical p→q pq Definition of implication
Equivalences p→q p→q Contrapositive
Definition of bi-
pq (p→q)(q→p)
conditional
• Right-side table gives some Bi-conditional of
more common logical pq pq
negations
equivalences involving
implication and bi-conditional
• Example: Rephrase by contrapositive
• Recall the example at the beginning of this lecture
• Your statement was: “If it rains, then no play”
• By contrapositive, this is same as: “Play means no
rain” (this was your friend’s statement)
• So, your and your friend’s statements are equivalent
• Exercise: Can you rephrase the statement “new car iff
A+” by “no new car iff no A+”? How?
87
Logical Equivalency by Derivation
88
Logical Equivalency by Derivation
89
Logical Equivalency by Derivation
90
Truth Tables vs Logical Derivations
91