First sound and complete nested sequent calculi for Horn-characterizable QMLs with equality and inner/outer domains via grammar-parameterized reachability rules.
Lyon and Piotr Ostropolski-Nalewaja
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
cs.LO 3verdicts
UNVERDICTED 3representative citing papers
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.
citing papers explorer
-
Nested Sequents for Horn-Characterizable Quantified Modal Logics with Equality via Reachability Rules
First sound and complete nested sequent calculi for Horn-characterizable QMLs with equality and inner/outer domains via grammar-parameterized reachability rules.
-
Optimizing Proof-Search via Linearization for G\"odel-L\"ob Logic with Tree-Hypersequents
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 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.