Remote Access Proceedings of the American Mathematical Society
Green Open Access

Proceedings of the American Mathematical Society

ISSN 1088-6826(online) ISSN 0002-9939(print)

 
 

 

Combinatorial characterization of supercompact cardinals


Author: M. Magidor
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
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: It is proved that supercompact cardinals can be characterized by combinatorial properties which are generalizations of ineffability.


References [Enhancements On Off] (What's this?)

  • [1] G. Fodor, On stationary sets and regressive functions, Acta Sci. Math. (Szeged) 27 (1966), 105-110. MR 34 #66. MR 0200167 (34:66)
  • [2] T. J. Jech, Some combinatorial problems concerning uncountable cardinals, Ann. Math. Logic 5 (1973), 165-198. MR 0325397 (48:3744)
  • [3] R. B. Jensen and K. Kunen, Some combinatorial properties of L and V (mimeographed).
  • [4] M. Magidor, On the role of supercompact and extendible cardinals in logic, Israel J. Math. 10 (1971), 147-157. MR 45 #4966. MR 0295904 (45:4966)
  • [5] T. K. Menas, A partition theorem for $ {P_k}(\lambda )$ (mimeographed).
  • [6] W. Reinhardt and R. Solovay, Strong axioms of infinity and elementary embeddings (to appear).

Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC: 02K35

Retrieve articles in all journals with MSC: 02K35


Additional Information

DOI: https://doi.org/10.1090/S0002-9939-1974-0327518-9
Article copyright: © Copyright 1974 American Mathematical Society

American Mathematical Society