Boolean Algebra and Simplifying Logic Expressions
Writing a circuit as an algebraic expression and rearranging it with the laws of Boolean algebra, including De Morgan's, to reach a shorter expression with the same truth table. Fewer gates means less silicon and less delay.
What a learner can do afterwards
- Rewrite NOT over an AND using De Morgan's laws and check the result against a truth table
- Simplify an expression of three variables and count the gates saved
- Turn a written condition into an expression and then into gates
1 · Read
Three operations build every logic expression. AND needs both sides true, OR needs at least one side true, and NOT flips its input. When operators mix, NOT runs first, then AND, then OR, while brackets override everything. So not A or B means (not A) or B, never not (A or B).
De Morgan law turns NOT over an AND into the OR of the flipped sides: not (A and B) equals (not A) or (not B). Check it the honest way by building a truth table for both forms across all four rows. Every row must match, and if a single row differs, the rewrite is wrong.
Simplification swaps a long expression for a short one with the same truth table. If the long form needs three gates and the short form needs one, you saved two gates. Fewer gates means less silicon, less delay and less energy, while the circuit answers exactly as before.
Turn a written condition into gates in three moves. First write the condition as an expression, then shrink it with laws like De Morgan, then map each remaining operation to a gate. Never skip the truth table check between shrinking and building.
Flip the sides and swap the operator, prove it on every row, then build with fewer gates.
2 · Watch
Take it off screen
Where it sits
8 questions wait behind this lesson, each with its answer explained. Every answer feeds the sky: stars light as they are learned, and dim when it is time to come back.