Normal forms and principal forms are standard ways of writing logical expressions to make them easier to understand, simplify, compare, and evaluate. They represent logical statements in a structured format using logical operators.
Example:
Let the logical expression be: P → Q
This can be written in Conjunctive Normal Form (CNF) as: ¬P ∨ Q
Its Principal Disjunctive Normal Form (PDNF) is: (¬P ∧ ¬Q) ∨ (¬P ∧ Q) ∨ (P ∧ Q)
These standard forms make logical expressions easier to analyze and use in digital circuits and logical proofs.
Question 1: Convert the expression (A ∨ B) ∧ (¬A ∨ C) to Disjunctive Normal Form (DNF)
Solution:
Distribute the AND over OR:
(A ∨ B) ∧ (¬A ∨ C) = (A ∧ ¬A) ∨ (A ∧ C) ∨ (B ∧ ¬A) ∨ (B ∧ C)
Simplify:
(A ∧ C) ∨ (B ∧ ¬A) ∨ (B ∧ C)
Final DNF:
(A ∧ C) ∨ (B ∧ ¬A) ∨ (B ∧ C)
Question 2: Convert the expression (A ∧ B) ∨ (¬A ∧ C) to Conjunctive Normal Form (CNF).
Solution:
Apply distributive laws to distribute OR over AND:
(A ∧ B) ∨ (¬A ∧ C) = (A ∨ ¬A) ∧ (A ∨ C) ∧ (B ∨ ¬A) ∧ (B ∨ C)
Simplify using the tautology
(A ∨ C) ∧ (B ∨ ¬A) ∧ (B ∨ C)
Final CNF:
(A ∨ C) ∧ (B ∨ ¬A) ∧ (B ∨ C)
Practice Problems
Problem 1. Convert the expression (A ∧ B) ∨ (¬A ∧ ¬B) to DNF.
Problem 2. Convert the expression (A ∨ B) ∧ (¬A ∨ ¬B) to CNF.
Problem 3. Find the PDNF for the expression A ∧ (¬B ∨ C).
Problem 4. Find the PCNF for the expression ¬A ∨ (B ∧ ¬C).
