跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.24722 · v1

Proof-Relevant Interpolation for Circular Proofs in Linear Logic

首次提交 2026-11-19 00:41
版本更新 2026-11-19 00:41
雷达观测 2026-11-19 15:04
arXiv ↗PDF ↗

摘要

First introduced for proving Craig's interpolation theorem, Maehara's method provides a constructive, proof-theoretic procedure for extracting interpolants in sequent calculus proofs. Building on this method, Saurin developed a ``proof-relevant'' interpolation theorem for first-order linear logic, in the sense that the interpolated proof is obtained by cut-introduction steps that can be reversed via cut-elimination. In this work, we extend Saurin's proof-relevant interpolation to linear logic proofs with cuts as well as to circular proofs in linear logic with fixed-points. We specifically show how Maehara's method can be extended in a proof-relevant way to work on non-cut-free and non-well-founded (but regular) proof objects, and guarantee that the interpolation procedure preserves strong validity. We also study conditions under which one can interpolate system L terms that are not necessarily in normal form.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-19 00:41 · 最新观测版本

Proof-Relevant Interpolation for Circular Proofs in Linear Logic

First introduced for proving Craig's interpolation theorem, Maehara's method provides a constructive, proof-theoretic procedure for extracting interpolants in sequent calculus proofs. Building on this method, Saurin developed a ``proof-relevant'' interpolation theorem for first-order linear logic, in the sense that the interpolated proof is obtained by cut-introduction steps that can be reversed via cut-elimination. In this work, we extend Saurin's proof-relevant interpolation to linear logic proofs with cuts as well as to circular proofs in linear logic with fixed-points. We specifically show how Maehara's method can be extended in a proof-relevant way to work on non-cut-free and non-well-founded (but regular) proof objects, and guarantee that the interpolation procedure preserves strong validity. We also study conditions under which one can interpolate system L terms that are not necessarily in normal form.

查看此版本解读 →查看此版本原文 ↗