Interpolation for converse PDL

DOI10.1007/978-3-032-06085-3_14MaRDI QIDQ6860382zbMATH OpenFDO

Authors Johannes Kloibhofer, Valentina Trucco Dalmas, Yde Venema

Publication date 10 February 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-032-06085-3_14

zbMATH Keywords

converse modalitiescyclic proof systeminterpolationpropositional dynamic logic

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cites work

• A near-optimal method for reasoning about action
• Beth definability in expressive description logics
• Circular proofs for the Gödel-Löb provability logic
• Computer Science Logic
• Deterministic propositional dynamic logic: finite models, complexity, and completeness
• scientific article; zbMATH DE number 2184446 (Why is no real title available?)
• scientific article; zbMATH DE number 3607998 (Why is no real title available?)
• Interpolation in computing science: The semantics of modularization
• Lyndon Interpolation for Modal $$\mu $$-Calculus
• Propositional dynamic logic of regular programs
• The Complexity of Tree Automata and Logics of Programs
• Tools and Algorithms for the Construction and Analysis of Systems

This page was built for publication: Interpolation for converse PDL

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