A hierarchy for the plus cupping Turing degrees

DOI10.2178/jsl/1058448450zbMath1061.03040OpenAlexW2036724962MaRDI QIDQ4650266

Yong Wang, Ang Sheng Li

Publication date: 9 February 2005

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.jsl/1058448450

zbMATH Keywords

computably enumerable degreescuppinghigh-low hierarchy

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28)

Related Items

On a Hierarchy of Plus-Cupping Degrees

Cites Work

• Unnamed Item
• A hierarchy for cuppable degrees
• Jump restricted interpolation in the recursively enumerable degrees
• On the degrees less than 0'
• An almost deep degree
• An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
• Splitting and nonsplitting, II: A low₂ c.e. degree above which 0′ is not splittable
• Automorphisms of the lattice of recursively enumerable sets
• A join theorem for the computably enumerable degrees
• Elementary Differences Among Jump Hierarchies
• A minimal pair of recursively enumerable degrees
• Lower Bounds for Pairs of Recursively Enumerable Degrees