Journal of Symbolic Logic

Variations on a Game of Gale (I): Coding Strategies

Marion Scheepers

Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.

Abstract

We consider an infinite two-person game. The second player has a winning perfect information strategy; we show that this player has a winning strategy which depends on substantially less information. The game studied here is a variation on a game of Gale.

Article information

Source
J. Symbolic Logic, Volume 58, Issue 3 (1993), 1035-1043.

Dates
First available in Project Euclid: 6 July 2007

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1183744311

Mathematical Reviews number (MathSciNet)
MR1242052

Zentralblatt MATH identifier
0792.03038

JSTOR
links.jstor.org

Citation

Scheepers, Marion. Variations on a Game of Gale (I): Coding Strategies. J. Symbolic Logic 58 (1993), no. 3, 1035--1043. https://projecteuclid.org/euclid.jsl/1183744311


Export citation