Definition:Tautology
Contents |
Definition
A tautology is a statement form which is always true, no matter what the truth value of its component substatements.
A tautology is symbolised by $\top$, and referred to as a top.
This is also known as a logical truth.
It is possible to express a theorem $\vdash \phi$ as $\top \dashv \vdash \phi$, which can be broken down conceptually into:
- $\top \vdash \phi$: this emphasises that logical truth logically implies $\phi$.
- $\phi \vdash \top$: this emphasises that $\phi$ logically implies logical truth.
Logical Formula
In the context of logical formulas the term valid is usually used:
A logical formula $P$ is valid if its value is True in all boolean interpretations.
If $P$ is valid it can be denoted $\models P$.
The notation here is that of model: the implication here is that $P$ is satisfied by any model.
Propositional Calculus
Let $\mathbf A$ be a propositional WFF.
Then $\mathbf A$ is a tautology iff it is true in every model:
- $\forall \mathcal M: \mathcal M \models \mathbf A$
Boolean Interpretation
There is only one boolean interpretation for $\top$:
- $v \left({\top}\right) = T$
Also see
Sources
- Alan G. Hamilton: Logic for Mathematicians (1978): $\S 1.2$: Definition $1.5 \ \text{(a)}$
- D.J. O'Connor and Betty Powell: Elementary Logic (1980): $\S 1.3$
- H. Jerome Keisler and Joel Robbin: Mathematical Logic and Computability (1996): $\S 1.6$