G ödel

In Reason's Nearest Kin: Philosophies of Arithmetic from Kant to Carnap. Oxford, GB: Oxford University Press. pp. 243-260 (2002)
  Copy   BIBTEX

Abstract

On September 7, 1930, Gödel announced at a conference that ‘one can give examples of propositions that, while contentually true, are unprovable in the formal system of classical mathematics’. On October 23, he cited both the incompleteness of the formal system of _Principia_ and the unprovability of the consistency of the system by methods formalizable within it. Gödel also went as far as to deny expressly that his theorems killed off Hilbert's programme. Three doubts were salient. First, Gödel's theorems apply only to theories that are formal, in the sense that ‘reasoning in them, in principle, can be completely replaced by mechanical devices’. Second, in order to demonstrate that the consistency of a formal system cannot be proved by methods formalizable in the system itself, it was necessary to appeal to certain features of the method of formalization: a consistency proof formalizable by methods not sharing these features therefore remained a possibility. Third, what Hilbert had demanded was a finitary proof of consistency Gödel's theorem does not rule out unless all finitary methods are formalizable in the system in question. Eventually, Gödel overcame his doubts on all three counts, but to understand why, his reservations must be investigated in detail.

Other Versions

No versions found

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The philosophical significance of Gödel's Dialectica interpretation.Stephen Mackereth - 2025 - Philosophy and Phenomenological Research 111 (2):423-450.
Hilbert’s Program.Richard Zach - 2012 - In Ed Zalta, Stanford Encyclopedia of Philosophy. Stanford, CA: Stanford Encyclopedia of Philosophy.
The Consistency of Arithmetic.Robert Meyer - 2021 - Australasian Journal of Logic 18 (5):289-379.
Gödel's Incompleteness Theorems.Panu Raatikainen - 2013 - The Stanford Encyclopedia of Philosophy (Winter 2013 Edition), Edward N. Zalta (Ed.).
Gödel on intuition and on Hilbert's finitism.W. W. Tait - 2010 - In Kurt Gödel, Solomon Feferman, Charles Parsons & Stephen G. Simpson, Kurt Gödel: essays for his centennial. Ithaca, NY: Association for Symbolic Logic.

Analytics

Added to PP
2026-01-22

Downloads
5 (#2,219,881)

6 months
5 (#1,638,424)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Michael Potter
Cambridge University

References found in this work

No references found.

Add more references