Parity of Imperfection or Fixing Independence

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.
Original languageEnglish
Title of host publicationComputer Science Logic
Subtitle of host publication17th International Workshop CSL 2003, 12th Annual Conference of the EACSL, 8th Kurt Gödel Colloquium, KGC 2003, Vienna, Austria, August 25-30, 2003. Proceedings
EditorsMatthias Baaz, Johann A. Makowsky
PublisherSpringer Berlin Heidelberg
Pages72-85
Number of pages14
ISBN (Electronic)978-3-540-45220-1
ISBN (Print)978-3-540-40801-7
DOIs
Publication statusPublished - 2003

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin Heidelberg
Volume2803

Fingerprint Dive into the research topics of 'Parity of Imperfection or Fixing Independence'. Together they form a unique fingerprint.

Cite this