𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexities of Winning Strategies in Diophantine Games

✍ Scribed by J.P. Jones; A.S. Fraenkel

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
871 KB
Volume
11
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Winning strategies in club games and the
Winning strategies in club games and their applications
✍ Bernhard KΓΆnig πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 135 KB

Namba lemma, club game, two cardinal diamond. MSC (2010) 03E05, 03E10 We present results concerning winning strategies and tactics in club games on Pω 1 λ. We show that there is generally no winning tactic for the player trying to get inside the club. The bound-countable game turns out to be rather

Complexity of winning strategies
Complexity of winning strategies
✍ Andreas Blass πŸ“‚ Article πŸ“… 1972 πŸ› Elsevier Science 🌐 English βš– 606 KB

Rabin has given an example of a game with recursive rules but no recursive winning strategy. We show that such a game always has a hyperarithmetical winning strategy, but arbitrarily high levels of the hyperarithmetical hierarchy may be needed. We also exhibit a recursively enumerable game which has