You have two logical expressions, and you want to prove they mean the same thing. Should you build a truth table and compare columns, or rewrite one expression into the other using identities like De Morgan and distributivity?
Both are valid. Neither is universally better. The right choice depends on the number of variables, the structure of the expressions, and what you actually want to walk away with at the end — a yes/no verdict, or a human-readable derivation.
What each tool does
Truth table. List every possible combination of truth values for the propositional variables. Evaluate both expressions on every row. If the final columns match row by row, the expressions are logically equivalent.
Equivalence rules. Apply a sequence of known identities — De Morgan, distributivity, double negation, implication as \lnot p \lor q, and so on — to transform one expression into the other. See Logic and Propositions for the full catalogue.
Why both work: logical equivalence means "same truth value on every interpretation." A truth table directly checks this by enumerating interpretations. Equivalence rules are theorems that have already been proved equivalent via truth tables — using them is just chaining together many small truth-table verdicts into one big one.
The first deciding factor: how many variables?
The truth table for n variables has 2^n rows. Watch how fast that grows:
| Variables | Rows | Feasibility |
|---|---|---|
| 2 | 4 | trivial |
| 3 | 8 | fast |
| 4 | 16 | manageable |
| 5 | 32 | tedious |
| 6 | 64 | do not attempt by hand |
Up to three variables, the truth table is almost always the safest move. You cannot forget a rule, you cannot miscite a theorem, and the mechanical process catches every error. For four variables, you still can — 16 rows fits comfortably on a page.
Beyond that, truth tables become error-prone simply because you are copying 2^n rows correctly. At 5 variables or more, equivalence rules pull ahead decisively.
The second deciding factor: structure
Some expressions beg for a rule. If you see:
- \lnot(p \land q) — the De Morgan rule gives you \lnot p \lor \lnot q in one step.
- p \Rightarrow q alongside \lnot p \lor q — these are equivalent by the implication rule, again one step.
- p \land (q \lor r) vs (p \land q) \lor (p \land r) — distributivity, one step.
Building a full 8-row truth table to verify what a single rule application reveals is a waste of a minute you do not have in an exam.
On the other hand, some expressions have no obvious structural relationship. They involve many nested operators, and you cannot see which rule to apply first. A truth table forces the answer out regardless of your pattern-recognition skill.
The third deciding factor: what do you need out of it?
- Just a yes/no verdict for a multiple-choice question. Truth table — fast and reliable if the variable count is small.
- A proof you can show to a grader or write on paper. Equivalence rules — the chain of identities is the proof, and it reads like a short paragraph.
- You need to understand why two expressions agree. Equivalence rules — each step reveals a structural reason. A truth table tells you that they agree, not why.
Two worked comparisons
Comparison 1: Two variables, two steps
Prove \lnot(p \Rightarrow q) \equiv p \land \lnot q.
Truth-table route (4 rows):
| p | q | p \Rightarrow q | \lnot(p \Rightarrow q) | p \land \lnot q |
|---|---|---|---|---|
| T | T | T | F | F |
| T | F | F | T | T |
| F | T | T | F | F |
| F | F | T | F | F |
Columns match. Done.
Equivalence-rules route (3 lines):
Both take about the same time. For two variables, pick whichever feels more natural.
Comparison 2: Four variables, no obvious rule
Prove (p \lor q) \land (r \lor s) \equiv (p \land r) \lor (p \land s) \lor (q \land r) \lor (q \land s).
Truth-table route: 16 rows, each requiring four base columns and five derived columns. It works — but it is half a page of careful copying.
Equivalence-rules route: Distribute (p \lor q) over (r \lor s) using the distributive law twice:
Two applications of distributivity. Done.
Here the rules win handily. The truth table verdict would be correct, but the equivalence-rule derivation is both faster and shows the structural reason.
The practical workflow
In an exam, use this decision sequence:
- Count the variables. If n \le 3, the truth table is always available as a safety net.
- Scan for obvious rules. De Morgan, implication rewrite, distributivity — if one applies directly, try the rule route first.
- If both options are comfortable, pick the one that matches what the question asks for. A "show" or "prove" question wants a derivation; a "verify" or "which of the following is equivalent" question wants a verdict.
- If you get stuck with rules, fall back to a truth table — it always works, even if slowly.
The two methods are not rivals. They are a portable toolkit, and the best logicians carry both. See the truth-table builder visualisation for a hands-on drill of the enumeration approach, and revisit the equivalence-rule catalogue in Logic and Propositions to drill the algebra approach.
Related: Logic and Propositions · Truth-Table Builder · Converse vs Contrapositive · Tautology, Contradiction, or Contingent?