Remote Access Proceedings of the American Mathematical Society
Green Open Access

Proceedings of the American Mathematical Society

ISSN 1088-6826(online) ISSN 0002-9939(print)



Meager-nowhere dense games. II. Coding strategies

Author: Marion Scheepers
Journal: Proc. Amer. Math. Soc. 112 (1991), 1107-1115
MSC: Primary 04A20; Secondary 54H99, 90D05, 90D44
MathSciNet review: 1072348
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: We consider three closely related infinite two person games in which the second player has a winning perfect information strategy and examine under what conditions it suffices for the second player to remember only the most recent two moves in the game in order to insure a win. Strategies depending on this information only are called coding strategies.

References [Enhancements On Off] (What's this?)

  • [1] K. Ciesielski and R. Laver, A game of D. Gale in which one of the players has limited memory, Per. Math. Hungar. 21 (1990), 153-158. MR 1070952 (92d:90137)
  • [2] T. Jech, Set theory, Academic Press, New York, 1978. MR 506523 (80a:03062)
  • [3] M. Scheepers, Meager-nowhere dense games (I): $ n$-tactics, Rocky Mountain J. Math. (to appear). MR 1183703 (93m:04006)
  • [4] -, Meager-nowhere dense games and the Singular Cardinals Hypothesis, in preparation.
  • [5] R. Telgarsky, Topological games: on the 50th anniversary of the Banach-Mazur game, Rocky Mountain J. Math. 17 (1987), 227-276. MR 892457 (88d:54046)
  • [6] N. H. Williams, Combinatorial set theory, (2nd ed.), Stud. Logic Foundations Math., vol. 91, North-Holland, Amsterdam, 1980.

Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC: 04A20, 54H99, 90D05, 90D44

Retrieve articles in all journals with MSC: 04A20, 54H99, 90D05, 90D44

Additional Information

Keywords: Free ideal, game, winning strategy, coding strategy
Article copyright: © Copyright 1991 American Mathematical Society

American Mathematical Society