Abstract
We extend Jensen’s Theorem that Souslin’s Hypothesis is consistent with CH, by showing that the statement Souslin’s Hypothesis holds in any forcing extension by a measure algebra is consistent with CH. We also formulate a variation of the principle (*) (see [AT97], [Tod00]) for closed sets of ordinals, and show its consistency relative to the appropriate large cardinal hypothesis. Its consistency with CH would extend Silver’s Theorem that, assuming the existence of an inaccessible cardinal, the failure of Kurepa’s Hypothesis is consistent with CH, by its implication that the statement Kurepa’s Hypothesis fails in any forcing extension by a measure algebra is consistent with CH.
Similar content being viewed by others
References
U. Abraham and S. Todorčević, Partition properties of ω 1 compatible with CH, Fundamenta Mathematicae 152 (1997), 165–181.
J. Baumgartner, Unpublished notes.
J. E. Baumgartner, Iterated Forcing, Surveys in Set Theory, Cambridge University Press, Cambridge, 1983, pp. 1–59.
J. Baumgartner, J. Malitz and W. Reinhardt, Embedding trees in the rationals, Proceedings of the National Academy of Sciences of the United States of America 67 (1970), 1748–1753.
T. Carlson and R. Laver, Sacks reals and Martin’s axiom, Fundamenta Mathematicae 133 (1989), 161–168.
K. J. Devlin, ℵ 1 -trees, Annals of Mathematical Logic 13 (1978), 267–330.
K. J. Devlin, Concerning the consistency of the Souslin hypothesis with the continuum hypothesis, Annals of Mathematical Logic 19 (1980), 115–125.
K. J. Devlin, The Yorkshireman’s Guide to Proper Forcing, Surveys in Set Theory, Cambridge University Press, Cambridge, 1983, pp. 60–115.
K. J. Devlin and H. Johnsbraten, The Souslin Problem, Lecture Notes in Mathematics, Vol. 405, Springer-Verlag, Berlin, 1974.
R. B. Jensen, The fine structure of the constructible hierarchy, Annals of Mathematical Logic 4 (1972), 229–308; erratum, ibid. 4 (1972), 443, With a section by Jack Silver.
A. Kanamori, The Higher Infinite, Springer-Verlag, Berlin, 1994, Large cardinals in set theory from their beginnings.
K. Kunen and F. D. Tall, Between Martin’s axiom and Souslin’s hypothesis, Fundamenta Mathematicae 102 (1979), 173–181.
R. Laver, Random reals and Souslin trees, Proceedings of the American Mathematical Society 100 (1987), 531–534.
H. Mildenberger and S. Shelah, Specializing Aronszajn trees by countable approximations, Annals of Mathematical Logic 42 (2003), 627–647, [SH:778].
S. Shelah, Proper Forcing, Springer-Verlag, Berlin, 1982.
S. Shelah, Can you take Solovay’s inaccessible away?, Israel Journal of Mathematics 48 (1984), 1–47, [Sh:176].
S. Shelah, Cardinal Arithmetic, The Clarendon Press Oxford University Press, New York, 1994, Oxford Science Publications.
S. Shelah, Proper and Improper Forcing, second edn., Springer-Verlag, Berlin, 1998.
S. Shelah, NNR Revisited, Shelah [Sh:656], 2000, arxiv:math.LO/0003115.
J. Silver, The independence of Kurepa’s conjecture and two-cardinal conjectures in model theory, in Axiomatic Set Theory (Proceedings of Symposia in Pure Mathematics, Vol. XIII, Part I, University California, Los Angeles, Calif., 1967), American Mathematical Society, Providence, R.I., 1971, pp. 383–390.
R. M. Solovay and S. Tennenbaum, Iterated Cohen extensions and Souslin’s problem, Annals of Mathematics (2) 94 (1971), 201–245.
S. Todorčević, A note on the proper forcing axiom, in Axiomatic Set Theory (Boulder, Colo., 1983), American Mathematical Society, Providence, R.I., 1984, pp. 209–218.
S. Todorčević, Trees and linearly ordered sets, in Handbook of Set-theoretic Topology, North-Holland, Amsterdam, 1984, pp. 235–293.
S. Todorčević, Partition relations for partially ordered sets, Acta Mathematica 155 (1985), 1–25.
S. Todorčević, Partitioning pairs of countable ordinals, Acta Mathematica 159 (1987), 261–294.
S. Todorčević, Random set-mappings and separability of compacta, Toplogy Applications 74 (1996), 265–274.
S. Todorčević, A dichotomy for P-ideals of countable sets, Fundamenta Mathematicae 166 (2000), 251–267.
S. Todorčević, Localized reflection and fragments of PFA, in Set Theory (Piscataway, NJ, 1999), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 58, American Mathematical Society, Providence, RI, 2002, pp. 135–148.
E. K. van Douwen, The integers and topology, in Handbook of Set-theoretic Topology, North-Holland, Amsterdam, 1984, pp. 111–167.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hirschorn, J. Random trees under CH. Isr. J. Math. 157, 123–153 (2007). https://doi.org/10.1007/s11856-006-0005-3
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s11856-006-0005-3