Skip to content
UPEEC

Boolean Algebra

The algebra of 0 and 1: laws, De Morgan's theorems and simplification.

Easy
Comments 0

Key laws:

  • Identity: A+0=AA + 0 = A, A⋅1=AA \cdot 1 = A
  • Null: A+1=1A + 1 = 1, A⋅0=0A \cdot 0 = 0
  • Idempotent: A+A=AA + A = A
  • Complement: A+Aˉ=1A + \bar{A} = 1, AAˉ=0A\bar{A} = 0
  • Absorption: A+AB=AA + AB = A
  • Distributive: A+BC=(A+B)(A+C)A + BC = (A + B)(A + C)

De Morgan's theorems:

A⋅B‾=Aˉ+BˉA+B‾=Aˉ⋅Bˉ\overline{A \cdot B} = \bar{A} + \bar{B} \qquad \overline{A + B} = \bar{A} \cdot \bar{B}

"Break the bar, change the sign." Simpler expressions mean fewer gates, less power and less delay.

Sub-topics (1)

Karnaugh Maps

A visual method to simplify Boolean expressions with up to 4–6 variables.

Easy♥ 0🔖 0💬 0

Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.

Discussion (0)

Sign in or join free to ask questions and discuss this topic.