The d.r.e. degrees are not dense

DOI10.1016/0168-0072(91)90005-7zbMath0756.03020MaRDI QIDQ1182487

Robert I. Soare, Steffen Lempp, S. Barry Cooper, Leo Harrington, Alistair H. Lachlan

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0168-0072(91)90005-7

zbMATH Keywords

priority argument; d.r.e. Turing degrees; Lachlan join strategy

Mathematics Subject Classification ID

03D25: Recursively (computably) enumerable sets and degrees

Related Items

Generalized nonsplitting in the recursively enumerable degrees, Degree Spectra of Relations on Computable Structures, Isolation and lattice embeddings, 1998–99 Annual Meeting of the Association for Symbolic Logic, Bi-isolation in the d.c.e. degrees, Almost universal cupping and diamond embeddings, There are no maximal low d.c.e. degrees, Decomposability of low 2-computably enumerable degrees and Turing jumps in the Ershov hierarchy, Infima in the d.r.e. degrees, Model-theoretic properties of Turing degrees in the Ershov difference hierarchy, Intervals containing exactly one c.e. degree, Splitting theorems in recursion theory, Complementing cappable degrees in the difference hierarchy., Isolation in the CEA hierarchy, Nonisolated degrees and the jump operator, Non-uniformity and generalised Sacks splitting, Interpolating \(d\)-r.e. and REA degrees between r.e. degrees, A survey of results on the d.c.e. and \(n\)-c.e. degrees, There exists a maximal 3-c.e. enumeration degree, Bounding computably enumerable degrees in the Ershov hierarchy, A non-splitting theorem for d.r.e. sets, Degree spectra of intrinsically c.e. relations, THE n-r.e. DEGREES: UNDECIDABILITY AND Σ₁ SUBSTRUCTURES, Cupping and Diamond Embeddings: A Unifying Approach, An almost-universal cupping degree, Degree spectra of relations on computable structures in the presence of Δ₂⁰isomorphisms, ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS, On Σ₁-Structural Differences Among Finite Levels of the Ershov Hierarchy, The jump is definable in the structure of the degrees of unsolvability, On Downey's conjecture, Infima of d.r.e. Degrees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weak density and cupping in the d-r.e. degrees
• On computable enumerations. II
• The recursively enumerable degrees are dense
• Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion
• D.R.E. Degrees and the Nondiamond Theorem
• A recursively enumerable degree which will not split over all lesser ones
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• Trial and error predicates and the solution to a problem of Mostowski
• Minimal Covers and Arithmetical Sets