In this paper we prove that from large cardinals it is consistent that there is a singular strong limit cardinal $\nu $ such that the singular cardinal hypothesis fails at $\nu $ and every collection of fewer than $\operatorname {\mathrm {cf}}(\nu )$ stationary subsets of $\nu ^{+}$ reflects simultaneously. For $\operatorname {\mathrm {cf}}(\nu )> \omega $, this situation was not previously known to be consistent. Using different methods, we reduce the upper bound on the consistency strength of this situation for $\operatorname {\mathrm {cf}}(\nu ) = \omega $ to below a single partially supercompact cardinal. The previous upper bound of infinitely many supercompact cardinals was due to Sharon.

1. (1) We show that it is possible to add $\kappa ^+$-Cohen subsets to $\kappa $ with a Prikry forcing over $\kappa $. This answers a question from [9].

2. (2) A strengthening of non-Galvin property is introduced. It is shown to be consistent using a single measurable cardinal which improves a previous result by S. Garti, S. Shelah, and the first author [5].

3. (3) A situation with Extender-based Prikry forcings is examined. This relates to a question of H. Woodin.

We show that assuming modest large cardinals, there is a definable class of ordinals, closed and unbounded beneath every uncountable cardinal, so that for any closed and unbounded subclasses $P, Q, {\langle L[P],\in ,P \rangle }$ and ${\langle L[Q],\in ,Q \rangle }$ possess the same reals, satisfy the Generalised Continuum Hypothesis, and moreover are elementarily equivalent. Examples of such P are Card, the class of uncountable cardinals, I the uniform indiscernibles, or for any n the class $C^{n}{=_{{\operatorname {df}}}}\{ \lambda \, | \, V_{\lambda } \prec _{{\Sigma }_{n}}V\}$ ; moreover the theory of such models is invariant under ZFC-preserving extensions. They also all have a rich structure satisfying many of the usual combinatorial principles and a definable wellorder of the reals. The inner model constructed using definability in the language augmented by the Härtig quantifier is thus also characterized.

We improve the upper bound for the consistency strength of stationary reflection at successors of singular cardinals.

We study the notion of tightly stationary sets which was introduced by Foreman and Magidor in [8]. We obtain two consistency results showing that certain sequences of regular cardinals ${\langle {\kappa _n}\rangle _{n < \omega }}$ can have the property that in some generic extension, every ground-model sequence of fixed-cofinality stationary sets ${S_n} \subseteq {\kappa _n}$ is tightly stationary. The results are obtained using variations of the short-extenders forcing method.

$ISP$ cannot hold at the first or second successor of a singular strong limit of countable cofinality; on the other hand, we force a failure of “strong ${\rm{SCH}}$” across a cardinal where $ITP$ holds. We also show that $ITP$ does not imply that there are stationary many internally unbounded models.

We show that from large cardinals it is consistent to have the tree property simultaneously at ${\aleph _{{\omega ^2} + 1}}$ and ${\aleph _{{\omega ^2} + 2}}$ with ${\aleph _{{\omega ^2}}}$ strong limit.

Three central combinatorial properties in set theory are the tree property, the approachability property and stationary reflection. We prove the mutual independence of these properties by showing that any of their eight Boolean combinations can be forced to hold at ${\kappa ^{ + + }}$, assuming that $\kappa = {\kappa ^{ < \kappa }}$ and there is a weakly compact cardinal above κ.

If in addition κ is supercompact then we can force κ to be ${\aleph _\omega }$ in the extension. The proofs combine the techniques of adding and then destroying a nonreflecting stationary set or a ${\kappa ^{ + + }}$-Souslin tree, variants of Mitchell’s forcing to obtain the tree property, together with the Prikry-collapse poset for turning a large cardinal into ${\aleph _\omega }$.

We analyze the modified extender based forcing from Assaf Sharon’s PhD thesis. We show there is a bad scale in the extension and therefore weak square fails. We also present two metatheorems which give a rough characterization of when a diagonal Prikry-type forcing forces the failure of weak square.

We prove that it is consistent that $\aleph _\omega $ is strong limit, $2^{\aleph _\omega } $ is large and the universality number for graphs on $\aleph _{\omega + 1} $ is small. The proof uses Prikry forcing with interleaved collapsing.

In this paper, we explore the structure theory of L(ℝ, μ) under the hypothesis L(ℝ, μ) ⊧ “AD + μ is a normal fine measure on ” and give some applications. First we show that “ ZFC + there exist ω2 Woodin cardinals”1 has the same consistency strength as “ AD + ω1 is ℝ-supercompact”. During this process we show that if L(ℝ, μ) ⊧ AD then in fact L(ℝ, μ) ⊧ AD+. Next we prove important properties of L(ℝ, μ) including Σ1 -reflection and the uniqueness of μ in L(ℝ, μ). Then we give the computation of full HOD in L(ℝ, μ). Finally, we use Σ1 -reflection and ℙmax forcing to construct a certain ideal on (or equivalently on in this situation) that has the same consistency strength as “ZFC+ there exist ω2 Woodin cardinals.”

We prove consistent, assuming there is a supercompact cardinal, that there is a singular strong limit cardinal μ, of cofinality ω, such that every μ+-chromatic graph X on μ+ has an edge colouring c of X into μ colours for which every vertex colouring g of X into at most μ many colours has a g-colour class on which c takes every value.

The paper also contains some generalisations of the above statement in which μ+ is replaced by other cardinals > μ.