The d.r.e. degrees are not dense
From MaRDI portal
Publication:1182487
DOI10.1016/0168-0072(91)90005-7zbMath0756.03020OpenAlexW2007016528MaRDI QIDQ1182487
Steffen Lempp, Robert I. Soare, Alistair H. Lachlan, Leo Harrington, S. Barry Cooper
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
Related Items (41)
Elementary theories and structural properties of d-c.e. and n-c.e. degrees ⋮ THE n-r.e. DEGREES: UNDECIDABILITY AND Σ1 SUBSTRUCTURES ⋮ There exists a maximal 3-c.e. enumeration degree ⋮ Bi-isolation in the d.c.e. degrees ⋮ Interpolating \(d\)-r.e. and REA degrees between r.e. degrees ⋮ Intervals containing exactly one c.e. degree ⋮ Corrigendum to: ``The d.r.e. degrees are not dense ⋮ The jump is definable in the structure of the degrees of unsolvability ⋮ IN MEMORIAM: BARRY COOPER 1943–2015 ⋮ Almost universal cupping and diamond embeddings ⋮ Normalizing notations in the Ershov hierarchy ⋮ A Survey of Results on the d-c.e. and n-c.e. Degrees ⋮ There Are No Maximal d.c.e. wtt-degrees ⋮ Decomposability of low 2-computably enumerable degrees and Turing jumps in the Ershov hierarchy ⋮ Isolated maximal d.r.e. degrees ⋮ Complementing cappable degrees in the difference hierarchy. ⋮ Generalized nonsplitting in the recursively enumerable degrees ⋮ Computability theory. Abstracts from the workshop held January 7--13, 2018 ⋮ Weak density and nondensity among transfinite levels of the Ershov hierarchy ⋮ Degree spectra of intrinsically c.e. relations ⋮ Infima in the d.r.e. degrees ⋮ On Downey's conjecture ⋮ Infima of d.r.e. Degrees ⋮ Isolation in the CEA hierarchy ⋮ A survey of results on the d.c.e. and \(n\)-c.e. degrees ⋮ There are no maximal low d.c.e. degrees ⋮ Bounding computably enumerable degrees in the Ershov hierarchy ⋮ 1998–99 Annual Meeting of the Association for Symbolic Logic ⋮ Turing computability: structural theory ⋮ ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS ⋮ Model-theoretic properties of Turing degrees in the Ershov difference hierarchy ⋮ Cupping and Diamond Embeddings: A Unifying Approach ⋮ An almost-universal cupping degree ⋮ A non-splitting theorem for d.r.e. sets ⋮ On Σ1-Structural Differences Among Finite Levels of the Ershov Hierarchy ⋮ Nonisolated degrees and the jump operator ⋮ Splitting theorems in recursion theory ⋮ Degree Spectra of Relations on Computable Structures ⋮ Non-uniformity and generalised Sacks splitting ⋮ Degree spectra of relations on computable structures in the presence of Δ20isomorphisms ⋮ Isolation and lattice embeddings
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
This page was built for publication: The d.r.e. degrees are not dense
