Meager-nowhere dense games. II. Coding strategies
HTML articles powered by AMS MathViewer
- by Marion Scheepers PDF
- Proc. Amer. Math. Soc. 112 (1991), 1107-1115 Request permission
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
- K. Ciesielski and R. Laver, A game of D. Gale in which one of the players has limited memory, Period. Math. Hungar. 21 (1990), no. 2, 153–158. MR 1070952, DOI 10.1007/BF01946852
- Thomas Jech, Set theory, Pure and Applied Mathematics, Academic Press [Harcourt Brace Jovanovich, Publishers], New York-London, 1978. MR 506523
- Marion Scheepers, Meager-nowhere dense games. I. $n$-tactics, Rocky Mountain J. Math. 22 (1992), no. 3, 1011–1055. MR 1183703, DOI 10.1216/rmjm/1181072711 —, Meager-nowhere dense games and the Singular Cardinals Hypothesis, in preparation.
- Rastislav Telgársky, Topological games: on the 50th anniversary of the Banach-Mazur game, Rocky Mountain J. Math. 17 (1987), no. 2, 227–276. MR 892457, DOI 10.1216/RMJ-1987-17-2-227 N. H. Williams, Combinatorial set theory, (2nd ed.), Stud. Logic Foundations Math., vol. 91, North-Holland, Amsterdam, 1980.
Additional Information
- © Copyright 1991 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 112 (1991), 1107-1115
- MSC: Primary 04A20; Secondary 54H99, 90D05, 90D44
- DOI: https://doi.org/10.1090/S0002-9939-1991-1072348-6
- MathSciNet review: 1072348