Overview
Tautology has related but distinct meanings in logic and in ordinary language. In formal logic it denotes a formula that is true under every possible valuation or interpretation. In everyday speech and rhetoric it refers to redundancy or saying the same thing twice in different words.

Formal logical meaning

In propositional and predicate logic a tautology is a sentence whose truth value is always true, regardless of the truth values assigned to its atomic parts. Examples include the law of excluded middle illustrated by p ∨ ¬p, and simple logical truths such as p → p. A tautology contrasts with a contradiction (always false) and a contingent formula (true in some interpretations, false in others).

Rhetorical and linguistic usage

In rhetoric a tautology is a needless or stylistic repetition: a phrase that repeats the same idea. Examples are "free gift," "it is what it is," or "a beginner who is new." Sometimes such repetition is used for emphasis or poetic effect, and sometimes it is judged a stylistic fault (pleonasm or redundancy).

History and etymology

The word derives from Greek roots meaning "saying the same thing" (tauto- "same" + -logy "saying, speech"). It was used historically in rhetorical contexts before being adopted into formal logic to name universally true formulae. Over time the term acquired specialized technical sense in mathematical logic and computer science.

Testing and practical importance

Deciding whether a formula is a tautology can be done by truth tables for propositional logic, semantic tableaux, resolution methods, or automated satisfiability solvers. In digital design and Boolean algebra tautologies correspond to expressions that evaluate to the constant true and are useful in simplification and verification. In philosophy the status of certain tautologies can bear on debates about analytic truth and logical necessity.

Distinctions and caveats

  • Logical tautology (semantic notion): true in every model in a given logic.
  • Rhetorical tautology: verbal redundancy, not a formal truth condition.
  • Non-classical logics: some formulas that are tautologies in classical logic (for example p ∨ ¬p) are not tautologies in systems like intuitionistic logic.