Computer Science Logic

DOI10.1007/11538363MaRDI QIDQ5394592zbMATH OpenOpenAlexFDO

Authors Carsten Lutz

Publication date 1 November 2006

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

Full work available at URL https://doi.org/10.1007/11538363

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70)

Recommendations

• PDL with Intersection and Converse Is 2EXP-Complete
• scientific article; zbMATH DE number 3983144
• PDL with intersection and converse: satisfiability and infinite-state model checking
• PDL with data constants
• Decision complexity of variants of propositional dynamic logic

Cited in

(11)

• Decidability and expressivity of Ockhamist propositional dynamic logics
• Proving the decidability of the \(\mathrm{PDL}\times\mathrm{PDL}\) product logic
• Tableaux methods for propositional dynamic logics with separating parallel composition
• Algebraic Semantics for Dynamic Dynamic Logic
• PDL with intersection of programs: a complete axiomatization
• scientific article; zbMATH DE number 3983144 (Why is no real title available?)
• Public announcement logic with distributed knowledge: expressivity, completeness and complexity
• PDL with Intersection and Converse Is 2EXP-Complete
• Derivatives on graphs for the positive calculus of relations with transitive closure
• Interpolation for converse PDL
• Modern faces of filtration

This page was built for publication: Computer Science Logic

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