Combinatorial characterization of supercompact cardinals
HTML articles powered by AMS MathViewer
- by M. Magidor PDF
- Proc. Amer. Math. Soc. 42 (1974), 279-285 Request permission
Abstract:
It is proved that supercompact cardinals can be characterized by combinatorial properties which are generalizations of ineffability.References
- G. Fodor, On stationary sets and regressive functions, Acta Sci. Math. (Szeged) 27 (1966), 105–110. MR 200167
- Thomas J. Jech, Some combinatorial problems concerning uncountable cardinals, Ann. Math. Logic 5 (1972/73), 165–198. MR 325397, DOI 10.1016/0003-4843(73)90014-4 R. B. Jensen and K. Kunen, Some combinatorial properties of L and V (mimeographed).
- M. Magidor, On the role of supercompact and extendible cardinals in logic, Israel J. Math. 10 (1971), 147–157. MR 295904, DOI 10.1007/BF02771565 T. K. Menas, A partition theorem for ${P_k}(\lambda )$ (mimeographed). W. Reinhardt and R. Solovay, Strong axioms of infinity and elementary embeddings (to appear).
Additional Information
- © Copyright 1974 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 42 (1974), 279-285
- MSC: Primary 02K35
- DOI: https://doi.org/10.1090/S0002-9939-1974-0327518-9
- MathSciNet review: 0327518