Abstract
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.
BibTeX - Entry
@InProceedings{decarvalho:LIPIcs:2016:6581,
author = {Daniel de Carvalho},
title = {{The Relational Model Is Injective for Multiplicative Exponential Linear Logic}},
booktitle = {25th EACSL Annual Conference on Computer Science Logic (CSL 2016)},
pages = {41:1--41:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-022-4},
ISSN = {1868-8969},
year = {2016},
volume = {62},
editor = {Jean-Marc Talbot and Laurent Regnier},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6581},
URN = {urn:nbn:de:0030-drops-65815},
doi = {10.4230/LIPIcs.CSL.2016.41},
annote = {Keywords: Linear Logic, Denotational semantics, Proof-nets}
}
Keywords: |
|
Linear Logic, Denotational semantics, Proof-nets |
Collection: |
|
25th EACSL Annual Conference on Computer Science Logic (CSL 2016) |
Issue Date: |
|
2016 |
Date of publication: |
|
29.08.2016 |