Skip to content
DraconiticResearch
Search Sources API
201,683 studies31 sourcesUpdated 23 min ago
PreprintarXiv licencearXiv

Every Nonrecursive Many-One Degree Contains Either One or Infinitely Many Finite-One Degrees

Abstract

This paper proves that every nonrecursive many-one degree contains either exactly one or infinitely many finite-one degrees. This gives a negative answer to Open Question 2 of Richter, Stephan, and Zhang~\cite[p.~17]{RSZ}. Earlier work established that, for almost every A⊆N with respect to the standard product measure on 2N, the degree [A]m contains an infinite antichain of finite-one degrees~\cite{Cintioli}. Thus the question had already received an almost-sure negative answer; the present theorem settles it for every nonrecursive many-one degree.

Related

  1. A Computably Enumerable tt-Degree Without Computably Enumerable Irreducible m-Degrees
    Patrizio Cintioli
    arXivPreprintarXiv licenceFull textLogic & foundationsarXiv
  2. A Bounded Finite-One Degree Whose One-One Degrees Form Exactly a Dense Linear Order
    Patrizio Cintioli
    arXivPreprintarXiv licenceFull textLogic & foundationsarXiv
  3. Seed thresholds and degree variance in heterogeneous bootstrap percolation with growing degrees
    Aleksandr Rodionov
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsProbabilityarXiv
  4. Infinite-variation Lévy processes are either strongly eroded or abrupt
    Jorge González Cázares, David Kramer-Bang, Aleksandar Mijatović
    arXivPreprintCC BY-SA 4.0Full textProbabilityarXiv
  5. Every introenumerable set contains a uniformly introreducible subset
    Patrizio Cintioli
    arXivPreprintarXiv licenceFull textLogic & foundationsarXiv
BibTeX
@misc{cintioli2026every,
  title = {{Every Nonrecursive Many-One Degree Contains Either One or Infinitely Many Finite-One Degrees}},
  author = {Patrizio Cintioli},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.00419},
  eprint = {2609.00419},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.00419},
}
RIS
TY  - UNPB
TI  - Every Nonrecursive Many-One Degree Contains Either One or Infinitely Many Finite-One Degrees
AU  - Patrizio Cintioli
PY  - 2026
DA  - 2026/09/01
PB  - arXiv
DO  - 10.48550/arxiv.2609.00419
UR  - https://arxiv.org/abs/2609.00419
AB  - This paper proves that every nonrecursive many-one degree contains either exactly one or infinitely many finite-one degrees. This gives a negative answer to Open Question 2 of Richter, Stephan, and Zhang~\cite[p.~17]{RSZ}. Earlier work established that, for almost every A⊆N with respect to the standard product measure on 2^N, the degree [A]_m contains an infinite antichain of finite-one degrees~\cite{Cintioli}. Thus the question had already received an almost-sure negative answer; the present theorem settles it for every nonrecursive many-one degree.
ER  -