- The effective sequence of uniformities and its limit: as a methodology in computable analysis.Mariko Yasugi, Takakazu Mori & Yoshiki Tsujii - 2007 - Annals of the Japan Association for Philosophy of Science 15 (2):99-121.details
|
|
Introduction to computability logic.Giorgi Japaridze - 2003 - Annals of Pure and Applied Logic 123 (1-3):1-99.details
|
|
Some intuitionistic equivalents of classical principles for degree 2 formulas.Stefano Berardi - 2006 - Annals of Pure and Applied Logic 139 (1):185-200.details
|
|
On the (semi)lattices induced by continuous reducibilities.Arno Pauly - 2010 - Mathematical Logic Quarterly 56 (5):488-502.details
|
|
Effective Borel measurability and reducibility of functions.Vasco Brattka - 2005 - Mathematical Logic Quarterly 51 (1):19-44.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
|
|
Effective choice and boundedness principles in computable analysis.Vasco Brattka & Guido Gherardi - 2011 - Bulletin of Symbolic Logic 17 (1):73-117.details
|
|
Some remarks on the algebraic structure of the Medvedev lattice.Andrea Sorbi - 1990 - Journal of Symbolic Logic 55 (2):831-853.details
|
|
Trial and error predicates and the solution to a problem of Mostowski.Hilary Putnam - 1965 - Journal of Symbolic Logic 30 (1):49-57.details
|
|
Limiting recursion.E. Mark Gold - 1965 - Journal of Symbolic Logic 30 (1):28-48.details
|
|
On the Structure of Finite Level and ω-Decomposable Borel Functions.Luca Motto Ros - 2013 - Journal of Symbolic Logic 78 (4):1257-1287.details
|
|
Wadge Hierarchy and Veblen Hierarchy Part I: Borel Sets of Finite Rank.J. Duparc - 2001 - Journal of Symbolic Logic 66 (1):56-86.details
|
|
Game representations of classes of piecewise definable functions.Luca Motto Ros - 2011 - Mathematical Logic Quarterly 57 (1):95-112.details
|
|
On the structure of finite level and $\omega$-decomposable Borel functions.Luca Motto Ros - 2013 - Journal of Symbolic Logic 78 (4):1257-1287.details
|
|
Levels of discontinuity, limit-computability, and jump operators.de Brecht Matthew - 2014 - In Dieter Spreen, Hannes Diener & Vasco Brattka (eds.), Logic, Computation, Hierarchies. De Gruyter. pp. 79-108.details
|
|
On Degrees of Unsolvability.J. R. Shoenfield - 1964 - Journal of Symbolic Logic 29 (4):203-204.details
|
|
Density of the Medvedev lattice of Π01 classes.Douglas Cenzer & Peter G. Hinman - 2003 - Archive for Mathematical Logic 42 (6):583-600.details
|
|
More on Wadge determinacy.Alessandro Andretta - 2006 - Annals of Pure and Applied Logic 144 (1-3):2-32.details
|
|
A sequent calculus for Limit Computable Mathematics.Stefano Berardi & Yoriyuki Yamagata - 2008 - Annals of Pure and Applied Logic 153 (1-3):111-126.details
|
|
Intermediate logics and factors of the Medvedev lattice.Andrea Sorbi & Sebastiaan A. Terwijn - 2008 - Annals of Pure and Applied Logic 155 (2):69-85.details
|
|
Games with 1-backtracking.Stefano Berardi, Thierry Coquand & Susumu Hayashi - 2010 - Annals of Pure and Applied Logic 161 (10):1254-1269.details
|
|
A splitting theorem for the Medvedev and Muchnik lattices.Stephen Binns - 2003 - Mathematical Logic Quarterly 49 (4):327.details
|
|
Subsystems of second-order arithmetic between RCA0 and WKL0.Carl Mummert - 2008 - Archive for Mathematical Logic 47 (3):205-210.details
|
|
The ∀∃-theory of the effectively closed Medvedev degrees is decidable.Joshua A. Cole & Takayuki Kihara - 2010 - Archive for Mathematical Logic 49 (1):1-16.details
|
|
Embeddings into the Medvedev and Muchnik lattices of Π0 1 classes.Stephen Binns & Stephen G. Simpson - 2004 - Archive for Mathematical Logic 43 (3):399-414.details
|
|
Density of the Medvedev lattice of Π0 1 classes.Douglas Cenzer & Peter G. Hinman - 2003 - Archive for Mathematical Logic 42 (6):583-600.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
|
|
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
|
|
Weihrauch degrees, omniscience principles and weak computability.Vasco Brattka & Guido Gherardi - 2011 - Journal of Symbolic Logic 76 (1):143 - 176.details
|
|
Coding true arithmetic in the Medvedev and Muchnik degrees.Paul Shafer - 2011 - Journal of Symbolic Logic 76 (1):267 - 288.details
|
|
A survey of Mučnik and Medvedev degrees.Peter G. Hinman - 2012 - Bulletin of Symbolic Logic 18 (2):161-229.details
|
|
Non-Branching Degrees in the Medvedev Lattice of [image] Classes.Christopher P. Alfeld - 2007 - Journal of Symbolic Logic 72 (1):81 - 97.details
|
|
Mind change efficient learning.Oliver Schulte - unknowndetails
|
|
Mass problems and randomness.Stephen G. Simpson - 2005 - Bulletin of Symbolic Logic 11 (1):1-27.details
|
|
Wadge hierarchy and veblen hierarchy part I: Borel sets of finite rank.J. Duparc - 2001 - Journal of Symbolic Logic 66 (1):56-86.details
|
|