Definable connectedness of randomizations of groups

Archive for Mathematical Logic 60 (7):1019-1041 (2021)
  Copy   BIBTEX

Abstract

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,590

External links

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

Through your library

Similar books and articles

Pseudo definably connected definable sets.Jafar S. Eivazloo & Somayyeh Tari - 2016 - Mathematical Logic Quarterly 62 (3):241-248.
On the Euler characteristic of definable groups.Mário J. Edmundo - 2011 - Mathematical Logic Quarterly 57 (1):44-46.
Topological dynamics and definable groups.Anand Pillay - 2013 - Journal of Symbolic Logic 78 (2):657-666.
Splitting definably compact groups in o-minimal structures.Marcello Mamino - 2011 - Journal of Symbolic Logic 76 (3):973 - 986.
A remark on divisibility of definable groups.Mário J. Edmundo - 2005 - Mathematical Logic Quarterly 51 (6):639-641.
Automorphism groups of randomized structures.Tomás Ibarlucía - 2017 - Journal of Symbolic Logic 82 (3):1150-1179.

Analytics

Added to PP
2021-05-06

Downloads
26 (#145,883)

6 months
22 (#694,291)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Paires de structures Stables.Bruno Poizat - 1983 - Journal of Symbolic Logic 48 (2):239-249.
Separable models of randomizations.Uri Andrews & H. Jerome Keisler - 2015 - Journal of Symbolic Logic 80 (4):1149-1181.
Definable closure in randomizations.Uri Andrews, Isaac Goldbring & H. Jerome Keisler - 2015 - Annals of Pure and Applied Logic 166 (3):325-341.
Stability and stable groups in continuous logic.Itaï Ben Yaacov - 2010 - Journal of Symbolic Logic 75 (3):1111-1136.

Add more references