We prove a completeness result for Multiplicative Exponential Linear Logic
(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.Comment: 33 page

de Carvalho, Daniel

English

arXiv

We prove a completeness result for Multiplicative Exponential Linear Logic (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

Dagstuhl Research Online Publication Server

The Relational Model Is Injective for Multiplicative Exponential Linear Logic

http://drops.dagstuhl.de/opus/volltexte/2016/6581/pdf/LIPIcs-CSL-2016-41.pdf

The relational model is injective for Multiplicative Exponential Linear Logic

Abstract

Similar works

Full text

Available Versions

Dagstuhl Research Online Publication Server