Crossref
DECIDABILITY OF SOME COMPLICATED STRUCTURES DEFINABLE IN math script C T$\mathbb{C}(T)$
The Journal of Symbolic Logic · 30.10.2026 · 1-15
DOI: 10.1017/jsl.2026.10279 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Journal of Symbolic Logic, online erschienen am 30.10.2026. Verfasst von THOMAS SCANLON.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
SCANLON, T. (2026). DECIDABILITY OF SOME COMPLICATED STRUCTURES DEFINABLE IN math script C T$\mathbb{C}(T)$. The Journal of Symbolic Logic, 1-15. https://doi.org/10.1017/jsl.2026.10279
Vancouver
SCANLON T. DECIDABILITY OF SOME COMPLICATED STRUCTURES DEFINABLE IN math script C T$\mathbb{C}(T)$. The Journal of Symbolic Logic. 2026:1-15. doi:10.1017/jsl.2026.10279
BibTeX
@article{SCANLON2026,
author = {SCANLON, THOMAS},
title = {DECIDABILITY OF SOME COMPLICATED STRUCTURES DEFINABLE IN math script C T$\mathbbC(T)$},
journal = {The Journal of Symbolic Logic},
year = {2026},
pages = {1--15},
doi = {10.1017/jsl.2026.10279}
}
EUVIMED