← 研踪 PaperTrailarXiv:2611.24235 · v1
Canonical Proof Nets for Intuitionistic Multiplicative Linear Logic
首次提交 2026-11-18 19:09
版本更新 2026-11-18 19:09
雷达观测 2026-11-19 15:04
摘要
We study the problem of finding canonical representations of proofs in the multiplicative fragment of intuitionistic linear logic with units. We show that, contrary to the classical case, it is possible to define a notion of proof nets for this fragment which is provided with a polynomial-time sequentialization procedure and is both canonical and efficient. In particular, we show that sequent calculus derivations differing only by a permutation of independent rule applications are translated to the same proof net, and that the translations between sequent calculus and proof nets are inverse to each other.
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-18 19:09 · 最新观测版本
Canonical Proof Nets for Intuitionistic Multiplicative Linear Logic
We study the problem of finding canonical representations of proofs in the multiplicative fragment of intuitionistic linear logic with units. We show that, contrary to the classical case, it is possible to define a notion of proof nets for this fragment which is provided with a polynomial-time sequentialization procedure and is both canonical and efficient. In particular, we show that sequent calculus derivations differing only by a permutation of independent rule applications are translated to the same proof net, and that the translations between sequent calculus and proof nets are inverse to each other.
查看此版本解读 →查看此版本原文 ↗