arXiv:1304.7797 Abstract | arXiv Analytics

arXiv:1304.7797 [math.LO]Abstract References Reviews Resources

Definable closure in randomizations

Uri Andrews, Isaac Goldbring, H. Jerome Keisler

Published 2013-04-29Version 1

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.

Comments: 19 pages

Categories: math.LO

Keywords: definable closure, randomization, complete first order theory, random elements, complete continuous theory

Related articles: Most relevant | Search more

arXiv:1409.1531 [math.LO] (Published 2014-09-04)

Independence relations in randomizations

Uri Andrews, Isaac Goldbring, H. Jerome Keisler

arXiv:2101.11849 [math.LO] (Published 2021-01-28)

On computable aspects of algebraic and definable closure

Nathanael Ackerman, Cameron Freer, Rehana Patel

arXiv:math/9201240 [math.LO] (Published 1990-01-15)

Categoricity over P for first order T or categoricity for phi in L_{omega_1 omega} can stop at aleph_k while holding for aleph_0, ..., aleph_{k-1}