First sound and complete nested sequent calculi for Horn-characterizable QMLs with equality and inner/outer domains via grammar-parameterized reachability rules.
Deep sequent systems for modal logic.Archive for Math- ematical Logic, 48(6):551–577
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
fields
cs.LO 5representative citing papers
A shallow sequent calculus for FIK is introduced, shown cut-admissible, and used to prove EXPSPACE decidability, improving on the non-elementary conjecture for IK.
A linearization method enables a PSPACE proof-search algorithm for GL on labeled tree sequents, with counter-model extraction from failed searches and a reduction to linear nested sequents.
Nested sequent calculi for intuitionistic grammar logics admit uniform cut-elimination via a shift rule and validity is undecidable.
The paper establishes syntactic correspondences between non-wellfounded and cyclic proofs for LTL in linear nested sequents by proving completeness relative to saturation recurrence and introducing an unraveling shift procedure.
citing papers explorer
-
Nested Sequents for Intuitionistic Multi-Modal Logics: Modularity, Cut-Elimination, and Undecidability
Nested sequent calculi for intuitionistic grammar logics admit uniform cut-elimination via a shift rule and validity is undecidable.