Independence in randomizations
Uri Andrews, Isaac Goldbring, and H. Jerome Keisler

TL;DR
This paper explores the properties of independence relations in the randomization of a complete first order theory, showing that under certain conditions, the randomized theory exhibits real rosiness and a strict independence relation.
Contribution
It demonstrates that if the original theory has the exchange property and algebraic closure equals definable closure, then its randomization has a strict independence relation and is real rosy.
Findings
Randomization preserves certain independence properties.
If T has exchange and acl=dcl, then T^R has a strict independence relation.
For o-minimal T, T^R is real rosy.
Abstract
The randomization of a complete first order theory is the complete continuous theory with two sorts, a sort for random elements of models of , and a sort for events in an underlying atomless probability space. We study independence relations and related ternary relations on the randomization of . We show that if has the exchange property and , then has a strict independence relation in the home sort, and hence is real rosy. In particular, if is o-minimal, then is real rosy.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Advanced Topology and Set Theory · Algorithms and Data Compression
