On Downey's conjecture

DOI10.2178/JSL/1268917488zbMath1192.03017OpenAlexW2025995522WikidataQ122999368 ScholiaQ122999368MaRDI QIDQ3570156

Steffen Lempp, Iskander Sh. Kalimullin, Marat M. Arslanov

Publication date: 24 June 2010

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1268917488

zbMATH Keywords

d.c.e. degrees\(n\)-c.e. degreesDowney's conjecture

Mathematics Subject Classification ID

Other Turing degree structures (03D28)

Related Items (15)

Downward density of exact degrees ⋮ Elementary theories and structural properties of d-c.e. and n-c.e. degrees ⋮ THE n-r.e. DEGREES: UNDECIDABILITY AND Σ₁ SUBSTRUCTURES ⋮ Nonuniformity of downward density in \(n\)-computably enumerable Turing degrees ⋮ Structural theory of degrees of unsolvability: advances and open problems ⋮ A Survey of Results on the d-c.e. and n-c.e. Degrees ⋮ Nondensity of Double Bubbles in the D.C.E. Degrees ⋮ A survey of results on the d.c.e. and \(n\)-c.e. degrees ⋮ On the problem of definability of the computably enumerable degrees in the difference hierarchy ⋮ Turing computability: structural theory ⋮ Splitting in 2-computably enumerable degrees with avoiding cones ⋮ Special splitting in the 2-c.e. Turing degrees ⋮ Marat Mirzaevich Arslanov (on his eightieth birthday) ⋮ Model-theoretic properties of Turing degrees in the Ershov difference hierarchy ⋮ Non-uniformity and generalised Sacks splitting

Cites Work

• Weak density and cupping in the d-r.e. degrees
• The d.r.e. degrees are not dense
• The recursively enumerable degrees are dense
• A minimal degree less than 0’
• D.R.E. Degrees and the Nondiamond Theorem

This page was built for publication: On Downey's conjecture