Independence in randomizations

Journal of Mathematical Logic 19 (1):1950005 (2019)
  Copy   BIBTEX

Abstract

The randomization of a complete first-order theory [Formula: see text] is the complete continuous theory [Formula: see text] with two sorts, a sort for random elements of models of [Formula: see text] and a sort for events in an underlying atomless probability space. We study independence relations and related ternary relations on the randomization of [Formula: see text]. We show that if [Formula: see text] has the exchange property and [Formula: see text], then [Formula: see text] has a strict independence relation in the home sort, and hence is real rosy. In particular, if [Formula: see text] is o-minimal, then [Formula: see text] is real rosy.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,561

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2018-12-03

Downloads
34 (#642,736)

6 months
6 (#809,985)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Model Theory.Michael Makkai, C. C. Chang & H. J. Keisler - 1991 - Journal of Symbolic Logic 56 (3):1096.
A geometric introduction to forking and thorn-forking.Hans Adler - 2009 - Journal of Mathematical Logic 9 (1):1-20.
Simplicity in compact abstract theories.Itay Ben-Yaacov - 2003 - Journal of Mathematical Logic 3 (02):163-191.
Properties and Consequences of Thorn-Independence.Alf Onshuus - 2006 - Journal of Symbolic Logic 71 (1):1 - 21.
Thorn-forking in continuous logic.Clifton Ealy & Isaac Goldbring - 2012 - Journal of Symbolic Logic 77 (1):63-93.

View all 9 references / Add more references