Boolean Algebra Laws, De Morgan Theorems and Simplification
Boolean algebra works on two values, 0 and 1, with the operations AND, OR and NOT. Its laws let you simplify a logic expression and reduce the gates needed.
Basic laws: identity (A + 0 = A, A . 1 = A), null (A + 1 = 1, A . 0 = 0), idempotent (A + A = A, A . A = A), complement (A + A' = 1, A . A' = 0), double negation (A'' = A), commutative, associative and distributive (A(B + C) = AB + AC, and also A + BC = (A + B)(A + C)). Absorption: A + AB = A and A(A + B) = A. A useful extra: A + A'B = A + B.
De Morgan's theorems: (A . B)' = A' + B' and (A + B)' = A' . B'. In words: complement of a product is the sum of complements, and complement of a sum is the product of complements. They are how you turn AND-OR into NAND-NAND logic. The duality principle: swapping AND with OR and 0 with 1 in a true identity gives another true identity.
To simplify, look for common factors, apply absorption and complement laws, and check with a truth table. Fewer literals mean fewer gates and inputs, which means a cheaper and faster circuit.
Key points
- A + A' = 1 and A . A' = 0.
- Absorption: A + AB = A.
- A + A'B = A + B.
- De Morgan: (AB)' = A' + B' and (A + B)' = A'B'.
- Duality: swap AND/OR and 0/1.
Worked example
Simplify F = AB + AB' + A'B. AB + AB' = A(B + B') = A, so F = A + A'B = A + B (using A + A'B = A + B).
Common questions
What is De Morgan's theorem?
The complement of a product is the sum of the complements, and the complement of a sum is the product of the complements.
Why simplify Boolean expressions?
To use fewer gates, which lowers cost, delay and power.
Practice questions on this topic
Try these, then open the app to check your answers with explanations.
- The plus sign (+) refers to ... in Boolean algebra, while the dot sign (.) refers to ...
- A. OR, AND
- B. AND, OR
- C. NOR, NAND
- D. NAND, NOR
- Find the Boolean expression in this truth table:
- A. A̅B̅C + ABC
- B. AB̅C̅ + ABC
- C. ABC + ABC
- D. A̅B̅C + AB̅C̅
- The distributive law for multiplication is :
- A. A(B+C) = ABC
- B. A(B+C) = AB +AC
- C. A(B+C) = B +AC
- D. A(B+C) = C+AB
- Then duality principle of X +X*Y = X
- A. X+(X+ Y )=X
- B. X+(X* Y )=X
- C. X*(X+ Y )=X
- D. X*(X* Y )=X
- Which gate operation is represented by the following Boolean expression Y=A⊕B?
- A. XOR
- B. NAND
- C. OR
- D. AND
- ...... is an example of identity law
- A. a + 0 = 0 + a = a
- B. 1 + a = a + 1 = 1
- C. ab = ba
- D. a + (b + c) = (a + b) + c
Related topics
- Number System Conversion: Binary, Octal, Decimal and Hexadecimal
- 1's Complement, 2's Complement and Signed Binary Arithmetic
- Logic Gates: AND, OR, NOT, NAND, NOR, XOR and Universal Gates
- Karnaugh Map (K-Map) Simplification Step by Step
- SOP and POS: Minterms, Maxterms and Canonical Forms
- Half Adder, Full Adder, Multiplexer and Decoder Explained
- All topics: Digital Logic
BASMAGLY is an independent student project, not an official Delta University site. Check lectures and your instructor for the final word.