THE HARRINGTON–SHELAH MODEL WITH LARGE CONTINUUM

We prove from the existence of a Mahlo cardinal the consistency of the statement that 2ω = ω3 holds and every stationary subset of ${\omega _2}\mathop \cap \nolimits {\rm{cof}}\left( \omega \right)$ reflects to an ordinal less than ω2 with cofinality ω1.

A Forcing Axiom Deciding the Generalized Souslin Hypothesis

We derive a forcing axiom from the conjunction of square and diamond, and present a few applications, primary among them being the existence of super-Souslin trees. It follows that for every uncountable cardinal$\unicode[STIX]{x1D706}$, if$\unicode[STIX]{x1D706}^{++}$is not a Mahlo cardinal in Gödel’s constructible universe, then$2^{\unicode[STIX]{x1D706}}=\unicode[STIX]{x1D706}^{+}$entails the existence of a$\unicode[STIX]{x1D706}^{+}$-complete$\unicode[STIX]{x1D706}^{++}$-Souslin tree.

Absoluteness via resurrection

The resurrection axioms are forcing axioms introduced recently by Hamkins and Johnstone, developing on ideas of Chalons and Veličković. We introduce a stronger form of resurrection axioms (the iterated resurrection axioms [Formula: see text] for a class of forcings [Formula: see text] and a given ordinal [Formula: see text]), and show that [Formula: see text] implies generic absoluteness for the first-order theory of [Formula: see text] with respect to forcings in [Formula: see text] preserving the axiom, where [Formula: see text] is a cardinal which depends on [Formula: see text] ([Formula: see text] if [Formula: see text] is any among the classes of countably closed, proper, semiproper, stationary set preserving forcings). We also prove that the consistency strength of these axioms is below that of a Mahlo cardinal for most forcing classes, and below that of a stationary limit of supercompact cardinals for the class of stationary set preserving posets. Moreover, we outline that simultaneous generic absoluteness for [Formula: see text] with respect to [Formula: see text] and for [Formula: see text] with respect to [Formula: see text] with [Formula: see text] is in principle possible, and we present several natural models of the Morse–Kelley set theory where this phenomenon occurs (even for all [Formula: see text] simultaneously). Finally, we compare the iterated resurrection axioms (and the generic absoluteness results we can draw from them) with a variety of other forcing axioms, and also with the generic absoluteness results by Woodin and the second author.

AN EQUICONSISTENCY RESULT ON PARTIAL SQUARES

We prove that the following two statements are equiconsistent: there exists a greatly Mahlo cardinal; there exists a regular uncountable cardinal κ such that no stationary subset of κ+ ∩ cof (κ) carries a partial square.

A weak variation of shelah's I[ω2]

We use a κ+-Mahlo cardinal to give a forcing construction of a model in which there is no sequence ⟨ Aβ : β < ω2 ⟩ of sets of cardinality ω1 such thatis stationary.

Shelah's work on non-semi-proper iterations, II

One of the main goals in the theory of forcing iteration is to formulate preservation theorems for not collapsing ω1 which are as general as possible. This line leads from c.c.c. forcings using finite support iterations to Axiom A forcings and proper forcings using countable support iterations to semi-proper forcings using revised countable support iterations, and more recently, in work of Shelah, to yet more general classes of posets. In this paper we concentrate on a special case of the very general iteration theorem of Shelah from [5, chapter XV]. The class of posets handled by this theorem includes all semi-proper posets and also includes, among others, Namba forcing.In [5, chapter XV] Shelah shows that, roughly, revised countable support forcing iterations in which the constituent posets are either semi-proper or Namba forcing or P[W] (the forcing for collapsing a stationary co-stationary subset ofwith countable conditions) do not collapse ℵ1. The iteration must contain sufficiently many cardinal collapses, for example, Levy collapses. The most easily quotable combinatorial application is the consistency (relative to a Mahlo cardinal) of ZFC + CH fails + whenever A ∪ B = ω2 then one of A or B contains an uncountable sequentially closed subset. The iteration Shelah uses to construct this model is built using P[W] to “attack” potential counterexamples, Levy collapses to ensure that the cardinals collapsed by the various P[W]'s are sufficiently well separated, and Cohen forcings to ensure the failure of CH in the final model.In this paper we give details of the iteration theorem, but we do not address the combinatorial applications such as the one quoted above.These theorems from [5, chapter XV] are closely related to earlier work of Shelah [5, chapter XI], which dealt with iterated Namba and P[W] without allowing arbitrary semi-proper forcings to be included in the iteration. By allowing the inclusion of semi-proper forcings, [5, chapter XV] generalizes the conjunction of [5, Theorem XI.3.6] with [5, Conclusion XI.6.7].

Power-like models of set theory

A model = (M. E, …) of Zermelo-Fraenkel set theory ZF is said to be 0-like. where E interprets ∈ and θ is an uncountable cardinal, if ∣M∣ = θ but ∣{b ∈ M: bEa}∣ < 0 for each a ∈ M, An immediate corollary of the classical theorem of Keisler and Morley on elementary end extensions of models of set theory is that every consistent extension of ZF has an ℵ1-like model. Coupled with Chang's two cardinal theorem this implies that if θ is a regular cardinal 0 such that 2<0 = 0 then every consistent extension of ZF also has a 0+-like model. In particular, in the presence of the continuum hypothesis every consistent extension of ZF has an ℵ2-like model. Here we prove:Theorem A. If 0 has the tree property then the following are equivalent for any completion T of ZFC:(i) T has a 0-like model.(ii) Ф ⊆ T. where Ф is the recursive set of axioms {∃κ (κ is n-Mahlo and “Vκis a Σn-elementary submodel of the universe”): n ∈ ω}.(iii) T has a λ-like model for every uncountable cardinal λ.Theorem B. The following are equiconsistent over ZFC:(i) “There exists an ω-Mahlo cardinal”.(ii) “For every finite language , all ℵ2-like models of ZFC() satisfy the schemeФ().

◇ at Mahlo cardinals

Given a Mahlo cardinal k and a regular ε such that ω1 < ε < k we show that ◇k(cf = ε) holds in V provided that there are only non-stationarily many β < k with o(β) ≥ ε in K.

The bounded proper forcing axiom

The bounded proper forcing axiom BPFA is the statement that for any family of ℵ1 many maximal antichains of a proper forcing notion, each of size ℵ1, there is a directed set meeting all these antichains.A regular cardinal κ is called ∑1-reflecting, if for any regular cardinal χ, for all formulas φ, “H(χ) ⊨ ‘φ’” implies “∃δ < κ, H(δ) ⊨ ‘φ’”.We investigate several algebraic consequences of BPFA, and we show that the consistency strength of the bounded proper forcing axiom is exactly the existence of a ∑1-reflecting cardinal (which is less than the existence of a Mahlo cardinal).We also show that the question of the existence of isomorphisms between two structures can be reduced to the question of rigidity of a structure.

Normality and

The main result of this paper is that if κ is not a weakly Mahlo cardinal, then the following two conditions are equivalent:1. is κ+-complete.2. is a prenormal ideal.Our result is a generalization of an announcement made in [Z]. We say that is selective iff for every -function f: κ → κ there is a set X ∈ such that f∣(κ − X) is one-to-one. Our theorem provides a positive partial answer to a question of B. Wȩglorz from [BTW, p. 90], viz.: is every selective ideal with κ+-complete, isomorphic to a normal ideal?The theorem is also true for fine ideals on [λ]<κ for any κ ≤ λ, i.e. if κ is not a weakly Mahlo cardinal then the Boolean algebra is λ+-complete iff is a prenormal ideal (in the sense of [λ/<κ).