Infinite Games Specified by 2-Tape Automata

Abstract : We prove that the determinacy of Gale-Stewart games whose winning sets are infinitary rational relations accepted by 2-tape Büchi automata is equivalent to the determinacy of (effective) analytic Gale-Stewart games which is known to be a large cardinal assumption. Then we prove that winning strategies, when they exist, can be very complex, i.e. highly non-effective, in these games. We prove the same results for Gale-Stewart games with winning sets accepted by real-time 1-counter Büchi automata, then extending previous results obtained about these games. Then we consider the strenghs of determinacy for these games, and we prove that there is a transfinite sequence of 2-tape Büchi automata (respectively, of real-time 1-counter Büchi automata) $A_\alpha$, indexed by recursive ordinals, such that the games $G(L(A_\alpha))$ have strictly increasing strenghs of determinacy. Moreover there is a 2-tape Büchi automaton (respectively, a real-time 1-counter Büchi automaton) B such that the determinacy of G(L(B)) is equivalent to the (effective) analytic determinacy and thus has the maximal strength of determinacy. We also show that the determinacy of Wadge games between two players in charge of infinitary rational relations accepted by 2-tape Büchi automata is equivalent to the (effective) analytic determinacy, and thus not provable in ZFC.
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00918326
Contributor : Olivier Finkel <>
Submitted on : Friday, December 13, 2013 - 12:41:44 PM
Last modification on : Friday, April 12, 2019 - 2:46:04 PM
Document(s) archivé(s) le : Friday, March 14, 2014 - 4:35:50 AM

Files

TWO-TAPE-GAMES.pdf
Files produced by the author(s)

Identifiers

Citation

Olivier Finkel. Infinite Games Specified by 2-Tape Automata. Annals of Pure and Applied Logic, Elsevier Masson, 2016, 167 (12), pp.1184-1212. ⟨10.1016/j.apal.2016.05.005⟩. ⟨hal-00918326⟩

Share

Metrics

Record views

519

Files downloads

132