CS210 Slides 02 02 Logic Equivalence TruthTables
CS210 Slides 02 02 Logic Equivalence TruthTables
Logical Equivalence
R ≡ S, R ⇔ S, R is equivalent to S
R ≡ S if whenever R is true, S is true and vice-versa
They have the same truth values
The definition of equivalence follows from bicondintional statement
P Q P↔Q
T T T
T F F
F T F
F F T
P ↔ Q is true when P = Q
Imdadullah Khan (LUMS) Logical Equivalence 2/1
Logical Equivalence using Truth Tables
a) Yes
b) No
P Q ¬P ¬Q ¬P ∨ ¬Q P ∧Q ¬(P ∧ Q)
T T F F F T F
T F F T T F T
F T T F T F T
F F T T T F T
P → Q ≡ ¬Q → ¬P
P Q P→Q ¬P ¬Q ¬Q → ¬P P → Q ↔ ¬Q → ¬P
T T T F F T T
T F F F T F T
F T T T F T T
F F T T T T T
ICP 1-4 Is P → Q ≡ ¬P ∨ Q ?
a) Yes
b) No
P Q ¬P P→Q ¬P ∨ Q P → Q ↔ ¬P ∨ Q
T T F T T T
T F F F F T
F T T T T T
F F T T T T
ICP 1-5 Is (P → R) ∨ (Q → R) ≡ (P ∧ Q) → R?
a) Yes
b) No
P Q R P→R Q→R (P → R) ∨ (Q → R) P ∧Q (P ∧ Q) → R
T T T T T T T T
T T F F F F T F
T F T T T T F T
T F F F T T F T
F T T T T T F T
F T F T F T F T
F F T T T T F T
F F F T T T F T
a) Yes
b) No
P∧ (P ∧ Q)
P Q R Q ∨R P ∧Q P ∧R
(Q ∨ R) ∨(P ∧ R)
T T T T T T T T
T T F T T T F T
T F T T T F T T
T F F F F F F F
F T T T F F F F
F T F T F F F F
F F T T F F F F
F F F F F F F F