English
Related papers

Related papers: Unprepared Indestructibility

200 papers

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

This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…

Logic in Computer Science · Computer Science 2025-09-03 Seth Bulin

In this paper we will develop an axiomatic foundation for the geometric study of straight edge, protractor, and compass constructions, which while being related to previous foundations, will be the first to have all axioms written and all…

Metric Geometry · Mathematics 2020-09-18 John R. Burke

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

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 mechanize, in the proof assistant Isabelle, a proof of the axiom-scheme of Separation in generic extensions of models of set theory by using the fundamental theorems of forcing. We also formalize the satisfaction of the axioms of…

Logic in Computer Science · Computer Science 2019-01-11 Emmanuel Gunther , Miguel Pagano , Pedro Sánchez Terraf

In this short note, we shall prove some observations regarding the connection between indestructible $\omega_1$-guessing models and the $\omega_1$-approximation property of forcing notions.

Logic · Mathematics 2022-02-18 Rahman Mohammadpour

The aim of these lectures is to give a short introduction to forcing. We will avoid metamathematical issues as much as possible and similarly we will avoid performing the actual construction of forcing. We assume familiarity with basic…

Logic · Mathematics 2015-03-30 Mohammad Golshani

We show that Dependent Choice is a sufficient choice principle for developing the basic theory of proper forcing, and for deriving generic absoluteness for the Chang model in the presence of large cardinals, even with respect to…

Logic · Mathematics 2023-06-22 David Asperó , Asaf Karagila

In this paper I introduce a new and intuitive first-order foundational theory (where the concept of set is not primitive) and use it to show that the power set of an infinite set does not exist. In particular, proofs of uncountability of a…

Logic · Mathematics 2018-12-04 Eddy El Khalil

We present a new and direct proof of Grothendieck's generic freeness lemma in its general form. Unlike the previously published proofs, it does not proceed in a series of reduction steps and is fully constructive, not using the axiom of…

Commutative Algebra · Mathematics 2018-07-04 Ingo Blechschmidt

We present a version with non-definable forcing notions of Shelah's theory of iterated forcing along a template. Our main result, as an application, is that, if $\kappa$ is a measurable cardinal and $\theta<\kappa<\mu<\lambda$ are…

Logic · Mathematics 2015-06-23 Diego Alejandro Mejía

(withdrawn.) For every lambda we give an explicit construction of an Abelian group with no non-trivial automorphisms. In particular the group absolutely has no non-trivial automorphisms, hence is absolutely indecomposable. Earlier we knew a…

Logic · Mathematics 2019-09-10 Saharon Shelah

A new axiom is proposed, the Ground Axiom, asserting that the universe is not a nontrivial set-forcing extension of any inner model. The Ground Axiom is first-order expressible, and any model of ZFC has a class-forcing extension which…

Logic · Mathematics 2007-05-23 Jonas Reitz

We develop a theory for describing composite objects in physics. These can be static objects, such as tables, or things that happen in spacetime (such as a region of spacetime with fields on it regarded as being composed of smaller such…

Quantum Physics · Physics 2013-03-20 Lucien Hardy

We study a well-known technique of using absoluteness for giving choice-free proofs to some statements which are known to be provable with the axiom of choice. The idea is to reduce the problem to an inner model where the axiom of choice…

Logic · Mathematics 2014-02-20 Asaf Karagila

In the Zermelo--Fraenkel set theory with the Axiom of Choice a forcing notion is "$\kappa$-distributive" if and only if it is "$\kappa$-sequential". We show that without the Axiom of Choice this equivalence fails, even if we include a weak…

Logic · Mathematics 2022-12-22 Asaf Karagila , Jonathan Schilhan

We present a logic for the reasoning about necessity and justifications which is independent from relational semantics. We choose the concept of justification -- coming from a class of "Justification Logics" (Artemov 2008, Fitting 2009) --…

Logic in Computer Science · Computer Science 2015-03-20 Steffen Lewitzka

We study the properties of the constructible universe, L, over intuitionistic theories. We give an extended set of fundamental operations which is sufficient to generate the universe over Intuitionistic Kripke-Platek set theory without…

Logic · Mathematics 2023-09-27 Richard Matthews , Michael Rathjen

We prove that a large class of presaturated ideals at inaccessible cardinals can be de-saturated while preserving their presaturation, answering both a question of Foreman and of Cox and Eskew. We do so by iterating a generalized version of…

Logic · Mathematics 2021-04-21 Noah Schoem