- (1 other version)Diagonals and Semihyperhypersimple Sets.Martin Kummer - 1991 - Journal of Symbolic Logic 56 (3):1068-1074.details
|
|
Automorphisms of the lattice of recursively enumerable sets.Peter Cholak - 1995 - Providence, RI: American Mathematical Society.details
|
|
Pseudo-Jump Operators. II: Transfinite Iterations, Hierarchies and Minimal Covers.Carl G. Jockusch & Richard A. Shore - 1984 - Journal of Symbolic Logic 49 (4):1205 - 1236.details
|
|
A survey of lattices of re substructures.Anil Nerode & Jeffrey Remmel - 1985 - In Anil Nerode & Richard A. Shore (eds.), Recursion theory. Providence, R.I.: American Mathematical Society. pp. 42--323.details
|
|
Splitting properties of R. E. sets and degrees.R. G. Downey & L. V. Welch - 1986 - Journal of Symbolic Logic 51 (1):88-109.details
|
|
Index sets and degrees of unsolvability.Michael Stob - 1982 - Journal of Symbolic Logic 47 (2):241-248.details
|
|
Computational complexity, speedable and levelable sets.Robert I. Soare - 1977 - Journal of Symbolic Logic 42 (4):545-563.details
|
|
(1 other version)Working below a low2 recursively enumerably degree.Richard A. Shore & Theodore A. Slaman - 1990 - Archive for Mathematical Logic 29 (3):201-211.details
|
|
Degrees of classes of RE sets.J. R. Shoenfield - 1976 - Journal of Symbolic Logic 41 (3):695-696.details
|
|
Recursively enumerable generic sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.details
|
|
The universal splitting property. II.M. Lerman & J. B. Remmel - 1984 - Journal of Symbolic Logic 49 (1):137-150.details
|
|
Mitotic recursively enumerable sets.Richard E. Ladner - 1973 - Journal of Symbolic Logic 38 (2):199-211.details
|
|
Bounding minimal pairs.A. H. Lachlan - 1979 - Journal of Symbolic Logic 44 (4):626-642.details
|
|
(1 other version)Diagonals and semihyperhypersimple sets.Martin Kummer - 1991 - Journal of Symbolic Logic 56 (3):1068-1074.details
|
|
Recursion, metarecursion, and inclusion.James C. Owings - 1967 - Journal of Symbolic Logic 32 (2):173-179.details
|
|
A jump class of noncappable degrees.S. B. Cooper - 1989 - Journal of Symbolic Logic 54 (2):324-353.details
|
|
On complexity properties of recursively enumerable sets.M. Blum & I. Marques - 1973 - Journal of Symbolic Logic 38 (4):579-593.details
|
|
The theory of the recursively enumerable weak truth-table degrees is undecidable.Klaus Ambos-Spies, André Nies & Richard A. Shore - 1992 - Journal of Symbolic Logic 57 (3):864-874.details
|
|
Lattice embeddings into the recursively enumerable degrees. II.K. Ambos-Spies & M. Lerman - 1989 - Journal of Symbolic Logic 54 (3):735-760.details
|
|
Degree theoretical splitting properties of recursively enumerable sets.Klaus Ambos-Spies & Peter A. Fejer - 1988 - Journal of Symbolic Logic 53 (4):1110-1137.details
|
|
An extension of the nondiamond theorem in classical and α-recursion theory.Klaus Ambos-Spies - 1984 - Journal of Symbolic Logic 49 (2):586-607.details
|
|
The d.r.e. degrees are not dense.S. Cooper, Leo Harrington, Alistair Lachlan, Steffen Lempp & Robert Soare - 1991 - Annals of Pure and Applied Logic 55 (2):125-151.details
|
|
Jumps of nontrivial splittings of recursively enumerable sets.Michael A. Ingrassia & Steffen Lempp - 1990 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 36 (4):285-292.details
|
|
The d.r.e. degrees are not dense.S. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp & Robert I. Soare - 1991 - Annals of Pure and Applied Logic 55 (2):125-151.details
|
|
Jumps of Hemimaximal Sets.Rod Downey & Mike Stob - 1991 - Mathematical Logic Quarterly 37 (8):113-120.details
|
|
A recursively enumerable degree which will not split over all lesser ones.Alistair H. Lachlan - 1976 - Annals of Mathematical Logic 9 (4):307.details
|
|
Σ2 -collection and the infinite injury priority method.Michael E. Mytilinaios & Theodore A. Slaman - 1988 - Journal of Symbolic Logic 53 (1):212-221.details
|
|
Intervals and sublattices of the R.E. weak truth table degrees, part I: Density.R. G. Downey - 1989 - Annals of Pure and Applied Logic 41 (1):1-26.details
|
|
Recursively Enumerable Sets and Retracting Functions.C. E. M. Yates - 1967 - Journal of Symbolic Logic 32 (3):394-394.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
|
|
Determining Automorphisms of the Recursively Enumerable Sets.Richard A. Shore & Anil Nerode - 1990 - Journal of Symbolic Logic 55 (1):358-360.details
|
|
A non-inversion theorem for the jump operator.Richard A. Shore - 1988 - Annals of Pure and Applied Logic 40 (3):277-303.details
|
|
On the Degrees Less than 0'.Gerald E. Sacks - 1964 - Journal of Symbolic Logic 29 (1):60-60.details
|
|
Classes of Recursively Enumerable Sets and Degrees of Unsolvability.Donald A. Martin - 1966 - Mathematical Logic Quarterly 12 (1):295-310.details
|
|
Structural interactions of the recursively enumerable T- and W-degrees.R. G. Downey & M. Stob - 1986 - Annals of Pure and Applied Logic 31:205-236.details
|
|
Lattice nonembeddings and initial segments of the recursively enumerable degrees.Rod Downey - 1990 - Annals of Pure and Applied Logic 49 (2):97-119.details
|
|
The intervals of the lattice of recursively enumerable sets determined by major subsets.Wolfgang Maass & Michael Stob - 1983 - Annals of Pure and Applied Logic 24 (2):189-212.details
|
|
The weak truth table degrees of recursively enumerable sets.Richard E. Ladner & Leonard P. Sasso - 1975 - Annals of Mathematical Logic 8 (4):429-448.details
|
|
The Priority Method I.A. H. Lachlans - 1967 - Mathematical Logic Quarterly 13 (1‐2):1-10.details
|
|
The Priority Method I.A. H. Lachlans - 1967 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 13 (1-2):1-10.details
|
|
Review: A. H. Lachlan, Lower Bounds for Pairs of Recursively Enumerable Degrees. [REVIEW]Carl G. Jockusch - 1972 - Journal of Symbolic Logic 37 (3):611-611.details
|
|
Jumps of nontrivial splittings of recursively enumerable sets.Michael A. Ingrassia & Steffen Lempp - 1990 - Mathematical Logic Quarterly 36 (4):285-292.details
|
|
Jumps of Hemimaximal Sets.Rod Downey & Mike Stob - 1991 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 37 (8):113-120.details
|
|
Friedberg splittings of recursively enumerable sets.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 59 (3):175-199.details
|
|
Completely mitotic R.E. degrees.R. G. Downey & T. A. Slaman - 1989 - Annals of Pure and Applied Logic 41 (2):119-152.details
|
|
Classifications of degree classes associated with r.e. subspaces.R. G. Downey & J. B. Remmel - 1989 - Annals of Pure and Applied Logic 42 (2):105-124.details
|
|
Anti‐Mitotic Recursively Enumerable Sets.Klaus Ambos-Spies - 1985 - Mathematical Logic Quarterly 31 (29-30):461-477.details
|
|
Anti‐Mitotic Recursively Enumerable Sets.Klaus Ambos-Spies - 1985 - Mathematical Logic Quarterly 31 (29-30):461-477.details
|
|