Decision complexity of variants of propositional dynamic logic
From MaRDI portal
Publication:3897033
DOI10.1007/BFB0022540zbMath0451.03003MaRDI QIDQ3897033
No author found.
Publication date: 1980
Published in: Mathematical Foundations of Computer Science 1980 (Search for Journal in Brave)
Modal logic (including the logic of norms) (03B45) Other nonclassical logic (03B60) Abstract data types; algebraic specification (68Q65) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) General topics in the theory of software (68N01)
Related Items (7)
A derivation-loop method for temporal logic ⋮ More efficient proof-search for sequents of temporal logic ⋮ Program schemata technique for propositional program logics: a 30-year history ⋮ On the computational complexity of satisfiability in propositional logics of programs ⋮ Loop-type sequent calculi for temporal logic ⋮ Deterministic propositional dynamic logic: finite models, complexity, and completeness ⋮ \(\Pi_ 1^ 1\)-universality of some propositional logics of concurrent programs
This page was built for publication: Decision complexity of variants of propositional dynamic logic
