Capturing bisimulation-invariant complexity classes with higher-order modal fixpoint logic

DOI10.1007/978-3-662-44602-7_8MaRDI QIDQ3190153zbMATH OpenOpenAlexFDO

Authors Martin Lange, Etienne Lozes

Publication date 15 September 2014

Published in Advanced Information Systems Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-44602-7_8

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive complexity and finite models (68Q19)

Recommendations

• Space-efficient fragments of higher-order fixpoint logic
• CONCUR 2004 - Concurrency Theory
• The Complexity of Model Checking Higher-Order Fixpoint Logic
• The complexity of model-checking tail-recursive higher-order fixpoint logic
• Mathematical Foundations of Computer Science 2005

Cited in

(3)

• The complexity of model-checking tail-recursive higher-order fixpoint logic
• A type-directed negation elimination
• Capturing bisimulation-invariant exponential-time complexity classes

This page was built for publication: Capturing bisimulation-invariant complexity classes with higher-order modal fixpoint logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3190153)