"Tautology" sounds like a compliment teachers give for saying nothing. A statement that is true in every row of the truth table tells you nothing about the world — the truth is not contingent on any fact about p or q. So why does the syllabus make a fuss about them?
The answer: tautologies are the grammar of logical thought. They are the rules every valid argument is secretly using. They encode the techniques of proof, simplify complicated expressions, and power the optimisation of every digital circuit. Far from being useless, they are the scaffolding you stand on whenever you reason.
What a tautology is (and what it is not)
A tautology is a compound statement whose final column in the truth table is all Ts, regardless of the truth values assigned to its atomic variables. The classic example is the law of excluded middle:
Whether p is true or false, the disjunction is true. The statement is always true — not because of what p says, but because of the structure of "or" and "not".
A tautology is not a fact about the world. "The sun rises in the east" is an empirical truth, not a tautology. "Either it is raining or it is not" is a tautology — it is true in every conceivable world, regardless of the weather.
Why this matters: a tautology is a truth of form, not of content. That is exactly why it is useful — because it is content-free, it applies to every problem you will ever encounter. The content gets plugged in later.
Use 1: tautologies are the blueprints of proof techniques
Every standard proof technique is a tautology in disguise. Here are three you already use, unmasked:
Modus ponens — the "if p is true and p \Rightarrow q is true, then q is true" rule:
Check the truth table: all four rows give T. This is a tautology. It is also the rule you use every time you go from "water boils at 100^\circC at sea level" and "this kettle is at sea level" to "this kettle boils at 100^\circC."
Modus tollens — the contrapositive proof technique:
Also a tautology. Every proof by contrapositive is this tautology applied to specific p and q. See Proof by Contrapositive for the full technique.
Proof by contradiction:
where F is any contradiction (a statement that is always false). Every "assume the opposite and derive a contradiction" argument is this tautology. See Proof by Contradiction.
When a textbook says "by modus ponens" or "by contradiction," the author is invoking a tautology as the justification for the step. The tautology itself is content-free, but the step is valid precisely because the tautology holds in all worlds.
Use 2: tautologies are algebraic simplification rules
The second role of tautologies is purely algebraic. In Logic and Propositions, you learn rules like distributivity, De Morgan, and absorption. Each rule is an equivalence of the form
which is itself shorthand for the tautology
The biconditional is T in every row — that is the definition of equivalence.
Why you care: these tautologies let you simplify a 5-variable, 7-operator expression into a cleaner form without building a 32-row truth table. They are the algebra of logic. A digital-electronics engineer uses De Morgan to convert a NAND-gate circuit into a NOT-AND circuit, cutting the chip's transistor count. A programmer uses distributivity to rewrite (x || y) && (x || z) as x || (y && z), saving a branch.
Use 3: tautologies encode validity
An argument is valid if the conclusion must be true whenever the premises are. Formally:
must be a tautology. Invalid arguments fail this test — there is a row where all premises are true but the conclusion is false.
This is the single most important use of tautologies. Checking whether an argument is valid reduces to checking whether one big expression is a tautology. You do not need intuition about what sounds persuasive. Build the truth table. If the final column is all Ts, the argument is valid. If there is a single F, the argument is invalid and you have found the counterexample row.
Use 4: tautologies power circuit optimisation
Every gate in a digital circuit is a truth table. Every tautology is a way of saying "these two circuits compute the same thing." If one circuit uses 10 gates and its tautologically equivalent form uses 6 gates, you save 4 gates per instance — and a modern chip has billions of gates.
The identity p \lor (p \land q) \equiv p (absorption law) is a tautology that tells a circuit designer "you do not need that extra AND gate." Millions of times per chip, absorption is invoked to simplify.
A lived example: proof that \sqrt{2} is irrational
The classical proof of \sqrt{2}'s irrationality assumes \sqrt{2} = p/q in lowest terms, and derives that both p and q are even — contradicting "lowest terms."
The structural move is: assume \lnot r (where r = "\sqrt{2} is irrational"), derive a contradiction, conclude r. That move is exactly the tautology (\lnot r \Rightarrow F) \Rightarrow r. Without the tautology, the contradiction you derived would prove nothing — it is the tautology that authorises the leap from "contradiction on the other side" to "therefore the original claim."
The content-free tautology made the content-full proof possible.
The short answer
A tautology is always true, so it says nothing about the world. But that is a feature, not a bug — it is because a tautology is content-free that you can plug any proposition into it and the validity holds. Tautologies are:
- The rules behind modus ponens, modus tollens, and proof by contradiction.
- The algebra of logical simplification (De Morgan, distributivity, absorption).
- The formal definition of a valid argument.
- The optimisation principle for digital circuits.
"Always true" is what makes them universally applicable. They are not trivial — they are the quiet furniture of every argument you have ever found convincing.
Related: Logic and Propositions · Tautology, Contradiction, or Contingent? · Proof by Contradiction · Proof by Contrapositive