Modal satisfiability is in deterministic linear space

DOI10.1007/3-540-44622-2_22MaRDI QIDQ2753683zbMATH OpenFDO

Authors Edith Hemaspaandra

Publication date 11 November 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44622-2_22

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• scientific article; zbMATH DE number 2196594
• On the complexity of elementary modal logics
• Generalized modal satisfiability
• Generalized Modal Satisfiability
• scientific article; zbMATH DE number 1989649

Cited in

(2)

• scientific article; zbMATH DE number 2196594 (Why is no real title available?)
• Coalgebraic semantics of modal logics: an overview

This page was built for publication: Modal satisfiability is in deterministic linear space

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