The Descriptive Complexity of Parity Games

We study the logical definablity of the winning regions of parity games. For games with a bounded number of priorities, it is wellknown that the winning regions are definable in the modal

• Type: Conference
• Year: 2008
• Where: CSL
• Authors: Anuj Dawar, Erich Grädel
• Keywords: Automated Reasoning, CSL 2008, Finite Game Graphs, Least-fixed Point Logic, Parity Games