Taylor expansion in linear logic is invertible

12/15/2017
by   Daniel de Carvalho, et al.
0

Each Multiplicative Exponential Linear Logic (MELL) proof-net can be expanded into a differential net, which is its Taylor expansion. We prove that two different MELL proof-nets have two different Taylor expansions. As a corollary, we prove a completeness result for MELL: We show that the relational model is injective for MELL proof-nets, i.e. the equality between MELL proof-nets in the relational model is exactly axiomatized by cut-elimination.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/14/2019

An application of parallel cut elimination in multiplicative linear logic to the Taylor expansion of proof nets

We examine some combinatorial properties of parallel cut elimination in ...
research
07/22/2022

Elimination and cut-elimination in multiplicative linear logic

We associate to every proof structure in multiplicative linear logic an ...
research
02/09/2018

Unification nets: canonical proof net quantifiers

Proof nets for MLL (unit-free Multiplicative Linear Logic) are concise g...
research
02/10/2021

Interpreting a concurrent λ-calculus in differential proof nets (extended version)

In this paper, we show how to interpret a language featuring concurrency...
research
08/06/2020

Gluing resource proof-structures: inhabitation and inverting the Taylor expansion

A Multiplicative-Exponential Linear Logic (MELL) proof-structure can be ...
research
10/17/2019

Glueability of resource proof-structures: inverting the Taylor expansion (long version)

A Multiplicative-Exponential Linear Logic (MELL) proof-structure can be ...
research
04/15/2019

Coherent Interaction Graphs

We introduce the notion of coherent graphs, and show how those can be us...

Please sign up or login with your details

Forgot password? Click here to reset