- 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
A well-ordering proof for Feferman's theoryT 0
Archive for Mathematical Logic 23 (1):65-77 (1983)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Quantifier elimination for infinite terms.G. Marongiu & S. Tulipani - 1991 - Archive for Mathematical Logic 31 (1):1-17.
Universes in explicit mathematics.Gerhard Jäger, Reinhard Kahle & Thomas Studer - 2001 - Annals of Pure and Applied Logic 109 (3):141-162.
Choice principles, the bar rule and autonomously iterated comprehension schemes in analysis.S. Feferman & G. Jäger - 1983 - Journal of Symbolic Logic 48 (1):63-70.
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.
On the proof theory of type two functionals based on primitive recursive operations.David Steiner & Thomas Strahm - 2006 - Mathematical Logic Quarterly 52 (3):237-252.
Proof-theoretic strengths of the well-ordering principles.Toshiyasu Arai - 2020 - Archive for Mathematical Logic 59 (3-4):257-275.
Predicativity and Feferman.Laura Crosilla - 2017 - In Gerhard Jäger & Wilfried Sieg (eds.), Feferman on Foundations: Logic, Mathematics, Philosophy. Cham: Springer. pp. 423-447.
Collapsing functions based on recursively large ordinals: A well-ordering proof for KPM. [REVIEW]Michael Rathjen - 1994 - Archive for Mathematical Logic 33 (1):35-55.
Well-ordering proofs for Martin-Löf type theory.Anton Setzer - 1998 - Annals of Pure and Applied Logic 92 (2):113-159.
Variation on a theme of Schutte.D. Probst & G. Jager - 2004 - Mathematical Logic Quarterly 50 (3):258.
On power set in explicit mathematics.Thomas Glass - 1996 - Journal of Symbolic Logic 61 (2):468-489.
On Feferman’s operational set theory OST.Gerhard Jäger - 2007 - Annals of Pure and Applied Logic 150 (1-3):19-39.
Analytics
Added to PP
2020-12-03
Downloads
8 (#1,322,828)
6 months
6 (#530,265)
2020-12-03
Downloads
8 (#1,322,828)
6 months
6 (#530,265)
Historical graph of downloads
Citations of this work
Hilbert's program relativized: Proof-theoretical and foundational reductions.Solomon Feferman - 1988 - Journal of Symbolic Logic 53 (2):364-384.
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.
Recent Advances in Ordinal Analysis: Π 1 2 — CA and Related Systems.Michael Rathjen - 1995 - Bulletin of Symbolic Logic 1 (4):468-485.
Recent advances in ordinal analysis: Π 21-CA and related systems.Michael Rathjen - 1995 - Bulletin of Symbolic Logic 1 (4):468 - 485.
Upper Bounds for metapredicative mahlo in explicit mathematics and admissible set theory.Gerhard Jäger & Thomas Strahm - 2001 - Journal of Symbolic Logic 66 (2):935-958.
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-5ff6c685cb-cc9fg uwo