Gödel’s Proof Based on ω-Consistency

Abstract

The proof that we have just given of the incompleteness of Peano Arithmetic was based on the underlying assumption that Peano Arithmetic is correct—i.e., that every sentence provable in P.A. is a true sentence. Gödel’s original incompleteness proof involved a much weaker assumption—that of ω-consistency to which we now turn. We consider an arbitrary axiom system S whose formulas are those of Peano Arithmetic, whose axioms include all those of Groups I and II (or alternatively, any set of axioms for first-order logic with identity such that all logically valid formulas are provable from them), and whose inference rules are modus ponens and generalization. (It is also possible to axiomatize first-order logic in such a way that modus ponens is the only inference rule—cf. Quine [1940].) In place of the axioms of Groups III and IV, however, we can take a completely arbitrary set of axioms. Such a system S is an example of what is termed a first-order theory, and we will consider several such theories other than Peano Arithmetic. (For the more general notion of a first-order theory, the key difference is that we do not necessarily start with + and × as the undefined function symbols, nor do we necessarily take ≤ as the undefined predicate symbol. Arbitrary function symbols and predicate symbols can be taken, however, as the undefined function and predicate symbols—cf. Tarski [1953] for details. However, the only theories (or “systems”, as we will call them) that we will have occasion to consider are those whose formulas are those of P.A.) S is called simply consistent (or just “consistent” for short) if no sentence is both provable and refutable in S.