- The open and clopen Ramsey theorems in the Weihrauch lattice.Alberto Marcone & Manlio Valenti - 2021 - Journal of Symbolic Logic 86 (1):316-351.details
|
|
Inside the Muchnik degrees II: The degree structures induced by the arithmetical hierarchy of countably continuous functions.K. Higuchi & T. Kihara - 2014 - Annals of Pure and Applied Logic 165 (6):1201-1241.details
|
|
Computing links and accessing arcs.Timothy H. McNicholl - 2013 - Mathematical Logic Quarterly 59 (1-2):101-107.details
|
|
On the (semi)lattices induced by continuous reducibilities.Arno Pauly - 2010 - Mathematical Logic Quarterly 56 (5):488-502.details
|
|
Closed choice and a uniform low basis theorem.Vasco Brattka, Matthew de Brecht & Arno Pauly - 2012 - Annals of Pure and Applied Logic 163 (8):986-1008.details
|
|
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.details
|
|
(13 other versions)2007 European Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '07.Steffen Lempp - 2008 - Bulletin of Symbolic Logic 14 (1):123-159.details
|
|
Inside the Muchnik degrees I: Discontinuity, learnability and constructivism.K. Higuchi & T. Kihara - 2014 - Annals of Pure and Applied Logic 165 (5):1058-1114.details
|
|
Turing degrees in Polish spaces and decomposability of Borel functions.Vassilios Gregoriades, Takayuki Kihara & Keng Meng Ng - 2020 - Journal of Mathematical Logic 21 (1):2050021.details
|
|
Borel complexity and computability of the Hahn–Banach Theorem.Vasco Brattka - 2008 - Archive for Mathematical Logic 46 (7-8):547-564.details
|
|
Real computation with least discrete advice: A complexity theory of nonuniform computability with applications to effective linear algebra.Martin Ziegler - 2012 - Annals of Pure and Applied Logic 163 (8):1108-1139.details
|
|
Weihrauch degrees, omniscience principles and weak computability.Vasco Brattka & Guido Gherardi - 2011 - Journal of Symbolic Logic 76 (1):143 - 176.details
|
|
Primitive recursive reverse mathematics.Nikolay Bazhenov, Marta Fiori-Carones, Lu Liu & Alexander Melnikov - 2024 - Annals of Pure and Applied Logic 175 (1):103354.details
|
|
Effective choice and boundedness principles in computable analysis.Vasco Brattka & Guido Gherardi - 2011 - Bulletin of Symbolic Logic 17 (1):73-117.details
|
|
Singular coverings and non‐uniform notions of closed set computability.Stéphane Le Roux & Martin Ziegler - 2008 - Mathematical Logic Quarterly 54 (5):545-560.details
|
|
Finding descending sequences through ill-founded linear orders.Jun le Goh, Arno Pauly & Manlio Valenti - 2021 - Journal of Symbolic Logic 86 (2):817-854.details
|
|
Searching for an analogue of atr0 in the Weihrauch lattice.Takayuki Kihara, Alberto Marcone & Arno Pauly - 2020 - Journal of Symbolic Logic 85 (3):1006-1043.details
|
|
Universality, optimality, and randomness deficiency.Rupert Hölzl & Paul Shafer - 2015 - Annals of Pure and Applied Logic 166 (10):1049-1069.details
|
|
Effective Borel degrees of some topological functions.Guido Gherardi - 2006 - Mathematical Logic Quarterly 52 (6):625-642.details
|
|
How Incomputable Is the Separable Hahn-Banach Theorem?Guido Gherardi & Alberto Marcone - 2009 - Notre Dame Journal of Formal Logic 50 (4):393-425.details
|
|
On the uniform computational content of ramsey’s theorem.Vasco Brattka & Tahina Rakotoniaina - 2017 - Journal of Symbolic Logic 82 (4):1278-1316.details
|
|
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.details
|
|
Connected choice and the Brouwer fixed point theorem.Vasco Brattka, Stéphane Le Roux, Joseph S. Miller & Arno Pauly - 2019 - Journal of Mathematical Logic 19 (1):1950004.details
|
|
A computable version of Banach’s Inverse Mapping Theorem.Vasco Brattka - 2009 - Annals of Pure and Applied Logic 157 (2-3):85-96.details
|
|