On independence-friendly fixpoint logics
We introduce a fixpoint extension of Hintikka and Sandu’s IF (independence-friendly) logic. We obtain some results on its complexity and expressive power. We relate it to parity games of imperfect information, and show its application to defining independence-friendly modal mu-calculi.
Main Author: | J. C. Bradfield |
---|---|
Format: | Article |
Language: | deu |
Published: |
Éditions Kimé
2004-10-01
|
Series: | Philosophia Scientiæ |
Online Access: | http://journals.openedition.org/philosophiascientiae/568 |
Similar Items
-
The Complexity of Independence−Friendly Fixpoint Logic
by: Bradfield, J, et al.
Published: (2007) -
The Complexity of Independence−Friendly Fixpoint Logic
by: Bradfield, J, et al.
Published: (2005) -
Model-checking games for fixpoint logics with partial order models
by: Gutierrez, J, et al.
Published: (2010) -
Model-checking games for fixpoint logics with partial order models
by: Gutierrez, J, et al.
Published: (2009) -
Model-checking games for fixpoint logics with partial order models
by: Gutierrez, J, et al.
Published: (2011)