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
Why it works
Worked examples
Worked example: Contradictory
- Column for $p \to q$: T, F, T, T.
- Column for $p \land \neg q$: F, T, F, F.
- They are opposite in every row.
Answer: Contradictory
Worked example: Inconsistent, not contradictory
- No row makes both T: one needs $p$ T, the other $p$ F.
- The row $p$ F, $q$ F makes both F.
Answer: Inconsistent but not contradictory
Worked example: Consistent
- Try $p$ F, $q$ T, $r$ T.
- $p \lor q$ is T, $\neg p$ is T, $q \to r$ is T.
Answer: Consistent: that row makes all three true.
Common mistake
Worked example: Three statements
- For all three to be T we need $p$ T and $q$ F.
- Then $p \to q$ is T → F, which is F.
- 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.
| Both true in some row? | Opposite in every row? | Name |
|---|---|---|
| yes | no | consistent |
| no | yes | contradictory |
| no | no | inconsistent but not contradictory |