No CrossRef data available.
Article contents
UFA fails in the Bell-Kunen model
Published online by Cambridge University Press: 12 March 2014
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
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1990