A hierarchy for the plus cupping Turing degrees
From MaRDI portal
(Redirected from A hierarchy for the plus cupping Turing degrees)
Recommendations
Cites work
- A hierarchy for cuppable degrees
- A join theorem for the computably enumerable degrees
- A minimal pair of recursively enumerable degrees
- An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
- An almost deep degree
- Automorphisms of the lattice of recursively enumerable sets
- Elementary Differences Among Jump Hierarchies
- scientific article; zbMATH DE number 3784859 (Why is no real title available?)
- Jump restricted interpolation in the recursively enumerable degrees
- Lower Bounds for Pairs of Recursively Enumerable Degrees
- On the degrees less than 0'
- Splitting and nonsplitting, II: A low2 c.e. degree above which 0′ is not splittable
Cited in
(9)- A hierarchy for cuppable degrees
- Modulo computably enumerable degrees by cupping partners
- The typical Turing degree
- On a hierarchy of plus-cupping degrees
- Joining to High Degrees
- The method of the Yu–Ding Theorem and its application
- A minimal pair joining to a plus cupping Turing degree
- Plus cupping degrees do not form an ideal
- On the definable ideal generated by the plus cupping c.e. degrees
This page was built for publication: A hierarchy for the plus cupping Turing degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4650266)