The complexity of independence-friendly fixpoint logic

Authors:
Julian Bradfield;Stephan Kreutzer
Affiliations:
Laboratory for Foundations of Computer Science, University of Edinburgh;Institut für Informatik, Humboldt Universität, Berlin, Germany
Venue:
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Year:
2005

Citing 3
Cited 1

Fixpoint extensions of first-order logic and datalog-like languages

Proceedings of the Fourth Annual Symposium on Logic in computer science
Independence-friendly modal logic and true concurrency

Nordic Journal of Computing
Independence: Logics and Concurrency

Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic

A logic for true concurrency

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory

Quantified Score

Hi-index	0.00

Visualization

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).