English
Related papers

Related papers: Forcing Axioms for Proper Posets Preserving a Topo…

200 papers

In this paper we show that forcings which are strongly proper for stationarily many countable elementary submodels preserve each of the following properties of topological spaces: countably tight; Lindel\"of; Rothberger; Menger; and a…

Logic · Mathematics 2024-10-04 Thomas Gilton , Jared Holshouser

We develop a new method for building forcing iterations with symmetric systems of structures as side conditions. Using our method we prove that the forcing axiom for the class of all the small finitely proper posets is compatible with a…

Logic · Mathematics 2015-01-26 David Asperó , Miguel Angel Mota

Various theorems for the preservation of set-theoretic axioms under forcing are proved, regarding both forcing axioms and axioms true in the Levy-Collapse. These show in particular that certain applications of forcing axioms require to add…

Logic · Mathematics 2007-05-23 Bernhard Koenig

We prove that a wide class of strongly proper forcing posets have quotients with strong properties. Specifically, we prove that quotients of forcing posets which have simple universal strongly generic conditions on a stationary set of…

Logic · Mathematics 2015-06-08 Sean Cox , John Krueger

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

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

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

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 develop a general framework for forcing with coherent adequate sets on $H(\lambda)$ as side conditions, where $\lambda \ge \omega_2$ is a cardinal of uncountable cofinality. We describe a class of forcing posets which we call coherent…

Logic · Mathematics 2014-06-13 John Krueger , Miguel Angel Mota

It was realized early on that topologies can model constructive systems, as the open sets form a Heyting algebra. After the development of forcing, in the form of Boolean-valued models, it became clear that, just as over ZF any…

Logic · Mathematics 2015-10-06 Robert Lubarsky

We develop a general theory for class-sized symmetric systems as a natural extension of symmetric systems with respect to class forcing. In particular, adapting the usual notions of pretameness and tameness for class forcing, we present…

Logic · Mathematics 2026-04-01 Peter Holy , Emma Palmer , Jonathan Schilhan

We introduce the idea of a coherent adequate set of models, which can be used as side conditions in forcing. As an application we define a forcing poset which adds a square sequence on $\omega_2$ using finite conditions.

Logic · Mathematics 2014-06-13 John Krueger

It is well known that pretameness implies the forcing theorem, and that pretameness is characterized by the preservation of the axioms of $\mathsf{ZF}^-$, that is $\mathsf{ZF}$ without the power set axiom, or equivalently, by the…

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

In these notes we present the method introduced by Neeman of generalized side conditions with two types of models. We then discuss some applications: the Friedman-Mitchell poset for adding a club in \omega_2 with finite conditions,…

Logic · Mathematics 2013-04-10 Boban Velickovic , Giorgio Venturi

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

We show how to force, with finite conditions, the forcing axiom PFA(T), a relativization of PFA to proper forcing notions preserving a given Souslin tree T. The proof uses a Neeman style iteration with generalized side conditions consisting…

Logic · Mathematics 2014-07-16 Giorgio Venturi

We show that the Proper Forcing Axiom for forcing notions of size $\aleph_1$ is consistent with the continuum being arbitrarily large. In fact, assuming $GCH$ holds and $\kappa\geq\omega_2$ is a regular cardinal, we prove that there is a…

Logic · Mathematics 2025-08-26 David Asperó , Mohammad Golshani

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

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 investigate preservation of the Lindel\"of property of topological spaces under forcing extensions. We give sufficient conditions for a forcing notion to preserve several strengthenings of the Lindel\"of property, such as indestructible…

General Topology · Mathematics 2010-11-10 Masaru Kada
‹ Prev 1 2 3 10 Next ›