Hostname: page-component-784d4fb959-pvpmm Total loading time: 0 Render date: 2025-07-17T01:54:45.979Z Has data issue: false hasContentIssue false
  • English
  • Français

On the Rowbottom M-ultrafilters

Published online by Cambridge University Press:  12 March 2014

Qi Feng
Qi Feng*
Affiliation:
Department of Mathematics, Pennsylvania State University, University Park, Pennsylvania 16802
Get access Rights & Permissions [Opens in a new window]

Abstract

We show that M ⊨ κ is a completely Ramsey cardinal iff there is a Rowbottom M-ultrafilter on κ.

Information

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 52 , Issue 4 , December 1987 , pp. 990 - 993
Copyright
Copyright © Association for Symbolic Logic 1987

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

REFERENCES

[1]Abramson, F., Harrington, L., Kleinberg, E. M., and Zwicker, W., Flipping properties: a unifying thread in the theory of large cardinals, Annals of Mathematical Logic, vol. 12 (1977), pp. 25–58.CrossRefGoogle Scholar
[2] Jech, T., Set theory, Academic Press, New York, 1978.Google Scholar
[3]Jech, T. and Prikry, K., Ideals over uncountable sets: Applications of almost disjoint functions and generic ultrapowers, Memoirs of the American Mathematical Society, no. 214 (1979).Google Scholar
[4]Kleinberg, E. M., A combinatorial characterization of normal M-ultrafilters, Advances in Mathematics, vol. 30 (1978), pp. 77–84.CrossRefGoogle Scholar
[5]Kunen, K., Inaccessibility properties of cardinals, Ph.D. Thesis, Stanford University, Stanford, California, 1968.Google Scholar
[6]Prikry, K., Changing measurable into accessible cardinals, Dissertationes Mathematicae Rozprawy Matematyczne, vol. 68 (1970).Google Scholar
[7]Rowbottom, F., Some strong axioms of infinity incompatible with the axiom of constructibility, Annals of Mathematical Logic, vol. 3 (1971), pp. 1–44.CrossRefGoogle Scholar