Abstract
We give a complete proof of the consistency of the existence of a universal graph of powerλ, whereκ =κ <κ <λ = cfλ < 2κ are arbitrary.
Similar content being viewed by others
References
U. Abraham, M. Rubin and S. Shelah,On the consistency of some partition theorems for continuous coloring and the structure of ℵf 1-dense real order type, Ann. Pure Appl. Logic29 (1985), 123–206.
J. Baumgartner,Almost disjoint sets, the dense set problem and the partition calculus, Ann. Math. Logic9 (1976), 401–439.
W. B. Easton,Powers of regular cardinals, Ann. Math. Logic1 (1970), 139–178.
R. Grossberg and S. Shelah,On universal locally finite groups, Isr. J. Math.44 (1983), 289–302.
A. H. Mekler,Universal structures in power ℵ1, J. Symb. Logic, to appear.
S. Shelah,Classification Theory and the Number of Non-isomorphic Models, North-Holland, Amsterdam, 1978, 542 + xvi pp.
S. Shelah,Independence results, J. Symb. Logic45 (1980), 563–573.
S. Shelah,Some results in set theory, Abstracts Am. Math. Soc. (1982), 522.
S. Shelah,Universal graphs without instances of CH, Ann. Pure Appl. Logic26 (1984), 75–87.
Author information
Authors and Affiliations
Additional information
The author would like to thank the NSF for partially supporting this research, Alice Leonhardt for the beautiful typing, and M. Kojman for proofreading. Publication No. 175A.
The proof in the second section of [9] is flawed.
Rights and permissions
About this article
Cite this article
Shelah, S. Universal graphs without instances of CH: Revisited. Israel J. Math. 70, 69–81 (1990). https://doi.org/10.1007/BF02807219
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02807219