Someone hands you a logic question: "Are p \Rightarrow q and \lnot p \lor q logically equivalent?" You have two tools:
- Truth tables — mechanically list every combination of truth values for p and q, compute both expressions, and check whether the columns match.
- Equivalence rules — apply De Morgan, distributivity, implication-as-disjunction, double negation, and the like, rewriting one expression until it literally becomes the other.
Both are valid. Both give the right answer. But they have very different costs. Truth tables are guaranteed to finish but blow up exponentially — a statement with n variables has 2^n rows, and that number reaches 64 at n = 6 and 1024 at n = 10. Equivalence rules are fast when they apply but demand pattern recognition — if you do not spot the right rule, you are stuck.
The craft is knowing when to use which. Here is the reflex.
Reach for truth tables when...
1. The statement has at most three variables. A 3-variable truth table has 8 rows. You can draw it in under a minute, fill it in, and compare columns. For small statements, the table is faster than searching your memory for the right rule.
2. You do not recognise any equivalence pattern. If the expression looks like (p \land q) \lor (\lnot p \Rightarrow r) and no standard rule jumps out, drop to the truth table. It will unblock you while the rule-based approach stalls.
3. You want to verify a proposed equivalence you found by rewriting. Even a seasoned proof writer occasionally confuses themselves during a rewrite. The truth table is the audit trail — if the columns match, your rewrite is correct; if they diverge, the exact row tells you where you went wrong.
4. The problem says "prove from first principles." A truth table is the definitional proof. You cannot be accused of hand-waving.
5. You need the exact counterexample. If two expressions are not equivalent, the truth table points at the specific truth assignment that distinguishes them — a gift the equivalence rules do not offer.
Skip truth tables when...
1. The statement has many variables. Five variables means 32 rows; six means 64. Writing that by hand is tedious and error-prone, and the exam will not reward the busywork. Hunt for a rewrite.
2. You recognise a familiar pattern. The moment you see \lnot(p \land q), you know it becomes \lnot p \lor \lnot q by De Morgan. Applying the rule takes one line; the truth table takes four. Both work, but the rule is faster and cleaner.
3. You want a reusable argument. A truth table proves the equivalence for two specific expressions. A rule-based proof often generalises — "this holds for any propositions P, Q standing in place of p, q" — and composes with other rewrites downstream.
4. The expression mixes quantifiers. Quantified statements ("for every x," "there exists x") have no finite truth table — the domain is usually infinite. Truth tables are a propositional-logic tool. Predicate-logic statements need other techniques.
A concrete choice — four scenarios
Why both tools should be in your toolbox: truth tables are your guarantee. They always work, regardless of whether you remember any rule. Equivalence rules are your speedup. They finish in constant time when the pattern is familiar, but they fail silently when you do not spot the pattern. Always have the truth table available as a fallback — even when you think you see a rule.
The size trap
The biggest mistake is grinding out a large truth table when a rule would have finished the job. A statement with four or five variables has 16 or 32 rows, and drawing that by hand under exam pressure is a recipe for arithmetic slip-ups.
If you find yourself about to write more than 8 rows, stop and ask: "is there a rule I am missing?" The short list to cycle through:
- De Morgan. \lnot(p \land q) \equiv \lnot p \lor \lnot q and \lnot(p \lor q) \equiv \lnot p \land \lnot q.
- Implication rewrite. p \Rightarrow q \equiv \lnot p \lor q.
- Contrapositive. p \Rightarrow q \equiv \lnot q \Rightarrow \lnot p.
- Double negation. \lnot \lnot p \equiv p.
- Distributivity. p \land (q \lor r) \equiv (p \land q) \lor (p \land r), and dual.
- Biconditional split. p \Leftrightarrow q \equiv (p \Rightarrow q) \land (q \Rightarrow p).
Nine times out of ten, one of those six rewrites collapses your statement to a form where the answer is visible. See Truth Table vs Equivalence Rules — Which to Use for the full decision.
The exam reflex
- Count variables first. \le 3: truth table is probably fine (\le 8 rows). \ge 4: try rules first.
- Skim for known patterns. De Morgan, implication rewrite, contrapositive — the top three catch most exam problems.
- If no pattern appears in 30 seconds, drop to the truth table anyway. Brute force is slow but reliable, and there is no partial credit for elegance that never arrives.
- Double-check a rule-based proof by spot-checking one or two rows. Pick p = T, q = F. Plug into both sides. If they match, you probably did the rewrite right; if they mismatch, your rewrite has a bug.
Truth tables and equivalence rules are not rivals. They are the two speeds of the same engine — and a confident problem solver switches between them without hesitation.
Related: Logic and Propositions · Truth Table vs Equivalence Rules — Which to Use · Truth-Table Builder: Watch Each Row Light Up · Why Do We Care About Logical Equivalence in Proofs If Proofs Are About Truth?