中文
相关论文

相关论文: Towards Martin's Minimum

200 篇论文

We study a family of variants of Jensen's\emph{subcomplete forcing axiom}, $\mathsf{SCFA}$ and \emph{subproper forcing axiom}, $\mathsf{SubPFA}$. Using these we develop a general technique for proving non-implications of $\mathsf{SCFA}$,…

逻辑 · 数学 2025-08-06 Hiroshi Sakai , Corey Bacal Switzer

We discuss the effect of adding a single real (for various forcing notions adding reals) on cardinal invariants associated with the continuum (like the unbounding or the dominating number or the cardinals related to measure and category on…

逻辑 · 数学 2009-09-25 Jörg Brendle

For $f,g\in\omega^\omega$ let $c^\forall_{f,g}$ be the minimal number of uniform $g$-splitting trees needed to cover the uniform $f$-splitting tree, i.e., for every branch $\nu$ of the $f$-tree, one of the $g$-trees contains $\nu$. Let…

逻辑 · 数学 2012-01-04 Jakob Kellner , 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

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

逻辑 · 数学 2024-05-17 Ben Goodman

We show that some cardinal arithmetic configurations related to the negation of the Shelah Weak Hypothesis and natural from the forcing point of view are impossible.

逻辑 · 数学 2007-05-23 Moti Gitik , Saharon Shelah

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…

逻辑 · 数学 2019-12-03 Matteo Viale

This article continues Roslanowski and Shelah math.LO/9906024 and 1105.6049 We introduce here yet another property of (<lambda)-strategically complete forcing notions which implies that their lambda-support iterations do not collapse…

逻辑 · 数学 2017-05-16 Andrzej Roslanowski , Saharon Shelah

In this article, we try to complete the regularity implications between the regularitites of the well-known tree forcing notions at the $\boldsymbol{\Delta}^1_2$ level of the projective hierarchy. The missing links in this case were the…

逻辑 · 数学 2025-01-16 Raiean Banerjee

The class forcing theorem, which asserts that every class forcing notion $\mathbb{P}$ admits a forcing relation $\Vdash_{\mathbb{P}}$, that is, a relation satisfying the forcing relation recursion -- it follows that statements true in the…

In this paper, following an idea of Christophe Chalons, I propose a new kind of forcing axiom, the Maximality Principle, which asserts that any sentence phi holding in some forcing extension V^P and all subsequent extensions V^P*Q holds…

逻辑 · 数学 2007-05-23 Joel David Hamkins

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

逻辑 · 数学 2017-10-31 Peter Holy , Regula Krapf , Philipp Schlicht

The Maximality Principle MP is a scheme which states that if a sentence of the language of ZFC is true in some forcing extension V^P, and remains true in any further forcing extension of V^P, then it is true in all forcing extensions of V.…

逻辑 · 数学 2007-05-23 George Leibman

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

In the first part of the paper, we show that if $\omega \le \kappa < \lambda$ are cardinals, $\kappa^{<\kappa} = \kappa$, and $\lambda$ is weakly compact, then in $V[\M(\kappa,\lambda)]$ the tree property at $\lambda =…

逻辑 · 数学 2020-04-22 Radek Honzik , Sarka Stejskalova

We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the meager ideal of the…

逻辑 · 数学 2007-05-23 Tomek Bartoszynski , Masaru Kada

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

We prove the consistency of the failure of the singular cardinals hypothesis at $\aleph_\omega$ together with the reflection of all stationary subsets of $\aleph_{\omega+1}$. This shows that two classic results of Magidor (from 1977 and…

逻辑 · 数学 2022-09-22 Alejandro Poveda , Assaf Rinot , Dima Sinapova

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…

逻辑 · 数学 2013-10-08 Justin Tatch Moore

In the paper we probe the possibilities of creating a Kurepa tree in a generic extension of a model of CH plus no Kurepa trees by an omega_1-preserving forcing notion of size at most omega_1. In the first section we show that in the Levy…

逻辑 · 数学 2016-09-06 Renling Jin , Saharon Shelah