Constructive Completeness for Modal Logic with Transitive Closure
No abstract available.
DOI 10.1007/978-3-642-35308-6_18
Related papers
- Model Checking and Transitive-Closure Logic CAV 1997
- Full functional verification of linked data structures PLDI 2008
- Modular reasoning about heap paths via effectively propositional formulas POPL 2014
- Process Logic POPL 1979
- Context logic as modal logic: completeness and parametric inexpressivity POPL 2007
- MightyPPL: Model Checking MITL with Past and Pnueli Modalities TACAS 2026
- Complete Abstractions and Subclassical Modal Logics VMCAI 2017
- Coinduction in Uniform: Foundations for Corecursive Proof Search with Horn Clauses ESOP 2019