Skip to main content Accessibility help

Partial realizations of Hilbert's program

  • Stephen G. Simpson (a1)


§0. Introduction. What follows is a write-up of my contribution to the symposium “Hilbert's Program Sixty Years Later” which was sponsored jointly by the American Philosophical Association and the Association for Symbolic Logic. The symposium was held on December 29,1985 in Washington, D. C. The panelists were Solomon Feferman, Dag Prawitz and myself. The moderator was Wilfried Sieg. The research which I discuss here was partially supported by NSF Grant DMS-8317874.

I am grateful to the organizers of this timely symposium on an important topic. As a mathematician I particularly value the opportunity to address an audience consisting largely of philosophers. It is true that I was asked to concentrate on the mathematical aspects of Hilbert's program. But since Hilbert's program is concerned solely with the foundations of mathematics, the restriction to mathematical aspects is really no restriction at all.

Hilbert assigned a special role to a certain restricted kind of mathematical reasoning known as finitistic. The essence of Hilbert's program was to justify all of set-theoretical mathematics by means of a reduction to finitism. It is now well known that this task cannot be carried out. Any such possibility is refuted by Gödel's theorem. Nevertheless, recent research has revealed the feasibility of a significant partial realization of Hilbert's program. Despite Gödel's theorem, one can give a finitistic reduction for a substantial portion of infinitistic mathematics including many of the best-known nonconstructive theorems. My purpose here is to call attention to these modern developments.



Hide All
[1]Bernays, P., Hilbert, David, Encyclopedia of Philosophy (Edwards, P., editor), Vol. 3, Macmillan and Free Press, New York, 1967, pp. 496504.
[2]Brown, D. K., Functional analysis in weak subsystems of second-order arithmetic, Ph.D. Thesis, Pennsylvania State University, University Park, Pa., 1987.
[3]Brown, D. K. and Simpson, S. G., Which set existence axioms are needed to prove the separable Hahn-Banach theorem?, Annals of Pure and Applied Logic, vol. 31 (1986), pp. 123144.
[4]Corcoran, J., Review of [17], Mathematical Reviews 82c:03013.
[5]Feferman, S., Systems of predicative analysis. I, II, this Journal, vol. 29 (1964), pp. 130; vol. 33 (1968), pp. 193–220.
[6]Friedman, H., Systems of second order arithmetic with restricted induction. I, II (abstracts), this Journal, vol. 41 (1976), pp. 557559.
[7]Friedman, H., personal communication to L. Harrington, 1977.
[8]Friedman, H., Simpson, S. G. and Smith, R. L., Countable algebra and set existence axioms, Annals of Pure and Applied Logic, vol. 25 (1983), pp. 141181; addendum, vol. 28 (1985), pp. 319–320.
[9]Gödel, K., On formally undecidable propositions of Principia Mathematica and related systems. I, translated by van Heijenoort, J., [27], pp. 596616.
[10]Gödel, K., Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes, Dialectica, vol. 12 (1958), pp. 280287.
[11]Gödel, K., What is Cantor's continuum problem?, Philosophy of mathematics: selected readings, 2nd ed. (Benacerraf, P. and Putnam, H., editors), Cambridge University Press, Cambridge, 1983, pp. 470485.
[12]Harrington, L., personal communication to H. Friedman, 1977.
[13]Hilbert, D., On the infinite, translated by Bauer-Mengelberg, S., [27], pp. 367392.
[14]Hilbert, D., The foundations of mathematics, translated by Bauer-Mengelberg, S. and Føllesdal, D., [27], pp. 464479.
[15]Hilbert, D. and Bernays, P., Grundlagen der Mathematik. Vols. I, II, 2nd ed., Springer-Verlag, Berlin, 1968, 1970.
[16]Kitcher, P.. Hubert's epistemology, Philosophy of Science, vol. 43 (1976), pp. 99115.
[17]Kline, M., Mathematics: the loss of certainty, Oxford University Press, New York, 1980.
[18]Lear, J., Aristotelian infinity, Proceedings of the Aristotelian Society (New Series), vol. 80 (1980), pp. 187210.
[19]Parsons, C., On a number-theoretic choice schema and its relation to induction, Intuitionism and proof theory (Myhill, al., editors), North-Holland, Amsterdam, 1970, pp. 459473.
[20]Sieg, W., Fragments of arithmetic, Annals of Pure and Applied Logic, vol. 28 (1985), pp. 3371.
[21]Simpson, S. G., Which set existence axioms are needed to prove the Cauchy/Peano theorem for ordinary differential equations?, this Journal, vol. 49 (1984), pp. 783802.
[22]Simpson, S. G., Friedman's research on subsystems of second order arithmetic, Harvey Friedman's research in the foundations of mathematics (Harrington, al., editors), North-Holland, Amsterdam, 1985, pp. 137159.
[23]Simpson, S. G., Subsystems of Z2 and reverse mathematics, appendix to G. Takeuti, Proof theory, 2nd ed., North-Holland, Amsterdam, 1987, pp. 432446.
[24]Simpson, S. G., Subsystems of second order arithmetic (in preparation).
[25]Tait, W. W., Finitism, Journal of Philosophy, vol. 78 (1981), pp. 524546.
[26]Takeuti, G., Recent topics on proof theory (in Japanese), Journal of the Japan Association for Philosophy of Science, vol. 17 (1984), pp. 15.
[27]Van Heijenoort, J. (editor), From Frege to Godel: a source book in mathematical logic, 1879–1931, Harvard University Press, Cambridge, Mass., 1967.
[28]Wigner, E. P., The unreasonable effectiveness of mathematics in the natural sciences, Communications on Pure and Applied Mathematics, vol. 13 (1960), pp. 114.

Related content

Powered by UNSILO

Partial realizations of Hilbert's program

  • Stephen G. Simpson (a1)


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.