Every nonzero enumeration degree contains infinitely many singleton degrees
Extending a result of Zacharov, we show that every nonzero enumeration degree consists of infinitely many s-degrees. In fact we show that there is no minimal s-degree inside any nonzero enumeration degree. This answers open questions in the literature raised by Cooper and Batyrshin.
Publication Details
- Journal
- Use Siena air (University of Siena)
- Published
- 2025-01-01
- Primary Topic
- Computability, Logic, AI Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00