Game logic is strong enough for parity games

Studia Logica 75 (2):205 - 219 (2003)
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.
Keywords Philosophy   Logic   Mathematical Logic and Foundations   Computational Linguistics
Categories (categorize this paper)
DOI 10.2307/20016551
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 15,904
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Oliver Friedmann & Martin Lange (2013). Deciding the Unguarded Modal -Calculus. Journal of Applied Non-Classical Logics 23 (4):353-371.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

16 ( #164,005 of 1,725,443 )

Recent downloads (6 months)

6 ( #110,403 of 1,725,443 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.