ChipKraftChipKraft
Start Learning
ChipKraft/Theoretical Concepts/Boolean Algebra

Boolean Algebra

Boolean Algebra Laws: Rules, Examples, and Simplification

ChipKraft8 min read

A practical reference to identity, complement, absorption, distributive, and De Morgan laws, with worked simplifications and common mistakes.

Boolean algebra describes digital logic using two values: 0 and 1. In these equations, + means OR, · means AND, and a bar means NOT. The plus sign is not ordinary arithmetic: for example, 1 + 1 = 1.

Identity, null, and idempotent laws

  • Identity: A + 0 = A, A·1 = A. OR with 0 and AND with 1 leave the signal unchanged.
  • Null: A + 1 = 1, A·0 = 0. A forced 1 controls OR; a forced 0 controls AND.
  • Idempotent: A + A = A, A·A = A. Repeating a condition adds no information.

Complement and involution laws

  • Complement OR: A + Ā = 1.
  • Complement AND: A·Ā = 0.
  • Double negation: overline(Ā) = A.

These laws remove contradictory conditions and unnecessary inversions.

Commutative, associative, and distributive laws

  • Commutative: A+B = B+A, AB = BA. The order of inputs does not matter.
  • Associative: (A+B)+C = A+(B+C), (AB)C = A(BC). Grouping can change.
  • Distributive: A(B+C)=AB+AC.
  • Dual distributive: A+BC=(A+B)(A+C). This helps convert between sum-of-products and product-of-sums forms.

Absorption laws

  • A + AB = A.
  • A(A+B)=A.

If A is already 1, the first expression is 1 regardless of B. If A is 0, both terms are 0. The extra term cannot change the answer, so absorption removes redundant logic.

De Morgan’s laws

  • Negated product: overline(AB) = Ā + B̄.
  • Negated sum: overline(A+B)=ĀB̄.

Move the inversion through the operation and complement every input. These identities explain how NAND and NOR gates can implement other logic functions.

Worked example

Simplify Y = AB + AĀ + AB̄. Since AĀ=0, this becomes Y=AB+AB̄. Factor A: Y=A(B+B̄). Since B+B̄=1, the result is Y=A. The original multi-gate expression is equivalent to a direct connection from A to Y.

A reliable simplification method

  1. Write the expression clearly and track every complement.
  2. Look for constants, repeated terms, and a variable with its complement.
  3. Factor or distribute to expose absorption and complement pairs.
  4. Apply De Morgan’s laws when you want a NAND or NOR implementation.
  5. Verify the result with a truth table.

Every algebraic step must preserve the output for every possible input combination. The truth table is a useful final check.

Keep learning

Use this concept in a tool

Try the idea interactively, then check how the inputs affect the output.