David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Ezio Di Nucci
Jack Alan Reynolds
Learn more about PhilPapers
Philosophia Mathematica 19 (3):255-280 (2011)
How do we prove true but unprovable propositions? Gödel produced a statement whose undecidability derives from its ad hoc construction. Concrete or mathematical incompleteness results are interesting unprovable statements of formal arithmetic. We point out where exactly the unprovability lies in the ordinary ‘mathematical’ proofs of two interesting formally unprovable propositions, the Kruskal-Friedman theorem on trees and Girard's normalization theorem in type theory. Their validity is based on robust cognitive performances, which ground mathematics in our relation to space and time, such as symmetries and order, or on the generality of Herbrand's notion of ‘prototype proof’
|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
No citations found.
Similar books and articles
Panu Raatikainen (2005). On the Philosophical Relevance of Gödel's Incompleteness Theorems. Revue Internationale de Philosophie 59 (4):513-534.
Philip Hugly & Charles Sayward (1989). Can There Be a Proof That an Unprovable Sentence of Arithmetic is True? Dialectica 43 (43):289-292.
Peter Milne (2007). On Gödel Sentences and What They Say. Philosophia Mathematica 15 (2):193-226.
John R. Lucas (1961). Minds, Machines and Godel. Philosophy 36 (April-July):112-127.
Peter Smith (2013). An Introduction to Gödel's Theorems. Cambridge University Press.
Raymond M. Smullyan (1992). Gödel's Incompleteness Theorems. Oxford University Press.
Laureano Luna & Alex Blum (2008). Arithmetic and Logic Incompleteness: The Link. The Reasoner 2 (3):6.
Raymond M. Smullyan (1993). Recursion Theory for Metamathematics. Oxford University Press.
Added to index2011-07-12
Total downloads55 ( #77,715 of 1,907,057 )
Recent downloads (6 months)1 ( #468,221 of 1,907,057 )
How can I increase my downloads?