Degrees bounding principles and universal instances in reverse mathematics
Annals of Pure and Applied Logic 166 (11):1165-1185 (2015)
Abstract
This article has no associated abstract. (fix it)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
The Dirac delta function in two settings of Reverse Mathematics.Sam Sanders & Keita Yokoyama - 2012 - Archive for Mathematical Logic 51 (1-2):99-121.
Reverse-engineering Reverse Mathematics.Sam Sanders - 2013 - Annals of Pure and Applied Logic 164 (5):528-541.
Mass problems and measure-theoretic regularity.Stephen G. Simpson - 2009 - Bulletin of Symbolic Logic 15 (4):385-409.
Comparing DNR and WWKL.Klaus Ambos-Spies, Bjørn Kjos-Hanssen, Steffen Lempp & Theodore A. Slaman - 2004 - Journal of Symbolic Logic 69 (4):1089-1104.
Sequences of real functions on [0, 1] in constructive reverse mathematics.Hannes Diener & Iris Loeb - 2009 - Annals of Pure and Applied Logic 157 (1):50-61.
On the Indecomposability of $\omega^{n}$.Jared R. Corduan & François G. Dorais - 2012 - Notre Dame Journal of Formal Logic 53 (3):373-395.
A characterization of the 0 -basis homogeneous bounding degrees.Karen Lange - 2010 - Journal of Symbolic Logic 75 (3):971-995.
Questioning Constructive Reverse Mathematics.I. Loeb - 2012 - Constructivist Foundations 7 (2):131-140.
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.
Open questions in reverse mathematics.Antonio Montalbán - 2011 - Bulletin of Symbolic Logic 17 (3):431-454.
Reverse Mathematics and Grundy colorings of graphs.James H. Schmerl - 2010 - Mathematical Logic Quarterly 56 (5):541-548.
Reverse mathematics: the playground of logic.Richard A. Shore - 2010 - Bulletin of Symbolic Logic 16 (3):378-402.
Bounding computably enumerable degrees in the Ershov hierarchy.Angsheng Li, Guohua Wu & Yue Yang - 2006 - Annals of Pure and Applied Logic 141 (1):79-88.
Nonstandard arithmetic and reverse mathematics.H. Jerome Keisler - 2006 - Bulletin of Symbolic Logic 12 (1):100-125.
Analytics
Added to PP
2015-08-28
Downloads
11 (#845,670)
6 months
1 (#449,220)
2015-08-28
Downloads
11 (#845,670)
6 months
1 (#449,220)
Historical graph of downloads
Citations of this work
Dominating the Erdős–Moser theorem in reverse mathematics.Ludovic Patey - 2017 - Annals of Pure and Applied Logic 168 (6):1172-1209.
The reverse mathematics of the thin set and erdős–moser theorems.Lu Liu & Ludovic Patey - 2022 - Journal of Symbolic Logic 87 (1):313-346.
Open questions about Ramsey-type statements in reverse mathematics.Ludovic Patey - 2016 - Bulletin of Symbolic Logic 22 (2):151-169.
References found in this work
Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers.Piergiorgio Odifreddi - 1989 - Sole Distributors for the Usa and Canada, Elsevier Science Pub. Co..
Classes of Recursively Enumerable Sets and Degrees of Unsolvability.Donald A. Martin - 1966 - Mathematical Logic Quarterly 12 (1):295-310.
On the strength of Ramsey's theorem for pairs.Peter A. Cholak, Carl G. Jockusch & Theodore A. Slaman - 2001 - Journal of Symbolic Logic 66 (1):1-55.
Combinatorial principles weaker than Ramsey's Theorem for pairs.Denis R. Hirschfeldt & Richard A. Shore - 2007 - Journal of Symbolic Logic 72 (1):171-206.
A cohesive set which is not high.Carl Jockusch & Frank Stephan - 1993 - Mathematical Logic Quarterly 39 (1):515-530.
