Complementing cappable degrees in the difference hierarchy.

DOI10.1016/J.APAL.2003.10.002zbMath1043.03035OpenAlexW2008604886MaRDI QIDQ1428038

Guohua Wu, Rodney G. Downey, Ang Sheng Li

Publication date: 14 March 2004

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2003.10.002

zbMATH Keywords

d.r.e. degreesrecursively enumerable degreescappable degreescomplementation of degreesDiamond Theoremisolated degrees

Mathematics Subject Classification ID

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

Related Items (1)

Cupping and Diamond Embeddings: A Unifying Approach

Cites Work

• Weak density and cupping in the d-r.e. degrees
• The d.r.e. degrees are not dense
• Isolated d.r.e. degrees are dense in r.e. degree structure
• Isolation and the high/low hierarchy
• The recursively enumerable degrees are dense
• On the degrees less than 0'
• A minimal degree less than 0’
• An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
• The upper semilattice of degrees ≤ 0′ is complemented
• D.R.E. Degrees and the Nondiamond Theorem
• Bounding minimal pairs
• A Splitting Theorem for the N-R.E. Degrees
• Minimal pairs and high recursively enumerable degrees
• Minimal degrees and the jump operator
• Turing Definability in the Ershov Hierarchy
• Cupping the Recursively Enumerable Degrees by D.R.E. Degrees
• Isolation and lattice embeddings
• The Isolated D. R. E. Degrees are Dense in the R. E. Degrees
• Minimal complements for degrees below 0′
• A minimal pair of recursively enumerable degrees
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complementing cappable degrees in the difference hierarchy.