Symbolic LogicTruth Tables

Consistent, Inconsistent and Contradictory

Statements are consistent if some row makes them all true; two statements are contradictory if they have opposite values in every row.

Not started Jump to practice

Truth tables compare more than single formulas. With a joint table (Tautologies, Contradictions and Contingent Statements) you can ask how two or more statements relate to each other: can they all be true at once, and can they all be false at once?

Key idea

Statements are consistent if at least one row makes all of them true; otherwise they are inconsistent. Two statements are contradictory if they have opposite values in every row.

Why it works

Consistency is about whether a set of claims could describe one possible situation. If no row makes them all true, then believing all of them is a mistake, whatever the facts are. Contradictories are a special, tighter case: exactly one of the pair is true in every row, so they can be neither both true nor both false. Inconsistent statements that are not contradictory can still both be false together.
Inconsistent but not contradictory: no row makes both true, but the last row makes both false.

Worked examples

Worked example: Contradictory

How are $p \to q$ and $p \land \neg q$ related?
  1. Column for $p \to q$: T, F, T, T.
  2. Column for $p \land \neg q$: F, T, F, F.
  3. They are opposite in every row.

Answer: Contradictory

Worked example: Inconsistent, not contradictory

How are $p \land q$ and $\neg p \land q$ related?
  1. No row makes both T: one needs $p$ T, the other $p$ F.
  2. The row $p$ F, $q$ F makes both F.

Answer: Inconsistent but not contradictory

Worked example: Consistent

Are $p \lor q$, $\neg p$ and $q \to r$ consistent?
  1. Try $p$ F, $q$ T, $r$ T.
  2. $p \lor q$ is T, $\neg p$ is T, $q \to r$ is T.

Answer: Consistent: that row makes all three true.

Common mistake

Calling any two statements that "disagree" contradictory. "The box is all red" and "the box is all blue" cannot both be true, but both are false if the box is green. They are inconsistent, not contradictory. Contradictories must split every row: one T, the other F.

Worked example: Three statements

Are $p \to q$, $p$ and $\neg q$ consistent?
  1. For all three to be T we need $p$ T and $q$ F.
  2. Then $p \to q$ is T → F, which is F.
  3. No row makes all three T.

Answer: Inconsistent. (Notice that no two of them clash on their own; the problem only shows up with all three.)

Consistency and validity are linked. An argument is valid exactly when its premises together with the negation of its conclusion are inconsistent: no row makes the premises true and the conclusion false. So a consistency check is another way to test an argument.

Why care? A set of claims that is inconsistent cannot all be true, so if someone asserts all of them, at least one claim must go. That makes consistency a first test for any story, plan or set of beliefs, before anyone checks the facts.

Deciding with a joint truth table.
Both true in some row?Opposite in every row?Name
yesnoconsistent
noyescontradictory
nonoinconsistent but not contradictory

Practice

Pass with 3 right answers, the last 2 in a row. Each right answer earns 2 XP.

Loading practice…

Builds on

Leads to

This is one of the top rungs of Symbolic Logic.

Sources and further reading

  • Patrick J. Hurley and Lori Watson, A Concise Introduction to Logic, 13th ed., section 6.3, comparing statements
  • forall x: Calgary, an open introduction to formal logic (P. D. Magnus, Tim Button and others; Open Logic Project), chapter on semantic concepts
@teddyrookbook GitHub