@inbook{2b92e3f8122b4451aa09ba18e572006e,
title = "The complexity of independence-friendly fixpoint logic",
abstract = "We study the complexity of model-checking for the fixpoint extension of Hintikka and Sandu's independence-friendly logic. We show that this logic captures EXPTIME; and by embedding PFP, we show that its combined complexity is EXPSPACE-hard, and moreover the logic includes second order logic (on finite structures). ",
author = "Julian Bradfield and Stephan Kreutzer",
year = "2007",
language = "English",
isbn = "978-1904987758",
series = "Studies in Logic",
publisher = "College Publications",
pages = "39--62",
editor = "Stefan Bold and Benedikt L{\"o}we and Thoralf R{\"a}sch and {van Benthem}, Johan",
booktitle = "Foundations of the Formal Sciences V, Infinite Games",
}