English
Related papers

Related papers: Cohen Forcing and Inner Models

200 papers

We show: There are pairs of universes V_1 subseteq V_2 and there is a notion of forcing P in V_1 such that the change mentioned in the title occurs when going from V_1[G] to V_2[G] for a P-generic filter G over V_2. We use forcing…

Logic · Mathematics 2007-05-23 Heike Mildenberger , Saharon Shelah

We show that some of the most prominent large cardinal notions can be characterized through the validity of certain combinatorial principles at $\omega_2$ in forcing extensions by the pure side condition forcing introduced by Neeman. The…

Logic · Mathematics 2018-11-01 Peter Holy , Philipp Lücke , Ana Njegomir

The following pcf results are proved: 1. Assume that kappa > aleph_0 is a weakly compact cardinal. Let mu > 2^kappa be a singular cardinal of cofinality kappa. Then for every regular lambda < pp^+_{Gamma(kappa)} (mu) there is an increasing…

Logic · Mathematics 2013-07-24 Moti Gitik , Saharon Shelah

We define a generic Vop\v{e}nka cardinal to be an inaccessible cardinal $\kappa$ such that for every first-order language $\mathcal{L}$ of cardinality less than $\kappa$ and every set $\mathscr{B}$ of $\mathcal{L}$-structures, if…

Logic · Mathematics 2019-08-13 Trevor M. Wilson

In this paper we introduce a tree-like forcing notion extending some properties of the random forcing in the context of the generalised Cantor space and study its associated ideal of null sets and notion of measurability. This issue was…

Logic · Mathematics 2020-04-28 Sy David Friedman , Giorgio Laguzzi

Assuming the negation of Chang's conjecture, there is a c.c.c. forcing which adds a strongly non-saturated Aronszajn tree. Using a Mahlo cardinal, we construct a model in which there exists a strongly non-saturated Aronszajn tree and the…

Logic · Mathematics 2025-06-30 John Krueger , Šárka Stejskalová

Fix a set-theoretic universe $V$. We look at small extensions of $V$ as generalised degrees of computability over $V$. We also formalise and investigate the complexity of certain methods one can use to define, in $V$, subclasses of degrees…

Logic · Mathematics 2025-01-03 Desmond Lau

The modal logic of forcing arises when one considers a model of set theory in the context of all its forcing extensions, interpreting necessity as "in all forcing extensions" and possibility as "in some forcing extension". In this modal…

Logic · Mathematics 2012-07-26 Joel David Hamkins , George Leibman , Benedikt Löwe

For a cardinal lambda<lambda_{omega_1} we give a ccc forcing notion P which forces that for some Borel subset B of the Cantor space (1) there a sequence (eta_alpha:alpha<lambda) of distinct elements such that |(eta_alpha+B) cap…

Logic · Mathematics 2018-06-19 Andrzej Roslanowski , Saharon Shelah

A club consisting of former regulars is added to an inaccessible cardinal, without changing cofinalities outside it. The initial assumption is optimal. A variation of the Radin forcing without a top measurable cardinal is introduced for…

Logic · Mathematics 2022-06-14 Moti Gitik , Sittinon Jirattikansakul

In the context of $\mathsf{ZF}+\mathsf{DC}$, we force $\mathsf{DC}_\kappa$ for relations on $\mathcal{P}(\kappa)$ for $\kappa{}<\aleph_\omega$ over the Chang model $\mathrm{L}(\mathrm{Ord}^\omega)$ making some assumptions on the thorn…

Logic · Mathematics 2024-04-01 James Holland , Grigor Sargsyan

If T is an iteration tree on K and F is a countably certified extender that coheres with the final model of T, then F is on the extender sequence of the final model of T. Several applications of maximality are proved, including: o K…

Logic · Mathematics 2016-09-07 Ernest Schimmerling , John R. Steel

We obtain a small ultrafilter number at $\aleph_{\omega_1}$. Moreover, we develop a version of the overlapping strong extender forcing with collapses which can keep the top cardinal $\kappa$ inaccessible. We apply this forcing to construct…

Logic · Mathematics 2025-12-10 Tom Benhamou , Sittinon Jirattikansakul

Let $\mathcal{SN}$ be the $\sigma$-ideal of the strong measure zero sets of reals. We present general properties of forcing notions that allow to control of the additivity of $\mathcal{SN}$ after finite support iterations. This is applied…

Logic · Mathematics 2025-08-21 Jörg Brendle , Miguel A. Cardona , Diego A. Mejía

Assuming 0^sharp does not exist, kappa is an uncountable cardinal and for all cardinals lambda with kappa <= lambda < kappa^{+ omega}, 2^lambda = lambda^+, we present a ``mini-coding'' between kappa and kappa^{+ omega}. This allows us to…

Logic · Mathematics 2016-09-06 Saharon Shelah , Lee Stanley

Let $D$ be an infinite discrete set of measurable cardinals. It is shown that generalized Prikry forcing to add a countable sequence to each cardinal in $D$ is subcomplete. To do this it is shown that a simplified version of generalized…

Logic · Mathematics 2018-12-31 Kaethe Minden

The productivity of the $\kappa$-chain condition, where $\kappa$ is a regular, uncountable cardinal, has been the focus of a great deal of set-theoretic research. In the 1970s, consistent examples of $\kappa$-cc posets whose squares are not…

Logic · Mathematics 2018-12-05 Chris Lambie-Hanson , Assaf Rinot

We give a brief survey on the interplay between forcing axioms and various other non-constructive principles widely used in many fields of abstract mathematics, such as the axiom of choice and Baire's category theorem. First of all we…

Logic · Mathematics 2019-12-03 Matteo Viale

We show that the Proper Forcing Axiom implies the Singular Cardinal Hypothesis. The proof is by interpolation and uses the Mapping Reflection Principle.

Logic · Mathematics 2007-05-23 Matteo Viale

Small forcing always ruins the indestructibility of an indestructible supercompact cardinal. In fact, after small forcing, any cardinal $\kappa$ becomes superdestructible---any further ${<}\kappa$-closed forcing which adds a subset to…

Logic · Mathematics 2016-07-05 Joel David Hamkins