Proof-theoretic reduction as a philosopher's tool

Erkenntnis 53 (1-2):127-146 (2000)

Authors
Thomas Hofweber
University of North Carolina, Chapel Hill
Abstract
Hilbert’s program in the philosophy of mathematics comes in two parts. One part is a technical part. To carry out this part of the program one has to prove a certain technical result. The other part of the program is a philosophical part. It is concerned with philosophical questions that are the real aim of the program. To carry out this part one, basically, has to show why the technical part answers the philosophical questions one wanted to have answered. Hilbert probably thought that he had completed the philosophical part of his program, maybe up to a few details. What was left to do was the technical part. To carry it out one, roughly, had to give a precise axiomatization of mathematics and show that it is consistent on purely finitistic grounds. This would come down to giving a relative consistency proof of mathematics in finitist mathematics, or to give a proof-theoretic reduction of mathematics on to finitist mathematics (we will look at these notions in more detail soon). It is widely believed that Gödel’s theorems showed that the technical part of Hilbert’s program could not be carried out. Gödel’s theorems show that the consistency of arithmetic can not even be proven in arithmetic, not to speak of by finitistic means alone. So, the technical part of Hilbert’s program is hopeless, and since Hilbert’s program essentially relied on both the technical and the philosophical part, Hilbert’s program as a whole is hopeless. Justified as this attitude is, it is a bit unfortunate. It is unfortunate because it takes away too much attention from the philosophical part of Hilbert’s program. And this is unfortunate for two reasons.
Keywords Philosophy   Philosophy   Epistemology   Ethics   Logic   Ontology
Categories (categorize this paper)
Reprint years 2004
DOI 10.1023/A:1005670319780
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 43,836
Through your library

References found in this work BETA

Number Determiners, Numbers, and Arithmetic.Thomas Hofweber - 2005 - Philosophical Review 114 (2):179-225.
A Platonist Epistemology.Mark Balaguer - 1995 - Synthese 103 (3):303 - 325.
Arithmetization of Metamathematics in a General Setting.S. Feferman - 1966 - Journal of Symbolic Logic 31 (2):269-270.

View all 10 references / Add more references

Citations of this work BETA

Number Determiners, Numbers, and Arithmetic.Thomas Hofweber - 2005 - Philosophical Review 114 (2):179-225.
Hilbert's Program Then and Now.Richard Zach - 2007 - In Dale Jacquette (ed.), Philosophy of Logic. Amsterdam: North Holland. pp. 411–447.

Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
85 ( #95,819 of 2,266,097 )

Recent downloads (6 months)
3 ( #444,549 of 2,266,097 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature