COMPUTABLE PRESENTATIONS OF RANDOMIZATIONS
The Journal of Symbolic Logic · 10.07.2026 · 1-21
DOI: 10.1017/jsl.2026.10233 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Journal of Symbolic Logic, online erschienen am 10.07.2026. Verfasst von NICOLAS CUERVO OVALLE und 1 weiteren Autor:innen.
Abstract (Originalsprache)
We initiate the effective metric structure theory of Keisler randomizations. We show that a classical countable structure M $\mathcal M$ script upper M has a decidable presentation if and only if its Borel randomization M [ 0 , 1 ) $\mathcal {M}^{[0,1)}$ script upper M Superscript left bracket 0 comma 1 right parenthesis has a computable presentation for which the constant functions are uniformly computable points. We determine a sufficient condition for which the uniform computability of the constant functions can be dropped. We show that when M $\mathcal M$ script upper M is effectively ω $\omega $ omega -categorical, then M [ 0 , 1 ) $\mathcal {M}^{[0,1)}$ script upper M Superscript left bracket 0 comma 1 right parenthesis is computably categorical, that is, has a unique computable presentation up to computable isomorphism. A special case of this result is that the unique separable atomless probability algebra is computably categorical. Finally, we show that all randomizations admit effective quantifier elimination.
Zitieren
APA
OVALLE, N. C., & GOLDBRING, I. (2026). COMPUTABLE PRESENTATIONS OF RANDOMIZATIONS. The Journal of Symbolic Logic, 1-21. https://doi.org/10.1017/jsl.2026.10233
Vancouver
OVALLE NC, GOLDBRING I. COMPUTABLE PRESENTATIONS OF RANDOMIZATIONS. The Journal of Symbolic Logic. 2026:1-21. doi:10.1017/jsl.2026.10233
BibTeX
@article{OVALLE2026,
author = {OVALLE, NICOLAS CUERVO and GOLDBRING, ISAAC},
title = {COMPUTABLE PRESENTATIONS OF RANDOMIZATIONS},
journal = {The Journal of Symbolic Logic},
year = {2026},
pages = {1--21},
doi = {10.1017/jsl.2026.10233}
}
EUVIMED