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.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-18
DOI
https://doi.org/10.48550/arxiv.2611.24722
Primary Topic
Logic, programming, and type systems
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Proof-Relevant Interpolation for Circular Proofs in Linear Logic

Alexis Saurin, Daniel Osorio-Valencia
arXiv (Cornell University)
Logic, programming, and type systems
preprint

Proof-Relevant Interpolation for Circular Proofs in Linear Logic

Alexis Saurin, Daniel Osorio-Valencia
preprint en

Abstract

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.

arXiv (Cornell University)
Logic, programming, and type systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon