The number of normal measures

There have been numerous results showing that a measurable cardinal κ can carry exactly α normal measures in a model of GCH. where α is a cardinal at most κ++. Starting with just one measurable cardinal, we have [9] (for α = 1), [10] (for α = α++, the maximum possible) and [1] (for α = κ+, after collapsing κ++). In addition, under stronger large cardinal hypotheses, one can handle the remaining cases: [12] (starting with a measurable cardinal of Mitchell order α), [2] (as in [12], but where κ is the least measurable cardinal and α is less than κ, starting with a measurable of high Mitchell order) and [11] (as in [12], but where κ is the least measurable cardinal, starting with an assumption weaker than a measurable cardinal of Mitchell order 2). In this article we treat all cases by a uniform argument, starting with only one measurable cardinal and applying a cofinality-preserving forcing. The proof uses κ-Sacks forcing and the “tuning fork” technique of [8]. In addition, we explore the possibilities for the number of normal measures on a cardinal at which the GCH fails.

Cardinal invariants and the collapse of the continuum by Sacks forcing

We study cardinal invariants of systems of meager hereditary families of subsets of ω connected with the collapse of the continuum by Sacks forcing and we obtain a cardinal invariant such that collapses the continuum to and . Applying the Baumgartner-Dordal theorem on preservation of eventually narrow sequences we obtain the consistency of . We define two relations and on the set (ωω)Fin of finite-to-one functions which are Tukey equivalent to the eventual dominance relation of functions such that if -unbounded, well-ordered by , and not -dominating, then there is a nonmeager p-ideal. The existence of such a system follows from Martin's axiom. This is an analogue of the results of [3], [9, 10] for increasing functions.

sets and singletons

We extend work of H. Friedman, L. Harrington and P. Welch to the third level of the projective hierarchy. Our main theorems say that (under appropriate background assumptions) the possibility to select definable elements of non-empty sets of reals at the third level of the projective hierarchy is equivalent to the disjunction of determinacy of games at the second level of the projective hierarchy and the existence of a core model (corresponding to this fragment of determinacy) which must then contain all real numbers. The proofs use Sacks forcing with perfect trees and core model techniques.