- The ω-Turing degrees.Andrey C. Sariev & Hristo Ganchev - 2014 - Annals of Pure and Applied Logic 165 (9):1512-1532.details
|
|
(1 other version)Cupping and noncupping in the enumeration degrees of∑< sub> 2< sup> 0 sets.S. Barry Cooper, Andrea Sorbi & Xiaoding Yi - 1996 - Annals of Pure and Applied Logic 82 (3):317-342.details
|
|
Learning via queries and oracles.Frank Stephan - 1998 - Annals of Pure and Applied Logic 94 (1-3):273-296.details
|
|
(1 other version)Natural factors of the Muchnik lattice capturing IPC.Rutger Kuyper - 2013 - Annals of Pure and Applied Logic 164 (10):1025-1036.details
|
|
Quasi-complements of the cappable degrees.Guohua Wu - 2004 - Mathematical Logic Quarterly 50 (2):189.details
|
|
The limitations of cupping in the local structure of the enumeration degrees.Mariya I. Soskova - 2010 - Archive for Mathematical Logic 49 (2):169-193.details
|
|
The minimal complementation property above 0′.Andrew E. M. Lewis - 2005 - Mathematical Logic Quarterly 51 (5):470-492.details
|
|
Upper bounds for the arithmetical degrees.M. Lerman - 1985 - Annals of Pure and Applied Logic 29 (3):225-254.details
|
|
Cuppability of Simple and Hypersimple Sets.Martin Kummer & Marcus Schaefer - 2007 - Notre Dame Journal of Formal Logic 48 (3):349-369.details
|
|
Two More Characterizations of K-Triviality.Noam Greenberg, Joseph S. Miller, Benoit Monin & Daniel Turetsky - 2018 - Notre Dame Journal of Formal Logic 59 (2):189-195.details
|
|
Cone avoidance and randomness preservation.Stephen G. Simpson & Frank Stephan - 2015 - Annals of Pure and Applied Logic 166 (6):713-728.details
|
|
ASH, CJ, Categoricity in hyperarithmetical degrees (1) BALDWIN, JT and HARRINGTON, L., Trivial pursuit: Re-marks on the main gap (3) COOPER, SB and EPSTEIN, RL, Complementing below re-cursively enumerable degrees (1). [REVIEW]Rl Epstein - 1987 - Annals of Pure and Applied Logic 34 (1):311.details
|
|
Finite cupping sets.Andrew Lewis - 2004 - Archive for Mathematical Logic 43 (7):845-858.details |
|
Definability of the jump operator in the enumeration degrees.I. Sh Kalimullin - 2003 - Journal of Mathematical Logic 3 (02):257-267.details
|
|
(1 other version)Cupping and noncupping in the enumeration degrees of ∑20 sets.S. Barry Cooper, Andrea Sorbi & Xiaoding Yi - 1996 - Annals of Pure and Applied Logic 82 (3):317-342.details
|
|
Mass Problems and Intuitionism.Stephen G. Simpson - 2008 - Notre Dame Journal of Formal Logic 49 (2):127-136.details
|
|
(1 other version)Natural factors of the Medvedev lattice capturing IPC.Rutger Kuyper - 2014 - Archive for Mathematical Logic 53 (7):865-879.details
|
|
Complementing below recursively enumerable degrees.S. Barry Cooper & Richard L. Epstein - 1987 - Annals of Pure and Applied Logic 34 (1):15-32.details
|
|
Almost everywhere domination and superhighness.Stephen G. Simpson - 2007 - Mathematical Logic Quarterly 53 (4):462-482.details
|
|
1-Generic degrees and minimal degrees in higher recursion theory, II.C. T. Chong - 1986 - Annals of Pure and Applied Logic 31:165-175.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
|
|