Gödel-Löb逻辑的循环证明
Circular Proofs for Gödel-Löb Logic
摘要：
我们提出了一个序列式证明系统的可证明性逻辑GL，承认所谓的循环证明。对于这些证明，证明的基础图不是有限树，但允许包含循环。作为应用，我们在语法上建立了GL的Lindon插值.
英文摘要：
We present a sequent-style proof system for provability logic GL that admits so-called circular proofs. For these proofs, the graph underlying a proof is not a finite tree but is allowed to contain cycles. As an application, we establish Lindon interpolation for GL syntactically.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
