Hostname: page-component-5c6d5d7d68-7tdvq Total loading time: 0 Render date: 2024-08-15T04:04:56.534Z Has data issue: false hasContentIssue false

A set in L containing regularizing families for ultrafilters

Published online by Cambridge University Press:  26 February 2010

Richard Laver
Affiliation:
University of Colorado, Boulder, Colorado
Get access

Extract

Let K be a successor cardinal. Call an regularizing family (for short, a regularizing family) if Card ℱ = k and for each with Card . In [7], Prikry proved, assuming V = L, that if is an ultrafilter on K which is uniform (Card X = K, each ) then is regular (some forms a regularizing family).†

Type
Research Article
Copyright
Copyright © University College London 1977

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.)

References

1.Benda, M. and Ketonen, J.. “On regularity of ultrafilters”, Israel J. of Math., 17 (1974), 231240.Google Scholar
2.Devlin, K..“**Xi-Trees”, preprint.Google Scholar
3.Erdős, P. and Hajnal, A.. “Unsolved problems in set theory”, Proceedings of AMS Symposia in Pure Mathematics, XIII, Vol. 1 (Providence, R.I., 1971), 1748.Google Scholar
4.Kanamori, A.. Ultrafilters over uncountable cardinals, Thesis, (University of Cambridge, 1975).Google Scholar
3.Keisler, H. J.. “A survey of ultraproducts” Logic, methodology, and philosophy of science, Bar-Hillel, Y., ed. (North Holland, 1965), 112126.Google Scholar
6.Ketonen, J.. “Non-regular ultrafilters and large cardinalsTrans. Amer. Math. Soc., 224 (1976), 6173.Google Scholar
7.Prikry, K.. “On a problem of Gillman and Keisler”, Ann. Math. Logic, 2 (1970), 179187.Google Scholar