Cut-free hypersequent calculus for S4.3.
From MaRDI portal
Recommendations
- Eliminability of cut in hypersequent calculi for some modal logics of linear frames
- The Method of Tree-Hypersequents for Modal Propositional Logic
- LINEAR TIME IN HYPERSEQUENT FRAMEWORK
- Cut-free completeness for modular hypersequent calculi for modal logics K, T, and D
- From Frame Properties to Hypersequent Rules in Modal Logics
Cited in
(18)- Hypersequent and display calculi -- a unified perspective
- Hypersequent calculi for S5: the methods of cut elimination
- Machine-checked proof-theory for propositional modal logics
- On a multilattice analogue of a hypersequent S5 calculus
- Hypersequent rules with restricted contexts for propositional modal logics
- Translation of hypersequents into display sequents
- Cut elimination theorem for non-commutative hypersequent calculus
- Eliminability of cut in hypersequent calculi for some modal logics of linear frames
- Cut-free completeness for modular hypersequent calculi for modal logics K, T, and D
- scientific article; zbMATH DE number 7561320 (Why is no real title available?)
- CUT ELIMINATION IN HYPERSEQUENT CALCULUS FOR SOME LOGICS OF LINEAR TIME
- A hypersequent calculus with clusters for linear frames
- A formal framework for hypersequent calculi and their fibring
- Interpolation method for multicomponent sequent calculi
- scientific article; zbMATH DE number 975278 (Why is no real title available?)
- LINEAR TIME IN HYPERSEQUENT FRAMEWORK
- Sequents vs hypersequents for Åqvist systems
- The bounded proof property via step algebras and step frames
This page was built for publication: Cut-free hypersequent calculus for S4.3.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5413334)
