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.