Skip to main content
Log in

Scattered sentences have few separable randomizations

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

Abstract

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 \(L_{\omega _1\omega }\)-sentence with few separable randomizations has countably many countable models.

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

Notes

  1. Here, countably many means of cardinality at most \(\aleph _0\).

  2. In [2], being scattered is defined as not having perfectly many countable models, and Lemma 3.4 says that if \(\varphi \) is scattered as defined in Morley [8] (and here), then \(\varphi \) is scattered as defined in [2].

References

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

    Article  MathSciNet  Google Scholar 

  2. Baldwin, J., Friedman, S., Koerwien, M., Laskowski, M.: Three red herrings around Vaught’s conjecture. Trans. Am. Math. Soc. 368, 3673–3694 (2016)

    Article  MathSciNet  Google Scholar 

  3. Ben Yaacov, I., Berenstein, A., Henson, C.W., Usvyatsov, A.: Model theory for metric structures. In: Model Theory with Applications to Algebra and Analysis. London Mathematical Society Lecture Note Series, vols. 2, 350, pp. 315–427 (2008)

  4. Eagle, C., Vignati, A.: Saturation and elementary equivalence of \(C^*\)-algebras. J. Funct. Anal. 269, 2631–2664 (2015)

    Article  MathSciNet  Google Scholar 

  5. Jech, T.: Set Theory. Springer, New York (2003)

    MATH  Google Scholar 

  6. Keisler, H.J.: Model Theory for Infinitary Logic. North-Holland, Amsterdam (1971)

    MATH  Google Scholar 

  7. Keisler, H.J.: Randomizations of scattered sentences. In: Iovino, J. (ed.) Beyond First Order Model Theory, pp. 189–220. CRC Press, Boca Raton (2000)

    Google Scholar 

  8. Morley, M.: The number of countable models. J. Symb. Log. 35, 14–18 (1970)

    Article  MathSciNet  Google Scholar 

  9. Scott, D.: Logic with denumerably long formulas and finite strings of quantifiers. In: Addison, J., et al. (eds.) The Theory of Models, pp. 329–341. North-Holland, Amsterdam (1965)

    Google Scholar 

  10. Steel, J.R.: On Vaught’s conjecture. In: Kechris, A.S., Moschovakis, Y.N. (eds.) Cabal Seminar 76–77. Lecture Notes in Mathematics, vol. 68, pp. 193–208. Springer, New York (1978)

    Chapter  Google Scholar 

  11. Vaught, R.L.: Denumerable models of complete theories. In: Infinitistic Methods, Warsaw, pp. 303–321 (1961)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Isaac Goldbring.

Additional information

Publisher's Note

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

The work of Andrews was partially supported by NSF Grant DMS-1600228. The work of Goldbring was partially supported by NSF CAREER Grant DMS-1349399. Hachtman was partially supported by NSF Grant DMS-1246844.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Andrews, U., Goldbring, I., Hachtman, S. et al. Scattered sentences have few separable randomizations. Arch. Math. Logic 59, 743–754 (2020). https://doi.org/10.1007/s00153-020-00718-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-020-00718-7

Keywords

Mathematics Subject Classification

Navigation