An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees

DOI10.2307/1999525zbMath0539.03020OpenAlexW4233349789MaRDI QIDQ3325709

Ambos-Spies, Klaus, Robert I. Soare, Richard A. Shore, Carl G. jun. Jockusch

Publication date: 1984

Full work available at URL: https://doi.org/10.2307/1999525

zbMATH Keywords

upper semilatticepromptly simple degreesrecursively enumerable degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items

Structural interactions of the recursively enumerable T- and W-degrees, On definable filters in computably enumerable degrees, Completely mitotic r. e. degrees, Classification of degree classes associated with r.e. subspaces, On the problem of the critical bound, A non-inversion theorem for the jump operator, Minimal pairs in initial segments of the recursively enumerable degrees, Index sets related to prompt simplicity, Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree, An extended Lachlan splitting theorem, On the definable ideal generated by the plus cupping c.e. degrees, The Quotient Semilattice of the Recursively Enumerable Degrees Modulo the Cappable Degrees, Cupping and noncapping in the r.e. weak truth table and turing degrees, STRONG JUMP-TRACEABILITY, Almost universal cupping and diamond embeddings, Localization of a theorem of Ambos-Spies and the strong anti-splitting property, Structural theory of degrees of unsolvability: advances and open problems, Homomorphisms and quotients of degree structures, Upper bounds on ideals in the computably enumerable Turing degrees, Complementing cappable degrees in the difference hierarchy., Modulo computably enumerable degrees by cupping partners, A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES, A hierarchy for the plus cupping Turing degrees, Incomparable prime ideals of recursively enumerable degrees, Immunity for Closed Sets, \(\Sigma_2\) induction and infinite injury priority arguments. III: Prompt sets, minimal pairs and Shoenfield's conjecture, Joining to high degrees via noncuppables, Weak density and cupping in the d-r.e. degrees, Turing computability: structural theory, Hierarchy of Computably Enumerable Degrees II, T-Degrees, Jump Classes, and Strong Reducibilities, Cupping and Diamond Embeddings: A Unifying Approach, Lowness properties and randomness, The contiguity in R/M., CUPPING AND JUMP CLASSES IN THE COMPUTABLY ENUMERABLE DEGREES, Cappable recursively enumerable degrees and Post's program, Splitting theorems in recursion theory, The continuity of cupping to \(\text \textbf{0}'\), Presentations of computably enumerable reals.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Splitting properties and jump classes
• The recursively enumerable degrees are dense
• Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
• Jump restricted interpolation in the recursively enumerable degrees
• Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets
• Bounding minimal pairs
• Recursively enumerable generic sets
• The weak truth table degrees of recursively enumerable sets
• The infinite injury priority method
• Degrees of classes of RE sets
• Recursively enumerable sets and degrees
• Computational complexity, speedable and levelable sets
• Computational complexity of recursively enumerable sets
• Degrees of Unsolvability. (AM-55)
• A minimal pair of recursively enumerable degrees
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• Degrees of recursively enumerable sets which have no maximal supersets