On the size of closed unbounded sets. (English) Zbl 0746.03040

The problem of determining the size of the closed unbounded subsets of \([\lambda]^{<\kappa}\) is reduced to the study of certain stationary sets and further related to combinatorial principles \(Q_ 1\) and \(Q_ 2\) and the notion of \(\alpha\)-remarkable cardinals (a weakening of \(\alpha\)-Erdős). Consistency and independence results are obtained connecting these principles to Jensen’s \(\square\)-principles.


03E05 Other combinatorial set theory
03E35 Consistency and independence results
Full Text: DOI


[1] Abraham, U.; Shelah, S., Forcing closed unbounded sets, J. symbolic logic, 48, 643-657, (1983) · Zbl 0568.03024
[2] Baumgartner, J., Ineffability properties of cardinals II, (), 87-106 · Zbl 0373.04002
[3] Baumgartner, J.; Harrington, L.; Kleinberg, E., Adding a closed unbounded set, J. symbolic logic, 41, 481-482, (1976) · Zbl 0344.02044
[4] Baumgartner, J.; Taylor, A., Saturation properties of ideals in generic extensions I, Trans. amer. math. soc., 270, 557-574, (1982) · Zbl 0485.03022
[5] Beller, A.; Litman, A., A strengthening of Jensen’s □-principles, J. symbolic logic, 45, 251-264, (1980) · Zbl 0457.03049
[6] Dodd, A.J., The core model, London math. soc. lecture note series, 61, (1982), Cambridge Univ. Press Cambridge · Zbl 0522.03037
[7] H.-D. Donder and J.-P. Levinski, to appear.
[8] A. Kanamori and M. Magidor, The Development of large cardinal axioms in set theory, in: Higher Set Theory, Lecture Notes in Math. 669, (Springer, Berlin) 99-276 · Zbl 0381.03038
[9] Kueker, D., Countable approximations and Löwenheim-Skolem theorems, Ann. math. logic, 11, 57-103, (1977) · Zbl 0364.02009
[10] Kunen, K., Saturated ideals, J. symbolic logic, 43, 65-76, (1978) · Zbl 0395.03031
[11] Magidor, M., Representing sets of ordinals as countable unions of sets in the core model, Trans. amer. math. soc., 317, 91-126, (1990) · Zbl 0714.03045
[12] Shelah, S., Proper forcing, Lecture notes in math., 940, (1982), Springer Berlin · Zbl 0495.03035
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.