Hostname: page-component-8448b6f56d-gtxcr Total loading time: 0 Render date: 2024-04-19T23:31:20.657Z Has data issue: false hasContentIssue false

UFA fails in the Bell-Kunen model

Published online by Cambridge University Press:  12 March 2014

John W. L. Merrill*
Affiliation:
Center for Adaptive Systems, Boston University, Boston, Massachusetts 02215

Extract

In [vDF], van Douwen and Fleissner introduce a number of axioms which hold in models constructed by iteratively forcing MA in a nontrivial extension of the set-theoretic universe. One such model is the Bell-Kunen model, obtained by starting with a model of ZFC + GCH, then forcing “MA + ϲ = ω2” by the standard means, then forcing “MA + ϲ = ω3”, and so on. The Bell-Kunen model is the result of an ω1 sequence of extensions of this form, with direct limits taken at limit ordinals. (See [BK] for a more complete description.) Van Douwen and Fleissner observed that many of the properties of this model could be distilled into a “Definable Forcing Axiom”, which states that “If P is a c.c.c. partial order which is definable from a real, then there is a sequence of filters through , such that if is any dense subset of P, then all but countably many of the ℱα's meet in a nonempty set.” (They call such a sequence ω1-generic.) Van Douwen and Fleissner ask whether one can eliminate the restriction on the c.c.c. order entirely; the resulting axiom (“If P is any c.c.c. partial order of cardinality at most ϲ, then there is a sequence of filters…”) is called the Undefinable Forcing Axiom (UFA).

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1990

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

REFERENCES

[BK]Bell, M. and Kunen, K., On the PI character of ultrafilters, La Société Royale du Canada. L'Académie des Sciences. Comptes Rendues Mathématiques (Mathematical Reports), vol. 3 (1981), pp. 351356.Google Scholar
[vDF]van Douwen, E. and Fleissner, W., The definable forcing axiom (preprint).Google Scholar
[H]Hajnal, A., Proof of a conjecture of S. Ruziewicz, Fundamenta Mathematicae, vol. 50 (1961/1962), pp. 123128.CrossRefGoogle Scholar
[J]Jech, T., Set theory, Academic Press, New York, 1978.Google Scholar
[K]Kunen, K., Set theory: an introduction to independence proofs, North-Holland, Amsterdam, 1980.Google Scholar
[M]Merrill, J., A class of consistent anti-Martin's axioms, Pacific Journal of Mathematics (to appear).Google Scholar
[R]Roitman, J., A very thin, thick, superatomic Boolean algebra, Algebra Universalis, vol. 21 (1985), pp. 137142.CrossRefGoogle Scholar