ToolSphere
Back to all articles
student

Boolean Algebra Laws and Simplification

2026-11-119 min read

Try it: free Boolean Algebra Simplifier

Simplify logic with named laws and a truth table

Open →

Boolean algebra is the mathematical framework that underpins modern computing hardware. Developed by George Boole in 1847 and adapted to electrical switching circuits by Claude Shannon at MIT in 1937, Boolean algebra treats variables as taking one of two discrete truth values: 1 (true, high voltage) or 0 (false, low voltage).

In digital logic design and computer architecture courses (such as UC Berkeley CS 61C or MIT 6.1910), simplifying Boolean expressions is essential. Unsimplified logic creates bloated circuits with unnecessary logic gates, larger silicon area, increased power dissipation, and longer propagation delays that throttle clock frequencies.

This guide provides a comprehensive reference of Boolean algebra laws and walks through three complete algebraic simplifications step by step. Every step and truth table in these worked examples has been verified with the site's Boolean simplification engine.


The Principle of Duality

Every valid Boolean identity has a dual identity that is also true. The Principle of Duality states that if you take any correct Boolean equation and:

  1. Swap every AND (·) operator with an OR (+) operator,
  2. Swap every OR (+) operator with an AND (·) operator, and
  3. Swap every constant 0 with 1, and every 1 with 0,

the resulting equation remains strictly valid. Variable complements remain unchanged.

For instance, the identity A + 0 = A has the dual A · 1 = A. Understanding duality cuts the memorization required for exams in half: mastering one form automatically gives you its dual.


Complete Table of Boolean Algebra Laws

The table below summarizes the fundamental Boolean algebra laws. Note that juxtaposition (writing variables side by side, such as AB) represents the AND operation (A · B), + represents the OR operation, and an apostrophe (A') represents the NOT (complement) operation.

Law Name AND Form OR Form (Dual) Algebraic Meaning
Identity Law A · 1 = A A + 0 = A Operating with the neutral element preserves the variable.
Null / Domination Law A · 0 = 0 A + 1 = 1 Operating with the dominant element forces the output constant.
Idempotent Law A · A = A A + A = A Repeating an input does not alter the logical outcome.
Complement Law A · A' = 0 A + A' = 1 A variable and its negation cannot both be true; one is always true.
Involution (Double Negation) (A')' = A (A')' = A Inverting a signal twice restores its original truth value.
Commutative Law A · B = B · A A + B = B + A Input order does not change the result of AND or OR gates.
Associative Law (A · B) · C = A · (B · C) (A + B) + C = A + (B + C) Grouping adjacent identical gates does not alter the output.
Distributive Law A · (B + C) = AB + AC A + (B · C) = (A + B) · (A + C) Factoring and distributing over complementary operations.
De Morgan's Laws (A · B)' = A' + B' (A + B)' = A' · B' Complemented gates equal inverted-input dual gates.
Absorption Law A · (A + B) = A A + (A · B) = A A term absorbs any term containing it as a subfactor.
Consensus Theorem (A + B) · (A' + C) · (B + C) = (A + B) · (A' + C) AB + A'C + BC = AB + A'C Eliminates redundant consensus terms spanning complementary variables.

Detailed Breakdown of Critical Theorems

1. Distributive Laws (AND over OR, and OR over AND)

While ordinary arithmetic supports distributing multiplication over addition (a · (b + c) = ab + ac), it does not support distributing addition over multiplication (a + (bc) ≠ (a + b)(a + c)).

In Boolean algebra, both forms are strictly valid:

  1. AND distributes over OR:
    A · (B + C) = A · B + A · C
    
  2. OR distributes over AND:
    A + (B · C) = (A + B) · (A + C)
    

The second identity is one of the most powerful tools in algebraic simplification. For example, to simplify A + A'B, students often struggle using normal arithmetic intuition. Applying OR distribution immediately yields:

A + (A' · B) = (A + A') · (A + B)
             = 1 · (A + B)          [Complement Law: A + A' = 1]
             = A + B                [Identity Law: 1 · X = X]

This derived identity (A + A'B = A + B) is frequently called the Elimination Theorem or Redundancy Rule.


2. De Morgan's Laws

De Morgan's laws describe the interaction between negation and binary operators:

  1. Negation of an AND gate (NAND):

    (A · B)' = A' + B'
    

    A NAND gate outputs high whenever at least one input is low. In circuit schematics, this means a NAND gate is logically interchangeable with an OR gate with active-low (inverted) inputs.

  2. Negation of an OR gate (NOR):

    (A + B)' = A' · B'
    

    A NOR gate outputs high only when both inputs are low. In circuit schematics, a NOR gate is interchangeable with an AND gate with active-low inputs.

The generalized rule for expressions with n variables is simple: invert every individual literal and swap all AND operators with OR operators (and vice versa).

(A + B + C + ... + N)' = A' · B' · C' · ... · N'
(A · B · C · ... · N)' = A' + B' + C' + ... + N'

3. Absorption Laws

Absorption eliminates redundant logic without requiring full expansion:

  1. Primary Form:

    A + A · B = A
    

    Algebraic Proof:

    A + A · B = A · 1 + A · B      [Identity Law: A = A · 1]
              = A · (1 + B)        [Distributive Law: factoring A]
              = A · 1              [Null Law: 1 + B = 1]
              = A                  [Identity Law: A · 1 = A]
    
  2. Dual Form:

    A · (A + B) = A
    

    Algebraic Proof:

    A · (A + B) = (A + 0) · (A + B)    [Identity Law: A = A + 0]
                = A + (0 · B)          [Distributive Law: OR over AND]
                = A + 0                [Null Law: 0 · B = 0]
                = A                    [Identity Law: A + 0 = A]
    

If input A is true, the compound expression is automatically satisfied regardless of B. If A is false, the product AB is false, leaving the outcome determined entirely by A. Hence, B exerts no independent control.


4. The Consensus Theorem

The Consensus Theorem identifies and eliminates hidden redundant terms that span complementary variables.

In Sum-of-Products (SOP) form:

AB + A'C + BC = AB + A'C

How to Identify the Consensus Term

  1. Find two product terms containing a variable and its complement (A in AB and A' in A'C).
  2. Take the remaining non-complementary variables from those terms (B and C) and form their product (BC).
  3. If this product term (BC) appears in the sum, it is the consensus term and can be eliminated.

Algebraic Proof

AB + A'C + BC = AB + A'C + BC · 1                [Identity Law]
              = AB + A'C + BC · (A + A')          [Complement Law: A + A' = 1]
              = AB + A'C + ABC + A'BC             [Distributive Law]
              = (AB + ABC) + (A'C + A'BC)         [Associative / Commutative]
              = AB · (1 + C) + A'C · (1 + B)      [Distributive Law]
              = AB · 1 + A'C · 1                  [Null Law: 1 + X = 1]
              = AB + A'C                          [Identity Law]

Dual Consensus Theorem (Product-of-Sums Form)

By duality, the consensus theorem applies equally to Product-of-Sums (POS):

(A + B) · (A' + C) · (B + C) = (A + B) · (A' + C)

Here, (B + C) is the redundant consensus clause and can be deleted.


Worked Simplification 1: De Morgan's Law and Idempotence

Consider the three-variable Boolean function:

F1 = (A + B)' · (A + C)'

Step-by-Step Algebraic Reduction

  1. Apply De Morgan's Law to the first factor (A + B)':

    F1 = (A' · B') · (A + C)'
    
  2. Apply the Associative Law to unnest the terms:

    F1 = A' · B' · (A + C)'
    
  3. Apply De Morgan's Law to the second factor (A + C)':

    F1 = A' · B' · (A' · C')
    
  4. Regroup using Commutative and Associative Laws to bring identical literals together:

    F1 = (A' · A') · B' · C'
    
  5. Apply the Idempotent Law (A' · A' = A'):

    F1 = A' · B' · C'
    

Verification and Results

  • Minimal Sum of Products (SOP): A'B'C'
  • Minimal Product of Sums (POS): (A') · (B') · (C')
  • Literal Count: Reduced from 4 literals across two NOR sub-expressions to 3 literals in a single product term.

Truth Table Verification

A B C (A + B)' (A + C)' F1 (Original) F1 (Simplified: A'B'C')
0 0 0 1 1 1 1
0 0 1 1 0 0 0
0 1 0 0 1 0 0
0 1 1 0 0 0 0
1 0 0 0 0 0 0
1 0 1 0 0 0 0
1 1 0 0 0 0 0
1 1 1 0 0 0 0

The original function produces 1 exclusively when A = 0, B = 0, and C = 0 (minterm m0). The simplified expression A'B'C' produces the identical truth assignment across all eight input combinations.


Worked Simplification 2: Distributive Factoring and Absorption

Consider the expression:

F2 = A + A · B + A · C

Step-by-Step Algebraic Reduction

  1. Apply the Associative Law to group the first two terms:

    F2 = (A + A · B) + A · C
    
  2. Apply the Absorption Law (A + A · B = A):

    F2 = A + A · C
    
  3. Apply the Absorption Law a second time (A + A · C = A):

    F2 = A
    

Verification and Results

  • Minimal SOP: A
  • Minimal POS: (A)
  • Gate Count: Reduced from two AND gates and two OR gates to zero gates (a direct wire from input A to output F2).

Truth Table Verification

A B C A · B A · C F2 (Original) F2 (Simplified: A)
0 0 0 0 0 0 0
0 0 1 0 0 0 0
0 1 0 0 0 0 0
0 1 1 0 0 0 0
1 0 0 0 0 1 1
1 0 1 0 1 1 1
1 1 0 1 0 1 1
1 1 1 1 1 1 1

Whenever A = 1, the output is guaranteed to be 1. Whenever A = 0, all terms evaluate to 0. The variables B and C are completely irrelevant to the circuit behavior.


Worked Simplification 3: Consensus Theorem in SOP Form

Consider the canonical digital logic exam problem:

F3 = A · B + A' · C + B · C

Step-by-Step Algebraic Reduction

  1. Group the primary complementary terms:

    F3 = ((A · B) + (A' · C)) + (B · C)
    
  2. Analyze for Consensus:

    • Term 1 (A · B) contains variable A.
    • Term 2 (A' · C) contains complement A'.
    • The product of the remaining literals from both terms is B · C.
    • The expression already contains the term B · C.
  3. Apply the Consensus Theorem:

    F3 = A · B + A' · C
    

Verification and Results

  • Minimal SOP: A'C + AB
  • Minimal POS: (A + C) · (A' + B)
  • Gate Savings: Eliminates one 2-input AND gate and reduces the output OR gate from 3 inputs to 2 inputs.

Truth Table Verification

| A | B | C | A · B | A' · C | B · C | F3 (Original) | F3 (Simplified: AB + A'C) |
| :-: | :-: | :-: | :-: | :-: | :-: | :-: |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 1 | 0 | 1 | 0 | 1 | 1 |
| 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 |
| 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 |
| 1 | 1 | 0 | 1 | 0 | 0 | 1 | 1 |
| 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 |

Both expressions match identically across all eight rows (minterms m1, m3, m6, m7 evaluate to 1).

Engineering Note: When to Keep the Consensus Term

In asynchronous logic design, removing BC introduces a static-1 hazard.

If B = 1 and C = 1, and input A transitions from 1 to 0, the term AB turns off while A'C turns on. Because real physical inverters have non-zero propagation delay, A' goes high slightly after A goes low. For a fraction of a nanosecond, both AB and A'C are 0, producing a momentary glitch to 0 on the output.

Retaining the redundant consensus term BC prevents this glitch because BC = 1 · 1 = 1 remains high throughout the transition of A. In combinational synchronous logic, the term is removed to minimize area; in hazard-free asynchronous control paths, it is intentionally retained.


Boolean Algebra vs. Karnaugh Maps vs. Quine-McCluskey

Method Best Suited For Key Advantages Practical Limitations
Boolean Algebra 2 to 3 variables; algebraic proofs; circuit equivalence verification. Does not require drawing grids or tables; establishes symbolic identities directly. Relies on human pattern recognition; easy to miss non-obvious consensus terms or factoring steps.
Karnaugh Maps (K-Maps) 3 to 4 variables in classroom problem sets and exams. Visual Gray-code grid makes adjacency obvious; eliminates guesswork in prime implicant grouping. Becomes cumbersome at 5 variables (requires multi-plane 3D maps) and unmanageable at 6+ variables.
Quine-McCluskey Method 4 to 8 variables; computer-aided design (CAD) synthesis engines. Fully deterministic tabular algorithm; guarantees minimum SOP and POS covers with exact prime charts. NP-hard complexity; manual chart reduction is tedious for humans with large prime implicant sets.

Use Boolean algebra when you need to prove equivalence or simplify algebraic expressions symbolically. When simplifying complete truth tables on digital design midterms, verify your algebraic result against a Karnaugh map solver or an automated Boolean algebra simplifier.


Five Common Exam Traps to Avoid

  1. Forgetting that OR distributes over AND:
    Many students remember A(B + C) = AB + AC but forget A + BC = (A + B)(A + C). When you see a single variable ORed with a product term, check if OR-distribution creates a (A + A') pair that simplifies to 1.

  2. Incomplete De Morgan application:
    When negating compound terms such as (A + B · C)', students often write A' + B'C' or A' · B' · C'. The correct order is to treat (B · C) as an atomic group first:

    (A + (B · C))' = A' · (B · C)' = A' · (B' + C') = A'B' + A'C'
    
  3. Confusing XOR with inclusive OR:
    Remember that A + B is true when either or both inputs are true (1 + 1 = 1). In contrast, exclusive OR (A ⊕ B = AB' + A'B) is true when inputs differ, but evaluates to 0 when both inputs are true (1 ⊕ 1 = 0).

  4. Dropping terms instead of canceling them:
    A + A' = 1 (a constant true), whereas A · A' = 0 (a constant false). In an OR expression, A + A' becomes 1, which dominates the entire sum (1 + X = 1). In an AND expression, A · A' becomes 0, which zeroes out that product term.

  5. Assuming minimal SOP equals minimal POS:
    A function's minimal Sum of Products and minimal Product of Sums do not always have the same gate or literal count. If a function has few 0 outputs and many 1 outputs, POS will often yield fewer gates than SOP. Always evaluate both forms if your circuit design goal is strict gate minimization.


Interactive Tools and Further Practice

  • Test your algebraic steps and compare exact Sum of Products and Product of Sums representations with the Boolean Algebra Simplifier.
  • Verify groupings, prime implicants, and Gray-code grids visually using the Karnaugh Map Solver.
  • Explore gate-level implementations and signal propagation in the Digital Logic Lab.

For a related walkthrough, read Truth Tables: Reading Boolean Logic.

Looking for other tools?

Explore ToolSphere Homepage →