中文
相关论文

相关论文: Preservation of a Souslin tree and side conditions

200 篇论文

We show that many countable support iterations of proper forcings preserve Souslin trees. We establish sufficient conditions in terms of games and we draw connections to other preservation properties. We present a proof of preservation…

逻辑 · 数学 2013-09-03 Heike Mildenberger , Saharon Shelah

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…

逻辑 · 数学 2022-03-14 Rahman Mohammadpour

We prove various iteration theorems for forcing classes related to subproper and subcomplete forcing, introduced by Jensen. In the first part, we use revised countable support iterations, and show that 1) the class of subproper,…

逻辑 · 数学 2025-04-16 Gunter Fuchs , Corey Bacal Switzer

Let $T^*$ be an almost Suslin tree, that is, an Aronszajn tree with no stationary antichains. Krueger introduced a forcing axiom, $\mathrm{PFA}(T^*)$, for the class of proper forcings that preserve that $T^*$ is almost Suslin. He showed…

逻辑 · 数学 2025-11-05 Carlos Martínez-Ranero , Lucas Polymeris

We present S. Todorcevic's method of forcing with a coherent Souslin tree over restricted iteration axioms as a black box usable by those who wish to avoid its complexities but still access its power.

一般拓扑 · 数学 2016-07-18 Franklin D. Tall

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…

逻辑 · 数学 2015-01-26 David Asperó , Miguel Angel Mota

Forcing axioms are generalizations of Baire category principles that allow one to intersect more dense open sets and to do so in a wider variety of circumstances. In this paper we introduce two new forcing axioms related to posets which…

逻辑 · 数学 2025-02-05 Thomas Gilton

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…

逻辑 · 数学 2020-04-28 John Krueger

We introduce the notion of effective Axiom A and use it to show that some popular tree forcings are Suslin+. We introduce transitive nep and present a simplified version of Shelah's "preserving a little implies preserving much": If I is a…

逻辑 · 数学 2009-09-29 Jakob Kellner

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,…

逻辑 · 数学 2013-04-10 Boban Velickovic , Giorgio Venturi

I prove preservation theorems for countable support iteration of proper forcing concerning certain classes of capacities and submeasures. New examples of forcing notions and connections with measure theory are included.

逻辑 · 数学 2007-05-23 Jindrich Zapletal

The preservation theorems for semi-properness, hemi-properness, and pseudo-completeness hold for countable support iterations as well as revised countable support iterations, notwithstanding the fact that the "factor lemma" fails for the…

逻辑 · 数学 2009-09-25 Chaz Schlindwein

We derive a forcing axiom from the conjunction of square and diamond, and present a few applications, primary among them being the existence of super-Souslin trees. It follows that for every uncountable cardinal $\lambda$, if $\lambda^{++}$…

逻辑 · 数学 2019-08-15 Chris Lambie-Hanson , Assaf Rinot

We present preservation theorems for countable support iteration of nep forcing notions satisfying ``old reals are not Lebesgue null'' and ``old reals are not meager''. (Nep is a generalization of Suslin proper.) We also give some results…

逻辑 · 数学 2007-05-23 Jakob Kellner , Saharon Shelah

We investigate properties of trees of height $\omega_1$ and their preservation under subcomplete forcing. We show that subcomplete forcing cannot add a new branch to an $\omega_1$-tree. We introduce fragments of subcompleteness which are…

逻辑 · 数学 2018-02-06 Gunter Fuchs , Kaethe Minden

This paper explores the consistency strength of The Proper Forcing Axiom ($\textsf{PFA}$) and the theory (T) which involves a variation of the Viale-Wei$\ss$ guessing hull principle. We show that (T) is consistent relative to a supercompact…

逻辑 · 数学 2016-08-23 Nam Trang

Assuming the P-ideal dichotomy, we attempt to isolate those cardinal characteristics of the continuum that are correlated with two well-known consequences of the proper forcing axiom. We find a cardinal invariant $\mathfrak{x}$ such that…

逻辑 · 数学 2013-05-27 Dilip Raghavan , Stevo Todorcevic

We apply Neeman's method of forcing with side conditions to show that PFA does not imply the precipitousness of the nonstationary ideal on $\omega_1$.

逻辑 · 数学 2015-04-22 Boban Velickovic

We introduce a method of constructing a forcing along a simplified $(\kappa,1)$-morass such that the forcing satisfies the $\kappa$-chain condition. Alternatively, this may be seen as a method to thin out a larger forcing to get a chain…

逻辑 · 数学 2008-10-30 Bernhard Irrgang

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…

逻辑 · 数学 2007-05-23 Bernhard Koenig
‹ 上一页 1 2 3 10 下一页 ›