- 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
|
|
Non-Branching Degrees in the Medvedev Lattice of [image] Classes.Christopher P. Alfeld - 2007 - Journal of Symbolic Logic 72 (1):81 - 97.details
|
|
Degrees of difficulty of generalized r.e. separating classes.Douglas Cenzer & Peter G. Hinman - 2008 - Archive for Mathematical Logic 46 (7-8):629-647.details
|
|
(1 other version)Density of the Medvedev lattice of Π0 1 classes.Douglas Cenzer & Peter G. Hinman - 2003 - Archive for Mathematical Logic 42 (6):583-600.details
|
|
(1 other version)Density of the Medvedev lattice of Π01 classes.Douglas Cenzer & Peter G. Hinman - 2003 - Archive for Mathematical Logic 42 (6):583-600.details
|
|
Weihrauch degrees, omniscience principles and weak computability.Vasco Brattka & Guido Gherardi - 2011 - Journal of Symbolic Logic 76 (1):143 - 176.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
|
|
Effective choice and boundedness principles in computable analysis.Vasco Brattka & Guido Gherardi - 2011 - Bulletin of Symbolic Logic 17 (1):73-117.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
|
|
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
|
|
A splitting theorem for the Medvedev and Muchnik lattices.Stephen Binns - 2003 - Mathematical Logic Quarterly 49 (4):327.details
|
|
Mass problems and randomness.Stephen G. Simpson - 2005 - Bulletin of Symbolic Logic 11 (1):1-27.details
|
|
Coding true arithmetic in the Medvedev and Muchnik degrees.Paul Shafer - 2011 - Journal of Symbolic Logic 76 (1):267 - 288.details
|
|
σ-Continuity and related forcings.Marcin Sabok - 2009 - Archive for Mathematical Logic 48 (5):449-464.details
|
|
Game representations of classes of piecewise definable functions.Luca Motto Ros - 2011 - Mathematical Logic Quarterly 57 (1):95-112.details
|
|
Decomposing Borel functions and structure at finite levels of the Baire hierarchy.Janusz Pawlikowski & Marcin Sabok - 2012 - Annals of Pure and Applied Logic 163 (12):1748-1764.details
|
|
(2 other versions)Computability and Randomness.André Nies - 2008 - Oxford, England: Oxford University Press.details
|
|
Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1999 - Studia Logica 77 (1):129-129.details
|
|
(1 other version)On the structure of finite level and $\omega$-decomposable Borel functions.Luca Motto Ros - 2013 - Journal of Symbolic Logic 78 (4):1257-1287.details
|
|
(2 other versions)Descriptive Set Theory.Richard Mansfield - 1981 - Journal of Symbolic Logic 46 (4):874-876.details
|
|
Topological aspects of the Medvedev lattice.Andrew Em Lewis, Richard A. Shore & Andrea Sorbi - 2011 - Archive for Mathematical Logic 50 (3-4):319-340.details
|
|
Mass problems and hyperarithmeticity.Joshua A. Cole & Stephen G. Simpson - 2007 - Journal of Mathematical Logic 7 (2):125-143.details
|
|
A survey of Mučnik and Medvedev degrees.Peter G. Hinman - 2012 - Bulletin of Symbolic Logic 18 (2):161-229.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
|
|
Effectively closed mass problems and intuitionism.Kojiro Higuchi - 2012 - Annals of Pure and Applied Logic 163 (6):693-697.details
|
|
(1 other version)Limiting recursion.E. Mark Gold - 1965 - Journal of Symbolic Logic 30 (1):28-48.details
|
|
(1 other version)Wadge hierarchy and veblen hierarchy part I: Borel sets of finite rank.J. Duparc - 2001 - Journal of Symbolic Logic 66 (1):56-86.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
|
|
Descriptive Set Theory.Yiannis Nicholas Moschovakis - 1982 - Studia Logica 41 (4):429-430.details
|
|
Subsystems of Second Order Arithmetic.Stephen George Simpson - 1998 - Springer Verlag.details
|
|