- 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
Transfinite recursion in higher reverse mathematics
Journal of Symbolic Logic 80 (3):940-969 (2015)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
What is effective transfinite recursion in reverse mathematics?Anton Freund - 2020 - Mathematical Logic Quarterly 66 (4):479-483.
Weak Well Orders and Fraïssé’s Conjecture.Anton Freund & Davide Manca - forthcoming - Journal of Symbolic Logic:1-16.
Nonstandard models in recursion theory and reverse mathematics.C. T. Chong, Wei Li & Yue Yang - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
Functionals defined by transfinite recursion.W. W. Tait - 1965 - Journal of Symbolic Logic 30 (2):155-174.
Functionals Defined by Transfinite Recursion.R. E. Vesley - 1966 - Journal of Symbolic Logic 31 (3):509.
A note on Quine's treatment of transfinite recursion.Charles Parsons - 1964 - Journal of Symbolic Logic 29 (4):179-182.
Autonomous Fixed Point Progressions and Fixed Point Transfinite Recursion.Thomas Strahm - 2001 - Bulletin of Symbolic Logic 7 (4):535-536.
On idempotent ultrafilters in higher-order reverse mathematics.Alexander P. Kreuzer - 2015 - Journal of Symbolic Logic 80 (1):179-193.
Analytics
Added to PP
2016-06-30
Downloads
45 (#493,054)
6 months
8 (#583,676)
2016-06-30
Downloads
45 (#493,054)
6 months
8 (#583,676)
Historical graph of downloads
Citations of this work
Elementary inductive dichotomy: Separation of open and clopen determinacies with infinite alternatives.Kentaro Sato - 2020 - Annals of Pure and Applied Logic 171 (3):102754.
The strength of compactness in Computability Theory and Nonstandard Analysis.Dag Normann & Sam Sanders - 2019 - Annals of Pure and Applied Logic 170 (11):102710.
Determinacy in third order arithmetic.Sherwood Hachtman - 2017 - Annals of Pure and Applied Logic 168 (11):2008-2021.
Determinacy separations for class games.Sherwood Hachtman - 2019 - Archive for Mathematical Logic 58 (5-6):635-648.
References found in this work
Uniform versions of some axioms of second order arithmetic.Nobuyuki Sakamoto & Takeshi Yamazaki - 2004 - Mathematical Logic Quarterly 50 (6):587-593.
On the Π1 1 -separation principle.Antonio Montalbán - 2008 - Mathematical Logic Quarterly 54 (6):563-578.
Non-principal ultrafilters, program extraction and higher-order reverse mathematics.Alexander P. Kreuzer - 2012 - Journal of Mathematical Logic 12 (1):1250002-.
Set existence axioms for general (not necessarily countable) stability theory.Victor Harnik - 1987 - Annals of Pure and Applied Logic 34 (3):231-243.
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-q5wnn uwo