Skip to main content
Log in

Definable connectedness of randomizations of groups

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Andrews, U., Goldbring, I., Keisler, H.J.: Definable closure in randomizations. Ann. Pure Appl. Log. 166(3), 325–342 (2015)

    Article  MathSciNet  Google Scholar 

  2. Andrews, U., Keisler, H.J.: Separable models of randomizations. J. Symb. Log. 80(4), 1149–1181 (2015)

    Article  MathSciNet  Google Scholar 

  3. Ben Yaacov, I.: Continuous and random Vapnik–Chervonenkis classes. Isr. J. Math. 173, 309–333 (2009)

    Article  MathSciNet  Google Scholar 

  4. Ben Yaacov, I.: Stability and stable groups in continuous logic. J. Symb. Log. 75(3), 1111–1136 (2010)

    Article  MathSciNet  Google Scholar 

  5. Ben Yaacov, I.: On theories of random variables. Isr. J. Math. 194, 957–1012 (2013)

    Article  MathSciNet  Google Scholar 

  6. Ben Yaacov, I., Berenstein, A., Henson, C.W., Usvyatsov, A.: Model Theory for Metric Structures, Model Theory with Applications to Algebra and Analysis, volume 2. In: Chatzidakis, Z., Macpherson, D., Pillay, A., Wilkie, A. (eds.) London Math Society Lecture Note Series, vol. 350, Cambridge University Press, 2008, pp. 315–427

  7. Ben Yaacov, I., Keisler, H.J.: Randomizations of models as metric structures. Confluentes Mathematici 1(2), 197–223 (2009)

    Article  MathSciNet  Google Scholar 

  8. Buechler, S.: Essential Stability Theory, Perspectives in Mathematical Logic. Springer-Verlag (1996)

  9. Keisler, H.J.: Randomizing a model. Adv. Math. 143(1), 124–158 (1999)

    Article  MathSciNet  Google Scholar 

  10. Poizat, B.: Paires de structures stables. J. Symb. Log. 48, 234–249 (1983)

    MathSciNet  MATH  Google Scholar 

  11. Poizat, B.: Stable groups, Mathematical Surveys and Monographs, American Mathematical Society, 2001

  12. Simon, P.: A Guide to NIP Theories, Lecture Notes in Logic. Cambridge University Press (2015)

  13. Wagner, F.: Stable groups, London Mathematical society Lecture Note Series, Cambridge University Press, 1997

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alexander Berenstein.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This paper is the result of the second author master thesis at Universidad de los Andes, Bogotá. We would like to thank Itaï Ben Yaacov for suggesting this problem and for helpful discussions.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Berenstein, A., Muñoz, J.D. Definable connectedness of randomizations of groups. Arch. Math. Logic 60, 1019–1041 (2021). https://doi.org/10.1007/s00153-021-00773-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-021-00773-8

Keywords

Mathematics Subject Classification

Navigation