English
Related papers

Related papers: Forcing indestructibility of set-theoretic axioms

200 papers

We show that if the weak compactness of a cardinal is made indestructible by means of any preparatory forcing of a certain general type, including any forcing naively resembling the Laver preparation, then the cardinal was originally…

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

We introduce the forcing property of descending distributivity. A forcing $\mathbb{P}$ is $\kappa$-descending distributive if for all decreasing sequences $(D_\alpha)_{\alpha<\kappa}$ of open dense sets, $\bigcap_\alpha D_\alpha$ is open…

Logic · Mathematics 2025-06-16 Calliope Ryan-Smith

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

Discrete Mathematics · Computer Science 2017-08-08 Emmanuel Jeandel

We show, assuming PD, that every complete finitely axiomatized second order theory with a countable model is categorical, but that there is, assuming again PD, a complete recursively axiomatized second order theory with a countable model…

Logic · Mathematics 2024-05-07 Tapio Saarinen , Jouko Väänänen , William Hugh Woodin

We show that Vopenka's Principle and Vopenka cardinals are indestructible under reverse Easton forcing iterations of increasingly directed-closed partial orders, without the need for any preparatory forcing. As a consequence, we are able to…

Logic · Mathematics 2012-02-28 Andrew D. Brooke-Taylor

In various models of set theory, we consider covering Aleph_1 x Aleph_1 rectangles by countably many smooth curves, and we study differentiable isomorphisms between Aleph_1-dense sets of reals.

Logic · Mathematics 2010-05-31 Kenneth Kunen

We develop foundational aspects of stability theory in affine logic. On the one hand, we prove appropriate affine versions of many classical results, including definability of types, existence of non-forking extensions, and other…

Logic · Mathematics 2026-03-11 Itaï Ben Yaacov , Tomás Ibarlucía

We show that it is consistent from an inaccessible cardinal that classical Namba forcing has the weak $\omega_1$-approximation property. In fact, this is the case if $\aleph_1$-preserving forcings do not add cofinal branches to…

Logic · Mathematics 2025-03-24 Maxwell Levine

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

We present a general framework for forcing on $\omega_2$ with finite conditions using countable models as side conditions. This framework is based on a method of comparing countable models as being membership related up to a large initial…

Logic · Mathematics 2016-06-10 John Krueger

$\mathsf{ZF + AD}$ proves that for all nontrivial forcings $\mathbb{P}$ on a wellorderable set of cardinality less than $\Theta$, $1_{\mathbb{P}} \Vdash_{\mathbb{P}} \neg\mathsf{AD}$. $\mathsf{ZF + AD} + \Theta$ is regular proves that for…

Logic · Mathematics 2019-03-19 William Chan , Stephen Jackson

The technique of symmetric extensions is derived from forcing and it is one of the most important tools for studying models without the Axiom of Choice. Despite being incredibly successful since the 1960s, our understanding of the technique…

Logic · Mathematics 2026-02-20 Asaf Karagila , Jonathan Schilhan

This article will be a continuation of our research into self-justifying systems. It will introduce several new theorems and their applications. (One of these results will transform our previous infinite-sized self-verifying formalisms into…

Logic · Mathematics 2014-01-14 Dan E. Willard

The main goal of this note is to prove the following theorem. If $A_n$ is a sequence of measurable sets in a $\sigma$-finite measure space $(X, \mathcal{A}, \mu)$ that covers $\mu$-a.e. $x \in X$ infinitely many times, then there exists a…

Logic · Mathematics 2011-09-23 Márton Elekes

We give characterizations for the (in ZFC unprovable) sentences ``Every $\Sb{1}{2}$--set is measurable" and ``Every $\Db{1}{2}$--set is measurable" for various notions of measurability derived from well--known forcing partial orderings.

Logic · Mathematics 2016-09-07 Jörg Brendle , Benedikt Loewe

We describe a formal proof of the independence of the continuum hypothesis ($\mathsf{CH}$) in the Lean theorem prover. We use Boolean-valued models to give forcing arguments for both directions, using Cohen forcing for the consistency of…

Logic · Mathematics 2021-02-08 Jesse Michael Han , Floris van Doorn

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…

Logic · Mathematics 2007-05-23 Todd Eisworth

We investigate the effects of various forcings on several forms of the Halpern-L\"auchli Theorem. For inaccessible $\kappa$, we show they are preserved by forcings of size less than $\kappa$. Combining this with work of Zhang in…

Logic · Mathematics 2019-05-21 Natasha Dobrinen , Dan Hathaway

We show that Shelah cardinals are preserved under the canonical $GCH$ forcing notion. We also show that if $GCH$ holds and $F:REG\rightarrow CARD$ is an Easton function which satisfies some weak properties, then there exists a cofinality…

Logic · Mathematics 2016-09-28 Mohammad Golshani

We combine several folklore observations to provide a working framework for iterating constructions which contradict the axiom of choice. We use this to define a model in which any kind of structural failure must fail with a proper class of…

Logic · Mathematics 2021-07-26 Asaf Karagila