Skip to main content
SpringerLink
Log in

Suslin’s Problem

  • Chapter
  • First Online:
Combinatorial Set Theory

Part of the book series: Springer Monographs in Mathematics ((SMM))

  • 2887 Accesses

Abstract

In this chapter we investigate Suslin’s Problem, which is the question whether every linearly ordered set which is dense, unbounded, complete, and satisfies the countable chain condition is also separable. It will be shown that the answer to Suslin’s Problem is independent of ZFC.

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. Tomek Bartoszyński and Haim Judah, Set Theory: on the structure of the real line, A. K. Peters, Wellesley, 1995.

    Google Scholar 

  2. Thomas Jech, Non-provability of Souslin’s hypothesis, Commentationes Mathematicae Universitatis Carolinae, vol. 8 (1967), 291–305.

    Google Scholar 

  3. _________ , Set Theory, [Pure and Applied Mathematics], Academic Press, London, 1978.

    Google Scholar 

  4. _________ , Set Theory ,The Third Millennium Edition, Revised and Expanded, [Springer Monographs in Mathematics], Springer-Verlag, Berlin, 2003.

    Google Scholar 

  5. Ronald Björn Jensen, Souslin’s hypothesis is incompatible with V=L, Notices of the American Mathematical Society, vol. 15 (1968), 935.

    Google Scholar 

  6. _________ , The fine structure of the constructible hierarchy, Annals of Pure and Applied Logic, vol. 4 (1972), 229–308; erratum, ibid. 4 (1972), 443.

    Google Scholar 

  7. Kenneth Kunen, Set Theory, an Introduction to Independence Proofs, [Studies in Logic and the Foundations of Mathematics 102], North-Holland, Amsterdam, 1983.

    Google Scholar 

  8. Donald A. Martin and Robert M. Solovay, Internal Cohen extensions, Annals of Mathematical Logic, vol. 2 (1970), 143–178.

    Google Scholar 

  9. Saharon Shelah, Can you take Solovay’s inaccessible away?, Israel Journal of Mathematics, vol. 48 (1984), 1–47.

    Google Scholar 

  10. Michail Suslin, Problème 3, Fundamenta Mathematicae, vol. 1 (1920), 223.

    Google Scholar 

  11. Stanley Tennenbaum, Souslin’s problem, Proceedings of the National Academy of Sciences of the United States of America, vol. 59 (1968), 60–63.

    Google Scholar 

  12. Stevo Todorčević, Partitioning pairs of countable ordinals, Acta Mathematica, vol. 159 (1987), 261–294.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, ETH Zurich, Zurich, Switzerland

    Lorenz J. Halbeisen

Authors
  1. Lorenz J. Halbeisen
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Halbeisen, L.J. (2017). Suslin’s Problem. In: Combinatorial Set Theory. Springer Monographs in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-319-60231-8_20

Download citation

Publish with us

Policies and ethics

Search

Navigation