Variations on a game of Gale (I): Coding strategies

Journal of Symbolic Logic 58 (3):1035-1043 (1993)
  Copy   BIBTEX

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,745

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A game characterizing baire class 1 functions.Viktor Kiss - 2020 - Journal of Symbolic Logic 85 (1):456-466.
Maker–Breaker Games on And.Nathan Bowler, Florian Gut, Attila Joó & Max Pitz - forthcoming - Journal of Symbolic Logic:1-7.
Games with 1-backtracking.Stefano Berardi, Thierry Coquand & Susumu Hayashi - 2010 - Annals of Pure and Applied Logic 161 (10):1254-1269.
Winning strategies in club games and their applications.Bernhard König - 2011 - Mathematical Logic Quarterly 57 (1):19-26.
The stationary set splitting game.Paul B. Larson & Saharon Shelah - 2008 - Mathematical Logic Quarterly 54 (2):187-193.
Games with Unknown Past.Bakhadyr Khoussainov, Alexander Yakhnis & Vladimir Yakhnis - 1998 - Mathematical Logic Quarterly 44 (2):185-204.
Proof and refutation in MALL as a game.Olivier Delande, Dale Miller & Alexis Saurin - 2010 - Annals of Pure and Applied Logic 161 (5):654-672.
Games for truth.P. D. Welch - 2009 - Bulletin of Symbolic Logic 15 (4):410-427.

Analytics

Added to PP
2009-01-28

Downloads
47 (#105,769)

6 months
19 (#786,843)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Supermachines and superminds.Eric Steinhart - 2003 - Minds and Machines 13 (1):155-186.

Add more citations

References found in this work

No references found.

Add more references