Weakly compact cardinals and nonspecial Aronszajn trees
HTML articles powered by AMS MathViewer
- by Saharon Shelah and Lee Stanley PDF
- Proc. Amer. Math. Soc. 104 (1988), 887-897 Request permission
Abstract:
Lemma 1. If $\lambda$ is a cardinal with cf $\lambda > \omega$, then ${\square _\lambda }$ implies that there is a ${\lambda ^ + }$-Aronszajn tree with an $\omega$-ascent path, i.e. a sequence $\left ( {{{\bar x}^\alpha }:\alpha < {\lambda ^ + }} \right )$ with each ${\bar x^\alpha } = \left ( {x_n^\alpha :n < \omega } \right )$ a one-to-one sequence from ${T_\alpha }$, such that for all $\alpha < \beta < {\lambda ^ + },x_n^\alpha$ precedes $x_n^\beta$ in the tree order for sufficiently large $n$. Lemma 2. If $\lambda$ is a cardinal with $\operatorname {cf} \lambda = \omega < \lambda$, then ${\square _\lambda }$ implies that there is a ${\lambda ^ + }$-Aronszajn tree with an ${\omega _1}$-ascent path (replace $\omega$ by ${\omega _1}$, above). Lemma 3. If $\lambda$ is an uncountable cardinal, $\kappa$ is regular, $\kappa < \lambda ,\operatorname {cf} \lambda \ne \kappa ,T$ is a ${\lambda ^ + }$-Aronszajn tree, and $\left ( {x_i^\alpha :i < \kappa } \right )$ is a one-to-one sequence from ${T_{\zeta \left ( \alpha \right )}}$ with the property of ascent paths, where $\zeta :{\lambda ^ + } \to {\lambda ^ + }$ is a monotone increasing function of $\alpha$, then $T$ is nonspecial. Theorem 4. If $\lambda$ is uncountable, then ${\square _\lambda }$ implies that there is a nonspecial ${\lambda ^ + }$-Aronszajn tree. Theorem 5. If $\lambda$ is an uncountable cardinal, $\kappa = {\lambda ^ + }$, and $\kappa$ is not ${(weakly\;compact)^L}$, then there is a nonspecial $\kappa$-Aronszajn tree.References
- Keith J. Devlin, Constructibility, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1984. MR 750828, DOI 10.1007/978-3-662-21723-8
- H.-D. Donder, R. B. Jensen, and L. J. Stanley, Condensation-coherent global square systems, Recursion theory (Ithaca, N.Y., 1982) Proc. Sympos. Pure Math., vol. 42, Amer. Math. Soc., Providence, RI, 1985, pp. 237–258. MR 791061, DOI 10.1090/pspum/042/791061
- R. Björn Jensen, The fine structure of the constructible hierarchy, Ann. Math. Logic 4 (1972), 229–308; erratum, ibid. 4 (1972), 443. With a section by Jack Silver. MR 309729, DOI 10.1016/0003-4843(72)90001-0
- Richard Laver and Saharon Shelah, The $\aleph _{2}$-Souslin hypothesis, Trans. Amer. Math. Soc. 264 (1981), no. 2, 411–417. MR 603771, DOI 10.1090/S0002-9947-1981-0603771-7
- Menachem Magidor, Reflecting stationary sets, J. Symbolic Logic 47 (1982), no. 4, 755–771 (1983). MR 683153, DOI 10.2307/2273097
- Saharon Shelah, Proper forcing, Lecture Notes in Mathematics, vol. 940, Springer-Verlag, Berlin-New York, 1982. MR 675955
- S. Shelah and L. Stanley, $S$-forcing. I. A “black-box” theorem for morasses, with applications to super-Souslin trees, Israel J. Math. 43 (1982), no. 3, 185–224. MR 689979, DOI 10.1007/BF02761942
- S. Shelah and L. Stanley, Generalized Martin’s axiom and Souslin’s hypothesis for higher cardinals, Israel J. Math. 43 (1982), no. 3, 225–236. MR 689980, DOI 10.1007/BF02761943
- S. Shelah and L. J. Stanley, Corrigendum to: “Generalized Martin’s axiom and Souslin’s hypothesis for higher cardinals” [Israel J. Math. 43 (1982), no. 3, 225–236; MR0689980 (84h:03120)], Israel J. Math. 53 (1986), no. 3, 304–314. MR 852482, DOI 10.1007/BF02786563 F. D. Tall, Some applications of a generalized Martins’s axiom (to appear).
- Stevo Todorčević, Partitioning pairs of countable ordinals, Acta Math. 159 (1987), no. 3-4, 261–294. MR 908147, DOI 10.1007/BF02392561 B. Velicković, Jensen’s $\square$-principles and the Nowák number of partially ordered sets, J. Symbolic Logic 51 (1986), 47-58.
Additional Information
- © Copyright 1988 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 104 (1988), 887-897
- MSC: Primary 03E05; Secondary 03E45, 03E55, 04A20
- DOI: https://doi.org/10.1090/S0002-9939-1988-0964870-5
- MathSciNet review: 964870