ESCAPING TENNENBAUM’S THEOREM AND A STRONG JUMP INVERSION THEOREM
The Journal of Symbolic Logic · 01.06.2026 · 1-25
DOI: 10.1017/jsl.2026.10219 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Journal of Symbolic Logic, online erschienen am 01.06.2026. Verfasst von DUARTE MAIA. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Tennenbaum’s theorem states that PA does not admit any nonstandard computable model. In 2022, Pakhomov proved that this theorem is fragile in regards to how PA is expressed, by constructing a theory that is definitionally equivalent to PA (roughly: “it’s PA but with a different choice of signature”) for which there is a computable nonstandard model. He showed that this fragility does not extend to true arithmetic (any nonstandard model of a theory definitionally equivalent to Th(N) is not computable), but the question of whether this fragility extends to fragments of PA of intermediate strength was left open. We show that it does, by constructing a sequence of theories T n $T^n$ upper T Superscript n which are definitionally equivalent to: “PA plus all Π n $\Pi _n$ normal upper Pi Subscript n truths,” all of which admit computable nonstandard models. In the process, we produce a general-purpose theorem for strong jump inversion. Besides applying this theorem to obtain our novel result, we show that several known results from the literature can be seen as direct applications of our theorem.
Zitieren
APA
MAIA, D. (2026). ESCAPING TENNENBAUM’S THEOREM AND A STRONG JUMP INVERSION THEOREM. The Journal of Symbolic Logic, 1-25. https://doi.org/10.1017/jsl.2026.10219
Vancouver
MAIA D. ESCAPING TENNENBAUM’S THEOREM AND A STRONG JUMP INVERSION THEOREM. The Journal of Symbolic Logic. 2026:1-25. doi:10.1017/jsl.2026.10219
BibTeX
@article{MAIA2026,
author = {MAIA, DUARTE},
title = {ESCAPING TENNENBAUM’S THEOREM AND A STRONG JUMP INVERSION THEOREM},
journal = {The Journal of Symbolic Logic},
year = {2026},
pages = {1--25},
doi = {10.1017/jsl.2026.10219}
}
EUVIMED