EUVIMEDEUVIMED entdecken
Crossref

CHARACTERISING SJT REDUCIBILITY

NOAM GREENBERG, ANDRÉ NIES, DANIEL TURETSKY

The Journal of Symbolic Logic · 24.06.2026 · 1-23

DOI: 10.1017/jsl.2026.10228 ↗

Kurz gefasst

Fachartikel in der Zeitschrift The Journal of Symbolic Logic, online erschienen am 24.06.2026. Verfasst von NOAM GREENBERG und 2 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

SJT reducibility between sets A , B ⊆ N $A,B \subseteq \mathbb N$ upper A comma upper B subset of or equal to double struck upper N is defined by A ≤ S J T B $A \le _{SJT} B$ upper A less than or equals Subscript upper S upper J upper T Baseline upper B if for each computable function h that is unbounded and nondecreasing, there is an h -bounded uniformly B -c.e. trace ( T n ) n ∈ N $(T_n)_{n \in \mathbb N} $ left parenthesis upper T Subscript n Baseline right parenthesis Subscript n element of double struck upper N such that for each n , the value J A ( n ) $J^A(n)$ upper J Superscript upper A Baseline left parenthesis n right parenthesis of the jump is in T n $T_n$ upper T Subscript n , if defined. This reducibility is slightly weaker than Turing reducibility. We study SJT reducibility, and as a main result give several characterisations of it on the K -trivial sets. This is the first case of extending the three lowness paradigms, weak as an oracle, computed by many, and inert, to the setting of weak reducibilities.

Zitieren

APA

GREENBERG, N., NIES, A., & TURETSKY, D. (2026). CHARACTERISING SJT REDUCIBILITY. The Journal of Symbolic Logic, 1-23. https://doi.org/10.1017/jsl.2026.10228

Vancouver

GREENBERG N, NIES A, TURETSKY D. CHARACTERISING SJT REDUCIBILITY. The Journal of Symbolic Logic. 2026:1-23. doi:10.1017/jsl.2026.10228

BibTeX
@article{GREENBERG2026,
  author = {GREENBERG, NOAM and NIES, ANDRÉ and TURETSKY, DANIEL},
  title = {CHARACTERISING SJT REDUCIBILITY},
  journal = {The Journal of Symbolic Logic},
  year = {2026},
  pages = {1--23},
  doi = {10.1017/jsl.2026.10228}
}
Kostenlos starten →