Displaying similar documents to “On the netweight of subspaces”

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...

A game and its relation to netweight and D-spaces

Gary Gruenhage, Paul Szeptycki (2011)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We introduce a two player topological game and study the relationship of the existence of winning strategies to base properties and covering properties of the underlying space. The existence of a winning strategy for one of the players is conjectured to be equivalent to the space have countable network weight. In addition, connections to the class of D-spaces and the class of hereditarily Lindelöf spaces are shown.