David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Nature 400:319-320 (1999)
In a famous lecture in 1900, David Hilbert listed 23 difficult problems he felt deserved the attention of mathematicians in the coming century. His conviction of the solvability of every mathematical problem was a powerful incentive to future generations: ``Wir müssen wissen. Wir werden wissen.'' (We must know. We will know.) Some of these problems were solved quickly, others might never be completed, but all have influenced mathematics. Later, Hilbert highlighted the need to clarify the methods of mathematical reasoning, using a formal system of explicit assumptions, or axioms. Hilbert's vision was the culmination of 2,000 years of mathematics going back to Euclidean geometry. He stipulated that such a formal axiomatic system should be both `consistent' (free of contradictions) and `complete' (in that it represents all the truth). Hilbert also argued that any wellposed mathematical problem should be `decidable', in the sense that there exists a mechanical procedure, a computer program, for deciding whether something is true or not. Of course, the only problem with this inspiring project is that it turned out to be impossible.
|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
Cristian S. Calude & Gheorghe P.?un (2000). Computing with Cells and Atoms in a Nutshell. Complexity 6 (1):38-48.
Similar books and articles
Michael Stöltzner (2002). How Metaphysical is “Deepening the Foundations”?: Hahn and Frank on Hilbert’s Axiomatic Method. Vienna Circle Institute Yearbook 9:245-262.
Panu Raatikainen (2001). Exploring Randomness. Notices of the AMS 48 (9):992-6.
Richard Zach, Hilbert's Program. Stanford Encyclopedia of Philosophy.
R. A. V. Yehuda (1999). Why Do We Prove Theorems? Philosophia Mathematica 7 (1).
Y. Rav (1999). Why Do We Prove Theorems? Philosophia Mathematica 7 (1):5-41.
Philip Kitcher (1976). Hilbert's Epistemology. Philosophy of Science 43 (1):99-115.
José Ferreirós (2009). Hilbert, Logicism, and Mathematical Existence. Synthese 170 (1):33 - 70.
Yaroslav Sergeyev (2010). Counting Systems and the First Hilbert Problem. Nonlinear Analysis Series A 72 (3-4):1701-1708.
Carlo Cellucci (1993). From Closed to Open Systems. In J. Czermak (ed.), Philosophy of Mathematics, pp. 206-220. Hölder-Pichler-Tempsky.
Richard Zach (2006). Hilbert's Program Then and Now. In Dale Jacquette (ed.), Philosophy of Logic. North Holland. 5--411.
Added to index2010-12-22
Total downloads6 ( #217,582 of 1,140,057 )
Recent downloads (6 months)1 ( #157,514 of 1,140,057 )
How can I increase my downloads?