English
Related papers

Related papers: Dependent Choice, Properness, and Generic Absolute…

200 papers

The theory ZFC implies the scheme that for every cardinal $\delta$ we can make $\delta$ many dependent choices over any definable relation without terminal nodes. Friedman, the first author, and Kanovei constructed a model of ZFC$^-$ (ZFC…

Logic · Mathematics 2023-09-27 Victoria Gitman , Richard Matthews

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 provide, for any regular uncountable cardinal $\kappa$, a new argument for Pincus' result on the consistency of $\mathrm{ZF}$ with the higher dependent choice principle $\mathrm{DC}_{<\kappa}$ and the ordering principle in the presence…

Logic · Mathematics 2025-10-20 Peter Holy , Jonathan Schilhan

I introduce a new family of axioms extending ZFC set theory, the $\Sigma_n$-correct forcing axioms. These assert roughly that whenever a forcing name $\dot{a}$ can be forced by a poset in some forcing class $\Gamma$ to have some $\Sigma_n$…

Logic · Mathematics 2024-05-17 Ben Goodman

We show that the Axiom of Dependent Choices, $\operatorname{DC}$, holds in countably iterable, passive premice $\mathcal{M}$ construced over their reals which satisfy the Axiom of Determinacy, $\operatorname{AD}$, in a…

Logic · Mathematics 2019-07-08 Sandra Müller

We show that the (typical) quantitative considerations about proper (as too big) and small classes are just tangential facts regarding the consistency of Zermelo-Fraenkel Set Theory with Choice. Effectively, we will construct a first-order…

Logic · Mathematics 2018-04-10 Danny A. J. Gomez-Ramirez

Recently the second author introduced combinatorial principles that characterize supercompactness for inaccessible cardinals but can also hold true for small cardinals. We prove that the proper forcing axiom PFA implies these principles…

Logic · Mathematics 2010-12-10 Matteo Viale , Christoph Weiß

We show that in the theory ZF + DC + for every cardinal {\lambda}, the set of infinite subsets of {\lambda} is well-ordered (i.e., Shelah's AX4), the {\theta}-function measuring the surjective size of the powersets P({\kappa}) can take…

Logic · Mathematics 2018-12-04 Anne Fernengel , Peter Koepke

We study methods to obtain the consistency of forcing axioms, and particularly higher forcing axioms. We first force over a model with a supercompact cardinal $\theta>\kappa$ to get the consistency of the forcing axiom for $\kappa$-strongly…

Logic · Mathematics 2024-03-19 David Asperó , Sean Cox , Asaf Karagila , Christoph Weiss

We develop a toolbox for forcing over arbitrary models of set theory without the axiom of choice. In particular, we introduce a variant of the countable chain condition and prove an iteration theorem that applies to many classical forcings…

Logic · Mathematics 2023-01-02 Daisuke Ikegami , Philipp Schlicht

We introduce finite support iterations of symmetric systems, and use them to provide a strongly modernized proof of David Pincus' classical result that the axiom of dependent choice is independent over ZF with the ordering principle…

Logic · Mathematics 2026-01-14 Peter Holy , Jonathan Schilhan

Generic absoluteness is the phenomenon that certain truths in the set-theoretic universe remain stable under forcing expansions. A classical result by Kripke asserts that every complete Boolean algebra completely embeds into a countably…

Logic · Mathematics 2026-05-08 Cesare Straffelini

The Axiom of Dependent Choice $\mathsf{DC}$ and the Axiom of Countable Choice $\mathsf{AC}_\omega$ are two weak forms of the Axiom of Choice that can be stated for a specific set: $\mathsf{DC}(X)$ asserts that any total binary relation on…

Logic · Mathematics 2025-01-07 Alessandro Andretta , Lorenzo Notaro

We introduce exacting cardinals and a strengthening of these, ultraexacting cardinals. These are natural large cardinals defined equivalently as weak forms of rank-Berkeley cardinals, strong forms of J\'onsson cardinals, or in terms of…

Logic · Mathematics 2025-09-17 Juan P. Aguilera , Joan Bagaria , Philipp Lücke

We introduce a category whose objects are stationary set preserving complete boolean algebras and whose arrows are complete homomorphisms with a stationary set preserving quotient. We show that the cut of this category at a rank initial…

Logic · Mathematics 2015-07-30 Matteo Viale

The forcing theorem is the most fundamental result about set forcing, stating that the forcing relation for any set forcing is definable and that the truth lemma holds, that is everything that holds in a generic extension is forced by a…

Logic · Mathematics 2017-10-31 Peter Holy , Regula Krapf , Philipp Lücke , Ana Njegomir , Philipp Schlicht

In the first part of this paper, we consider several natural axioms in urelement set theory, including the Collection Principle, the Reflection Principle, the Dependent Choice scheme and its generalizations, as well as other axioms…

Logic · Mathematics 2024-11-20 Bokai Yao

This paper studies structural consequences of supercompactness of $\omega_1$ under $\sf{ZF}$. We show that the Axiom of Dependent Choice $(\sf{DC})$ follows from "$\omega_1$ is supercompact". "$\omega_1$ is supercompact" also implies that…

Logic · Mathematics 2019-04-04 Daisuke Ikegami , Nam Trang

We mainly investigate model of set theory with restricted choice, e.g., ZF + DC + "the family of countable subsets of lambda is well ordered for every lambda" (really local version for a given lambda). In this frame much of pcf theory can…

Logic · Mathematics 2019-01-29 Saharon Shelah

We make use of generalized iterations of Jensen forcing to define a cardinal-preserving generic model of ZF for any $n\ge 1$ and each of the following four Choice hypotheses: (1)…

Logic · Mathematics 2025-12-22 Vladimir Kanovei , Vassily Lyubetsky
‹ Prev 1 2 3 10 Next ›