Partial degrees and the density problem

DOI10.2307/2273104MaRDI QIDQ4749831zbMATH OpenOpenAlexFDO

Authors S. Barry Cooper

Publication date 1982

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

Full work available at URL https://doi.org/10.2307/2273104

zbMATH Keywords

density of partial degreesenumeration degreesminimal coverpartial functionsTuring reducibility

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Theory of numerations, effectively presented structures (03D45)

Cited in

(13)

• Degrees of denumerability reducibilities
• The \(n\)-rea enumeration degrees are dense
• Sets of generator and automorphism bases for the enumeration degrees
• Quasi-minimal enumeration degrees and minimal Turing degrees
• There exists a maximal 3-c.e. enumeration degree
• Cupping Classes of $\Sigma^0_2$ Enumeration Degrees
• Cupping Δ₂⁰ enumeration degrees to 0_e′
• The singleton degrees of the \({\Sigma}_2^0\) sets are not dense
• The minimal e-degree problem in fragments of Peano arithmetic
• Every nonzero enumeration degree contains infinitely many singleton degrees
• Strong enumeration reducibilities
• On some filters and ideals of the Medvedev lattice
• Goodness in the enumeration and singleton degrees

This page was built for publication: Partial degrees and the density problem

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