Many countable support iterations of proper forcings preserve Souslin trees

被引：1

作者：

Mildenberger, Heike ^{[1
]}

Shelah, Saharon ^{[2
]}

机构：

[1] Hebrew Univ Jerusalem, Einstein Inst Math, IL-91904 Jerusalem, Israel

[2] Univ Freiburg, Math Inst, Abt Math Log, D-79104 Freiburg, Germany

来源：

ANNALS OF PURE AND APPLIED LOGIC | 2014年 / 165卷 / 02期

关键词：

Games played on forcing orders; Creature forcing; Non-elementary proper forcing; Preservation theorems for trees on; N-1;

D O I：

10.1016/j.apal.2013.08.002

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We show that many countable support iterations of proper forcings preserve Souslin trees. We establish sufficient conditions in terms of games and we draw connections to other preservation properties. We present a proof of preservation properties in countable support iterations in the so-called Case A that does not need a division into forcings that add reals and those who do not. (C) 2013 Elsevier B.V. All rights reserved.

引用

页码：573 / 608

页数：36

共 4 条

[1] OMEGA-1-SOUSLIN TREES UNDER COUNTABLE SUPPORT ITERATIONS
MIYAMOTO, T
[J]. FUNDAMENTA MATHEMATICAE, 1993, 142 (03) : 257 - 261
[2] NO RANDOM REALS IN COUNTABLE SUPPORT ITERATIONS
JUDAH, H
REPICKY, M
[J]. ISRAEL JOURNAL OF MATHEMATICS, 1995, 92 (1-3) : 349 - 359
[3] GOLDSTERN-JUDAH-SHELAH PRESERVATION THEOREM FOR COUNTABLE SUPPORT ITERATIONS
REPICKY, M
[J]. FUNDAMENTA MATHEMATICAE, 1994, 144 (01) : 55 - 72
[4] Non-stationary support iterations of Prikry forcings and restrictions of ultrapower embeddings to the ground model
Gitik, Moti
Kaplan, Eyal
[J]. ANNALS OF PURE AND APPLIED LOGIC, 2023, 174 (01)

← 1 →