Notre Dame Journal of Formal Logic

Nonstandard Models and Kripke's Proof of the Gödel Theorem

Hilary Putnam
Source: Notre Dame J. Formal Logic Volume 41, Number 1 (2000), 53-58.

Abstract

This lecture, given at Beijing University in 1984, presents a remarkable (previously unpublished) proof of the Gödel Incompleteness Theorem due to Kripke. Today we know purely algebraic techniques that can be used to give direct proofs of the existence of nonstandard models in a style with which ordinary mathematicians feel perfectly comfortable--techniques that do not even require knowledge of the Completeness Theorem or even require that logic itself be axiomatized. Kripke used these techniques to establish incompleteness by means that could, in principle, have been understood by nineteenth-century mathematicians. The proof exhibits a statement of number theory--one which is not at all "self referring"--and constructs two models, in one of which it is true and in the other of which it is false, thereby establishing "undecidability" (independence).

First Page: Show Hide
Primary Subjects: 03
Secondary Subjects: 03C62, 03H15
Links and Identifiers

Permanent link to this document: http://projecteuclid.org/euclid.ndjfl/1027953483
Digital Object Identifier: doi:10.1305/ndjfl/1027953483
Zentralblatt MATH identifier: 1005.03054
Mathematical Reviews number (MathSciNet): MR1915131


2013 © University of Notre Dame

Notre Dame Journal of Formal Logic

Notre Dame Journal of Formal Logic

Turn MathJax Off
What is MathJax?