Saturated families
HTML articles powered by AMS MathViewer
- by Martin Goldstern, Haim I. Judah and Saharon Shelah PDF
- Proc. Amer. Math. Soc. 111 (1991), 1095-1104 Request permission
Abstract:
We will show that $V = K$ implies that there exist saturated (or completely separable) almost disjoint families on sets of any infinite cardinality.References
-
B. Balcar, J. Dockalkova, and P. Simon, Almost disjoint families of countable sets, Finite and Infinite Sets, Proc. Coll. Math. Soc. J. Bolyai, I, Eger, 1981.
- P. Erdős and A. Hajnal, Unsolved problems in set theory, Axiomatic Set Theory (Proc. Sympos. Pure Math., Vol. XIII, Part I, Univ. California, Los Angeles, Calif., 1967) Amer. Math. Soc., Providence, R.I., 1971, pp. 17–48. MR 0280381
- P. Erdős and A. Hajnal, Unsolved and solved problems in set theory, Proceedings of the Tarski Symposium (Proc. Sympos. Pure Math., Vol. XXV, Univ. California, Berkeley, Calif., 1971) Amer. Math. Soc., Providence, R.I., 1974, pp. 269–287. MR 0357122
- A. Hajnal, I. Juhász, and L. Soukup, On saturated almost disjoint families, Comment. Math. Univ. Carolin. 28 (1987), no. 4, 629–633. MR 928677
- Thomas Jech, Set theory, Pure and Applied Mathematics, Academic Press [Harcourt Brace Jovanovich, Publishers], New York-London, 1978. MR 506523 P. Komjath, Dense systems of almost disjoint sets, Finite and Infinite Sets, Proc. Coll. Math. Soc. J. Bolyai, II, Eger, 1981.
Additional Information
- © Copyright 1991 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 111 (1991), 1095-1104
- MSC: Primary 03E05; Secondary 54A25
- DOI: https://doi.org/10.1090/S0002-9939-1991-1052573-0
- MathSciNet review: 1052573