Journal of Symbolic Logic 85 (3):1006-1043 (2020)
Abstract |
There are close similarities between the Weihrauch lattice and the zoo of axiom systems in reverse mathematics. Following these similarities has often allowed researchers to translate results from one setting to the other. However, amongst the big five axiom systems from reverse mathematics, so far $\mathrm {ATR}_0$ has no identified counterpart in the Weihrauch degrees. We explore and evaluate several candidates, and conclude that the situation is complicated.
|
Keywords | No keywords specified (fix it) |
Categories | (categorize this paper) |
DOI | 10.1017/jsl.2020.12 |
Options |
![]() ![]() ![]() ![]() |
Download options
References found in this work BETA
Effective Choice and Boundedness Principles in Computable Analysis.Vasco Brattka & Guido Gherardi - 2011 - Bulletin of Symbolic Logic 17 (1):73-117.
Embeddings Between Well-Orderings: Computability-Theoretic Reductions.Jun Le Goh - 2020 - Annals of Pure and Applied Logic 171 (6):102789.
The Bolzano–Weierstrass Theorem is the Jump of Weak Kőnig’s Lemma.Vasco Brattka, Guido Gherardi & Alberto Marcone - 2012 - Annals of Pure and Applied Logic 163 (6):623-655.
Effective Borel Measurability and Reducibility of Functions.Vasco Brattka - 2005 - Mathematical Logic Quarterly 51 (1):19-44.
View all 11 references / Add more references
Citations of this work BETA
A Comparison of Various Analytic Choice Principles.Paul-Elliot Anglès D’Auriac & Takayuki Kihara - 2021 - Journal of Symbolic Logic 86 (4):1452-1485.
The Computational Strength of Matchings in Countable Graphs.Stephen Flood, Matthew Jura, Oscar Levin & Tyler Markkanen - 2022 - Annals of Pure and Applied Logic 173 (8):103133.
Finding Descending Sequences Through Ill-Founded Linear Orders.Jun le Goh, Arno Pauly & Manlio Valenti - 2021 - Journal of Symbolic Logic 86 (2):817-854.
Similar books and articles
Weihrauch Degrees, Omniscience Principles and Weak Computability.Vasco Brattka & Guido Gherardi - 2011 - Journal of Symbolic Logic 76 (1):143 - 176.
On the Uniform Computational Content of the Baire Category Theorem.Vasco Brattka, Matthew Hendtlass & Alexander P. Kreuzer - 2018 - Notre Dame Journal of Formal Logic 59 (4):605-636.
Borel Quasi-Orderings in Subsystems of Second-Order Arithmetic.Alberto Marcone - 1991 - Annals of Pure and Applied Logic 54 (3):265-291.
On the Uniform Computational Content of Ramsey’s Theorem.Vasco Brattka & Tahina Rakotoniaina - 2017 - Journal of Symbolic Logic 82 (4):1278-1316.
Derived Sequences and Reverse Mathematics.Jeffry L. Hirst - 1993 - Mathematical Logic Quarterly 39 (1):447-453.
Reverse Mathematics and Homeomorphic Embeddings.Harvey M. Friedman & Jeffry L. Hirst - 1991 - Annals of Pure and Applied Logic 54 (3):229-253.
A Characterization of a Semimodular Lattice.Peng He & Xue-Ping Wang - 2018 - Studia Logica 106 (4):691-698.
Some Remarks on the Algebraic Structure of the Medvedev Lattice.Andrea Sorbi - 1990 - Journal of Symbolic Logic 55 (2):831-853.
Reverse Mathematics and Ordinal Exponentiation.Jeffry L. Hirst - 1994 - Annals of Pure and Applied Logic 66 (1):1-18.
Lattice Representations for Computability Theory.Peter A. Fejer - 1998 - Annals of Pure and Applied Logic 94 (1-3):53-74.
A Lattice for the Language of Aristotle's Syllogistic and a Lattice for the Language of Vasiľév's Syllogistic.Andrew Schumann - 2006 - Logic and Logical Philosophy 15 (1):17-37.
On the Structure of the Medvedev Lattice.Sebastiaan A. Terwijn - 2008 - Journal of Symbolic Logic 73 (2):543 - 558.
Analytics
Added to PP index
2020-07-11
Total views
5 ( #1,202,720 of 2,504,866 )
Recent downloads (6 months)
1 ( #417,030 of 2,504,866 )
2020-07-11
Total views
5 ( #1,202,720 of 2,504,866 )
Recent downloads (6 months)
1 ( #417,030 of 2,504,866 )
How can I increase my downloads?
Downloads