Skip to content

Mathematics and Statistics · Ch 1 — Mathematical Logic

Truth Tables of Compound Statements

2

Truth Tables of Compound Statements

The truth value of a compound statement is fixed entirely by the truth values of its simple parts and the connectives joining them. A truth table lists, row by row, every possible combination of truth values of the simple statements together with the resulting truth value of the compound statement. If a compound statement involves nn distinct simple statements, its truth table has 2n2^n rows — 22 rows for one statement, 44 for two, 88 for three, and so on.

The five basic tables. Every larger table is built from these.

Negation ∼p\sim p:

pp∼p\sim p
TF
FT

Conjunction p∧qp \wedge q — true only when both are true:

ppqqp∧qp \wedge q
TTT
TFF
FTF
FFF

Disjunction p∨qp \vee q — false only when both are false:

ppqqp∨qp \vee q
TTT
TFT
FTT
FFF

Conditional p→qp \rightarrow q — false only when the antecedent is true and the consequent false:

ppqqp→qp \rightarrow q
TTT
TFF
FTT
FFT

The two rows where pp is false may look surprising: when the hypothesis is false, the conditional is counted true by convention ("vacuously true") — a promise "if it rains, I will carry an umbrella" is not broken on a day it does not rain.

Biconditional p↔qp \leftrightarrow q — true exactly when both parts have the same truth value:

ppqqp↔qp \leftrightarrow q
TTT
TFF
FTF
FFT
Definition 1Truth table

A table listing every possible combination of truth values of the simple statements in a compound statement, with the resulting truth value of the compo …

Definition 2Number of rows

A compound statement built from n distinct simple statements has a truth table with 2^n rows, one for each combination of T/F valu …