Metraipolis › archive › dc_291ee5595361

Some variants of function domination — arXiv:2611.01420

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.01420
License (as archived)
CC0-1.0
Archived
2026-11-03T11:39:29.280Z
SHA-256 of the archived text
cfac8cd5a9a47dfe687d558b2d259b6366e3b5e6fd3b9c405f77900dc7d9be34
Stable URL of this page
https://metraipolis.com/documento/dc_291ee5595361

How to cite

Some variants of function domination — arXiv:2611.01420 — arXiv (en), https://arxiv.org/abs/2611.01420 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_291ee5595361 (Metraipolis archive dc_291ee5595361, sha256 cfac8cd5a9a47dfe687d558b2d259b6366e3b5e6fd3b9c405f77900dc7d9be34)
BibTeX
@misc{dc291ee5595361,
  title = {Some variants of function domination — arXiv:2611.01420},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.01420},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_291ee5595361; sha256 cfac8cd5a9a47dfe687d558b2d259b6366e3b5e6fd3b9c405f77900dc7d9be34},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01420. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We investigate whether classical recursion-theoretic notions defined by function domination remain unchanged when success is required only on sets of prescribed asymptotic density. We establish robustness for many such notions and uncover unexpected connections between familiar degree properties by comparing upper and lower density. In contrast, pdomination, as defined by Chong, Hoi, Stephan and Turetsky, is not robust under density weakenings. We also answer a question of Kjos-Hanssen and Nies by characterizing superhighness as domination with a threshold boundedly limit recursive in the oracle. As an application, we introduce supermaximal sets, a strengthening of maximality whose degrees are exactly the superhigh r.e. degrees.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.LO, nuovi lavori del giorno).
Categorie arXiv: Logic (math.LO).
Pagina del lavoro: https://arxiv.org/abs/2611.01420 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T11:05:52.152Z dalla pagina https://arxiv.org/list/math.LO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).