English
Related papers

Related papers: Forcing consequences of PFA together with the cont…

200 papers

In this note we will discuss a new reflection principle which follows from the Proper Forcing Axiom. The immediate purpose will be to prove that the bounded form of the Proper Forcing Axiom implies both that 2^omega = omega_2 and that…

Logic · Mathematics 2013-10-08 Justin Tatch Moore

We note that some form of the condition "$p_1, p_2$ have a $\leq_{\mathbb{Q}}$-lub in $\mathbb{Q}$" is necessary in some forcing axiom for $\lambda$-complete $\mu^+$-c.c. forcing notions. We also show some versions are really stronger than…

Logic · Mathematics 2020-07-30 Saharon Shelah

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…

Logic · Mathematics 2016-07-05 Joel David Hamkins

We try to control many cardinal characteristics by working with a notion of orthogonality between two families of forcings. We show that b^+<g is consistent

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

We develop the basic fine structure theory of the minimal model of the Largest Suslin Axiom. In particular, we prove that that the minimal model of the Largest Suslin Axiom satisfies the Mouse Set Conjecture, and that the Proper Forcing…

Logic · Mathematics 2025-02-03 Grigor Sargsyan , Nam Trang

Assume $\kappa = \kappa^{< \kappa}$ (usually $\aleph_0$ or an inaccessible). We shall deal with iterated forcings preserving ${}^{\kappa>}{\rm Ord}$ and not collapsing cardinals along a linear order $L$. A sufficient condition for this,…

Logic · Mathematics 2026-03-19 Saharon Shelah

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…

Logic · Mathematics 2021-09-24 Mohammad Golshani

We present a direct construction of stationary set preserving forcings that make $\omega$-cofinal all the members of some arbitrary set $\mathcal{K}$ of regular cardinals $\kappa > \omega_1$. In addition, it is made possible to ensure that…

Logic · Mathematics 2025-10-29 Ben De Bondt , Boban Velickovic

For a relational structure ${\mathbb X}$ we investigate the partial order $\langle {\mathbb P} ({\mathbb X}) ,\subset \rangle$, where ${\mathbb P} ({\mathbb X}):=\{ f[X]: f\in \mathop{\rm Emb}\nolimits ({\mathbb X})\}$. Here we consider…

Logic · Mathematics 2024-04-24 Miloš S. Kurilić

We show that the weakest versions of Foreman's minimal generic hugeness axioms cannot hold simultaneously on adjacent cardinals. Moreover, conventional forcing techniques cannot produce a model of one of these axioms.

Logic · Mathematics 2023-03-27 Monroe Eskew

We present three syntactic forcing models for coherent logic. These are based on sites whose underlying category only depends on the signature of the coherent theory, and they do not presuppose that the logic has equality. As an application…

Logic · Mathematics 2017-12-22 Marc Bezem , Ulrik Buchholtz , Thierry Coquand

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

We prove forcing axiom equivalents of two families of weakenings of the axiom of choice: a trichotomy principle for cardinals isolated by L\'evy, ${\rm H\hskip0.05pt}_\kappa$, and ${\rm DC}_\kappa$, the principle of dependent choices…

Logic · Mathematics 2025-02-19 Diego Lima Bomfim , Charles Morgan , Samuel Gomes da Silva

We generalise the termination method of higher-order polynomial interpretations to a setting with impredicative polymorphism. Instead of using weakly monotonic functionals, we interpret terms in a suitable extension of System F-omega. This…

Logic in Computer Science · Computer Science 2019-04-23 Łukasz Czajka , Cynthia Kop

The class forcing theorem, which asserts that every class forcing notion $\mathbb{P}$ admits a forcing relation $\Vdash_{\mathbb{P}}$, that is, a relation satisfying the forcing relation recursion -- it follows that statements true in the…

A system $(P_\alpha: \alpha\in\mathcal{A})$ of probability distributions on a partially ordered set (poset) $\mathcal{S}$ indexed by another poset $\mathcal{A}$ can be realized by a system of $\mathcal{S}$-valued random variables…

Probability · Mathematics 2024-08-21 Motoya Machida

This expository paper, aimed at the reader without much background in set theory or logic, gives an overview of Cohen's proof (via forcing) of the independence of the continuum hypothesis. It emphasizes the broad outlines and the intuitive…

Logic · Mathematics 2008-05-08 Timothy Y. Chow

We deal with (< kappa)-supported iterated forcing notions which are (E_0,E_1)-complete, have in mind problems on Whitehead groups, uniformizations and the general problem. We deal mainly with the successor of a singular case. This continues…

Logic · Mathematics 2016-09-07 Saharon Shelah

In this paper we investigate some properties of forcing which can be considered "nice" in the context of singularizing regular cardinals to have an uncountable cofinality. We show that such forcing which changes cofinality of a regular…

Logic · Mathematics 2018-05-15 Yair Hayut , Asaf Karagila

We introduce several properties of forcing notions which imply that their lambda-support iterations are lambda-proper. Our methods and techniques refine those studied in math.LO/9906024, math.LO/0210205, math.LO/0508272 and math.LO/0605067,…

Logic · Mathematics 2013-01-04 Andrzej Roslanowski , Saharon Shelah