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. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Bradfield, J. C. (2003). Parity of imperfection or fixing independence. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2803, 72–85. https://doi.org/10.1007/978-3-540-45220-1_8
Mendeley helps you to discover research relevant for your work.