DD-maximal many-one degrees contain least finite-one degrees
Abstract
Richter, Stephan, and Zhang asked whether every nonrecursive many-one degree contains a least finite-one degree. We prove this for every nonrecursive \ many-one degree containing a D-maximal set. The proof handles the simple cases via known results and develops a duplicate-cover method for the remaining D-maximal types in the classification of Cholak, Gerdes, and Lange.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.