arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0910.3383cs.LO
收藏

线性逻辑中的最小和最大不动点

Least and Greatest Fixed Points in Linear Logic

David Baelde

摘要:

MALL(乘法,加法线性逻辑)的一阶理论仅在等式上是一个有趣但弱的逻辑,因为它不能捕获无界(无限)行为。而不是通过增加指数(!和?),我们添加最小和最大不动点算子。由此产生的逻辑,我们称之为muMALL,满足两个基本的证明理论性质:我们建立弱规范化,我们设计了一个集中的证明系统,我们证明完整的。第二个结果提供了一个强范式的无切割证明结构,可用于,例如,帮助自动化证明搜索。我们展示了如何将这些基础应用于直觉逻辑。

英文摘要:

The first-order theory of MALL (multiplicative, additive linear logic) over only equalities is an interesting but weak logic since it cannot capture unbounded (infinite) behavior. Instead of accounting for unbounded behavior via the addition of the exponentials (! and ?), we add least and greatest fixed point operators. The resulting logic, which we call muMALL, satisfies two fundamental proof theoretic properties: we establish weak normalization for it, and we design a focused proof system that we prove complete. That second result provides a strong normal form for cut-free proof structures that can be used, for example, to help automate proof search. We show how these foundations can be applied to intuitionistic logic.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑