Course contentsShow
← Mathematics
Lesson 2478 of 3,12150. Discrete Math — Logic and ProofFree lesson

Tautologies, Contradictions, and Contingencies

Classify compound propositions as tautologies (always true), contradictions (always false), or contingencies (sometimes true).

Tautologies, Contradictions, and Contingencies

What you'll learn: You'll discover how to classify any compound logical proposition based on whether it's always true, always false, or sometimes true depending on its variables.

The Three Categories

After building compound propositions with AND, OR, NOT, and conditionals, we can now classify them by examining their truth tables:

Tautology

A tautology is a compound proposition that is always true, regardless of the truth values of its component propositions. Think of it as a logical certainty—no matter what happens, it comes out true.

Example: p ∨ ¬p ("p or not p")
Whether p is true or false, this statement is always true. Either it's raining or it's not raining—guaranteed true!

Contradiction

A contradiction is a compound proposition that is always false, no matter what. It's logically impossible.

Example: p ∧ ¬p ("p and not p")
This can never be true. It can't both be raining and not raining at the same time.

Contingency

A contingency is a compound proposition that is sometimes true and sometimes false—it depends on the truth values of its components. Most everyday statements fall into this category.

Example: p ∧ q ("p and q")
This is true only when both p and q are true; otherwise it's false. Its truth depends on the specific situation.

How to Classify

Build a complete truth table. If the final column contains:

  • All T's → tautology
  • All F's → contradiction
  • Mix of T's and F's → contingency

Key Takeaway: Tautologies are always true, contradictions are always false, and contingencies depend on their variables—use truth tables to classify any compound proposition into exactly one of these three categories.