Iteration of -complete forcing notions not collapsing .

Rosłanowski, Andrzej; Shelah, Saharon

Displaying similar documents to “Iteration of $λ$ -complete forcing notions not collapsing $λ^{+}$ .”

Determinateness in the low protective hierarchy

Harvey Friedman (1971)

Fundamenta Mathematicae

Similarity:

Measurable cardinals and analytic games

Donald Matrin (1970)

Fundamenta Mathematicae

Similarity:

On the netweight of subspaces

Krzysztof Ciesielski (1983)

Fundamenta Mathematicae

Similarity:

The Axiom of Determinateness and canonical measures

James Henle (1981)

Fundamenta Mathematicae

Similarity:

On the open-open game

Peg Daniels, Kenneth Kunen, Haoxuan Zhou (1994)

Fundamenta Mathematicae

Similarity:

We modify a game due to Berner and Juhász to get what we call “the open-open game (of length ω)”: a round consists of player I choosing a nonempty open subset of a space X and II choosing a nonempty open subset of I’s choice; I wins if the union of II’s open sets is dense in X, otherwise II wins. This game is of interest for ccc spaces. It can be translated into a game on partial orders (trees and Boolean algebras, for example). We present basic results and various conditions under which...