Separable models of randomizations

&
Journal of Symbolic Logic 80 (4):1149-1181 (2015)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1017/jsl.2015.33

Links

PhilArchive



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

External links

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

Through your library

My notes

Similar books and articles

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.
Review: H. Jerome Keisler, Ultraproducts and Saturated Models. [REVIEW]James R. Geiser - 1970 - Journal of Symbolic Logic 35 (4):584-585.
Review: H. Jerome Keisler, Some Applications of the Theory of Models to Set Theory. [REVIEW]Azriel Levy - 1967 - Journal of Symbolic Logic 32 (3):410-410.
Review: H. Jerome Keisler, Elementary Calculus; H. Jerome Keisler, Foundations of Infinitesimal Calculus. [REVIEW]Peter A. Loeb - 1981 - Journal of Symbolic Logic 46 (3):673-676.
Review: H. Jerome Keisler, Good Ideals in Fields of Sets; H. Jerome Keisler, Ideals with Prescribed Degree of Goodness. [REVIEW]Victor Harnik - 1974 - Journal of Symbolic Logic 39 (2):332-333.
Review: H. Jerome Keisler, Unions of Relational Systems; Jan Mycielski, On Unions of Denumerable Models. [REVIEW]Martin Helling - 1968 - Journal of Symbolic Logic 33 (2):287-287.
H. Jerome Keisler. Theory of models with generalized atomic formulas. The journal of symbolic logic, vol. 25 no. 1 (for 1960, pub. 1961), pp. 1–26. [REVIEW]H. Jerome Keisler - 1970 - Journal of Symbolic Logic 34 (4):651-651.
H. Jerome Keisler. Theory of models with generalized atomic formulas. The journal of symbolic logic, vol. 25 no. 1 (for 1960, pub. 1961), pp. 1–26. [REVIEW]Martin Helling - 1970 - Journal of Symbolic Logic 34 (4):651-651.
H. Jerome Keisler. Finite approximations of infinitely long formulas. The theory of models, Proceedings of the 1963 International Symposium at Berkeley, edited by J. W. Addison, Leon Henkin, and Alfred Tarski, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam1965, pp. 158–169. - H. Jerome Keisler. Some applications of infinitely long formulas. The journal of symbolic logic, vol. 30 , pp. 339–349. [REVIEW]Carol Karp - 1969 - Journal of Symbolic Logic 34 (1):129-130.
Review: H. Jerome Keisler, Model Theory. [REVIEW]C. C. Chang - 1973 - Journal of Symbolic Logic 38 (4):648-648.

Analytics

Added to PP
2016-06-30

Downloads
14 (#264,824)

6 months
3 (#1,723,834)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

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

Model Theory.Michael Makkai, C. C. Chang & H. J. Keisler - 1991 - Journal of Symbolic Logic 56 (3):1096.
Vaught’s conjecture for superstable theories of finite rank.Steven Buechler - 2008 - Annals of Pure and Applied Logic 155 (3):135-172.
Some Theories Having Countably Many Countable Models.Nigel J. Cutland - 1977 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 23 (7-12):105-110.
Some Theories Having Countably Many Countable Models.Nigel J. Cutland - 1976 - Mathematical Logic Quarterly 23 (7‐12):105-110.

Add more references