Visual Tools
Calculators
Tables
Mathematical Keyboard
Converters
Other Tools

How to Check Whether a Formula Is a Tautology

A tautology is true in every row of its truth table. To prove it, check all 2n2^n rows or show that no row can make it false; to disprove it, one false row is enough.

Recognize the task

The question asks "is this a tautology", "is this always true", "is this formula valid", or asks you to prove an argument form such as modus ponens: P∨¬PP \lor \neg P, ((P→Q)∧P)→Q((P \to Q) \land P) \to Q, (P→Q)→(Q→P)(P \to Q) \to (Q \to P). Test: the answer is yes or no, and a "no" must come with a row where the formula is F.
Tautologies are defined in what is a tautology; the tautology lesson lists the classic ones.

Ways to do it

Full truth tableusual
all 2n rows are T\text{all } 2^n \text{ rows are T}
Build the table and scan the final column; best for up to three letters. The key tautological patterns are all checked this way.
Assume it is falseshort
A→B is F  ⟺  A is T and B is FA \to B \text{ is F} \iff A \text{ is T and } B \text{ is F}
Suppose some row makes the formula F, force the values this needs, and look for a letter that must be both T and F. A clash means no such row exists.
Simplify with the lawslaws
A≡⋯≡⊤A \equiv \cdots \equiv \top
Rewrite the formula until it becomes ⊤\top, as in simplifying a logical expression; best with four or more letters.

Steps

StepOn ((P→Q)∧P)→Q((P \to Q) \land P) \to Q
1Set up the rows. Count the letters and list all 2n2^n rows as in building a truth table.2 letters, 4 rows
2Evaluate the subformulas. Fill one column per connective, innermost first.P→QP \to Q: T, F, T, T; (P→Q)∧P(P \to Q) \land P: T, F, F, F
3Fill the final column. Apply the main connective. For an arrow, a row is F only when the left side is T and the right side is F.((P→Q)∧P)→Q((P \to Q) \land P) \to Q: T, T, T, T
4Read the verdict. All T: a tautology. Any F: not a tautology, and that row is the counterexample to report. Not a tautology does not mean a contradiction.all four rows T: a tautology

Worked examples

Example 1 · excluded middle

1 letter
P∨¬PP \lor \neg P: T∨FT \lor F, then F∨TF \lor T
only two rows
P∨¬PP \lor \neg P: T, T, a tautology
every row is T

Example 2 · a converse in disguise

not a tautology
P→QP \to Q: T, F, T, T; Q→PQ \to P: T, T, F, T
the two inner columns
(P→Q)→(Q→P)(P \to Q) \to (Q \to P): T, T, F, T
row 3 is T followed by F
not a tautology: P=FP = F, Q=TQ = T
one F row is enough

Example 3 · hypothetical syllogism

assume false
suppose ((P→Q)∧(Q→R))→(P→R)((P \to Q) \land (Q \to R)) \to (P \to R) is F
look for a falsifying row
then P→RP \to R is F, so P=TP = T, R=FR = F
the only F row of an arrow
P→QP \to Q is T with P=TP = T, so Q=TQ = T
the left part must be T
Q→RQ \to R is T with R=FR = F, so Q=FQ = F
clashes with Q=TQ = T
no row is F: a tautology
all eight rows are T
Type a formula into the proposition analyzer: its badge reads Tautology, Contradiction or Contingent.

See it happen

A tautology is true because of its shape, not because of the facts its letters stand for. Whatever you put in for PP and QQ, the pattern forces T. That is why checking finitely many rows settles the question: the rows list every way the letters can turn out. The assume-false method runs the same check backwards: instead of testing every row, it shows that the one kind of row that could fail cannot exist.

Common mistakes

Checking only some rows

✗ call P→QP \to Q a tautology after the rows (T,T)(T, T) and (F,F)(F, F)
✓ the row P=TP = T, Q=FQ = F gives F, so P→QP \to Q is not a tautology

Reading not a tautology as a contradiction

✗ P→QP \to Q is not a tautology, so it is always false
✓ it is T in three rows, so it is contingent
A contradiction needs F in every row; see checking for a contradiction.

Reading a tautological conditional as an equivalence

✗ (P∧Q)→P(P \land Q) \to P is a tautology, so P∧Q≡PP \land Q \equiv P
✓ at P=TP = T, Q=FQ = F, P∧QP \land Q is F and PP is T; only the arrow is a tautology