Uniform Lyndon interpolation is shown for GLS via non-wellfounded proofs, closing a prior gap and yielding an alternative cut-elimination proof.
Shamkanov (2014): Circular proofs for the Gödel-Löb provability logic
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 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.
citing papers explorer
-
Uniform Lyndon Interpolation via Non-wellfounded Proofs
Uniform Lyndon interpolation is shown for GLS via non-wellfounded proofs, closing a prior gap and yielding an alternative cut-elimination proof.
-
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.