Related papers: A ccc indestructible construction with CH

We introduce the split principles and show that they bear tight connections to large cardinal properties such as inaccessibility, weak compactness, subtlety, almost ineffability and ineffability, as well as classical combinatorial objects…

Given a forcing notion $P$ that forces certain values to several classical cardinal characteristics of the reals, we show how we can compose $P$ with a collapse (of a cardinal $\lambda>\kappa$ to $\kappa$) such that the composition still…

Given a Fra\"{i}ss\'{e} class $\mathcal{K}$ and an infinite cardinal $\kappa,$ we define a forcing notion which adds a structure of size $\kappa$ using elements of $\mathcal{K}$, which extends the Fra\"{i}ss\'{e} construction in the case…

We explicitly construct infinite families of MSTD (more sums than differences) sets. There are enough of these sets to prove that there exists a constant C such that at least C / r^4 of the 2^r subsets of {1,...,r} are MSTD sets; thus our…

A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is…

We prove various iteration theorems for forcing classes related to subproper and subcomplete forcing, introduced by Jensen. In the first part, we use revised countable support iterations, and show that 1) the class of subproper,…

An infinite family of nonschurian separable association schemes is constructed.

We prove that every weakly square compact cardinal is a strong limit cardinal. We also study Aronszajn trees with no uncountable finitely branching subtrees, characterizing them in terms of being Lindel\"of with respect to a particular…

We give a complete characterization of the sets of cardinals that in a suitable forcing extension can be the Kurepa spectrum, that is, the set of cardinalities of branches of Kurepa trees. This answers a question of the first named author.

We give an alternative construction for a family of partition generating functions due to Kanade and Russell. In our alternative construction, we use ordinary partitions instead of jagged partitions. We also present new generating functions…

We isolate a new preservation class of Suslin forcings and prove several associated consistency results in the choiceless theory ZF+DC regarding countable chromatic numbers of various Borel hypergraphs.

We force the existence of a non-trivial $\kappa$-complete ultrafilter over $\kappa$ which fails to satisfy the Galvin property. This answers a question asked by the first author and Moti Gitik.

We prove two general results about the preservation of extendible and $C^{(n)}$-extendible cardinals under a wide class of forcing iterations (Theorems 5.4 and 7.5). As applications we give new proofs of the preservation of Vop\v{e}nka's…

For $f,g\in\omega^\omega$ let $c^\forall_{f,g}$ be the minimal number of uniform $g$-splitting trees needed to cover the uniform $f$-splitting tree, i.e., for every branch $\nu$ of the $f$-tree, one of the $g$-trees contains $\nu$. Let…

Consider $(\kappa^{+++},\kappa^{++}) \twoheadrightarrow (\kappa^+,\kappa)$ where $\kappa$ is an uncountable regular cardinal. By a result of Shelah's we have $\operatorname{cof}(X \cap \kappa^{++}) = \kappa$ for almost all $X \subset…

We introduce the notion of an arithmetical type of combinatorial family of reals, which serves to generalize different types of families such as mad families, maximal cofinitary groups, ultrafilter bases, splitting families and other…

We present reasons for developing a theory of forcing notions which satisfy the properness demand for countable models which are not necessarily elementary submodels of some (H(chi), in). This leads to forcing notions which are…

We consider $(<\lambda)$-support iterations of a version of $(<\lambda)$-strategically complete $\lambda^+$-c.c. definable forcing notions along partial orders. We show that such iterations can be corrected to yield an analog of a result by…

We propose a parameterized proxy principle from which $\kappa$-Souslin trees with various additional features can be constructed, regardless of the identity of $\kappa$. We then introduce the microscopic approach, which is a simple method…

After small forcing, any < kappa-closed forcing will destroy the supercompactness, even the strong compactness, of kappa .