Boolean Algebra: Laws & De Morgan’s Theorem

Boolean algebra is the mathematics of binary logic. It uses variables that take only two values — 0 and 1 — and three operations (AND, OR, NOT) to describe and simplify digital circuits. Every logic gate network corresponds to a Boolean expression, and simplifying that expression means fewer gates, less area and lower power in silicon. This guide covers the operators, the laws, and De Morgan’s theorems.

The three Boolean operations

• AND (logical product): A · B, written AB. Output 1 only when both are 1.
• OR (logical sum): A + B. Output 1 when either is 1.
• NOT (complement): A' or Ā. Inverts the value.

Laws of Boolean algebra

De Morgan’s theorems

The two most-used rules in logic design, because they let you convert between AND/OR forms and swap gate types:

• First theorem: (A · B)' = A' + B' — the complement of an AND is the OR of the complements.
• Second theorem: (A + B)' = A' · B' — the complement of an OR is the AND of the complements.

De Morgan’s laws are why a NAND can stand in for an OR-of-inverted-inputs, and a NOR for an AND-of-inverted-inputs — the foundation of universal-gate design.

Worked simplification example

Simplify Y = A'B + AB + AB':

1. Group the first two terms: A'B + AB = B(A' + A) = B · 1 = B.
2. Expression becomes Y = B + AB'.
3. By absorption variant, B + AB' = B + A.
4. So Y = A + B — a single OR gate replaces three AND/OR terms.

SOP and POS forms

Any Boolean function can be written as a Sum of Products (OR of AND terms, e.g. AB + CD) or a Product of Sums (AND of OR terms, e.g. (A+B)(C+D)). SOP maps directly to AND-OR logic; POS maps to OR-AND logic. The Karnaugh map is the graphical tool for reducing either form to its minimal gate count.

Why Boolean algebra matters in chip design

Synthesis tools apply these same laws automatically to minimize a netlist, but engineers still need them to read schematics, debug logic, and reason about equivalence. Boolean simplification directly reduces gate count, which cuts die area, dynamic power and delay.

FAQs on Boolean algebra

What are the basic operations in Boolean algebra?

AND (logical product), OR (logical sum) and NOT (complement). All other operations, including XOR and NAND, are built from these three.

What is De Morgan’s theorem?

Two rules: (A·B)’ = A’ + B’ and (A+B)’ = A’ · B’. They let you convert an AND to an OR (and vice versa) by complementing inputs and output, which is essential for universal-gate design.

What is the difference between SOP and POS?

SOP (Sum of Products) is an OR of AND terms and maps to AND-OR logic; POS (Product of Sums) is an AND of OR terms and maps to OR-AND logic. Both can represent the same function.

How is Boolean algebra used in VLSI?

It underlies logic minimization during synthesis — fewer Boolean terms mean fewer gates, which reduces area, power and timing in the final chip.

Learn logic design end to end in ChipXpert’s RTL Design course. Related: logic gates, universal gates, Karnaugh map.