Complementing cappable degrees in the difference hierarchy.

DOI10.1016/J.APAL.2003.10.002MaRDI QIDQ1428038zbMATH OpenOpenAlexFDO

Authors Rodney G. Downey, Guohua Wu, Angsheng 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)

Recommendations

• scientific article; zbMATH DE number 2063233
• Isolation and lattice embeddings
• Isolated d-r.e. degree below r.e. degree
• The Isolated D. R. E. Degrees are Dense in the R. E. Degrees
• On relative enumerability of Turing degrees
• Bounding cappable degrees
• Nonisolated degrees and the jump operator
• scientific article; zbMATH DE number 4087652
• Isolated from above d-r. e. degrees. I
• Cappable recursively enumerable degrees and Post's program

Cites work

• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 2063233 (Why is no real title available?)
• scientific article; zbMATH DE number 841082 (Why is no real title available?)
• scientific article; zbMATH DE number 3342831 (Why is no real title available?)
• A Splitting Theorem for the N-R.E. Degrees
• A minimal degree less than 0’
• 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
• Bounding minimal pairs
• Cupping the Recursively Enumerable Degrees by D.R.E. Degrees
• D.R.E. Degrees and the Nondiamond Theorem
• Isolated d.r.e. degrees are dense in r.e. degree structure
• Isolation and lattice embeddings
• Isolation and the high/low hierarchy
• Lattice embedding into d-r. e. degrees preserving 0 and 1
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• Minimal complements for degrees below 0′
• Minimal degrees and the jump operator
• Minimal pairs and high recursively enumerable degrees
• On the degrees less than 0'
• The Isolated D. R. E. Degrees are Dense in the R. E. Degrees
• The d.r.e. degrees are not dense
• The recursively enumerable degrees are dense
• The upper semilattice of degrees ≤ 0′ is complemented
• Turing Definability in the Ershov Hierarchy
• Weak density and cupping in the d-r.e. degrees

Cited in

(10)

• scientific article; zbMATH DE number 468962 (Why is no real title available?)
• Nonisolated degrees and the jump operator
• Quasi-complements of the cappable degrees
• Bounding computably enumerable degrees in the Ershov hierarchy
• Generalized high degrees have the complementation property
• Cupping and diamond embeddings: a unifying approach
• scientific article; zbMATH DE number 4016885 (Why is no real title available?)
• Complementing below recursively enumerable degrees
• On a conjecture of Lempp
• scientific article; zbMATH DE number 2063233 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1428038)