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.
Logica Universalis 8(1), pp
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
A complete labelled sequent calculus is developed for inquisitive first-order modal logic by extending prior work, with proofs of strong completeness, rule invertibility, and cut admissibility.
citing papers explorer
-
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.
-
Labelled Sequents for Inquisitive First-Order Modal Logic
A complete labelled sequent calculus is developed for inquisitive first-order modal logic by extending prior work, with proofs of strong completeness, rule invertibility, and cut admissibility.