Meager-nowhere dense games (III): Remainder strategies

Details Meager-nowhere dense games (III): Remainder strategies Meager-nowhere dense games (III): Remainder strategies

1992-09-25

arxiv.org/abs/math/9209208v1

Mathematics

Logic

Scientific paper

Player ONE chooses a meager set and player TWO, a nowhere dense set per inning. They play $\omega$ many innings. ONE's consecutive choices must form a (weakly) increasing sequence. TWO wins if the union of the chosen nowhere dense sets covers the union of the chosen meager sets. A strategy for TWO which depends on knowing only the uncovered part of the most recently chosen meager set is said to be a remainder strategy. Theorem (among others): TWO has a winning remainder strategy for this game played on the real line with its usual topology.

Affiliated with

Also associated with

No associations

Rating

Meager-nowhere dense games (III): Remainder strategies does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Meager-nowhere dense games (III): Remainder strategies, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Meager-nowhere dense games (III): Remainder strategies will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-687293