On the Limits of Decision is a short essay in formal logic rather than a full-length book. Its central topic is the logical “decision problem”: whether there is a mechanical procedure that, for any formula in a given logical system, will determine in a finite number of steps whether the formula is valid or satisfiable.
Quine begins with the propositional calculus, where truth tables provide such a procedure. Because the truth value of a truth-functional compound is determined by the truth values of its components, truth tables can decide validity for the whole truth-functional fragment. The essay then turns to the limits of that method once quantifiers and predicates are introduced. Full quantification theory has no general decision procedure, and Quine explains the significance of this negative result: the truth-functional part of logic is decidable, while the whole of first-order quantification is not. Restricted classes of quantified formulas may still be decidable, so the boundary between decidability and undecidability depends on the expressive resources of the fragment being considered.
The work is expository and conceptual. It clarifies what a decision procedure is, why truth tables settle the propositional case, and why no analogous general method can settle all of quantification theory. It is not about practical decision-making, ethics, or rational choice; “decision” is used in the technical logical sense of an effective method for settling validity or satisfiability.
The essay treats decidability as a property of a formal language or theory rather than of isolated formulas. A decision procedure must be uniform and effective: it must apply to every formula in the language and terminate with a yes-or-no answer. The absence of such a procedure for full quantification theory therefore does not imply that particular quantified formulas cannot be settled, nor that proof in quantification theory is unregulated. It means only that no single mechanical method can settle all cases.
This distinction also brings out an asymmetry between validity and satisfiability in first-order logic. Valid formulas can be positively recognized through a complete proof procedure, but the same procedure need not terminate with a negative verdict on invalid formulas. The essay’s significance lies in locating the limit of decision at the point where truth-functional surveyability gives way to quantificational expressive power: propositional logic is decidable because its semantics can be exhausted by finite truth tables, while quantification introduces interpretations and relational structures that outrun any finite survey. The “limits of decision” are thus presented as a structural consequence of expressive power, not as a practical obstacle or a defect in formal rigor.
