Covering games and the Banach-Mazur game: k-tactics

Details Covering games and the Banach-Mazur game: k-tactics Covering games and the Banach-Mazur game: k-tactics

1992-07-25

arxiv.org/abs/math/9207203v1

Mathematics

Logic

Scientific paper

Given a free ideal J of subsets of a set X, we consider games where player ONE plays an increasing sequence of elements of the sigma completion of J, and TWO tries to cover the union of this sequence by playing one set at a time from J. We describe various conditions under which player TWO has has a winning strategy that uses only information about the most recent k moves of ONE, and apply some of these results to the Banach-Mazur game.

Affiliated with

Also associated with

No associations

Rating

Covering games and the Banach-Mazur game: k-tactics 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 Covering games and the Banach-Mazur game: k-tactics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Covering games and the Banach-Mazur game: k-tactics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-721595