1.
8 Normal Forms:
In this section we use the word “product” in place of “conjunction” and “sum” in
place of “disjunction”.
A product of the variables and their negations in a formula is called an elementary
product. Similarly, a sum of the variables and their negations in a formula is called an
elementary sum.
Let P and Q be any two atomic variables. Then are
some examples of elementary products. On the other hand are
some examples of elementary sums of two variables.
Minterm: For a given number of variables, the minterm consists of product terms in which
each variable or its negation, but not both, appears only once.
Remark:
(1) For two variables P and Q, there are minterms, given by
.
(2) For three variables P, Q and R, there are minterms, given by
In general for given number of variables there will be minterms.
(3) For a given truth combination, minterms are written down by including the variable if
it’s truth value is T and it’s negation if the value is F. For example consider the truth
combination T, T, F of three variables P, Q and R respectively, and then the minterm
associated with this truth combination is
Principal Disjunctive Normal Form (PDNF)
For a given formula, an equivalent formula consisting of disjunctions of minterms
only is known as it’s principal disjunctive normal form (PDNF) or sum of the products
canonical form.
The PDNF of a given formula contains disjunction of minterms corresponding
to the combination of truth values of variable appear in for which the formula is T
in the truth table.
Maxterm: For a given number of variables, the maxterm consists of sum terms in which
each variable or its negation, but not both, appears only once.
Remark:
(1) For two variables P and Q, there are maxterms, given by
.
(2) For three variables P, Q and R, there are maxterms, given by
In general for given number of variables there will be maxterms.
(3) For a given truth combination, maxterms are written down by including the variable if
it’s truth value is F and it’s negation if the value is T. For example consider the truth
combination T, T, F of three variables P, Q and R respectively, and then the maxterm
associated with this truth combination is
Principal conjunctive Normal Form (PCNF)
For a given formula, an equivalent formula consisting of conjunctions of maxterms
only is known as its principal conjunctive normal form (PCNF) or product of the sums
canonical form.
The PCNF of a given formula contains conjunction of maxterms corresponding to the
combination of truth values of variable appear in for which the formula is F in the
truth table.
Example 1.8.1: Find PDNF and PCNF of
First we construct the truth table for
P Q
T T F F F F T
T F F T T T T
F T T F T T T
F F T T T F F
PDNF of the given formula disjunction of minterms corresponding to the
combination of truth values of variables P, Q and R for which the formula is T in the truth
table. i.e. is the required PDNF.
If the PDNF (PCNF) of a given formula containing variables is known, then the
PDNF (PCNF) of will consist of the disjunction (conjunction) of the remaining minterms
(maxterms) which do not appear int PDNF of . From one can obtain PCNF (PDNF)
of by repeated applications of De Morgan’s laws to PDNF (PCNF) of .
Example 1.8.2: If PDNF of is , find it’s PCNF.
Given that PDNF of is , then PDNF of is the disjunction of the
remaining minterms which do not appear in PDNF of
i.e.
Applying negation on both sides, we get,
Therefore
Hence PCNF of
Remarks:
(1) If a formula is tautology( contradiction), then all the minterms (maxterms) appear
in it’s PDNF(PCNF)
(2) Every formula which is not a contradiction (Tautology) has an equivalent PDNF (PCNF).
(3) The PDNF (PCNF) of a formula (if exists) is unique except for the rearrangement of
minterms in the disjunction.
Automatic Theorem Proving
Before going to study the Automatic theorem proving , we should have idea about the
terminology such as String, Consequent, Axiom, Theorem etc.
String: i) if A, B, C, D are Primary variables then is called string of primary variables.
ii) if A, B, C, D are statement formulas then is called string of statement formulas.
Examples : : P, Q, R where P,Q, R are primary variables
: A, B, C where A, B, C are statement formulas.
Sequent: if , are strings of formulas then ⎯⎯s
→ is called sequent. We read this s as “
string implies to ” in which is called antecedent and is called consequent.
i) If ⎯⎯s
→ is true iff atleast one formula of is F (Contradiction) OR atleast one
formula of is T (Tautology).
s
ii) If ⎯⎯s
→ is true, then we write this as , read it as “ string tautological
implies to ”.
iii) let A be a statement formula
s
→ A is True iff X
a) A is Tautology iff ⎯⎯ s
