English
Related papers

Related papers: Bounded Namba forcing axiom may fail

200 papers

We study a strengthening of Bounded Martin's Maximum which asserts that if a \Sigma_1 fact holds of \omega_2^V in a stationary set preserving extension then it holds in V for a stationary set of ordinals less than \omega_2. We show that…

Logic · Mathematics 2008-12-09 Stuart Zoble

The notion of a symmetric extension extends the usual notion of forcing by identifying a particular class of names which forms an intermediate model of ZF between the ground model and the generic extension, and often the axiom of choice…

Logic · Mathematics 2019-03-27 Asaf Karagila

We show that $\mathsf{PFA}$ implies that the tightness $t(X_\delta)$ of the $G_\delta$-modification of a Fr\'echet $\alpha_1$-space $X$ is at most $\omega_1$, while $\Box(\kappa)$ implies that there is a Fr\'echet $\alpha_1$-space with…

General Topology · Mathematics 2019-10-24 William Chen-Mertens , Paul J. Szeptycki

I investigate the relationships between three hierarchies of reflection principles for a forcing class $\Gamma$: the hierarchy of bounded forcing axioms, of $\Sigma^1_1$-absoluteness and of Aronszajn tree preservation principles. The latter…

Logic · Mathematics 2023-06-22 Gunter Fuchs

We show that the weakest versions of Foreman's minimal generic hugeness axioms cannot hold simultaneously on adjacent cardinals. Moreover, conventional forcing techniques cannot produce a model of one of these axioms.

Logic · Mathematics 2023-03-27 Monroe Eskew

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…

Logic · Mathematics 2018-02-06 Gunter Fuchs , Kaethe Minden

The main result of this paper is a partial answer to [math.LO/9909115, Problem 5.5]: a finite iteration of Universal Meager forcing notions adds generic filters for many forcing notions determined by universality parameters. We also give…

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

We present and analyze $F_\sigma$-Mathias forcing, which is similar but tamer than Mathias forcing. In particular, we show that this forcing preserves certain weak subsystems of second-order arithmetic such as $\mathsf{ACA}_0$ and…

Logic · Mathematics 2012-10-05 François G. Dorais

We study methods to obtain the consistency of forcing axioms, and particularly higher forcing axioms. We first force over a model with a supercompact cardinal $\theta>\kappa$ to get the consistency of the forcing axiom for $\kappa$-strongly…

Logic · Mathematics 2024-03-19 David Asperó , Sean Cox , Asaf Karagila , Christoph Weiss

The purpose of this paper is to present a general method for forcing on $\omega_2$ and $\omega_3$ with finite conditions, while preserving all cardinals and some fragments of $\mathrm{GCH}$. This method is based on the technique of forcing…

Logic · Mathematics 2026-03-16 Curial Gallart

For every uncountable regular $\kappa$, we give two examples of proper posets which turn improper in some $\kappa$-closed forcing extension.

Logic · Mathematics 2019-08-06 Yasuo Yoshinobu

We make use of a finite support product of the Jensen minimal forcing to define a model of set theory in which the separation theorem fails for projective classes $\mathbf\Sigma^1_n$ and $\mathbf\Pi^1_n$, for a given $n\ge3$.

Logic · Mathematics 2019-05-28 Vladimir Kanovei , Vassily Lyubetsky

The Steprans forcing notion arises as a quotient of Borel sets modulo the ideal of $\sigma$-continuity of a certain Borel not $\sigma$-continuous function. We give a characterization of this forcing in the language of trees and using this…

Logic · Mathematics 2008-07-09 Marcin Sabok

We introduce a variant of Martin's axiom, called the grounded Martin's axiom, which asserts that the universe is a ccc forcing extension in which Martin's axiom holds for posets in the ground model. This principle already implies several of…

Logic · Mathematics 2021-05-14 Miha E. Habič

We provide a counterexample to a lemma used in a recent tentative improvement of the the Pin-Frankl bound for synchronizing automata. This example naturally leads us to formulate an open question, whose answer could fix the line of proof,…

Formal Languages and Automata Theory · Computer Science 2014-12-03 François Gonze , Raphaël M. Jungers , A. N. Trahtman

We supplement the string field theory action with boundary terms to make its variational principle well-posed. Central to our considerations is the violation of the stress-energy tensor conservation in non-compact CFTs due to the boundary…

High Energy Physics - Theory · Physics 2025-02-13 Atakan Hilmi Fırat , Raji Ashenafi Mamade

We prove forcing axiom equivalents of two families of weakenings of the axiom of choice: a trichotomy principle for cardinals isolated by L\'evy, ${\rm H\hskip0.05pt}_\kappa$, and ${\rm DC}_\kappa$, the principle of dependent choices…

Logic · Mathematics 2025-02-19 Diego Lima Bomfim , Charles Morgan , Samuel Gomes da Silva

We prove that the forcing axiom $MA^{1.5}_{\aleph_2}(\mbox{stratified})$ implies $\Box_{\omega_1, \omega_1}$. Using this implication, we show that the forcing axiom $MM_{\aleph_2}(\aleph_2\mbox{-c.c.})$ is inconsistent. We also derive weak…

Logic · Mathematics 2022-12-15 David Aspero , Nutt Tananimit

Negative constraints (instructions of the form "do not use word X") represent a fundamental test of instruction-following capability in large language models. Despite their apparent simplicity, these constraints fail with striking…

Artificial Intelligence · Computer Science 2026-01-14 Shailesh Rana

We give a forcing construction of the square principle on omega_1 using forcing with conditions whose domain is finite.

Logic · Mathematics 2016-08-14 Gregor K. Dolinar , Mirna Džamonja