Games with winning conditions of high Borel complexity
This research work represents a significant contribution to the study of the infinite two-player games on pushdown graphs. The author establishes the best recent result concerning the families of decidable winning conditions for arbitrary finite Borel complexity with the important particular cases of games played on finite graphs. The method provides effective winning strategies and the exact form of the winning sets together with the existence of positional strategies remains open. Several pertinent references complete the paper.
scientific article; zbMATH DE number 5013344
scientific article