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.
In David Makinson, Jacek Malinowski & Heinrich Wansing, editors:Towards Mathematical Philosophy, Trends in logic28
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.