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
- Use absorption: A + AB = A, A(A + B) = A.
- Use redundancy: A + A′B = A + B.
- Use De Morgan to push negations to the variables: (A + B)′ = A′B′, (AB)′ = A′ + B′.
- 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.
| m | A | B | F | G |
|---|---|---|---|---|
| 0 | 0 | 0 | 1 | 1 |
| 1 | 0 | 1 | 0 | 0 |
| 2 | 1 | 0 | 0 | 0 |
| 3 | 1 | 1 | 0 | 0 |
The two expressions are equivalent: identical truth tables.
| Law | AND form | OR form |
|---|---|---|
| Identity | A · 1 = A | A + 0 = A |
| Null | A · 0 = 0 | A + 1 = 1 |
| Idempotent | A · A = A | A + A = A |
| Complement | A · A' = 0 | A + A' = 1 |
| Absorption | A(A + B) = A | A + AB = A |
| Redundancy | A(A' + B) = AB | A + 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' |
| Distributive | A(B + C) = AB + AC | A + 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
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.