arXiv math/06111312006-11math.LO

Lords of the iteration

Andrzej Roslanowski, Saharon Shelah

发表信息：: Set theory and its applications, 287-330, Contemp. Math., 533, 2011

英文摘要：

We introduce several properties of forcing notions which imply that their lambda-support iterations are lambda-proper. Our methods and techniques refine those studied in math.LO/9906024, math.LO/0210205, math.LO/0508272 and math.LO/0605067, covering some new forcing notions (though the exact relation of the new properties to the old ones remains undecided).

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

Iteration of lambda-complete forcing notions not collapsing lambda^+

We look for a parallel to the notion of ``proper forcing'' among lambda-complete forcing notions not collapsing lambda^+ . We suggest such a definition and prove that it is preserved by suitable iterations.

2001-07-29math.LO

More about lambda-support iterations of <lambda-complete forcing notions

This article continues Rosł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 their lambda-support iterations do not collapse lambda^+ (for a strongly inaccessible cardinal lambda).

2012-10-02math.LO

Reasonably complete forcing notions

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 application of our iteration result we show that it is consistent that dominating numbers associated with two normal filters on lambda are distinct.

2005-08-16math.LO

The last forcing standing with diamonds

This article continues Roslanowski and Shelah math.LO/9906024 and 1105.6049 We introduce here yet another property of (<lambda)-strategically complete forcing notions which implies that their lambda-support iterations do not collapse lambda^+.

2017-05-14math.LO

Large continuum, oracles

Our main theorem is about iterated forcing for making the continuum larger than aleph_2. We present a generalization of math.LO/0303294 which is dealing with oracles for random, etc., replacing aleph_1, aleph_2 by lambda,lambda^+ (starting with lambda=lambda^{<lambda}>aleph_1). Well, instead of properness we demand absolute c.c.c. So we get, e.g. the continuum is lambda^+ but we can get cov(meagre)=lambda. We give some applications. As in math.LO/0303294, it is a "partial" countable support iteration but it is c.c.c.

2010-03-03math.LO

Reasonable ultrafilters, again

We continue investigations of reasonable ultrafilters on uncountable cardinals defined in math.LO/0407498. We introduce stronger properties of ultrafilters and we show that those properties may be handled in lambda-support iterations of reasonably bounding forcing notions. We use this to show that consistently there are reasonable ultrafilters on an inaccessible cardinal lambda with generating system of size less than 2^lambda . We also show how reasonable ultrafilters can be killed by forcing notions which have enough reasonable completeness to be iterated with lambda-supports (and we show th…

2010-09-20math.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

幂集之下的强分划关系：一致性，Sierpinski是对的吗？II

Strong partition relations below the power set: consistency, was Sierpinski right, II?

本文围绕Galvin关于强分划关系一致性的猜想展开，证否了原猜想，证明了将ω₂替换为大基数2^ω时的一致性，并给出相关迭代引理与定理推广。

2024-01-29math.LO