- (1 other version)Working below a high recursively enumerable degree.Richard A. Shore & Theodore A. Slaman - 1993 - Journal of Symbolic Logic 58 (3):824-859.details
|
|
Degrees of classes of RE sets.J. R. Shoenfield - 1976 - Journal of Symbolic Logic 41 (3):695-696.details
|
|
Simplicity of recursively enumerable sets.Robert W. Robinson - 1967 - Journal of Symbolic Logic 32 (2):162-172.details
|
|
Recursive isomorphism types of recursive Boolean algebras.J. B. Remmel - 1981 - Journal of Symbolic Logic 46 (3):572-594.details
|
|
Recursion theory on orderings. II.J. B. Remmel - 1980 - Journal of Symbolic Logic 45 (2):317-333.details
|
|
On R.e. And CO-R.E. Vector spaces with nonextendible bases.J. Remmel - 1980 - Journal of Symbolic Logic 45 (1):20-34.details
|
|
Maximal and cohesive vector spaces.J. B. Remmel - 1977 - Journal of Symbolic Logic 42 (3):400-418.details
|
|
Recursion theory on orderings. I. a model theoretic setting.G. Metakides & J. B. Remmel - 1979 - Journal of Symbolic Logic 44 (3):383-402.details
|
|
On the orbits of hyperhypersimple sets.Wolfgang Maass - 1984 - Journal of Symbolic Logic 49 (1):51-62.details
|
|
Some theorems on r-maximal sets and major subsets of recursively enumerable sets.Manuel Lerman - 1971 - Journal of Symbolic Logic 36 (2):193-215.details
|
|
Turing degrees and many-one degrees of maximal sets.Manuel Lerman - 1970 - Journal of Symbolic Logic 35 (1):29-40.details
|
|
A limit on relative genericity in the recursively enumerable sets.Steffen Lempp & Theodore A. Slaman - 1989 - Journal of Symbolic Logic 54 (2):376-395.details
|
|
(1 other version)α-Degrees of maximal α-r.e. sets.Anne Leggett - 1978 - Journal of Symbolic Logic 43 (3):456-474.details
|
|
Degrees of recursively enumerable sets which have no maximal supersets.A. H. Lachlan - 1968 - Journal of Symbolic Logic 33 (3):431-443.details
|
|
(1 other version)Diagonals and Semihyperhypersimple Sets.Martin Kummer - 1991 - Journal of Symbolic Logic 56 (3):1068-1074.details
|
|
Two theorems on degrees of models of true arithmetic.Julia Knight, Alistair H. Lachlan & Robert I. Soare - 1984 - Journal of Symbolic Logic 49 (2):425-436.details
|
|
(1 other version)Generalized cohesiveness.Tamara Hummel & Carl G. Jockusch - 1999 - Journal of Symbolic Logic 64 (2):489-516.details
|
|
(1 other version)Codable sets and orbits of computably enumerable sets.Leo Harrington & Robert I. Soare - 1998 - Journal of Symbolic Logic 63 (1):1-28.details
|
|
Automorphisms of supermaximal subspaces.R. G. Downey & G. R. Hird - 1985 - Journal of Symbolic Logic 50 (1):1-9.details
|
|
(1 other version)Definable encodings in the computably enumerable sets.Peter A. Cholak & Leo A. Harrington - 2000 - Bulletin of Symbolic Logic 6 (2):185-196.details
|
|
(1 other version)Definable Encodings In The Computably Enumerable Sets, By, Pages 185 -- 196.Peter A. Cholak & Leo A. Harrington - 2000 - Bulletin of Symbolic Logic 6 (2):185-196.details
|
|
The degrees of hyperhyperimmune sets.Carl G. Jockusch - 1969 - Journal of Symbolic Logic 34 (3):489-493.details
|
|
Recursively enumerable sets which are uniform for finite extensions.Donald A. Alton - 1971 - Journal of Symbolic Logic 36 (2):271-287.details
|
|
Inductive inference and reverse mathematics.Rupert Hölzl, Sanjay Jain & Frank Stephan - 2016 - Annals of Pure and Applied Logic 167 (12):1242-1266.details
|
|
Upper bounds for the arithmetical degrees.M. Lerman - 1985 - Annals of Pure and Applied Logic 29 (3):225-254.details
|
|
Superhighness.Bjørn Kjos-Hanssen & Andrée Nies - 2009 - Notre Dame Journal of Formal Logic 50 (4):445-452.details
|
|
The infinite injury priority method.Robert I. Soare - 1976 - Journal of Symbolic Logic 41 (2):513-530.details
|
|
Regainingly Approximable Numbers and Sets.Peter Hertling, Rupert Hölzl & Philip Janicki - forthcoming - Journal of Symbolic Logic.details
|
|
${\Cal d}$-maximal sets.Peter A. Cholak, Peter Gerdes & Karen Lange - 2015 - Journal of Symbolic Logic 80 (4):1182-1210.details
|
|
Prime models of computably enumerable degree.Rachel Epstein - 2008 - Journal of Symbolic Logic 73 (4):1373-1388.details
|
|
On a Conjecture of Dobrinen and Simpson concerning Almost Everywhere Domination.Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman & Reed Solomon - 2006 - Journal of Symbolic Logic 71 (1):119 - 136.details
|
|
Almost everywhere domination.Natasha L. Dobrinen & Stephen G. Simpson - 2004 - Journal of Symbolic Logic 69 (3):914-922.details
|
|
-Maximal sets.Peter A. Cholak, Peter Gerdes & Karen Lange - 2015 - Journal of Symbolic Logic 80 (4):1182-1210.details
|
|
Low sets without subsets of higher many-one degree.Patrizio Cintioli - 2011 - Mathematical Logic Quarterly 57 (5):517-523.details
|
|
Tracing and domination in the Turing degrees.George Barmpalias - 2012 - Annals of Pure and Applied Logic 163 (5):500-505.details
|
|
Initial segments of the degrees of unsolvability part II: Minimal degrees.C. E. M. Yates - 1970 - Journal of Symbolic Logic 35 (2):243-266.details
|
|
Degree invariance in the Π10classes.Rebecca Weber - 2011 - Journal of Symbolic Logic 76 (4):1184-1210.details
|
|
Computational complexity, speedable and levelable sets.Robert I. Soare - 1977 - Journal of Symbolic Logic 42 (4):545-563.details
|
|
Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets.Robert I. Soare - 1982 - Annals of Mathematical Logic 22 (1):69.details
|
|
Relativized Schnorr tests with universal behavior.Nicholas Rupprecht - 2010 - Archive for Mathematical Logic 49 (5):555-570.details
|
|
Recursively enumerable Boolean algebras.J. B. Remmel - 1978 - Annals of Mathematical Logic 15 (1):75.details
|
|
Recursion theory on algebraic structures with independent sets.J. B. Remmel - 1980 - Annals of Mathematical Logic 18 (2):153.details
|
|
Uniform Almost Everywhere Domination.Peter Cholak, Noam Greenberg & Joseph S. Miller - 2006 - Journal of Symbolic Logic 71 (3):1057 - 1072.details
|
|
The complexity of orbits of computably enumerable sets.Peter A. Cholak, Rodney Downey & Leo A. Harrington - 2008 - Bulletin of Symbolic Logic 14 (1):69 - 87.details
|
|
Degrees bounding principles and universal instances in reverse mathematics.Ludovic Patey - 2015 - Annals of Pure and Applied Logic 166 (11):1165-1185.details
|
|
Computable analogs of cardinal characteristics: Prediction and rearrangement.Iván Ongay-Valverde & Paul Tveite - 2021 - Annals of Pure and Applied Logic 172 (1):102872.details
|
|
There is no fat orbit.Rod Downey & Leo Harrington - 1996 - Annals of Pure and Applied Logic 80 (3):277-289.details
|
|
Orbits of computably enumerable sets: low sets can avoid an upper cone.Russell Miller - 2002 - Annals of Pure and Applied Logic 118 (1-2):61-85.details
|
|
Highness and bounding minimal pairs.Rodney G. Downey, Steffen Lempp & Richard A. Shore - 1993 - Mathematical Logic Quarterly 39 (1):475-491.details
|
|
On very high degrees.Keng Meng Ng - 2008 - Journal of Symbolic Logic 73 (1):309-342.details
|
|