Visual Tools
Calculators
Tables
Mathematical Keyboard
Converters
Other Tools

How to Simplify a Logical Expression

Simplifying means finding a shorter formula with the same truth table. Work in a fixed order: get rid of the arrows, move every negation onto a single letter, then factor and collapse until no law makes the formula shorter.

Recognize the task

The question says "simplify", "write in simplest form", or "reduce": ¬(P→¬Q)∨(P∧¬Q)\neg(P \to \neg Q) \lor (P \land \neg Q), (P→Q)∧P(P \to Q) \land P, P∨(P∧Q)P \lor (P \land Q). Simplifying can also settle a tautology or contradiction question: the result is then ⊤\top or ⊥\bot. Test: a letter appears more than once, or a negation stands in front of a bracket.
The laws used here are listed in the propositional logic laws reference, each with its truth-table check.

Steps

StepOn ¬(P→¬Q)∨(P∧¬Q)\neg(P \to \neg Q) \lor (P \land \neg Q)
1Rewrite the arrows. Replace each A→BA \to B by ¬A∨B\neg A \lor B (material implication).Material implication ↗¬(¬P∨¬Q)∨(P∧¬Q)\neg(\neg P \lor \neg Q) \lor (P \land \neg Q)
2Push the negations into the brackets. A ¬\neg in front of a bracket moves inside and flips ∧\land and ∨\lor (De Morgan's law).De Morgan's laws ↗(¬¬P∧¬¬Q)∨(P∧¬Q)(\neg\neg P \land \neg\neg Q) \lor (P \land \neg Q)
3Cancel the double negations. ¬¬A\neg\neg A becomes AA by the double negation law.Double negation law ↗(P∧Q)∨(P∧¬Q)(P \land Q) \lor (P \land \neg Q)
4Factor out the shared letter. Both terms contain PP; the distributive law, read right to left, pulls it out.Distributive laws ↗P∧(Q∨¬Q)P \land (Q \lor \neg Q)
5Collapse complements and constants. Q∨¬Q≡⊤Q \lor \neg Q \equiv \top by excluded middle, and P∧⊤≡PP \land \top \equiv P by the identity law. When one term contains another, use absorption: P∨(P∧Q)≡PP \lor (P \land Q) \equiv P.P∧⊤≡PP \land \top \equiv P
6Check the result. Compare the truth tables of the start and the result: the columns must match in every row.both columns: T, T, F, F

Worked examples

Example 1 · absorption

1 law
P∨(P∧Q)P \lor (P \land Q)
the term P∧QP \land Q contains PP
≡P\equiv P
absorption

Example 2 · an arrow and its premise

distribute
(P→Q)∧P≡(¬P∨Q)∧P(P \to Q) \land P \equiv (\neg P \lor Q) \land P
material implication
≡(¬P∧P)∨(Q∧P)\equiv (\neg P \land P) \lor (Q \land P)
distribute ∧P\land P
≡⊥∨(P∧Q)\equiv \bot \lor (P \land Q)
non-contradiction
≡P∧Q\equiv P \land Q
identity law

Example 3 · down to a contradiction

result is false
(P∨Q)∧(P∨¬Q)∧¬P(P \lor Q) \land (P \lor \neg Q) \land \neg P
start
≡(P∨(Q∧¬Q))∧¬P\equiv (P \lor (Q \land \neg Q)) \land \neg P
factor out P∨P \lor
≡(P∨⊥)∧¬P≡P∧¬P\equiv (P \lor \bot) \land \neg P \equiv P \land \neg P
non-contradiction, then identity
≡⊥\equiv \bot
a letter and its negation
Confirm that the start and the result match in the equivalence validator.

See it happen

Simplifying is the logic version of collecting like terms. The fixed order matters: arrows and negated brackets hide the structure, so they go first. Once only ∧\land, ∨\lor and negated letters remain, shared letters become visible and the distributive law can pull them out. Pairs like Q∨¬QQ \lor \neg Q then say "always true" and drop away, the way x−xx - x drops out of a sum.

Common mistakes

Absorbing into the wrong term

✗ P∧(P∨Q)≡P∧QP \land (P \lor Q) \equiv P \land Q
✓ P∧(P∨Q)≡PP \land (P \lor Q) \equiv P by absorption

Keeping the connective in De Morgan's law

✗ ¬(¬P∨¬Q)≡P∨Q\neg(\neg P \lor \neg Q) \equiv P \lor Q
✓ ¬(¬P∨¬Q)≡P∧Q\neg(\neg P \lor \neg Q) \equiv P \land Q

Letting a contradiction swallow an or

✗ (P∧¬P)∨Q≡⊥(P \land \neg P) \lor Q \equiv \bot
✓ (P∧¬P)∨Q≡⊥∨Q≡Q(P \land \neg P) \lor Q \equiv \bot \lor Q \equiv Q

Dropping the premise

✗ (P→Q)∧P≡Q(P \to Q) \land P \equiv Q
✓ (P→Q)∧P≡P∧Q(P \to Q) \land P \equiv P \land Q; at P=FP = F, Q=TQ = T the formula is F but QQ is T