The Determinacy of Context-Free Games - Université Paris Cité Accéder directement au contenu
Article Dans Une Revue The Journal of Symbolic Logic Année : 2013

The Determinacy of Context-Free Games

Résumé

We prove that the determinacy of Gale-Stewart games whose winning sets are accepted by real-time 1-counter Büchi automata is equivalent to the determinacy of (effective) analytic Gale-Stewart games which is known to be a large cardinal assumption. We show also that the determinacy of Wadge games between two players in charge of omega-languages accepted by 1-counter Büchi automata is equivalent to the (effective) analytic Wadge determinacy. Using some results of set theory we prove that one can effectively construct a 1-counter Büchi automaton A and a Büchi automaton B such that: (1) There exists a model of ZFC in which Player 2 has a winning strategy in the Wadge game W(L(A), L(B)); (2) There exists a model of ZFC in which the Wadge game W(L(A), L(B)) is not determined. Moreover these are the only two possibilities, i.e. there are no models of ZFC in which Player 1 has a winning strategy in the Wadge game W(L(A), L(B)).
Fichier principal
Vignette du fichier
CF-GAMES-JSL.pdf (235.19 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00916865 , version 1 (10-12-2013)

Identifiants

Citer

Olivier Finkel. The Determinacy of Context-Free Games. The Journal of Symbolic Logic, 2013, 78 (4), pp.1115-1134. ⟨hal-00916865⟩
116 Consultations
386 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More