Definable closure in randomizations
Logic
2013-05-01 v1
Abstract
The randomization of a complete first order theory T is the complete continuous theory T^R with two sorts, a sort for random elements of models of T, and a sort for events in an underlying probability space. We give necessary and sufficient conditions for an element to be definable over a set of parameters in a model of T^R.
Keywords
Cite
@article{arxiv.1304.7797,
title = {Definable closure in randomizations},
author = {Uri Andrews and Isaac Goldbring and H. Jerome Keisler},
journal= {arXiv preprint arXiv:1304.7797},
year = {2013}
}
Comments
19 pages