0% found this document useful (0 votes)
40 views

CS210 Slides 02 02 Logic Equivalence TruthTables

This document discusses logical equivalence in discrete mathematics. It defines logical equivalence as two compound propositions being equivalent if their biconditional statement is a tautology. Logical equivalence can be tested using truth tables by constructing a table with the variables and checking if the corresponding values of the two propositions are equal. Equivalence can also be shown using logical laws like DeMorgan's law, distributive law, and others.

Uploaded by

Eisha Islam
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
40 views

CS210 Slides 02 02 Logic Equivalence TruthTables

This document discusses logical equivalence in discrete mathematics. It defines logical equivalence as two compound propositions being equivalent if their biconditional statement is a tautology. Logical equivalence can be tested using truth tables by constructing a table with the variables and checking if the corresponding values of the two propositions are equal. Equivalence can also be shown using logical laws like DeMorgan's law, distributive law, and others.

Uploaded by

Eisha Islam
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Discrete Mathematics

Logical Equivalence

Tautology, Contradiction, Logical Equivalence


Logical Equivalence using Truth Table
Logical Equivalence using Laws

Imdad Ullah Khan and Malik Jahan Khan

Imdadullah Khan (LUMS) Logical Equivalence 1/1


Logical Equivalence

Two compound propositions R and S are equivalent if R ↔ S is a


tautology

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

To test for logical equivalence of two compound propositions R and S


Construct a truth table including every variable (atomic propositions)
Populate the column of R ↔ S and see if it is a tautology
The last step basically means to check if the corresponding values of
the R and S are equal

Imdadullah Khan (LUMS) Logical Equivalence 3/1


Logical Equivalence using Truth Tables

ICP 1-3 Is ¬(P ∧ Q) ≡ ¬P ∨ ¬Q?

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

Notice the corresponding columns are equal, equivalence follows.


This is called the DeMorgan’s Law

Imdadullah Khan (LUMS) Logical Equivalence 4/1


Logical Equivalence using Truth Tables

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

Imdadullah Khan (LUMS) Logical Equivalence 5/1


Logical Equivalence using Truth Tables

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

Imdadullah Khan (LUMS) Logical Equivalence 6/1


Logical Equivalence using Truth Tables

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

Imdadullah Khan (LUMS) Logical Equivalence 7/1


Logical Equivalence using Truth Tables

ICP 1-6 Is P ∧ (Q ∨ R) ≡ (P ∧ Q) ∨ ((P ∧ R) ?

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

This is called the Distributive Law of and over or


Imdadullah Khan (LUMS) Logical Equivalence 8/1
Logical Equivalence using Laws: Summary

To show equivalence of compound propositions R and S


Make truth table of R and S and verify that corresponding entries are
equal
Alternatively, verify that the biimplication between R and S is a
tautology

Imdadullah Khan (LUMS) Logical Equivalence 9/1

You might also like