← 🧮 Boolean Algebra, Canonical Forms & K-Maps
Subtopic 1 of 5

2.1Boolean laws, duality and De Morgan

The idea

Boolean algebra has two values and the operations AND, OR, NOT, and a set of laws that let you simplify any expression. Every law has a dual found by swapping + with · and 0 with 1.

Think of it like this: Rewriting a fraction in lowest terms: you get the same value, but with the smallest expression.

Why it exists

Simplification is the engine behind circuits, K-maps and half of the algebra-style Digital Logic questions.

How it works

  1. Use absorption: A + AB = A, A(A + B) = A.
  2. Use redundancy: A + A′B = A + B.
  3. Use De Morgan to push negations to the variables: (A + B)′ = A′B′, (AB)′ = A′ + B′.
  4. Use consensus to drop the third term: AB + A′C + BC = AB + A′C.

Worked example: Simplify AB + A′C + BC

The term BC is the consensus of AB and A′C, so it is redundant. Result: AB + A′C. Try the Consensus button to check the two truth tables are identical.

Now play with it

  • →Press the De Morgan button and compare the F and G columns.
  • →Type your own pair of expressions and see if they are equivalent.
mABFG
00011
10100
21000
31100
Minterms Σm0
Maxterms ΠM1, 2, 3
Number of 1s1
Canonical SOP: A'B' Canonical POS: (A + B')(A' + B)(A' + B')

The two expressions are equivalent: identical truth tables.

LawAND formOR form
IdentityA · 1 = AA + 0 = A
NullA · 0 = 0A + 1 = 1
IdempotentA · A = AA + A = A
ComplementA · A' = 0A + A' = 1
AbsorptionA(A + B) = AA + AB = A
RedundancyA(A' + B) = ABA + A'B = A + B
Consensus(A+B)(A'+C)(B+C) = (A+B)(A'+C)AB + A'C + BC = AB + A'C
De Morgan(AB)' = A' + B'(A + B)' = A'B'
DistributiveA(B + C) = AB + ACA + BC = (A + B)(A + C)

Every row of the OR column is the dual of the AND column: swap + and · and swap 0 and 1.

Check yourself

A + A′B simplifies to

Remember: Absorb, redundancy, consensus, De Morgan: four tools cover nearly every simplification.
Exam notes (the dense version)

Identity, null, idempotent (A + A = A), complement (A·A′ = 0), involution, commutative, associative, distributive in both directions (A + BC = (A + B)(A + C)). Absorption: A + AB = A, A(A + B) = A. Consensus: AB + A′C + BC = AB + A′C. A + A′B = A + B. De Morgan: (A + B)′ = A′B′, (AB)′ = A′ + B′. Duality: swap + with · and 0 with 1; every valid identity stays valid. The complement of F is found by dualising and complementing each literal.

Previous year questions: Boolean Algebra, Canonical Forms & K-Maps (27)

PYQs are grouped by topic, so this is the full set for Boolean Algebra, Canonical Forms & K-Maps; try the ones that match this subtopic. Open all 27 on the topic page.