Cupping the Recursively Enumerable Degrees by D.R.E. Degrees

DOI10.1112/S0024611599011818zbMath1025.03032OpenAlexW2039241442MaRDI QIDQ4487561

Xiaoding Yi, Ang Sheng Li

Publication date: 22 June 2000

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/s0024611599011818

zbMATH Keywords

r.e. degree\(n\)-r.e. degreeincomplete d.r.e. degrees

Mathematics Subject Classification ID

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

Related Items (8)

Structural theory of degrees of unsolvability: advances and open problems ⋮ Complementing cappable degrees in the difference hierarchy. ⋮ Finite cupping sets ⋮ A single minimal complement for the c.e. degrees ⋮ Turing computability: structural theory ⋮ Cupping and Diamond Embeddings: A Unifying Approach ⋮ Nonisolated degrees and the jump operator ⋮ Non-uniformity and generalised Sacks splitting

This page was built for publication: Cupping the Recursively Enumerable Degrees by D.R.E. Degrees