English
Related papers

Related papers: Forcing consequences of PFA together with the cont…

200 papers

We give a modification of Mitchell's technique for adding objects of size $\omega_2$ with conditions with finite working parts in which the collections of models used as side conditions are very highly structured, arguably making them more…

Logic · Mathematics 2014-11-25 Charles Morgan

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 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 introduce a forcing that adds a $\square(\aleph_2,\aleph_0)$-sequence with countable conditions under CH. Assuming the consistency of a weakly compact cardinal, we can find a forcing extension by our new poset in which both…

Logic · Mathematics 2026-03-17 Maxwell Levine

The purpose of this paper is to present some results which suggest that the Singular Cardinals Hypothesis follows from the Proper Forcing Axiom. What will be proved is that a form of simultaneous reflection follows from the Set Mapping…

Logic · Mathematics 2013-10-08 Justin Tatch Moore

We present a method which allows the combination of forcing uniformization on the $\Pi$- and the $\Sigma$-side of the projective hierarchy to a certain extent. Using this method we construct a universe where ${\Pi}^1_3$-reduction holds,…

Logic · Mathematics 2025-11-10 Stefan Hoffelner

In this paper we prove that the maximum principle in forcing is equivalent to the axiom of choice. The maximum principle is the property of forcing: p ||- exists x theta(x) iff for some name tau p ||- theta(tau). We also look at three…

Logic · Mathematics 2011-05-27 Arnold W. Miller

The technique of "classical realizability" is an extension of the method of "forcing"; it permits to extend the Curry-Howard correspondence between proofs and programs, to Zermelo-Fraenkel set theory and to build new models of ZF, called…

Logic in Computer Science · Computer Science 2018-03-20 Jean-Louis Krivine

We introduce two types of variations of setwise climbability properties, which have been introduced by the second author as fragments of Jensen's square principles. We show that variations of the first type are equivalent to known…

Logic · Mathematics 2026-03-06 Bernhard König , Yasuo Yoshinobu

Suppose that $T^*$ is an $\omega_1$-Aronszajn tree with no stationary antichain. We introduce a forcing axiom PFA($T^*$) for proper forcings which preserve these properties of $T^*$. We prove that PFA($T^*$) implies many of the strong…

Logic · Mathematics 2020-04-28 John Krueger

An introduction is given to the logic of sheaves of structures and to set theoretic forcing constructions based on this logic. Using these tools, it is presented an alternative proof of the independence of the Continuum Hypothesis; which…

Logic · Mathematics 2012-02-08 J. Benavides

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

Assuming $\rm PFA$, we shall use internally club $\omega_1$-guessing models as side conditions to show that for every tree $T$ of height $\omega_2$ without cofinal branches, there is a proper and $\aleph_2$-preserving forcing notion with…

Logic · Mathematics 2022-03-14 Rahman Mohammadpour

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

We ask for a given system of polynomials f_1,...,f_n and f over the complex numbers when there exist continuous functions q_1,...,q_n such that q_1 f_1+...+q_n f_n = f. This condition defines the continuous closure of an ideal. We give…

Commutative Algebra · Mathematics 2007-05-23 Holger Brenner

The modal logic of forcing arises when one considers a model of set theory in the context of all its forcing extensions, interpreting necessity as "in all forcing extensions" and possibility as "in some forcing extension". In this modal…

Logic · Mathematics 2012-07-26 Joel David Hamkins , George Leibman , Benedikt Löwe

David Aspero asks on the possibility of having Forcing axiom FA_{aleph_2}(K), where K is the class of forcing notions preserving stationarity of subsets of aleph_1 and of aleph_2. We answer negatively, in fact we show the negative result…

Logic · Mathematics 2007-05-23 Saharon Shelah

The landmark Levy-Solovay Theorem limits the kind of large cardinal embeddings that can exist in a small forcing extension. Here I announce a generalization of this theorem to a broad new class of forcing notions. One consequence is that…

Logic · Mathematics 2007-05-23 Joel David Hamkins

We investigate the systematic design of compliant morphing structures composed of materials reacting to an external stimulus. We add a perimeter penalty term to ensure existence of solutions. We propose a phase-field approximation of this…

Numerical Analysis · Mathematics 2024-11-12 Jamal Shabani , Kaushik Bhattacharya , Blaise Bourdin

If T has only countably many complete types, yet has a type of infinite multiplicity then there is a ccc forcing notion Q such that, in any Q --generic extension of the universe, there are non-isomorphic models M_1 and M_2 of T that can be…

Logic · Mathematics 2007-05-23 Michael C. Laskowski , Saharon Shelah