A COMPLETE BOUNDED THEORY WITH UNBOUNDED TYPES
The Journal of Symbolic Logic · 23.04.2026 · 1-14
DOI: 10.1017/jsl.2026.10208 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Journal of Symbolic Logic, online erschienen am 23.04.2026. Verfasst von HONGYU ZHU. Die Arbeit nennt 11 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
One measure of the complexity of a first-order theory, and similarly a type, is the complexity of the formulas required to axiomatize it. We say that a theory is bounded if there is an axiomatization involving only $\forall _n$ -formulas for some finite n , and unbounded otherwise. One might expect bounded theories to have only bounded types. In fact, an analogue holds in infinitary logic, where the complexity of a Scott sentence roughly agrees with the complexity of the most complicated automorphism orbit. Our main result, however, shows that this is not the case in the first-order setting: Namely, there can be a bounded theory, in fact $\forall _1$ -axiomatizable, which has unbounded types.
Zitieren
APA
ZHU, H. (2026). A COMPLETE BOUNDED THEORY WITH UNBOUNDED TYPES. The Journal of Symbolic Logic, 1-14. https://doi.org/10.1017/jsl.2026.10208
Vancouver
ZHU H. A COMPLETE BOUNDED THEORY WITH UNBOUNDED TYPES. The Journal of Symbolic Logic. 2026:1-14. doi:10.1017/jsl.2026.10208
BibTeX
@article{ZHU2026,
author = {ZHU, HONGYU},
title = {A COMPLETE BOUNDED THEORY WITH UNBOUNDED TYPES},
journal = {The Journal of Symbolic Logic},
year = {2026},
pages = {1--14},
doi = {10.1017/jsl.2026.10208}
}
EUVIMED