- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
What rests on what? The proof-theoretic analysis of mathematics
In J. Czermak (ed.), Philosophy of Mathematics. Hölder-Pichler-Tempsky. pp. 1--147 (1993)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
S. Feferman and W. Sieg Inductive definitions and subsystems of analysis. Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies, by Wilfried Buchholz, Solomon Feferman, Wolfram Pohlers, and Wilfried Sieg. Lecture notes in mathematics, vol. 897, Springer-Verlag, Berlin, Heidelberg, and New York, 1981, pp. 16–77. - Solomon Feferman and Wilfried Sieg. Proof theoretic equivalences between classical and constructive theories for analysis. Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies, by Wilfried Buchholz, Solomon Feferman, Wolfram Pohlers, and Wilfried Sieg. Lecture notes in mathematics, vol. 897, Springer-Verlag, Berlin, Heidelberg, and New York, 1981, pp. 78–142. - Solomon Feferman. Iterated inductive fixed-point theories: application to Hancock's conjecture. Patras logic symposion, Proceedings of the logic symposion held at Patras, Greece, August 18–22, 1980, edited by George Metakides, Studies in logic. [REVIEW]Helmut Pfeiffer - 1994 - Journal of Symbolic Logic 59 (2):668-670.
Reflections on the Foundations of Mathematics: Essays in Honor of Solomon Feferman.Wilfried Sieg, Richard Sommer & Carolyn Talcott - 2017 - Cambridge University Press.
Feferman on Foundations: Logic, Mathematics, Philosophy.Gerhard Jäger & Wilfried Sieg (eds.) - 2017 - Cham: Springer.
Jeremy Avigad and Solomon Feferman. Gödel's functional (“Dialectica”) interpretation. Handbook of proof theory, edited by Samuel R. Buss, Studies in logic and the foundations of mathematics, vol. 137, Elsevier, Amsterdam etc. 1998, pp. 337–405. [REVIEW]Toshiyasu Arai - 2000 - Bulletin of Symbolic Logic 6 (4):469-470.
Proof Theory of Constructive Systems: Inductive Types and Univalence.Michael Rathjen - 2017 - In Gerhard Jäger & Wilfried Sieg (eds.), Feferman on Foundations: Logic, Mathematics, Philosophy. Cham: Springer.
Solomon Feferman. Foundational ways. Perspectives in mathematics, Anniversary of Oberwolfach 1984, edited by W. Jäger, J. Moser, and R. Remmert, Birkhäuser Verlag, Basel, Boston, and Stuttgart, 1984, pp. 147–158. - Solomon Fefeŕman. Working foundations. Synthese, vol. 62 , pp. 229–254. [REVIEW]Maria Luisa Dalla Chiara - 1992 - Journal of Symbolic Logic 57 (4):1478-1479.
What Wifl Count as Mathematics in 2100?Stanford Csli - 2008 - In Bonnie Gold & Roger A. Simons (eds.), Proof and Other Dilemmas: Mathematics and Philosophy. Mathematical Association of America. pp. 291.
Systems of explicit mathematics with non-constructive μ-operator. Part I.Solomon Feferman & Gerhard Jäger - 1993 - Annals of Pure and Applied Logic 65 (3):243-263.
What is mathematics? A pedagogical answer to a philosophical question.Guershon Harel - 2008 - In Bonnie Gold & Roger A. Simons (eds.), Proof and Other Dilemmas: Mathematics and Philosophy. Mathematical Association of America. pp. 265--290.
Theories of Proof-Theoretic Strength Ψ.Thomas Strahm, Gerhard Jäger & Ulrik Buchholtz - 2016 - In Peter Schuster & Dieter Probst (eds.), Concepts of Proof in Mathematics, Philosophy, and Computer Science. Boston: De Gruyter. pp. 115-140.
Analytics
Added to PP
2009-01-28
Downloads
89 (#235,836)
6 months
8 (#583,676)
2009-01-28
Downloads
89 (#235,836)
6 months
8 (#583,676)
Historical graph of downloads
Citations of this work
Hilbert’s Program.Richard Zach - 2012 - In Ed Zalta (ed.), Stanford Encyclopedia of Philosophy. Stanford, CA: Stanford Encyclopedia of Philosophy.
Arithmetical Reflection and the Provability of Soundness.Walter Dean - 2015 - Philosophia Mathematica 23 (1):31-64.
Why a Little Bit Goes a Long Way: Logical Foundations of Scientifically Applicable Mathematics.Solomon Feferman - 1992 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1992:442 - 455.
Predicativity and Feferman.Laura Crosilla - 2017 - In Gerhard Jäger & Wilfried Sieg (eds.), Feferman on Foundations: Logic, Mathematics, Philosophy. Cham: Springer. pp. 423-447.
References found in this work
Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes.Kurt Gödel - 1958 - Dialectica 12 (3):280.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-559df78dcc-ppxv8 uwo