English
Related papers

Related papers: Generalizing random real forcing for inaccessible …

200 papers

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

We study the question of when a given countable ordinal $\alpha$ is $\Sigma^1_n$- or $\Pi^1_n$-reflecting in models which are neither $\mathsf{PD}$ models nor the constructible universe, focusing on generic extensions of $L$. We prove,…

Logic · Mathematics 2023-11-22 Juan P. Aguilera , Corey Bacal Switzer

We define and investigate versions of Silver and Mathias forcing with respect to lower and upper density. We focus on properness, Axiom A, chain conditions, preservation of cardinals and adding Cohen reals. We find rough forcings that…

Logic · Mathematics 2021-02-12 Giorgio Laguzzi , Heike Mildenberger , Brendan Stuber-Rousselle

This paper generalizes Shelah's generic pair conjecture (now theorem) for the measurable cardinal case from first order theories to finite diagrams. We use homogeneous models in the place of saturated models.

Logic · Mathematics 2014-12-05 Itay Kaplan , Noa Lavi , Saharon Shelah

We define the $\aleph_{1.5}$ chain condition. The corresponding forcing axiom is a generalization of Martin's Axiom and implies certain uniform failures of club--guessing on $\omega_1$ that don't seem to have been considered in the…

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

We investigate classes of Boolean algebras related to the notion of forcing that adds Cohen reals. A >>Cohen algebra<< is a Boolean algebra that is dense in the completion of a free Boolean algebra. We introduce and study generalizations of…

Logic · Mathematics 2016-09-06 Bohuslav Balcar , Thomas Jech , Jindřich Zapletal

The tree forcing method given by (Liu 2015) enables the cone avoiding of strong enumeration of a given tree, within a subset or co-subset of an arbitrary given set, provided the given tree does not admit computable strong enumeration. Using…

Logic · Mathematics 2019-12-20 Bjørn Kjos-Hanssen , Lu Liu

In this paper, we study the notion of a generically extendible cardinal, which is a generic version of an extendible cardinal. We prove that the generic extendibility of $\omega_1$ or $\omega_2$ has small consistency strength, but that of a…

Logic · Mathematics 2024-11-26 Toshimichi Usuba

We generalise Jensen's result on the incompatibility of subcompactness with square. We show that alpha^+-subcompactness of some cardinal less than or equal to alpha precludes square_alpha, but also that square may be forced to hold…

Logic · Mathematics 2014-10-01 Andrew D. Brooke-Taylor , Sy-David Friedman

We show, assuming a mild set-theoretic hypothesis, that if an abstract elementary class (AEC) has a superstable-like forking notion for models of cardinality $\lambda$ and a superstable-like forking notion for models of cardinality…

Logic · Mathematics 2020-02-28 Sebastien Vasey

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

We prove that, consistently, there exists a weakly but not strongly inaccessible cardinal $\lambda$ for which the sequence $\langle 2^\theta:\theta<\lambda\rangle$ is not eventually constant and the weak diamond fails at $\lambda$. We also…

Logic · Mathematics 2021-03-12 Shimon Garti , Saharon Shelah

We present a systematic study of the method of "norms on possibilities" of building forcing notions with keeping their properties under full control. This technique allows us to answer several open problems, but on our way to get the…

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

We present some results about generics for computable Mathias forcing. The $n$-generics and weak $n$-generics in this setting form a strict hierarchy as in the case of Cohen forcing. We analyze the complexity of the Mathias forcing…

Logic · Mathematics 2012-02-14 Peter A. Cholak , Damir D. Dzhafarov , Jeffry L. Hirst

This article continues Ros{\l}anowski and Shelah math.LO/9906024, math.LO/0508272, math.LO/0210205, math.LO/0611131 and math.LO/0605067. We introduce here a new property of <lambda-strategically complete forcing notions which implies that…

Logic · Mathematics 2013-08-20 Andrzej Roslanowski , Saharon Shelah

We show that adding a random real number destroys a large fragment of Martin's axiom, namely Martin's axiom for partial orders that have precalibre-$\aleph_1$, thus answering an old question of J. Roitman [9]. We also answer a question of…

Logic · Mathematics 2019-08-30 Joan Bagaria , Saharon Shelah

We show that the forcing axiom for countably compact, $\omega_2$-Knaster, well-met posets is inconsistent. This is supplemental to an inconsistency result of Shelah and sets a new limit to the generalization of Martin's Axiom to the stage…

Logic · Mathematics 2020-08-05 Stevo Todorčević , Shihao Xiong

We contribute to the study of $\aleph_1$-dense sets of reals, a mainstay in set theoretic research since Baumgartner's seminal work in the 70s. In particular, we show that it is consistent with $\textsf{MA}$ that there exists an…

Logic · Mathematics 2025-12-25 Pedro Marun , Saharon Shelah , Corey Bacal Switzer

Small forcing always ruins the indestructibility of an indestructible supercompact cardinal. In fact, after small forcing, any cardinal $\kappa$ becomes superdestructible---any further ${<}\kappa$-closed forcing which adds a subset to…

Logic · Mathematics 2016-07-05 Joel David Hamkins

We answer a question of Woodin by showing that assuming an inaccessible cardinal $\kappa$ which is a limit of ${<}\kappa$-supercompact cardinals exists, there is a stationary set preserving forcing $\mathbb{P}$ so that $V^{\mathbb…

Logic · Mathematics 2024-03-15 Andreas Lietz