Scribd
Upload
1K views

Normal Forms: Elementary Product

The document defines elementary products and sums as formulas composed of variables and their negations. Disjunctive normal form is the sum of elementary products, while conjunctive normal form is the product of elementary sums. Minterms and maxterms are defined as products and sums where each variable appears only once. Principal disjunctive normal form is a formula consisting of disjunctions of minterms, while principal conjunctive normal form consists of conjunctions of maxterms. Steps for converting formulas to these normal forms are also provided, along with examples.

Uploaded by

Dwaarakesh Ramesh
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
1K views

Normal Forms: Elementary Product

The document defines elementary products and sums as formulas composed of variables and their negations. Disjunctive normal form is the sum of elementary products, while conjunctive normal form is the product of elementary sums. Minterms and maxterms are defined as products and sums where each variable appears only once. Principal disjunctive normal form is a formula consisting of disjunctions of minterms, while principal conjunctive normal form consists of conjunctions of maxterms. Steps for converting formulas to these normal forms are also provided, along with examples.

Uploaded by

Dwaarakesh Ramesh
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 18

Normal Forms

• Elementary Product :
A product of the variables and their
negations in a formula is called an
elementary product.

Examples:
𝑃, ¬𝑃 ∧ 𝑄, ¬𝑄 ∧ 𝑃 ∧ ¬𝑃, 𝑃 ∧ ¬𝑃 𝑎𝑛𝑑
𝑄 ∧ ¬𝑄 are some examples of elementary
products.
• Elementary Sum:
A sum of the variables and their
negations in a formula is called an
elementary sum.

Examples:
𝑃, ¬𝑃 ∨∧ 𝑄, ¬𝑄 ∨ 𝑃 ∨ ¬𝑃, 𝑃 ∨ ¬𝑃 𝑎𝑛𝑑
𝑄 ∨ ¬𝑄 are some examples of elementary
sum.
▪ Disjunctive Normal Form
Sum of elementary products is called disjunctive
normal form.

Example :
𝑷 ∨ 𝑷 ∧𝑸 ∨ (𝑷 ∧ ¬𝑸) .

▪ Conjunctive Normal Form


Product of elementary sums is called
Conjunctive normal form.

Example :
𝑷 ∧ 𝑷 ∨𝑸 ∧ (𝑷 ∨ ¬𝑸) .
• Minterms :
Given a number of variables, the
products in which each variable or its
negation but not both, occurs only once are
called minterms.
• For two variables 𝑃 𝑎𝑛𝑑 𝑄, the minterms
are
𝑷 ∧ 𝑸, 𝑷 ∧ ¬𝑸, ¬𝑷 ∧ 𝑸 𝒂𝒏𝒅 ¬𝑷 ∧ ¬𝑸.
• For three variables 𝑃, 𝑄 𝑎𝑛𝑑 𝑅, the
minterms are
𝑷 ∧ 𝑸 ∧ 𝑹, ¬𝑷 ∧ 𝑸 ∧ 𝑹, 𝑷 ∧ ¬𝑸 ∧ 𝑹,
𝑷 ∧ 𝑸 ∧ ¬𝑹, ¬𝑷 ∧ ¬𝑸 ∧ 𝑹, ¬𝑷 ∧ 𝑸 ∧ ¬𝑹, 𝑷 ∧
¬𝑸 ∧ ¬𝑹 and ¬𝑷 ∧ ¬𝑸 ∧ ¬𝑹.
• Maxterms :
Given a number of variables,
the sums in which each variable or its
negation but not both, occurs only once
are called maxterms.
• For two variables 𝑃 𝑎𝑛𝑑 𝑄, the
maxterms are
𝑷 ∨ 𝑸, 𝑷 ∨ ¬𝑸, ¬𝑷 ∨ 𝑸 𝒂𝒏𝒅 ¬𝑷 ∨ ¬𝑸.
• For three variables 𝑃, 𝑄 𝑎𝑛𝑑 𝑅, the
maxterms are
𝑷 ∨ 𝑸 ∨ 𝑹, ¬𝑷 ∨ 𝑸 ∨ 𝑹, 𝑷 ∨ ¬𝑸 ∨ 𝑹,
𝑷 ∨ 𝑸 ∨ ¬𝑹, ¬𝑷 ∨ ¬𝑸 ∨ 𝑹, ¬𝑷 ∨ 𝑸 ∨ ¬𝑹,
𝑷 ∨ ¬𝑸 ∨ ¬𝑹 and ¬𝑷 ∨ ¬𝑸 ∨ ¬𝑹.
Principal Disjunctive Normal
Form (PDNF)
• A formula consisting of
disjunctions of minterms in the
variable only is known as its principal
disjunctive normal form.
• Example :

(𝑷 ∧ 𝑸) ∨ (¬𝑷 ∧ ¬𝑸).
Principal Conjunctive Normal
Form (PCNF)
• A formula consisting of
conjunctions of maxterms in the
variable only is known as its principal
conjunctive normal form.
• Example :

(𝑷 ∨ 𝑸) ∧ (¬𝑷 ∨ ¬𝑸).
Steps involved in finding PDNF:
▪ First obtain DNF of the formula.

▪ To get the minterms in the disjunctions,


the missing factors are introduced
through the complement law, 𝑃 ∨ ¬𝑃 ≡ 𝑇 .

▪ Then apply distributive law.

▪ Identical minterms appearing in the


disjunctions are then deleted as 𝑃 ∨ 𝑃 ≡P.
• Steps involved in finding PCNF:
▪ First find PDNF of the given formula 𝐴.
▪ To find PCNF, we use the fact that 𝐴 ≡ ∼
∼𝐴 .
▪ Apply Demorgan’s law to the PDNF of ∼
𝐴 repeatedly.
• Note:
If the PDNF of a formula 𝐴 is known, the
PDNF of ∼ 𝐴 will consist of the disjunctions of
the remaining minterms which are not
included in the PDNF of 𝐴.
Find PDNF of 𝑷 ∧ 𝑸 ∨ ¬𝑷 ∧ 𝑹 ∨ 𝑸 ∧ 𝑹 . Also find
PCNF.

• Solution:
Given 𝑷 ∧ 𝑸 ∨ ¬𝑷 ∧ 𝑹 ∨ 𝑸 ∧ 𝑹
≡ 𝑃∧𝑄 ∧𝑇 ∨ ¬𝑃 ∧ 𝑅 ∧ 𝑇 ∨ ( 𝑄 ∧ 𝑅 ∧ 𝑇)

(By 𝑷 ∧ 𝑻 ≡ 𝑷)

≡ 𝑃 ∧ 𝑄 ∧ 𝑅 ∨ ¬𝑅 ∨ ¬𝑃 ∧ 𝑅 ∧ 𝑄 ∨ ¬𝑄

∨ ( 𝑄 ∧ 𝑅 ∧ 𝑃 ∨ ¬𝑃 )

(By 𝑷 ∨ ¬𝑷 ≡ 𝑻)
≡ (𝑃 ∧ 𝑄 ∧ 𝑅) ∨ (𝑃 ∧ 𝑄 ∧ ¬𝑅) ∨ (¬𝑃 ∧ 𝑄 ∧ 𝑅)

∨ (¬𝑃 ∧ ¬𝑄 ∧ 𝑅) ∨ (𝑃 ∧ 𝑄 ∧ 𝑅) ∨ (¬𝑃 ∧ 𝑄 ∧ 𝑅)

(By distributive law)


≡ (𝑃 ∧ 𝑄 ∧ 𝑅) ∨ (𝑃 ∧ 𝑄 ∧ ¬𝑅)

∨ (¬𝑃 ∧ 𝑄 ∧ 𝑅) ∨ (¬𝑃 ∧ ¬𝑄 ∧ 𝑅)

(By 𝑷 ∨ 𝑷 ≡ 𝑷)

which is disjunction of minterms.(PDNF)


PCNF ≡
¬(𝒅𝒊𝒔𝒋𝒖𝒏𝒄𝒕𝒊𝒐𝒏 𝒐𝒇 𝒓𝒆𝒎𝒂𝒊𝒏𝒊𝒏𝒈 𝒎𝒊𝒏𝒕𝒆𝒓𝒎𝒔)
≡ ¬[(𝑃 ∧ ¬𝑄 ∧ 𝑅) ∨ (¬𝑃 ∧ 𝑄 ∧ ¬𝑅)
∨ (𝑃 ∧ ¬𝑄 ∧ ¬𝑅) ∨ (¬𝑃 ∧ ¬𝑄 ∧ ¬𝑅)]
≡ ¬(𝑃 ∧ ¬𝑄 ∧ 𝑅) ∧ ¬(¬𝑃 ∧ 𝑄 ∧ ¬𝑅)
∧ ¬(𝑃 ∧ ¬𝑄 ∧ ¬𝑅) ∧ ¬(¬𝑃 ∧ ¬𝑄 ∧ ¬𝑅)
(By Demorgan’s law)
≡ (¬𝑃 ∨ 𝑄 ∨ ¬𝑅) ∧ (𝑃 ∨ ¬𝑄 ∨ 𝑅)
∧ (¬𝑃 ∨ 𝑄 ∨ 𝑅) ∧ (𝑃 ∨ 𝑄 ∨ 𝑅).
(By Demorgan’s law)
which is conjunction of maxterms.
Obtain PDNF of ¬𝑷 → 𝑹 ∧ 𝑸 ↔ 𝑷 . Also find PCNF.

• Solution:
Given ¬𝑷 → 𝑹 ∧ 𝑸 ↔ 𝑷

≡ ¬(¬𝐏) ∨ 𝐑 ∧ ¬𝐐 ∨ 𝐏 ∧ ¬𝐏 ∨ 𝐐 )

(By 𝐏 → 𝐐 ≡ ¬𝐏 ∨ 𝐐 𝐚𝐧𝐝

𝐏 ↔ 𝐐 ≡ (¬𝐏 ∨ 𝐐) ∧ (¬𝐐 ∨ 𝐏))

≡ 𝐏 ∨ 𝐑 ∧ (𝐏 ∨ ¬𝐐) ∧ (¬𝐏 ∨ 𝐐)

(By double negation & commutative law)

≡ 𝑃∨𝑅 ∨𝐹 ∧ 𝑃 ∨ ¬𝑄 ∨ 𝐹 ∧ ( ¬𝑃 ∨ 𝑄 ∨ 𝐹)

(By 𝑷 ∨ 𝑭 ≡ 𝑷)
≡ 𝑃 ∨ 𝑅 ∨ (𝑄 ∧ ¬𝑄 ∧ 𝑃 ∨ ¬𝑄 ∨ (𝑅 ∧ ¬𝑅

∧ ( ¬𝑃 ∨ 𝑄 ∨ (𝑅 ∧ ¬𝑅))

(By 𝑷 ∧ ¬𝑷 ≡ 𝑭)

≡ (P ∨ 𝑄 ∨ 𝑅) ∧ (𝑃 ∨ ¬𝑄 ∨ 𝑅) ∧ (𝑃 ∨ ¬𝑄 ∨ 𝑅)

∧ (P ∨ ¬𝑄 ∨ ¬𝑅) ∧ (¬𝑃 ∨ 𝑄 ∨ 𝑅) ∧ (¬𝑃 ∨ 𝑄 ∨ ¬𝑅)

(By distributive law)

≡ P ∨ 𝑄 ∨ 𝑅 ∧ 𝑃 ∨ ¬𝑄 ∨ 𝑅 ∧ P ∨ ¬𝑄 ∨ ¬𝑅

∧ (¬𝑃 ∨ 𝑄 ∨ 𝑅) ∧ (¬𝑃 ∨ 𝑄 ∨ ¬𝑅)

(By 𝑷 ∧ 𝑷 ≡ 𝑷)

which is conjunction of maxterms. (PCNF)


PDNF ≡
¬(𝐜𝐨𝐧𝒋𝒖𝒏𝒄𝒕𝒊𝒐𝒏 𝒐𝒇 𝒓𝒆𝒎𝒂𝒊𝒏𝒊𝒏𝒈 𝒎𝒂𝒙𝒕𝒆𝒓𝒎𝒔)
≡ ¬[(𝑃 ∨ 𝑄 ∨ ¬𝑅) ∧ (¬𝑃 ∨ ¬𝑄 ∨ 𝑅) ∧ (¬𝑃 ∨ ¬𝑄 ∨ ¬𝑅)]

≡ ¬(𝑃 ∨ 𝑄 ∨ ¬𝑅) ∨ ¬(¬𝑃 ∨ ¬𝑄 ∨ 𝑅) ∨ ¬(¬𝑃 ∨ ¬𝑄 ∨ ¬𝑅)

(By Demorgan’s law)

≡ (¬𝑃 ∧ ¬𝑄 ∧ 𝑅) ∨ (𝑃 ∧ 𝑄 ∧ ¬𝑅) ∨ (𝑃 ∧ 𝑄 ∧ 𝑅).

(By Demorgan’s law)

which is disjunction of minterms.


Note :

The 𝐏𝐃𝐍𝐅 and 𝐏𝐂𝐍𝐅 can be obtained by


constructing truth tables by finding
minterms corresponding to 𝐓 and
maxterms corresponding to 𝐅 respectively.
3.Find PDNF and PCNF of
(𝑷 ∧ 𝑸) ∨ ¬𝑷 ∧ 𝑹 using truth table.

Solution :

T T T F T F T

T T F F T F T

T F T F F F F

T F F F F F F

F T T T F T T

F T F T F F F

F F T T F T T

F F F T F F F
𝐏𝐃𝐍𝐅 ≡ 𝐏 ∧ 𝐐 ∧ 𝐑 ∨ 𝐏 ∧ 𝐐 ∧ ¬𝐑
∨ ¬𝐏 ∧ 𝐐 ∧ 𝐑 ∨ (¬𝐏 ∧ ¬𝐐 ∧ 𝐑).

𝐏𝐂𝐍𝐅 ≡ ¬𝐏 ∨ 𝐐 ∨ ¬𝐑 ∧ ¬𝐏 ∨ 𝐐 ∨ 𝐑
∧ 𝐏 ∨ ¬𝐐 ∨ 𝐑 ∧ 𝐏 ∨ 𝐐 ∨ 𝐑 .

You might also like