A truth table checks a formula row by row and always works, but it doubles in size with every new letter. The laws of logic rewrite a formula without any rows and scale to any size. Name the task first, then count the letters.
When to use this
You have a propositional formula and are not sure whether to tabulate it or transform it: "is ((P∨Q)∧¬P)→Q a tautology", "show P→(Q→R)≡(P∧Q)→R", "write ¬(P→Q)∨R in CNF". Test: say what the answer looks like (a column, a yes or no, a new formula) and count the letters n; a table has 2n rows.
Truth tables and the laws, as two ways to verify an equivalence, are compared in the equivalences lesson.
Decision tree
The same tree, written out
1You need the value of a formula in every case, or the cases where it is true.Build a table: it lists all 2n assignments, and with up to three letters it is quick. Use building a truth table; tables are introduced on the truth tables page.
4You must prove an equivalence with four or more letters, or the question says to use the laws.Rewrite one side into the other with named laws, since a table would need 16 rows or more. Use proving an equivalence with the laws together with the laws reference.
5You must write a formula in conjunctive or disjunctive normal form.Use the laws for a short form, or read the canonical form off the truth table when there are few letters. Use converting to CNF or converting to DNF; both forms are explained with the normal forms converter.
6You must simplify a formula or write it in its shortest form.Use the laws in a fixed order: arrows, negations, distribution, collapse. Use simplifying a logical expression, then check the result with a table; the laws are listed in the laws reference.