English
Related papers

Related papers: The Proper Forcing Axiom and the Singular Cardinal…

200 papers

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

Logic · Mathematics 2025-04-16 Gunter Fuchs , Corey Bacal Switzer

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…

Logic · Mathematics 2007-05-23 Tomek Bartoszynski , Masaru Kada

A new axiom is proposed, the Ground Axiom, asserting that the universe is not a nontrivial set-forcing extension of any inner model. The Ground Axiom is first-order expressible, and any model of ZFC has a class-forcing extension which…

Logic · Mathematics 2007-05-23 Jonas Reitz

We announce some consequences of an abstract comparison principle.

Logic · Mathematics 2017-10-11 Gabriel Goldberg

We consider extensions of the language of Peano arithmetic by transfinitely iterated truth definitions satisfying uniform Tarskian biconditionals. Without further axioms, such theories are known to be conservative extensions of the original…

Logic · Mathematics 2019-10-31 Lev D. Beklemishev , Fedor N. Pakhomov

Since being isolated by Viale and Weiss in 2009, the Guessing Model Property has emerged as a particularly prominent and powerful consequence of the Proper Forcing Axiom. In this paper, we investigate connections between variations of the…

Logic · Mathematics 2023-03-03 Chris Lambie-Hanson , Šárka Stejskalová

We present reasons for developing a theory of forcing notions which satisfy the properness demand for countable models which are not necessarily elementary submodels of some (H(chi), in). This leads to forcing notions which are…

Logic · Mathematics 2016-09-07 Saharon Shelah

Strong reflection principles with the reflection cardinal $\leq\aleph_1$ or $<2^{\aleph_0}$ imply that the size of the continuum is either $\aleph_1$ or $\aleph_2$ or very large. Thus, the stipulation, that a strong reflection principle…

Logic · Mathematics 2020-09-08 Sakaé Fuchino , André Ottenbreit Maschio Rodrigues

We produce a model where every supercompact cardinal is $C^{(1)}$-supercompact with inaccessible targets. This is a significant improvement of the main identity-crises configuration obtained in \cite{HMP} and provides a definitive answer to…

Logic · Mathematics 2024-06-19 Alejandro Poveda

We give arguments for and prove the consistency of some internal forcing axioms.

Logic · Mathematics 2009-09-25 Garvin Melles

Whenever x is a tame cardinal invariant and ZFC+large cardinals proves that x=aleph one implies WCG then ZFC+large cardinals proves that x=aleph one implies b=aleph one, and b=aleph one implies WCG. Here WCG is a certain prediction…

Logic · Mathematics 2007-05-23 Jindrich Zapletal

Given a cardinal $\lambda$, category forcing axioms for $\lambda$-suitable classes $\Gamma$ are strong forcing axioms which completely decide the theory of the Chang model $\mathcal C_\lambda$, modulo generic extensions via forcing notions…

Logic · Mathematics 2018-05-23 David Aspero , Matteo Viale

Let $\mathcal{SN}$ be the $\sigma$-ideal of the strong measure zero sets of reals. We present general properties of forcing notions that allow to control of the additivity of $\mathcal{SN}$ after finite support iterations. This is applied…

Logic · Mathematics 2025-08-21 Jörg Brendle , Miguel A. Cardona , Diego A. Mejía

We give some general criteria, when kappa-complete forcing preserves largeness properties -- like kappa-presaturation of normal ideals on lambda (even when they concentrate on small cofinalities). Then we quite accurately obtain the…

Logic · Mathematics 2016-09-06 Moti Gitik , Saharon Shelah

A new large-cardinal property is introduced which enables one to give a relative consistency proof of restricted versions of the reflection principles discussed by Tait in his essay "Constructing Cardinals from Below".

Logic · Mathematics 2013-01-08 Rupert McCallum

We use forcing over admissible sets to show that, for every ordinal $\alpha$ in a club $C\subset\omega_1$, there are copies of $\alpha$ such that the isomorphism between them is not computable in the join of the complete $\Pi^1_1$ set…

Logic · Mathematics 2024-08-21 Noah Schweber

We introduce more properties of forcing notions which imply that their lambda-support iterations are lambda-proper, where lambda is an inaccessible cardinal. This paper is a direct continuation of section A.2 of math.LO/0210205. As an…

Logic · Mathematics 2013-01-04 Andrzej Roslanowski , Saharon Shelah

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

Foreman proved the Duality Theorem, which gives an algebraic characterization of certain ideal quotients in generic extensions. As an application he proved that generic supercompactness of $\omega_1$ is preserved by any proper forcing. We…

Logic · Mathematics 2015-08-04 Brent Cody , Sean Cox

A stationary subset S of a regular uncountable cardinal kappa reflects fully at regular cardinals if for every stationary set T subseteq kappa of higher order consisting of regular cardinals there exists an alpha in T such that S cap alpha…

Logic · Mathematics 2008-02-03 Thomas Jech , Saharon Shelah
‹ Prev 1 4 5 6 7 8 10 Next ›