Definable closure in randomizations

Annals of Pure and Applied Logic 166 (3):325-341 (2015)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,809

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
2015-08-28

Downloads
25 (#877,287)

6 months
8 (#575,465)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Independence in randomizations.Uri Andrews, Isaac Goldbring & H. Jerome Keisler - 2019 - Journal of Mathematical Logic 19 (1):1950005.
Definable connectedness of randomizations of groups.Alexander Berenstein & Jorge Daniel Muñoz - 2021 - Archive for Mathematical Logic 60 (7):1019-1041.
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

Thorn-forking in continuous logic.Clifton Ealy & Isaac Goldbring - 2012 - Journal of Symbolic Logic 77 (1):63-93.
Pseudofinite and Pseudocompact Metric Structures.Isaac Goldbring & Vinicius Cifú Lopes - 2015 - Notre Dame Journal of Formal Logic 56 (3):493-510.
Definable Operators on Hilbert Spaces.Isaac Goldbring - 2012 - Notre Dame Journal of Formal Logic 53 (2):193-201.

Add more references