Laws of Boolean Algebra: Theorems with Simple Examples

The laws of Boolean algebra are identities — equations that hold true for every possible value of the variables involved. They play the same role for logic that the familiar rules of arithmetic play for numbers: they let us simplify expressions, prove two circuits equivalent, and design cheaper hardware.

These laws matter because a simpler Boolean expression means a circuit with fewer gates, which is cheaper, faster and uses less power. Every digital design tool applies these laws automatically, but a designer who knows them can reason about correctness and spot simplifications by hand.

Key Concepts

• Identity laws: A OR 0 = A and A AND 1 = A — OR with 0 and AND with 1 change nothing.
• Complement laws: A OR (not A) = 1 and A AND (not A) = 0.
• Idempotent laws: A OR A = A and A AND A = A — repeating a variable adds nothing.
• Commutative and associative laws: order and grouping of AND/OR do not matter.
• Absorption laws: A OR (A AND B) = A and A AND (A OR B) = A — the larger term is swallowed.
• Involution: not (not A) = A — double negation cancels.

Formulas

• Distributive laws: A AND (B OR C) = (A AND B) OR (A AND C) and, unusually, A OR (B AND C) = (A OR B) AND (A OR C).
• De Morgan's laws: not (A AND B) = (not A) OR (not B) and not (A OR B) = (not A) AND (not B).
• Absorption: A OR ((not A) AND B) = A OR B and A AND ((not A) OR B) = A AND B.
• All variables range over {0, 1}. Duality holds: swapping AND with OR and 0 with 1 in any law gives another valid law.

Worked Example

Simplify F = (A AND B) OR (A AND not B). Step 1: factor out A using the distributive law, F = A AND (B OR not B). Step 2: by the complement law, B OR not B = 1, so F = A AND 1. Step 3: by the identity law, A AND 1 = A. The truth-table check confirms it: the original expression is 1 exactly when A = 1, matching F = A on every row. Two AND gates and one inverter collapsed into a single wire.

Common Misconceptions

• "Boolean algebra follows the same rules as ordinary algebra." Mostly, but not entirely — A OR (B AND C) = (A OR B) AND (A OR C) has no counterpart in ordinary arithmetic.
• "A OR A = 2A." There is no 2 in Boolean algebra; A OR A = A by the idempotent law.
• "De Morgan's law just flips AND to OR." It flips the operator AND complements each variable — forgetting the complements is the most common exam error.

Real-World Applications

• Circuit minimisation: synthesis tools apply these laws to shrink chip area and power consumption.
• Proving equivalence: showing two different-looking circuits compute the same function, used in verification.
• Query optimisation: databases rewrite Boolean filter conditions into cheaper equivalent forms.

The laws of Boolean algebra — identity, complement, idempotent, distributive, absorption and De Morgan's — let us transform any logic expression into a simpler equivalent one. Fluency with them is what turns a truth table into an efficient circuit.