\texorpdfstring{$D$}{D}-maximal many-one degrees contain least finite-one degrees
Logic
2026-04-20 v1
Abstract
Richter, Stephan, and Zhang asked whether every nonrecursive many-one degree contains a least finite-one degree. We prove this for every nonrecursive \ce\ many-one degree containing a -maximal set. The proof handles the simple cases via known results and develops a duplicate-cover method for the remaining -maximal types in the classification of Cholak, Gerdes, and Lange.
Cite
@article{arxiv.2604.15949,
title = {\texorpdfstring{$D$}{D}-maximal many-one degrees contain least finite-one degrees},
author = {Patrizio Cintioli},
journal= {arXiv preprint arXiv:2604.15949},
year = {2026}
}
Comments
31 pages. Companion paper to arXiv:2604.10879