Symbolic LogicTruth Tables

Validity by Truth Table

An argument is valid when no row makes every premise true and the conclusion false.

Not started Jump to practice

In Validity you learned that an argument is valid when it is impossible for the premises to be true and the conclusion false. Truth tables turn "impossible" into something you can check: every possible situation is a row.

Key idea

An argument is valid when no row of its truth table makes every premise true and the conclusion false. A row that does is a counterexample, and one counterexample makes the argument invalid.

Why it works

Each row is one way the world could be, as far as the letters go. "Impossible to have true premises and a false conclusion" means "no row has true premises and a false conclusion". So we write a column for each premise and for the conclusion, and look only at the rows where every premise is true. If the conclusion is true in all of those, the argument is valid.
Affirming the consequent: the red row has both premises true and the conclusion false.

Worked examples

Worked example: A valid form

Premises $p \lor q$, $\neg p$. Conclusion $q$. Valid?
  1. Rows with both premises T: $\neg p$ needs $p$ F; then $p \lor q$ needs $q$ T.
  2. That is the row $p$ F, $q$ T, where the conclusion $q$ is T.
  3. No counterexample.

Answer: Valid

Worked example: An invalid form

Premises $p \to q$, $q$. Conclusion $p$. Valid?
  1. Rows with both premises T: $p$ T, $q$ T; and $p$ F, $q$ T.
  2. In the second, the conclusion $p$ is F.

Answer: Invalid; the counterexample is $p$ F, $q$ T.

Worked example: Three letters

Premises $p \to q$, $q \to r$. Conclusion $p \to r$. Valid?
  1. A counterexample needs $p \to r$ F: $p$ T, $r$ F.
  2. Then $p \to q$ needs $q$ T, but $q \to r$ needs $q$ F.
  3. No row works.

Answer: Valid

Common mistake

Looking for a row where everything is true and calling the argument valid, or calling it invalid because some row has a false premise. Rows with a false premise say nothing either way. Only rows where all the premises are true matter, and in those the conclusion must be true.

Remember from Validity and Truth Together that validity is not truth. A valid argument can have a false conclusion when a premise is false, and an invalid argument can have all true statements. The truth table looks at every row, the actual one and all the others, which is exactly why it tests form and not facts.

The table also tells you more than yes or no. When an argument is invalid, the counterexample row describes a concrete situation that breaks it, which is often the most convincing way to show someone the reasoning fails.

  • Make a column for each premise and the conclusion.
  • Mark the rows where every premise is T.
  • If the conclusion is T in all of them: valid. If not: invalid, and that row is a counterexample.

Practice

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

Loading practice…

Builds on

Leads to

Sources and further reading

  • Patrick J. Hurley and Lori Watson, A Concise Introduction to Logic, 13th ed., section 6.4, Truth Tables for Arguments
  • forall x: Calgary, an open introduction to formal logic (P. D. Magnus, Tim Button and others; Open Logic Project), chapter on truth tables and validity
@teddyrookbook GitHub