Professional Documents
Culture Documents
Normal Forms
Two special forms disjunctive
for formulas normal form
logically equivalent conjunctive
to a given formula normal form
A: (p→(q˅r)) ↔ (q→p)
and
◦ C: (¬(p→q))→(q˄¬r)
Disjunctive
Normal ◦ A formula may have several equivalent
formulas in DNF, but we need a
Form (DNF) systematic way to find one.
Form (DNF)
table for all interpretations of C.
Interpretation p q r C
I0 T T T T
I1 T T F T
I2 T F T F
I3 T F F F
I4 F T T T
I5 F T F T
I6 F F T T
I7 F F F T
A: (p→(q˅r)) ↔ (q→p)
◦ A is logically equivalent to D.
D: (p˅¬q) ˄ (¬p˅q˅r)
Conjunctive
Normal Form ◦ D is in conjunctive normal form (CNF).
◦ It consists of a conjunction of two formulas that
(CNF) are disjunctions of literals
◦ (p˅¬q)
◦ (¬p˅q˅r)
Normal Form
(CNF) Every formula is logically
equivalent to a formula
in CNF
Interpretation p q r E
I0 T T T F
I1 T T F F
I2 T F T T
I3 T F F T
I4 F T T F
I5 F T F F
I6 F F T F
I7 F F F F
CSCC 11 Discrete Structures 22
Conjunctive Normal Form (CNF)
E: (¬(p→q)) → (q˄¬r)
(CNF)
◦ E: ¬(p˄¬q˄r) ˄ ¬(p˄¬q˄¬r)