A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.
Boolean algebra provides formal rules (commutative, associative, distributive, De Morgan's laws) for manipulating logical expressions. These laws are essential for circuit minimization and understanding how logic gates can be rearranged without changing their function.
Practice simplifying boolean expressions step-by-step using one law at a time; verify results with truth tables.
De Morgan's laws apply to AND and OR (negating changes the operator), not directly to other gates. Double negation always simplifies to the original.
Boolean algebra is a formal system with exactly two values — 0 and 1 (or false and true) — and three fundamental operations: AND (·), OR (+), and NOT (¬). Just as ordinary algebra has rules like a + b = b + a, Boolean algebra has its own laws that let you rewrite expressions into equivalent forms. Understanding these laws is what turns "simplify this circuit" from guesswork into a systematic procedure.
The foundational laws fall into a few families. The identity laws say that A AND 1 = A and A OR 0 = A — ANDing with 1 or ORing with 0 doesn't change anything. The complement laws say that A AND NOT A = 0 and A OR NOT A = 1 — a variable and its complement always cancel out. The commutative and associative laws work just like in regular algebra: order and grouping of AND/OR don't matter. The distributive law is where things get interesting: A AND (B OR C) = (A AND B) OR (A AND C), which lets you factor common terms and collapse expressions.
De Morgan's laws are the most frequently used and most frequently confused. They say: NOT(A AND B) = NOT A OR NOT B, and NOT(A OR B) = NOT A AND NOT B. The pattern is: when you push a NOT inside parentheses, every variable gets negated AND the operator flips (AND ↔ OR). This is not intuitive at first. The classic mistake is to negate the variables without flipping the operator. A truth table check for a small case is the surest way to verify you've applied De Morgan's correctly.
The practical payoff of these laws is circuit minimization. Every gate in a digital circuit costs area, power, and delay. If you can rewrite a Boolean expression into a simpler equivalent — fewer terms, fewer literals — you build a faster and cheaper circuit. For example, AB + AC simplifies to A(B + C) by the distributive law: instead of two AND gates feeding an OR gate, you get one AND gate whose output feeds a smaller OR gate. After learning to minimize by hand, you'll use Karnaugh maps to do this visually for larger expressions.
Always verify algebraic simplifications with a truth table, at least while learning. The table is the ground truth: if two expressions have identical truth tables for all input combinations, they are equivalent. If your simplified expression disagrees with the original truth table on any row, you made an error somewhere in the algebra.