arXiv math/98071721998-07-30math.LO

Norms on possibilities I: forcing with trees and creatures

Andrzej Roslanowski, Saharon Shelah

备注：: accepted for Memoirs of the Amer. Math. Soc
发表信息：: Mem. Amer. Math. Soc. 141 (1999), no. 671

英文摘要：

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 solutions we develop various ideas interesting per se.These include a new iterable condition for ``not adding Cohen reals'' (which has a flavour of preserving special properties of p-points), new intriguing properties of ultrafilters (weaker than being Ramsey but stronger than p-point) and some new applications of variants of the PP--property.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Creature forcing and topological Ramsey spaces

This article introduces a line of investigation into connections between creature forcings and topological Ramsey spaces. Three examples of sets of pure candidates for creature forcings are shown to contain dense subsets which are actually topological Ramsey spaces. A new variant of the product tree Ramsey theorem is proved in order to obtain the pigeonhole principles for two of these examples.

2016-07-18math.LO

Creature forcing and five cardinal characteristics in Cichoń's diagram

We use a (countable support) creature construction to show that consistently \[ \mathfrak d=\aleph_1= \text{cov}(\text{NULL}) < \text{non}(\text{MEAGER}) < \text{non}(\text{NULL}) < \text{cof}(\text{NULL}) < 2^{\aleph_0}. \] The same method shows the consistency of \[ \mathfrak d=\aleph_1= \text{cov}(\text{NULL}) < \text{non}(\text{NULL}) < \text{non}(\text{MEAGER}) < \text{cof}(\text{NULL}) < 2^{\aleph_0}. \]

2015-09-04math.LO

Creature forcing and large continuum: The joy of halving

For $f,g\inω^ω$ 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 $ν$ of the $f$-tree, one of the $g$-trees contains $ν$. Let $c^\exists_{f,g}$ be the dual notion: For every branch $ν$, one of the $g$-trees guesses $ν(m)$ infinitely often. We show that it is consistent that $c^\exists_{f_ε,g_ε}=c^\forall_{f_ε,g_ε}=κ_ε$ for continuum many pairwise different cardinals $κ_ε$ and suitable pairs $(f_ε,g_ε)$. For the proof we introduce a new mixed-limit creature forcing construction.

2010-03-17math.LO

Sheva-Sheva-Sheva: Large Creatures

We develop the theory of the forcing with trees and creatures for an inaccessible lambda continuing Rosłanowski and Shelah math.LO/9807172, math.LO/9909115. To make a real use of these forcing notions (that is to iterate them without collapsing cardinals) we need suitable iteration theorems, and those are proved as well. (In this aspect we continue Rosłanowski and Shelah math.LO/9906024.)

2003-03-23math.LO

Games with creatures

Many forcing notions obtained using the creature technology are naturally connected with certain integer games.

2002-12-03math.LO

Decisive creatures and large continuum

For $f,g\inω\ho$ let $\mycfa_{f,g}$ be the minimal number of uniform $g$-splitting trees needed to cover the uniform $f$-splitting tree, i.e. for every branch $ν$ of the $f$-tree, one of the $g$-trees contains $ν$. $\myc_{f,g}$ is the dual notion: For every branch $ν$, one of the $g$-trees guesses $ν(m)$ infinitely often. It is consistent that $\myc_{f_ε,g_ε}=\mycfa_{f_ε,g_ε}=κ_ε$ for $\al1$ many pairwise different cardinals $κ_ε$ and suitable pairs $(f_ε,g_ε)$. For the proof we use creatures with sufficient bigness and halving. We show that the lim-inf creature forcing satisfies fusion and pu…

2008-07-10math.LO

更多相关论文收起更多论文

Partition theorems from creatures and idempotent ultrafilters

We show a general scheme of Ramsey-type results for partitions of countable sets of finite functions, where "one piece is big" is interpreted in the language originating in creature forcing. The heart of our proofs follows Glazer's proof of the Hindman Theorem, so we prove the existence of idempotent ultrafilters with respect to suitable operation. Then we deduce partition theorems related to creature forcings.

2011-03-23math.COmath.LO

Towards Martin's Minimum

We show that it is consistent with MA + the negation of CH, that the Forcing Axiom fails for all forcing notions in the class of omega^omega-bounding forcing notions with norms of "Norms on possibilities I: forcing with trees and creatures"(by Roslanowski and Shelah - math.LO/9807172).

1999-04-29math.LO

Nonproper Products

We show that there exist two proper creature forcings having a simple (Borel) definition, whose product is not proper. We also give a new condition ensuring properness of some forcings with norms.

2011-08-16math.LO

Measured creatures

Using forcing with measured creatures we build a universe of set theory in which: (a) every sup-measurable function f:RxR-->R is measurable, and (b) every function f:R-->R is continuous on a non-measurable set. This answers a question of Balcerzak, Ciesielski and Kharazishvili and von Weizsacker's problem (see Fremlin's list of problems).

2003-03-23math.CAmath.GNmath.LO

The splitting number can be smaller than the matrix chaos number

Let chi be the minimum cardinal of a subset of 2^omega that cannot be made convergent by multiplication with a single Toeplitz matrix. By an application of creature forcing we show that s<chi is consistent. We thus answer a question by Vojtas. We give two kinds of models for the strict inequality. The first is the combination of an aleph_2-iteration of some proper forcing with adding aleph_1 random reals. The second kind of models is got by adding delta random reals to a model of MA_{< kappa} for some delta in [aleph_1,kappa). It was a conjecture of Blass that s=aleph_1<chi=kappa holds in such…

2000-11-22math.LO

Specializing Aronszajn trees by countable approximations

We show that there are proper forcings based upon countable trees of creatures that specialize a given Aronszajn tree.

2001-12-27math.LO

具有ccc的糖性

Saccharinity with ccc

本文利用creatures技术构造了若干Suslin ccc非甜forcing概念，探讨了ZFC与ZF+实数集等于Borel集模null理想闭包的等价性，以及ω₁序列的构造。

2025-05-26math.LO

Cichoń's Diagram and Localisation Cardinals

We reimplement the creature forcing construction used by Fischer et al. (arXiv:1402.0367) to separate Cichoń's diagram into five cardinals as a countable support product. Using the fact that it is of countable support, we augment our construction by adding uncountably many additional cardinal characteristics, sometimes referred to as localisation cardinals.

2020-09-16math.LO

Continuum Many Different Things: Localisation, Anti-Localisation and Yorioka Ideals

Combining creature forcing approaches from arXiv:1003.3425 and arXiv:1402.0367, we show that, under CH, there is a proper $ω^ω$-bounding poset with $\aleph_2$-cc that forces continuum many pairwise different cardinal characteristics, parametrised by reals, for each one of the following six types: uniformity and covering numbers of Yorioka ideals as well as both kinds of localisation and anti-localisation cardinals, respectively. This answers several open questions from arXiv:1805.11005.

2024-05-03math.LO

Can a small forcing create Kurepa trees?

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 model obtained by collapsing all cardinals between omega_1 and a strongly inaccessible cardinal by forcing with a countable support Levy collapsing order many omega_1-preserving forcing notions of size at most omega_1 including all omega-proper forcing notions and some proper but not omega-proper forcing notions of size at most omega_1 do not create Kurepa tre…

1995-04-15math.LO