Visual Tools
Calculators
Tables
Mathematical Keyboard
Converters
Other Tools

Tautologies Truth Tables


Basic Propositions
Implications
Biconditionals
Contradictions
P¬PP ∨ ¬P
FTT
TFT

This tautology expresses that a proposition or its negation must always be true, capturing the principle of bivalence in classical logic. The expression evaluates to true for both possible truth values of P. It is a fundamental truth in propositional logic, showing that every statement must either hold or not hold, with no third option. This tautology is essential in establishing completeness and soundness in logical systems.

Learn more:


What Is a Tautology?
Key Tautological Patterns
P ∨ ¬P: Law of Excluded Middle
(P → Q) ∨ (Q → P): Implication Comparability
(P ∧ Q) → P: Conjunction Elimination
((P → Q) ∧ (Q → R)) → (P → R): Hypothetical Syllogism
((P → Q) ∧ P) → Q: Modus Ponens
P → (Q → P): Positive Antecedent Principle
(P → (Q ∨ R)) → ((P → Q) ∨ (P → R)): Implication Over Disjunction
((P ∨ Q) ∧ ¬P) → Q: Disjunctive Syllogism
(P ↔ Q) → ((P → Q) ∧ (Q → P)): Biconditional Decomposition


What Is a Tautology?

A tautology is a compound proposition that is true under every possible assignment of truth values to its variables. No matter what combination of true and false you assign, the formula always evaluates to true. In a truth table, the final column contains only T values.

Tautologies are also called logically valid formulas. They represent logical truths — statements whose truth depends entirely on their logical structure, not on the meaning of their components. The negation of a tautology is a contradiction (always false), and vice versa.

Tautologies play a central role in formal logic: they define the valid inference rules, establish equivalences between formulas, and serve as the axioms of many deductive systems. Recognizing tautologies is essential for constructing sound mathematical proofs.

Key Tautological Patterns

Several tautological patterns appear repeatedly in logic and mathematics:

• Law of excluded middle: P ∨ ¬P — every proposition is either true or false.

• Modus ponens: ((P → Q) ∧ P) → Q — if the implication and its antecedent both hold, the consequent follows.

• Hypothetical syllogism: ((P → Q) ∧ (Q → R)) → (P → R) — implication chains are transitive.

• Disjunctive syllogism: ((P ∨ Q) ∧ ¬P) → Q — eliminating one disjunct forces the other.

• Conjunction elimination: (P ∧ Q) → P — a conjunction implies each of its conjuncts.

• Contrapositive equivalence: (P → Q) ↔ (¬Q → ¬P) — an implication equals its contrapositive.

These patterns are the building blocks of deductive reasoning. Each corresponds to an inference rule used in natural deduction and other formal proof systems.

P ∨ ¬P: Law of Excluded Middle

The formula P ∨ ¬P states that for any proposition P, either P is true or its negation ¬P is true. There is no third option. This is the law of excluded middle (tertium non datur), one of the three classical laws of thought alongside the law of non-contradiction and the law of identity.

The truth table has only two rows (P = T and P = F), and the result is T in both. When P is true, the first disjunct holds. When P is false, ¬P is true and the second disjunct holds.

The law of excluded middle is accepted in classical logic but rejected in intuitionistic logic, where asserting P ∨ ¬P requires a constructive proof of one disjunct. This distinction is fundamental to the philosophy of mathematics and the foundations of constructive reasoning.

(P → Q) ∨ (Q → P): Implication Comparability

This tautology states that for any two propositions, at least one of them implies the other. This may seem surprising, but it follows directly from how material implication works: P → Q is false only when P is true and Q is false, and Q → P is false only when Q is true and P is false. These two falsifying conditions cannot hold simultaneously.

If P and Q are both true, both implications hold. If both are false, both hold (vacuously). If one is true and the other false, exactly one implication holds. In every case, the disjunction is true.

This result does not mean that there is a meaningful logical relationship between any two propositions — it is a consequence of the truth-functional definition of material implication, where a false antecedent makes the conditional vacuously true.

(P ∧ Q) → P: Conjunction Elimination

The formula (P ∧ Q) → P states that if both P and Q are true, then P is true. This is the simplification rule (or conjunction elimination): from a conjunction, either conjunct can be inferred.

The tautology holds vacuously when the antecedent P ∧ Q is false (any row where P or Q is false), and it holds directly when the antecedent is true (the single row where both P and Q are true, in which case P is certainly true).

Conjunction elimination is one of the most basic inference rules in natural deduction. Its symmetric counterpart (P ∧ Q) → Q is equally valid. Together they establish that a conjunction carries exactly the information of both its components.

((P → Q) ∧ (Q → R)) → (P → R): Hypothetical Syllogism

This tautology expresses the transitivity of implication: if P implies Q and Q implies R, then P implies R. The implication chain can be extended to any length — if P → Q, Q → R, and R → S, then P → S.

The truth table has eight rows (three variables). In every row, the formula evaluates to true. The only way the outer implication could be false is if the antecedent ((P → Q) ∧ (Q → R)) were true and the consequent (P → R) were false. But P → R is false only when P is true and R is false, and if P is true and P → Q holds then Q is true, and if Q is true and Q → R holds then R is true — contradicting R being false.

Hypothetical syllogism is the logical basis for chain reasoning in mathematics: proving A → B → C → D by establishing each link separately.

((P → Q) ∧ P) → Q: Modus Ponens

Modus ponens is the most fundamental rule of inference in deductive logic: if P → Q is true and P is true, then Q must be true. The Latin name means "method of affirming" — by affirming the antecedent, we affirm the consequent.

The truth table confirms this is a tautology. The antecedent (P → Q) ∧ P is true only in one row: P = T, Q = T (since P → Q requires Q to be true when P is true). In that row, Q is indeed true. In all other rows, the antecedent is false and the outer implication holds vacuously.

Modus ponens is the engine of forward reasoning. Given a known fact P and a rule P → Q, we conclude Q. Nearly every mathematical proof uses modus ponens, often implicitly, when applying a theorem to specific premises.

P → (Q → P): Positive Antecedent Principle

This tautology states that if P is true, then P is implied by any proposition Q. The nested implication Q → P holds whenever P is true, regardless of Q's truth value, because a true consequent makes any conditional true.

When P is true, Q → P is true (true consequent). When P is false, the outer implication P → (Q → P) is vacuously true (false antecedent). Either way, the formula holds.

This principle reflects a property of material implication that can seem counterintuitive: a true proposition is implied by everything. In formal axiom systems (such as Hilbert-style systems), P → (Q → P) often appears as an axiom, establishing that truths can be freely "weakened" by additional hypotheses.

(P → (Q ∨ R)) → ((P → Q) ∨ (P → R)): Implication Over Disjunction

This tautology states that if P implies a disjunction Q ∨ R, then P implies at least one of the disjuncts individually. The formula distributes implication over disjunction.

The proof is straightforward: if P is false, both P → Q and P → R are vacuously true, so the consequent holds. If P is true, then Q ∨ R must be true (by the antecedent), meaning at least one of Q or R is true. Whichever is true makes the corresponding implication (P → Q or P → R) true.

This principle is valid in classical logic. In intuitionistic logic, the result is more subtle because constructive disjunction requires knowing which disjunct holds, not merely that one does.

((P ∨ Q) ∧ ¬P) → Q: Disjunctive Syllogism

Disjunctive syllogism states: if at least one of P or Q is true, and P is false, then Q must be true. The disjunction guarantees one disjunct, the negation eliminates one, and the remaining disjunct is forced.

The truth table confirms that this formula is a tautology. The antecedent (P ∨ Q) ∧ ¬P is true only when P is false and Q is true — and in that case Q is indeed true. In all other rows the antecedent is false, making the outer implication vacuously true.

Disjunctive syllogism is one of the most commonly used inference rules in natural deduction and everyday reasoning. It formalizes the intuitive argument: "it's one or the other; it's not this one; therefore it's the other."

(P ↔ Q) → ((P → Q) ∧ (Q → P)): Biconditional Decomposition

This tautology states that if P and Q are logically equivalent (P ↔ Q), then P implies Q and Q implies P. The biconditional decomposes into the conjunction of both directions of implication.

The biconditional P ↔ Q is true when P and Q share the same truth value (both true or both false). In both cases, P → Q and Q → P are each true, so their conjunction is true and the outer implication holds. When P ↔ Q is false (P and Q differ), the outer implication is vacuously true.

This decomposition is the standard way to prove a biconditional in mathematics: prove the forward direction (P → Q) and the backward direction (Q → P) separately, then combine them.