Independence relations in randomizations

2014/09/04 by Uri Andrews, Andrews, Uri, Isaac Goldbring +3
Computer Science · Mathematics · #Advanced Algebra and Logic #Advanced Topology and Set Theory #FOS: Mathematics #Logic (math.LO) #math.LO #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.1409.1531

45 pages

arxiv created 2014/09/04 · openalex publication_date 2014/09/04 · arxiv updated 2014/09/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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 study various notions of independence in models of T^R.

Related

• Independence in randomizations
• Algebraic Independence Relations in Randomizations
• Definable closure in randomizations
• Simple Models of Randomization and Preservation Theorems
• Axiomatic Theory of Independence Relations in Model Theory