Partial realizations of Hilbert's program

Journal of Symbolic Logic 53 (2):349-363 (1988)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2274508

Other Versions

No versions found

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Hilbert's program: incompleteness theorems vs. partial realizations.Roman Murawski - 1994 - In Jan Wolenski, Philosophical Logic in Poland. Kluwer Academic Publishers. pp. 103--127.
Harvey M. Friedman, Stephen G. Simpson, and Rick L. Smith. Countable algebra and set existence axioms. Annals of pure and applied logic, vol. 25, pp. 141–181. - Harvey M. Friedman, Stephen G. Simpson, and Rick L. Smith. Addendum to “Countable algebra and set existence axioms.” Annals of pure and applied logic, vol. 28, pp. 319–320. [REVIEW]Peter G. Clote - 1987 - Journal of Symbolic Logic 52 (1):276-278.
Stephen G. Simpson. Subsystems of second order arithmetic. Perspectives in mathematical logic. Springer, Berlin, Heidelberg, New York, etc., 1999, xiv + 445 pp.Peter Cholak - 1999 - Journal of Symbolic Logic 64 (3):1356-1357.
Stephen G. Simpson. Friedman's research on subsystems of second order arithmetic. Harvey Friedman's research on the foundations of mathematics, edited by L. A. Harrington, M. D. Morley, A. S̆c̆edrov, and S. G. Simpson, Studies in logic and the foundations of mathematics, vol. 117, North-Holland, Amsterdam, New York, and Oxford, 1985, pp. 137–159.Wilfried Sieg - 1990 - Journal of Symbolic Logic 55 (2):870-874.
Stephen G. Simpson. Nonprovability of certain combinatorial properties of finite trees. Harvey Friedman's research on the foundations of mathematics, edited by L. A. Harrington, M. D. Morley, A. Ṧčedrov, and S. G. Simpson, Studies in logic and the foundations of mathematics, vol. 117, North-Holland, Amsterdam, New York, and Oxford, 1985, pp. 87–117., pp. 45–65.).Stephen G. Simpson - 1990 - Journal of Symbolic Logic 55 (2):868-869.
Kurt Gödel. Essays for his centennial, edited by Solomon Feferman, Charles Parsons, and Stephen G. Simpson, Cambridge University Press, Cambridge and others, 2010, x + 373 pp. [REVIEW]Matthias Wille - 2011 - Bulletin of Symbolic Logic 17 (1):125-126.
A symposium on Hilbert's program.Wilfrid Hodges & Wilfried Sieg - 1988 - Journal of Symbolic Logic 53 (2):337.
The autonomy of mathematical knowledge: Hilbert's program revisited.Curtis Franks - 2011 - Bulletin of Symbolic Logic 17 (1):119-122.
Hilbert's program relativized: Proof-theoretical and foundational reductions.Solomon Feferman - 1988 - Journal of Symbolic Logic 53 (2):364-384.
Kneebone G. T.. Mathematical formalisms and their realizations. Philosophy, vol. 27, pp. 138–147.G. T. Kneebone - 1953 - Journal of Symbolic Logic 18 (3):270-270.

Analytics

Added to PP
2009-01-28

Downloads
444 (#114,618)

6 months
52 (#166,296)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Why Do We Prove Theorems?Yehuda Rav - 1999 - Philosophia Mathematica 7 (1):5-41.
On the Depth of Gödel’s Incompleteness Theorems.Yong Cheng - 2022 - Philosophia Mathematica 30 (2):173–199.

View all 66 citations / Add more citations

References found in this work

Finitism.W. W. Tait - 1981 - Journal of Philosophy 78 (9):524-546.
Mathematics, the Loss of Certainty.Morris Kline - 1981 - Critica 13 (39):87-91.
On the Infinite.David Hilbert - 1926 - Mathematische Annalen 95:161-190.

View all 11 references / Add more references