A contraction-free and cut-free sequent calculus for propositional dynamic logic
From MaRDI portal
Publication:965900
DOI10.1007/s11225-010-9224-zzbMath1193.03038OpenAlexW2085914381MaRDI QIDQ965900
Francesca Poggiolesi, Brian Hill
Publication date: 26 April 2010
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11225-010-9224-z
Related Items (2)
Labeled sequent calculi for modal logics and implicit contractions ⋮ Syntactic cut-elimination for a fragment of the modal mu-calculus
Cites Work
- Unnamed Item
- Unnamed Item
- On models for propositional dynamic logic
- About cut elimination for logics of common knowledge
- Cut-free common knowledge
- A CUT-FREE SIMPLE SEQUENT CALCULUS FOR MODAL LOGIC S5
- The Method of Tree-Hypersequents for Modal Propositional Logic
- An axiomatic basis for computer programming
- Algorithmic properties of structures
This page was built for publication: A contraction-free and cut-free sequent calculus for propositional dynamic logic