Boolean algebra simplification replaces an expression with an equivalent one: it must produce the same result for every assignment of its variables. The rules below show how to recognize common patterns, rewrite them one step at a time, and check the result without treating Boolean expressions like ordinary arithmetic.
Notation and the goal of simplification
In two-valued Boolean algebra, variables take the values 0 (false) or 1 (true). This article uses ∧ for AND, ∨ for OR, and ¬ for NOT. In digital-logic notation, the same operations are often written as xy, x + y, and x′ (or with an overbar), respectively.
A valid rewrite preserves the value of the whole expression for every possible input. “Simpler” depends on the task: a shorter expression, fewer literals, fewer logic gates, and a form that is easier to read are not necessarily the same thing. The identities are tools for reaching a useful equivalent form, not a guarantee of one universally shortest answer. Delft University of Technology’s Boolean algebra of sets material and Kansas State University’s CC 210 textbook present these laws as equivalent transformations.
Boolean algebra rules at a glance
Use the equations as the reference: course materials may group or name some laws differently. “Domination” is also called the null or annulment law.
Do these 3 things before closing this tab:
1Fix the driver behind crashes, sound loss and screen glitches2Repair Windows errors before they cause bigger problems3Scan for outdated or missing drivers - takes under a minute#1 Best Overall
| Law | AND/OR identity | Pattern to notice |
|---|---|---|
| Identity | x ∧ 1 = xx ∨ 0 = x |
A neutral constant leaves the variable unchanged. |
| Domination (null) | x ∧ 0 = 0x ∨ 1 = 1 |
A dominating constant fixes the result. |
| Complement | x ∧ ¬x = 0x ∨ ¬x = 1 |
A variable appears with its negation. |
| Idempotent | x ∧ x = xx ∨ x = x |
The same term is repeated. |
| Double negation | ¬¬x = x |
Two NOT operations cancel. |
| Commutative | x ∧ y = y ∧ xx ∨ y = y ∨ x |
Terms can be reordered within the same operation. |
| Associative | (x ∧ y) ∧ z = x ∧ (y ∧ z)(x ∨ y) ∨ z = x ∨ (y ∨ z) |
Like operations can be regrouped. |
| Distributive | x ∧ (y ∨ z) = (x ∧ y) ∨ (x ∧ z)x ∨ (y ∧ z) = (x ∨ y) ∧ (x ∨ z) |
Expand or factor across the other operation. |
| Absorption | x ∨ (x ∧ y) = xx ∧ (x ∨ y) = x |
A term already covered by x can be removed. |
| De Morgan | ¬(x ∧ y) = ¬x ∨ ¬y¬(x ∨ y) = ¬x ∧ ¬y |
A NOT over a group negates each term and swaps AND with OR. |
These identities and their uses are covered in the Kansas State Boolean algebra lesson and Delft’s introduction to Boolean algebra.
How to simplify an expression reliably
- Copy the expression exactly. Preserve every NOT sign and parenthesis; grouping determines which part a rule applies to.
- Scan for recognizable patterns. Look for constants, repeated terms, a variable paired with its complement, absorption, and negated groups.
- Apply one identity to one part. Change only the portion that matches the rule, leaving the rest of the expression intact.
- Name the rule beside the rewrite. A labeled line makes it easier to see whether the replacement is valid and to locate a mistake.
- Repeat until the form suits the goal. For a small expression, a truth table can independently check that the original and final forms agree for every input combination.
Worked simplifications
Absorption removes a redundant term
x ∨ (x ∧ y) = x by absorption. Whenever x is true, the whole OR is already true; when x is false, the AND term is false too. The second term therefore cannot change the result.
Push a negation inward, then simplify
Consider x ∧ ¬(y ∨ ¬x). Apply one law at a time:
x ∧ ¬(y ∨ ¬x)— original expression= x ∧ (¬y ∧ ¬¬x)— De Morgan’s law= x ∧ (¬y ∧ x)— double negation= x ∧ (x ∧ ¬y)— commutativity inside the grouped AND= (x ∧ x) ∧ ¬y— associativity= x ∧ ¬y— idempotence
This style of successive, labeled transformations appears in Delft’s worked Boolean transformations and the University of Michigan’s Boolean expression simplification examples.
Windows Errors? Fix Them Before They Spread
Repair common Windows errors and clear accumulated junk for a smoother, more stable PC - no reinstall needed.Free scan · no reinstallCrashes, No Sound, or Screen Glitches?
Random freezes, missing sound and display glitches usually trace back to one bad driver. Find and replace yours safely.Free scan · under a minuteRank #3
Common mistakes to avoid
- Importing ordinary arithmetic rules. In Boolean OR notation,
x + x = x, not2x; repeated terms collapse by idempotence. - Forgetting to swap operations in De Morgan’s law. Negating an AND group produces an OR of negated terms; negating an OR group produces an AND of negated terms.
- Dropping parentheses. Keep the original grouping clear when moving a NOT inward or regrouping operations.
- Calling a form “the simplest” without a criterion. State whether the objective is readability, literal count, or gate count; a valid rewrite alone does not establish an optimum.
When to use a truth table
A truth table is useful as a check, especially when a derivation feels uncertain. List every input assignment and compare the output of the original expression with the proposed result. Matching outputs for all rows establish equivalence for that finite, two-valued expression; the table does not by itself explain which algebraic rule produced a shorter form. For larger expressions, a law-by-law derivation is usually easier to inspect, while a table can still provide a check when the number of variables is manageable.
Quick Recap
Product prices and availability are accurate as of the date/time indicated and are subject to change. Any price and availability information displayed on Amazon at the time of purchase will apply.
