Definability in Games

Abstract We shall present a survey on definability questions for graph games. Infinite games on graphs, where two players move a token along the edges of a directed graph tracing out a finite or infinite path, are intimately connected with fundamental questions in logic and have numerous applications in different areas of mathematics and computer science.

Authors

• Erich Grädel

Keywords

No keywords are indexed for this paper.