- The strength of compactness in Computability Theory and Nonstandard Analysis.Dag Normann & Sam Sanders - 2019 - Annals of Pure and Applied Logic 170 (11):102710.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
|
|
Completion of choice.Vasco Brattka & Guido Gherardi - 2021 - Annals of Pure and Applied Logic 172 (3):102914.details
|
|
Universality, optimality, and randomness deficiency.Rupert Hölzl & Paul Shafer - 2015 - Annals of Pure and Applied Logic 166 (10):1049-1069.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
|
|
Using Ramsey’s theorem once.Jeffry L. Hirst & Carl Mummert - 2019 - Archive for Mathematical Logic 58 (7-8):857-866.details
|
|
On the strength of marriage theorems and uniformity.Makoto Fujiwara, Kojiro Higuchi & Takayuki Kihara - 2014 - Mathematical Logic Quarterly 60 (3):136-153.details
|
|
Two direct proofs that LLPO implies the detachable fan theorem.D. S. Bridges, J. E. Dent & M. N. McKubre-Jordens - 2013 - Logic Journal of the IGPL 21 (5):830-835.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
|
|
On the uniform computational content of ramsey’s theorem.Vasco Brattka & Tahina Rakotoniaina - 2017 - Journal of Symbolic Logic 82 (4):1278-1316.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
|
|
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
|
|
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
|
|
Algebraic properties of the first-order part of a problem.Giovanni Soldà & Manlio Valenti - 2023 - Annals of Pure and Applied Logic 174 (7):103270.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
|
|
Weihrauch degrees, omniscience principles and weak computability.Vasco Brattka & Guido Gherardi - 2011 - Journal of Symbolic Logic 76 (1):143 - 176.details
|
|
On notions of computability-theoretic reduction between Π21 principles.Denis R. Hirschfeldt & Carl G. Jockusch - 2016 - Journal of Mathematical Logic 16 (1):1650002.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
|
|
From Bolzano‐Weierstraß to Arzelà‐Ascoli.Alexander P. Kreuzer - 2014 - Mathematical Logic Quarterly 60 (3):177-183.details
|
|
Searching problems above arithmetical transfinite recursion.Yudai Suzuki & Keita Yokoyama - 2024 - Annals of Pure and Applied Logic 175 (10):103488.details
|
|