Game logic is strong enough for parity games

Studia Logica 75 (2):205 - 219 (2003)
  Copy   BIBTEX

Abstract

We investigate the expressive power of Parikh's Game Logic interpreted in Kripke structures, and show that the syntactical alternation hierarchy of this logic is strict. This is done by encoding the winning condition for parity games of rank n. It follows that Game Logic is not captured by any finite level of the modal -calculus alternation hierarchy. Moreover, we can conclude that model checking for the -calculus is efficiently solvable iff this is possible for Game Logic.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 74,509

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
54 (#216,112)

6 months
2 (#277,663)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The Variable Hierarchy for the Games Μ-Calculus.Walid Belkhir & Luigi Santocanale - 2010 - Annals of Pure and Applied Logic 161 (5):690-707.
Deciding the Unguarded Modal -Calculus.Oliver Friedmann & Martin Lange - 2013 - Journal of Applied Non-Classical Logics 23 (4):353-371.
On Guarded Transformation in the Modal -Calculus.F. Bruse, O. Friedmann & M. Lange - 2015 - Logic Journal of the IGPL 23 (2):194-216.

Add more citations

References found in this work

No references found.

Add more references