Boolean Laws
Part of Boolean Logic and Gates
The algebraic rules governing logical operations, enabling circuit simplification and proof of equivalence.
Why This Matters
Boolean algebra provides the mathematical foundation for designing and simplifying digital circuits. Without it, engineers would have no systematic way to reduce a complex gate network to its simplest equivalent form. Every time you reduce a five-gate circuit to two gates, you save transistors, power, and signal propagation delay.
Understanding Boolean laws also lets you verify that two circuits behave identically without building both. You prove equivalence on paper, then build only the simpler version. In a resource-constrained rebuild scenario, this translates directly to less wire, fewer components, and more reliable hardware.
These laws are not arbitrary rules — each one has a direct physical interpretation in terms of switch states and current flow. Internalizing them builds intuition that makes circuit design feel natural rather than mechanical.
Identity and Null Laws
Two fundamental laws define the boundaries of logical operations.
The identity laws state that combining any variable with the neutral element for an operation leaves the variable unchanged:
- A AND 1 = A
- A OR 0 = A
These are analogous to multiplying by 1 or adding 0 in ordinary arithmetic. A switch in series with a permanently closed switch behaves like a single switch. A switch in parallel with a permanently open switch behaves like a single switch.
The null laws state that combining any variable with the absorbing element collapses the result:
- A AND 0 = 0
- A OR 1 = 1
A switch in series with a permanently open switch can never pass current regardless of the switch state. A switch in parallel with a permanently closed switch always passes current. These laws allow you to eliminate branches of a circuit that connect to power or ground.
In practice, these laws appear constantly during simplification. When tracing a schematic and you encounter a node tied to VCC or GND, you can immediately substitute 1 or 0 and apply these laws to collapse portions of the logic tree.
Idempotent, Complement, and Involution Laws
The idempotent laws describe what happens when a variable operates on itself:
- A AND A = A
- A OR A = A
Repeating a variable in an expression adds no information. Two switches controlled by the same signal and placed in series behave as one switch. This law helps eliminate redundant gate inputs.
The complement laws describe a variable combined with its own inverse:
- A AND NOT-A = 0
- A OR NOT-A = 1
These are fundamental. A signal and its complement are mutually exclusive — one is always 0 when the other is 1. In series, they can never both conduct simultaneously, so the result is always 0. In parallel, one is always conducting, so the result is always 1. These laws let you identify and eliminate contradictory or tautological subexpressions.
The involution law (double negation) states:
- NOT(NOT-A) = A
Inverting a signal twice returns you to the original. Two cascaded NOT gates cancel out. This is useful when analyzing circuits with multiple inversion stages — you can cancel paired inverters to simplify the expression.
Commutative and Associative Laws
The commutative laws state that operand order does not matter:
- A AND B = B AND A
- A OR B = B OR A
This is obvious for two inputs but matters when reordering terms to identify common factors or to match a standard form. In a physical circuit, commutativity means you can swap which wire connects to which gate input without changing behavior — useful when routing wires on a board.
The associative laws state that grouping does not matter:
- (A AND B) AND C = A AND (B AND C)
- (A OR B) OR C = A OR (B OR C)
You can parenthesize a chain of ANDs or ORs in any way and get the same result. This allows you to restructure multi-input gate trees for timing optimization — a balanced tree of two-input gates has shorter propagation delay than a chain. For a four-input AND, two parallel two-input AND gates feeding a third AND gate is faster than three sequential two-input AND gates.
Distributive Law and Absorption
The distributive laws describe how AND and OR interact:
- A AND (B OR C) = (A AND B) OR (A AND C)
- A OR (B AND C) = (A OR B) AND (A OR C)
The first form is analogous to arithmetic distribution and is more intuitive. The second form has no arithmetic analogue and surprises beginners, but it is equally valid. These laws enable factoring and expansion of Boolean expressions, which is central to minimization.
The absorption laws allow you to eliminate redundant terms:
- A OR (A AND B) = A
- A AND (A OR B) = A
In the first case, whenever A is 1, the whole expression is 1 regardless of B — so the AND term adds nothing. When A is 0, the AND term is also 0, so again B does not matter. The variable A “absorbs” the more complex term. These laws are powerful shortcuts that dramatically reduce expression complexity before applying more systematic methods like Karnaugh maps.
DeMorgan’s Theorems
DeMorgan’s theorems are among the most practically useful Boolean laws:
- NOT(A AND B) = NOT-A OR NOT-B
- NOT(A OR B) = NOT-A AND NOT-B
In words: the complement of a product equals the sum of complements; the complement of a sum equals the product of complements. To negate a Boolean expression, invert each variable and swap AND with OR (and vice versa).
This is invaluable when you have only NAND gates available. A NAND gate computes NOT(A AND B). By DeMorgan, this equals NOT-A OR NOT-B. So a NAND gate with both inputs tied together computes NOT-A — it functions as an inverter. Two NAND gates can implement any two-input function. This is why NAND gates are called “universal.”
To apply DeMorgan to a complex expression, work from the outside in. For NOT(A AND (B OR C)):
- Complement the outer AND: NOT-A OR NOT(B OR C)
- Apply DeMorgan to the inner term: NOT-A OR (NOT-B AND NOT-C)
Practicing this transformation fluently is essential for circuit design with limited gate types.
Applying the Laws: A Simplification Example
Consider the expression: A AND B OR A AND NOT-B
Factor out A using the distributive law: A AND (B OR NOT-B)
Apply the complement law to the term in parentheses: B OR NOT-B = 1
Apply the null/identity law: A AND 1 = A
The original two-term, four-variable expression reduces to a single wire. In a circuit, two AND gates and one OR gate become nothing — just a direct connection. This kind of simplification is what Boolean laws make possible, and Karnaugh maps systematize the process for larger expressions.