English
Related papers

Related papers: The Proper Forcing Axiom and the Singular Cardinal…

200 papers

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…

Assuming an abstract comparison principle called the Ultrapower Axiom, which is motivated by the comparison process of inner model theory and generalizes the statement that the Mitchell order is linear on normal ultrafilters, we…

Logic · Mathematics 2018-01-30 Gabriel Goldberg

We present three natural combinatorial properties for class forcing notions, which imply the forcing theorem to hold. We then show that all known sufficent conditions for the forcing theorem (except for the forcing theorem itself),…

Logic · Mathematics 2017-10-31 Peter Holy , Regula Krapf , Philipp Schlicht

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

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

Forcing axioms are generalizations of Baire category principles that allow one to intersect more dense open sets and to do so in a wider variety of circumstances. In this paper we introduce two new forcing axioms related to posets which…

Logic · Mathematics 2025-02-05 Thomas Gilton

We use the core model for sequences of measures to prove a new lower bound for the consistency strength of the failure of the SCH: THEOREM (i) If there is a singular strong limit cardinal $\kappa$ such that $2^\kappa > kappa^+$ then there…

Logic · Mathematics 2016-09-06 William J. Mitchell

These notes are extracted from the lectures on forcing axioms and applications held by professor Matteo Viale at the University of Turin in the academic year 2011-2012. Our purpose is to give a brief account on forcing axioms with a special…

Logic · Mathematics 2014-12-25 Giorgio Audrito , Gemma Carotenuto

The weakly compact reflection principle $\text{Refl}_{\text{wc}}(\kappa)$ states that $\kappa$ is a weakly compact cardinal and every weakly compact subset of $\kappa$ has a weakly compact proper initial segment. The weakly compact…

Logic · Mathematics 2017-09-05 Brent Cody , Hiroshi Sakai

Let $\mathsf{MM}^{++}(\kappa)$ state that the forcing axiom $\mathsf{MM}^{++}$ can be instantiated only for stationary set preserving posets of size at most $\kappa$. We give a detailed account of Asper\`o and Schindler's proof that…

Logic · Mathematics 2021-11-09 Matteo Viale

We answer a question of Woodin by showing that assuming an inaccessible cardinal $\kappa$ which is a limit of ${<}\kappa$-supercompact cardinals exists, there is a stationary set preserving forcing $\mathbb{P}$ so that $V^{\mathbb…

Logic · Mathematics 2024-03-15 Andreas Lietz

This paper explores the consistency strength of The Proper Forcing Axiom ($\textsf{PFA}$) and the theory (T) which involves a variation of the Viale-Wei$\ss$ guessing hull principle. We show that (T) is consistent relative to a supercompact…

Logic · Mathematics 2016-08-23 Nam Trang

The paper settles the problem of the consistency of the existence of a single universal graph between a strong limit singular and its power. Assuming that in a model of $\mathbf{GCH}$ $\kappa$ is supercompact and the cardinals $\theta <…

Logic · Mathematics 2022-01-04 Márk Poór , Saharon Shelah

Providing explanations about how machine learning algorithms work and/or make particular predictions is one of the main tools that can be used to improve their trusworthiness, fairness and robustness. Among the most intuitive type of…

Machine Learning · Computer Science 2024-04-12 Rubén Ruiz-Torrubiano

A proof of the continuous martingale convergence theorem is provided. It relies on a classical martingale inequality and the almost sure convergence of a uniformly bounded non-negative super-martingale, after a truncation argument.

Probability · Mathematics 2021-11-25 Joe Ghafari

There are several examples in the literature showing that compactness-like properties of a cardinal $\kappa$ cause poor behavior of some generic ultrapowers which have critical point $\kappa$ (Burke \cite{MR1472122} when $\kappa$ is a…

Logic · Mathematics 2011-10-19 Sean Cox , Matteo Viale

We summarize the known methods of producing a non-supercompact strongly compact cardinal and describe some new variants. Our Main Theorem shows how to apply these methods to many cardinals simultaneously and exactly control which cardinals…

Logic · Mathematics 2007-05-23 Arthur W. Apter , Joel David Hamkins

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…

Logic · Mathematics 2021-07-16 Bagaria Joan , Poveda Alejandro

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

We prove an iteration theorem which guarantees for a wide class of nice iterations of $\omega_1$-preserving forcings that $\omega_1$ is not collapse, at the price of needing large cardinals to burn as fuel. More precisely, we show that a…

Logic · Mathematics 2024-03-15 Andreas Lietz