Density of the cototal enumeration degrees

DOI10.1016/j.apal.2018.01.001OpenAlexW2782873327MaRDI QIDQ1706269

Joseph S. Miller, Mariya Ivanova Soskova

Publication date: 21 March 2018

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.2018.01.001

zbMATH Keywords

densityenumeration degreesgood approximationscototal enumeration degrees

Mathematics Subject Classification ID

Graph theory (05C99) Symbolic dynamics (37B10) Applications of computability and recursion theory (03D80) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (4)

RELATIONSHIPS BETWEEN COMPUTABILITY-THEORETIC PROPERTIES OF PROBLEMS ⋮ Cototal enumeration degrees and their applications to effective mathematics ⋮ A STRUCTURAL DICHOTOMY IN THE ENUMERATION DEGREES ⋮ PA RELATIVE TO AN ENUMERATION ORACLE

Cites Work

• Unnamed Item
• Unnamed Item
• Goodness in the enumeration and singleton degrees
• The \(n\)-rea enumeration degrees are dense
• Limit lemmas and jump inversion in the enumeration degrees
• Independent domination in graphs: A survey and recent results
• INITIAL SEGMENTS OF THE ENUMERATION DEGREES
• A NOTE ON INITIAL SEGMENTS OF THE ENUMERATION DEGREES
• The Π₂⁰ enumeration degrees are not dense
• Note on Degrees of Partial Functions
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• Reducibility and Completeness for Sets of Integers
• DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREES
• Cototal enumeration degrees and their applications to effective mathematics
• On cototality and the skip operator in the enumeration degrees
• Definability via Kalimullin pairs in the structure of the enumeration degrees
• Degrees of unsolvability of continuous functions
• The  -Enumeration Degrees
• Enumeration reducibility and partial degrees
• Arithmetical Reducibilities I

This page was built for publication: Density of the cototal enumeration degrees