Complementing cappable degrees in the difference hierarchy.

DOI10.1016/J.APAL.2003.10.002zbMATH Open1043.03035OpenAlexW2008604886MaRDI QIDQ1428038FDOQ1428038

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

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

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)

Cites Work

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

Cited In (10)

• Complementing below recursively enumerable degrees
• Title not available (Why is that?)
• Nonisolated degrees and the jump operator
• Title not available (Why is that?)
• Bounding computably enumerable degrees in the Ershov hierarchy
• On a conjecture of Lempp
• Quasi-complements of the cappable degrees
• Cupping and diamond embeddings: a unifying approach
• Generalized high degrees have the complementation property
• Title not available (Why is that?)

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)