中文
相关论文

相关论文: Small forcings and Cohen reals

200 篇论文

Assuming that every set is constructible, we find a $\Pi^1_1$ maximal cofinitary group of permutations of $\mathbb N$ which is indestructible by Cohen forcing. Thus we show that the existence of such groups is consistent with arbitrarily…

逻辑 · 数学 2022-11-09 Vera Fischer , David Schrittesser , Asger Törnquist

We show that it is relatively consistent with ZFC that there exists a hyperfinite type $\mathrm{II}_1$-factor of density character $\aleph_1$ which is not isomorphic to its opposite, does not have any outer automorphisms, and has trivial…

算子代数 · 数学 2020-03-12 Ilijas Farah , Ilan Hirshberg

We show that, in the model constructed by adding sufficiently many Cohen reals, derived limits are additive on a large class of systems. This generalizes the work of Jeffrey Bergfalk, Michael Hru\v s\'ak, and Chris Lambie-Hanson which…

逻辑 · 数学 2025-01-23 Nathaniel Bannister

David Aspero asks on the possibility of having Forcing axiom FA_{aleph_2}(K), where K is the class of forcing notions preserving stationarity of subsets of aleph_1 and of aleph_2. We answer negatively, in fact we show the negative result…

逻辑 · 数学 2007-05-23 Saharon Shelah

Given a countable transitive model of set theory and a partial order contained in it, there is a natural countable Borel equivalence relation on generic filters over the model; two are equivalent if they yield the same generic extension. We…

逻辑 · 数学 2024-07-22 Iian B. Smythe

Using creature technology, we construct families of Suslin ccc non-sweet forcing notions $\mathbb Q$ such that $ZFC$ is equiconsistent with $ZF+$"every set of reals equals a Borel set modulo the $(\leq \aleph_1)$-closure of the null ideal…

逻辑 · 数学 2025-05-28 Haim Horowitz , Saharon Shelah

We study uncountable structures similar to the Fra\"iss\'e limits. The standard inductive arguments from the Fra\"iss\'e theory are replaced by forcing, so the structures we obtain are highly sensitive to the universe of set theory. In…

逻辑 · 数学 2024-12-19 Ziemowit Kostana

It is a well-known result that, after adding one Cohen real, the transcendence degree of the reals over the ground-model reals is continuum. We extend this result for a set $X$ of finitely many Cohen reals, by showing that, in the forcing…

逻辑 · 数学 2026-01-13 Azul Fatalini , Ralf Schindler

We show that $\mathsf{PFA}$ (Proper Forcing Axiom) implies that adding any number of Cohen subsets of $\omega$ will not add an $\omega_2$-Aronszajn tree or a weak $\omega_1$-Kurepa tree, and moreover no $\sigma$-centered forcing can add a…

逻辑 · 数学 2022-08-05 Radek Honzik , Chris Lambie-Hanson , Šárka Stejskalová

The modal logic of forcing arises when one considers a model of set theory in the context of all its forcing extensions, interpreting necessity as "in all forcing extensions" and possibility as "in some forcing extension". In this modal…

逻辑 · 数学 2012-07-26 Joel David Hamkins , George Leibman , Benedikt Löwe

This is a report on state-of-the-art on the question of developing higher analogues of the forcing axiom PFA. Recently there have been several attempts to develop forcing axioms analogous to the proper forcing axiom (PFA) for cardinals of…

逻辑 · 数学 2020-12-22 Mirna Džamonja

We show that the Cohen--Lyndon property holds for all non-metric small-cancellation quotients. This generalises the analogous result from the metric small-cancellation setting, and answers a question asked by Lyndon in 1966 and by Wall in…

群论 · 数学 2025-10-24 Macarena Arenas , Karol Duda

We consider strictly increasing sequences $\left(a_{n}\right)_{n \geq 1}$ of integers and sequences of fractional parts $\left(\left\{a_{n} \alpha\right\}\right)_{n \geq 1}$ where $\alpha \in \mathbb{R}$. We show that a small additive…

数论 · 数学 2016-08-25 Christoph Aistleitner , Gerhard Larcher

We build on a 1990 paper of Bukovsky and Coplakova-Hartova. First, we remove the hypothesis of $\textsf{CH}$ from one of their minimality results. Then, using a measurable cardinal, we show that there is a $|\aleph_2^V|=\aleph_1$-minimal…

逻辑 · 数学 2025-10-15 Maxwell Levine

Countable tightness may be destroyed by countably closed forcing. We characterize the indestructibility of countable tightness under countably closed forcing by combinatorial statements similar to the ones Tall used to characterize…

一般拓扑 · 数学 2013-10-22 Marion Scheepers

We construct a computable sequence of computable reals $\langle X_i\rangle$ such that any real that can compute a subsequence that is maximal with respect to the finite intersection property can also compute a Cohen 1-generic. This is…

逻辑 · 数学 2016-05-23 Peter Cholak , Rod Downey , Greg Igusa

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

We investigate the relation of countable closed subsets of the reals with respect to continuous monotone embeddability; we show that there are exactly aleph_1 many equivalence classes with respect to this embeddability relation. This is an…

逻辑 · 数学 2007-05-23 Arnold Beckmann , Martin Goldstern , Norbert Preining

Using a modification of the invariant Jensen forcing, we define a model of ZFC, in which, for a given $n\ge3$, there exists a lightface $\varPi^1_n$ set of reals, which is a ${\mathsf E}_0$ equivalence class, hence a countable set, and…

逻辑 · 数学 2018-11-07 Vladimir Kanovei , Vassily Lyubetsky

We deal with an iteration theorem of forcing notion with a kind of countable support of nice enough forcing notion which is proper aleph_2-c.c. forcing notions. We then look at some special cases (Q_D 's preceded by random forcing).

逻辑 · 数学 2007-05-23 Saharon Shelah