Transformations of the transfinite plane

We study the existence of transformations of the transfinite plane that allow one to reduce Ramsey-theoretic statements concerning uncountable Abelian groups into classical partition relations for uncountable cardinals. To exemplify: we prove that for every inaccessible cardinal $\kappa $ , if $\kappa $ admits a stationary set that does not reflect at inaccessibles, then the classical negative partition relation $\kappa \nrightarrow [\kappa ]^2_\kappa $ implies that for every Abelian group $(G,+)$ of size $\kappa $ , there exists a map $f:G\rightarrow G$ such that for every $X\subseteq G$ of size $\kappa $ and every $g\in G$ , there exist $x\neq y$ in X such that $f(x+y)=g$ .

PERFECT SUBSETS OF GENERALIZED BAIRE SPACES AND LONG GAMES

We extend Solovay’s theorem about definable subsets of the Baire space to the generalized Baire spaceλλ, whereλis an uncountable cardinal withλ<λ= λ. In the first main theorem, we show that the perfect set property for all subsets ofλλthat are definable from elements ofλOrd is consistent relative to the existence of an inaccessible cardinal aboveλ. In the second main theorem, we introduce a Banach–Mazur type game of lengthλand show that the determinacy of this game, for all subsets ofλλthat are definable from elements ofλOrd as winning conditions, is consistent relative to the existence of an inaccessible cardinal aboveλ. We further obtain some related results about definable functions onλλand consequences of resurrection axioms for definable subsets ofλλ.

HYPERCLASS FORCING IN MORSE-KELLEY CLASS THEORY

In this article we introduce and study hyperclass-forcing (where the conditions of the forcing notion are themselves classes) in the context of an extension of Morse-Kelley class theory, called MK**. We define this forcing by using a symmetry between MK** models and models of ZFC− plus there exists a strongly inaccessible cardinal (called SetMK**). We develop a coding between β-models ${\cal M}$ of MK** and transitive models M+ of SetMK** which will allow us to go from ${\cal M}$ to M+ and vice versa. So instead of forcing with a hyperclass in MK** we can force over the corresponding SetMK** model with a class of conditions. For class-forcing to work in the context of ZFC− we show that the SetMK** model M+ can be forced to look like LK*[X], where κ* is the height of M+, κ strongly inaccessible in M+ and $X \subseteq \kappa$. Over such a model we can apply definable class forcing and we arrive at an extension of M+ from which we can go back to the corresponding β-model of MK**, which will in turn be an extension of the original ${\cal M}$. Our main result combines hyperclass forcing with coding methods of [3] and [4] to show that every β-model of MK** can be extended to a minimal such model of MK** with the same ordinals. A simpler version of the proof also provides a new and analogous minimality result for models of second-order arithmetic.

NONCONGLOMERABILITY FOR COUNTABLY ADDITIVE MEASURES THAT ARE NOT κ-ADDITIVE

Let κ be an uncountable cardinal. Using the theory of conditional probability associated with de Finetti (1974) and Dubins (1975), subject to several structural assumptions for creating sufficiently many measurable sets, and assuming that κ is not a weakly inaccessible cardinal, we show that each probability that is not κ-additive has conditional probabilities that fail to be conglomerable in a partition of cardinality no greater than κ. This generalizes a result of Schervish, Seidenfeld, & Kadane (1984), which established that each finite but not countably additive probability has conditional probabilities that fail to be conglomerable in some countable partition.

DEFINABILITY OF SATISFACTION IN OUTER MODELS

Let M be a transitive model of ZFC. We say that a transitive model of ZFC, N, is an outer model of M if M ⊆ N and ORD ∩ M = ORD ∩ N. The outer model theory of M is the collection of all formulas with parameters from M which hold in all outer models of M (which exist in a universe in which M is countable; this is independent of the choice of such a universe). Satisfaction defined with respect to outer models can be seen as a useful strengthening of first-order logic. Starting from an inaccessible cardinal κ, we show that it is consistent to have a transitive model M of ZFC of size κ in which the outer model theory is lightface definable, and moreover M satisfies V = HOD. The proof combines the infinitary logic L∞,ω, Barwise’s results on admissible sets, and a new forcing iteration of length strictly less than κ+ which manipulates the continuum function on certain regular cardinals below κ. In the appendix, we review some unpublished results of Mack Stanley which are directly related to our topic.

LARGE CARDINALS AND LIGHTFACE DEFINABLE WELL-ORDERS, WITHOUT THE GCH

This paper deals with the question whether the assumption that for every inaccessible cardinal κ there is a well-order of H(κ+) definable over the structure $\langle {\rm{H}}({\kappa ^ + }), \in \rangle$ by a formula without parameters is consistent with the existence of (large) large cardinals and failures of the GCH. We work under the assumption that the SCH holds at every singular fixed point of the ℶ-function and construct a class forcing that adds such a well-order at every inaccessible cardinal and preserves ZFC, all cofinalities, the continuum function, and all supercompact cardinals. Even in the absence of a proper class of inaccessible cardinals, this forcing produces a model of “V = HOD” and can therefore be used to force this axiom while preserving large cardinals and failures of the GCH. As another application, we show that we can start with a model containing an ω-superstrong cardinal κ and use this forcing to build a model in which κ is still ω-superstrong, the GCH fails at κ and there is a well-order of H(κ+) that is definable over H(κ+) without parameters. Finally, we can apply the forcing to answer a question about the definable failure of the GCH at a measurable cardinal.

EXAMPLES IN DEPENDENT THEORIES

In the first part we show a counterexample to a conjecture by Shelah regarding the existence of indiscernible sequences in dependent theories (up to the first inaccessible cardinal). In the second part we discuss generic pairs, and give an example where the pair is not dependent. Then we define the notion of directionality which deals with counting the number of coheirs of a type and we give examples of the different possibilities. Then we discuss nonsplintering, an interesting notion that appears in the work of Rami Grossberg, Andrés Villaveces and Monica VanDieren, and we show that it is not trivial (in the sense that it can be different than splitting) whenever the directionality of the theory is not small. In the appendix we study dense types in RCF.

THE STRONG TREE PROPERTY AT SUCCESSORS OF SINGULAR CARDINALS

An inaccessible cardinal is strongly compact if, and only if, it satisfies the strong tree property. We prove that if there is a model of ZFC with infinitely many supercompact cardinals, then there is a model of ZFC where ${\aleph _{\omega + 1}}$ has the strong tree property. Moreover, we prove that every successor of a singular limit of strongly compact cardinals has the strong tree property.

Strong tree properties for small cardinals

An inaccessible cardinal κ is supercompact when (κ, λ)-ITP holds for all λ ≥ κ. We prove that if there is a model of ZFC with infinitely many supercompact cardinals, then there is a model of ZFC where for every n ≥ 2 and μ ≥ ℕn, we have (ℕn, μ)-ITP.