Related papers: Killing the GCH everywhere with a single real
We present two different types of models where, for certain singular cardinals lambda of uncountable cofinality, lambda -> (lambda, omega+1)^2, although lambda is not a strong limit cardinal. We announce, here, and will present in a…
In earlier work of the second and third author the equivalence of a finite square principle square^fin_{lambda,D} with various model theoretic properties of structures of size lambda and regular ultrafilters was established. In this paper…
The Gap Forcing Theorem, a key contribution of this paper, implies essentially that after any reverse Easton iteration of closed forcing, such as the Laver preparation, every supercompactness measure on a supercompact cardinal extends a…
Our goal is to study the pseudo-intersection and tower numbers on uncountable regular cardinals, whether these two cardinal characteristics are necessarily equal, and related problems on the existence of gaps. First, we prove that either…
We discuss how singular can cardinals be in absence of the axiom of choice. We show that, contrasting with known negative consistency results (of Gitik and others), certain positive results are provable. Then we pose some problems.
We develop a general framework for forcing with coherent adequate sets on $H(\lambda)$ as side conditions, where $\lambda \ge \omega_2$ is a cardinal of uncountable cofinality. We describe a class of forcing posets which we call coherent…
We introduce 0^h (0^handgrenade) as a sharp for an inner model with a proper class of strong cardinals. If 0^h does not exist then any normal iteration tree is "almost linear." We exploit this fact to prove the existence of the core model K…
The stable core, an inner model of the form $\langle L[S],\in, S\rangle$ for a simply definable predicate $S$, was introduced by the first author in [Fri12], where he showed that $V$ is a class forcing extension of its stable core. We study…
In this article we prove three main theorems: (1) guessing models are internally unbounded, (2) for any regular cardinal $\kappa \ge \omega_2$, $\textsf{ISP}(\kappa)$ implies that $\textsf{SCH}$ holds above $\kappa$, and (3) forcing posets…
This paper presents the main results in my Ph.D. thesis. In what follows several proofs of SCH are presented introducing a family of covering properties which implies both SCH and the failure of various forms of square. These covering…
We show that if the existence of a supercompact cardinal $\kappa$ with a weakly compact cardinal $\lambda$ above $\kappa$ is consistent, then the following are consistent as well (where $\mathfrak{t}(\kappa)$ and $\mathfrak{u}(\kappa)$ are…
A central theme in set theory is to find universes with extreme, well-understood behaviour. The case we are interested in is assuming GCH and has a strong forcing axiom of higher order than usual. Instead of "for every suitable forcing…
In this paper, we study the notion of a generically extendible cardinal, which is a generic version of an extendible cardinal. We prove that the generic extendibility of $\omega_1$ or $\omega_2$ has small consistency strength, but that of a…
We show that the statement "every universally Baire set of reals has the perfect set property" is equiconsistent modulo ZFC with the existence of a cardinal that we call a virtually Shelah cardinal. These cardinals resemble Shelah cardinals…
Starting from a supercompact cardinal we build a model in which $2^{\aleph_{\omega_1}}=2^{\aleph_{\omega_1+1}}=\aleph_{\omega_1+3}$ but there is a jointly universal family of size $\aleph_{\omega_1+2}$ of graphs on $\aleph_{\omega_1+1}$.…
We investigate the problem of when $\leq\lambda$--support iterations of $<\lambda$--complete notions of forcing preserve $\lambda^+$. We isolate a property -- {\em properness over diamonds} -- that implies $\lambda^+$ is preserved and show…
We consider some of the various formulations of the Revised GCH Theorem presented in Shelah's original paper \cite{SheRGCH}. We compare them and discuss their meaning.
We give a proof of Theorem 2.10 from [8] that eliminates the use of Shelah's nice filters and associated rank functions, and instead uses only the well-foundedness of reduced products of ordinals modulo countably complete filters. This…
It was proved recently that Telg\'arsky's conjecture, which concerns partial information strategies in the Banach-Mazur game, fails in models of $\mathsf{GCH}+\square$. The proof introduces a combinatorial principle that is shown to follow…
We prove: $\mathbf{Theorem}$ Let $K$ be a universal class. If $K$ is categorical in cardinals of arbitrarily high cofinality, then $K$ is categorical on a tail of cardinals. The proof stems from ideas of Adi Jarden and Will Boney, and also…