David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Ezio Di Nucci
Jack Alan Reynolds
Learn more about PhilPapers
British Journal for the Philosophy of Science 4 (14):107-129 (1953)
IN Hilbert's theory of the foundations of any given branch of mathematics the main problem is to establish the consistency (of a suitable formalisation) of this branch. Since the (intuitionist) criticisms of classical logic, which Hilbert's theory was intended to meet, never even alluded to inconsistencies (in classical arithmetic), and since the investigations of Hilbert's school have always established much more than mere consistency, it is natural to formulate another general problem in the foundations of mathematics: to translate statements of theorems and proofs in the branch considered into those of some preferred system, where the translation must satisfy certain appropriate conditions (interpretation). The problem is relative to the choice of preferred system, as is Hilbert's consistency problem since he required the consistency to be established by particular methods (finitist ones). A finitist interpretation of classical number theory, which has been published in full detail elsewhere, is here described by means of typical examples. Partial results on analysis (theory of arbitrary functions whose arguments and values are the non-negative integers) are here presented for the first time. One of these results is restricted to functions whose values are bounded; its interest derives from the fact that real numbers may be represented by such functions. It is hoped that diverse general observations and comments, which would bore the specialist, may be of help to the general reader. The specialist may find some points of interest in the last two sections of the main text and in the notes following it
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
Toshiyasu Arai (1998). Some Results on Cut-Elimination, Provable Well-Orderings, Induction and Reflection. Annals of Pure and Applied Logic 95 (1-3):93-184.
M. Hofmann, J. Van Oosten & T. Streicher (2006). Well-Foundedness in Realizability. Archive for Mathematical Logic 45 (7):795-805.
Harvey M. Friedman & Andre Scedrov (1986). Intuitionistically Provable Recursive Well-Orderings. Annals of Pure and Applied Logic 30 (2):165-171.
Yvon Gauthier (1971). Logique mathématique et philosophie des mathématiques. Dialogue 10 (2):243-275.
Similar books and articles
Kai F. Wehmeier (1997). Aspekte der frege–hilbert-korrespondenz. History and Philosophy of Logic 18 (4):201-209.
Richard Zach, Hilbert's Program. Stanford Encyclopedia of Philosophy.
Richard Zach (2003). The Practice of Finitism: Epsilon Calculus and Consistency Proofs in Hilbert's Program. Synthese 137 (1-2):211 - 259.
Enrico Moriconi (2003). On the Meaning of Hilbert's Consistency Problem (Paris, 1900). Synthese 137 (1-2):129 - 139.
José Ferreirós (2009). Hilbert, Logicism, and Mathematical Existence. Synthese 170 (1):33 - 70.
Yvon Gauthier (1994). Hilbert and the Internal Logic of Mathematics. Synthese 101 (1):1 - 14.
Richard Zach (2004). Hilbert's 'Verunglückter Beweis', the First Epsilon Theorem, and Consistency Proofs. History and Philosophy of Logic 25 (2):79-94.
Richard Zach (2006). Hilbert's Program Then and Now. In Dale Jacquette (ed.), Philosophy of Logic. North Holland 5--411.
Thomas Hofweber (2000). Proof-Theoretic Reduction as a Philosopher's Tool. Erkenntnis 53 (1-2):127-146.
Added to index2009-01-28
Total downloads36 ( #107,337 of 1,789,834 )
Recent downloads (6 months)12 ( #68,715 of 1,789,834 )
How can I increase my downloads?