THE FAILURE OF SELMAN’S THEOREM FOR HYPERENUMERATION REDUCIBILITY
The Journal of Symbolic Logic · 14.04.2026 · 1-19
DOI: 10.1017/jsl.2026.10204 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Journal of Symbolic Logic, online erschienen am 14.04.2026. Verfasst von JOSIAH JACOBSEN-GROCOTT. Die Arbeit nennt 12 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Hyperenumeration reducibility was first introduced by Sanchis [11]. The relationship between hyperenumeration and hyperarithmetic reducibility shares many parallels with the relationship between enumeration and Turing reducibility. We ask if this relationship can be pushed to prove and analog of Selman’s Theorem for hyperenumeration reducibility. By studying e-pointed trees in Baire space we are able to get a counter example. An e-pointed tree T is a tree with no dead ends and the property that every path in T enumerates T . We prove that if T is an e-pointed tree then for all X if T is $\Pi ^1_1$ in X then $\overline {T}$ is $\Pi ^1_1$ in X . We build an e-pointed tree T such that $\overline {T}$ is not hyperenumeration reducible to T .
Zitieren
APA
JACOBSEN-GROCOTT, J. (2026). THE FAILURE OF SELMAN’S THEOREM FOR HYPERENUMERATION REDUCIBILITY. The Journal of Symbolic Logic, 1-19. https://doi.org/10.1017/jsl.2026.10204
Vancouver
JACOBSEN-GROCOTT J. THE FAILURE OF SELMAN’S THEOREM FOR HYPERENUMERATION REDUCIBILITY. The Journal of Symbolic Logic. 2026:1-19. doi:10.1017/jsl.2026.10204
BibTeX
@article{JACOBSENGROCOTT2026,
author = {JACOBSEN-GROCOTT, JOSIAH},
title = {THE FAILURE OF SELMAN’S THEOREM FOR HYPERENUMERATION REDUCIBILITY},
journal = {The Journal of Symbolic Logic},
year = {2026},
pages = {1--19},
doi = {10.1017/jsl.2026.10204}
}
EUVIMED