Computing Connected Proof(-Structure)s From Their Taylor Expansion
Computing Connected Proof(-Structure)s From Their Taylor Expansion
复制标题
从泰勒展开式计算连通证明（-结构）
DOI：
10.4230/lipics.fscd.2016.20
复制
发表时间：
2016
影响因子：
3.4
通讯作者：
L. Falco
中科院分区：
文献类型：
--
作者：
Giulio Guerrieri;L. Pellissier;L. Falco
我们表明，每一个连接的乘法指数线性逻辑（MELL）证明结构（有或没有削减）是唯一确定的一个精心挑选的元素的泰勒展开：一个通过采取两个副本的内容，每个盒子。因此，关系
模型是关于连接MELL证明结构的单射。
We show that every connected Multiplicative Exponential Linear Logic (MELL) proof-structure (with or without cuts) is uniquely determined by a well-chosen element of its Taylor expansion: the one obtained by taking two copies of the content of each box. As a consequence, the relational
model is injective with respect to connected MELL proof-structures.