Switch to: References

Add citations

You must login to add citations.
  1. Scattered sentences have few separable randomizations.Uri Andrews, Isaac Goldbring, Sherwood Hachtman, H. Jerome Keisler & David Marker - 2020 - Archive for Mathematical Logic 59 (5-6):743-754.
    In the paper Randomizations of Scattered Sentences, Keisler showed that if Martin’s axiom for aleph one holds, then every scattered sentence has few separable randomizations, and asked whether the conclusion could be proved in ZFC alone. We show here that the answer is “yes”. It follows that the absolute Vaught conjecture holds if and only if every \-sentence with few separable randomizations has countably many countable models.
    Download  
     
    Export citation  
     
    Bookmark  
  • Independence in randomizations.Uri Andrews, Isaac Goldbring & H. Jerome Keisler - 2019 - Journal of Mathematical Logic 19 (1):1950005.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Automorphism groups of randomized structures.Tomás Ibarlucía - 2017 - Journal of Symbolic Logic 82 (3):1150-1179.
    We study automorphism groups of randomizations of separable structures, with focus on the ℵ0-categorical case. We give a description of the automorphism group of the Borel randomization in terms of the group of the original structure. In the ℵ0-categorical context, this provides a new source of Roelcke precompact Polish groups, and we describe the associated Roelcke compactifications. This allows us also to recover and generalize preservation results of stable and NIP formulas previously established in the literature, via a Banach-theoretic translation. (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Definable connectedness of randomizations of groups.Alexander Berenstein & Jorge Daniel Muñoz - 2021 - Archive for Mathematical Logic 60 (7):1019-1041.
    We study randomizations of definable groups. Whenever the underlying theory is stable or NIP and the group is definably amenable, we show its randomization is definably connected.
    Download  
     
    Export citation  
     
    Bookmark