Switch to: Citations

Add references

You must login to add references.
  1. Separable models of randomizations.Uri Andrews & H. Jerome Keisler - 2015 - Journal of Symbolic Logic 80 (4):1149-1181.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Definable closure in randomizations.Uri Andrews, Isaac Goldbring & H. Jerome Keisler - 2015 - Annals of Pure and Applied Logic 166 (3):325-341.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Model theoretic stability and definability of types, after A. grothendieck.Itaï Ben Yaacov - 2014 - Bulletin of Symbolic Logic 20 (4):491-496,.
    We point out how the "Fundamental Theorem of Stability Theory", namely the equivalence between the "non order property" and definability of types, proved by Shelah in the 1970s, is in fact an immediate consequence of Grothendieck's "Criteres de compacite" from 1952. The familiar forms for the defining formulae then follow using Mazur's Lemma regarding weak convergence in Banach spaces.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Almost Indiscernible Sequences and Convergence of Canonical Bases.Itaï Ben Yaacov, Alexander Berenstein & C. Ward Henson - 2014 - Journal of Symbolic Logic 79 (2):460-484.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation