Almost Indiscernible Sequences and Convergence of Canonical Bases

Journal of Symbolic Logic 79 (2):460-484 (2014)
  Copy   BIBTEX

Abstract

We give a model-theoretic account for several results regarding sequences of random variables appearing in Berkes and Rosenthal [12]. In order to do this,•We study and compare three notions of convergence of types in a stable theory: logic convergence, i.e., formula by formula, metric convergence (both already well studied) and convergence of canonical bases. In particular, we characterise א0-categorical stable theories in which the last two agree.•We characterise sequences that admit almost indiscernible sub-sequences.•We apply these tools to the theory of atomless random variables (ARV). We characterise types and notions of convergence of types as conditional distributions and weak/strong convergence thereof, and obtain, among other things, the Main Theorem of Berkes and Rosenthal.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,225

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
2016-06-30

Downloads
25 (#879,283)

6 months
9 (#482,469)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Automorphism groups of randomized structures.Tomás Ibarlucía - 2017 - Journal of Symbolic Logic 82 (3):1150-1179.

Add more citations

References found in this work

On perturbations of continuous structures.Itaï Ben Yaacov - 2008 - Journal of Mathematical Logic 8 (2):225-249.

Add more references