@inproceedings{5a7d3baf24884eb19953798bee8137ed,
title = "Multiple conclusion linear logic: Cut elimination and more",
abstract = "Full Intuitionistic Linear Logic (FILL) was first introduced by Hyland and de Paiva, and went against current beliefs that it was not possible to incorporate all of the linear connectives, e.g. tensor, par, and implication, into an intuitionistic linear logic. It was shown that their formalization of FILL did not enjoy cut-elimination by Bierman, but Bellin proposed a change to the definition of FILL in the hope to regain cut-elimination. In this note we adopt Bellin{\textquoteright}s proposed change and give a direct proof of cut-elimination. Then we show that a categorical model of FILL in the basic dialectica category is also a LNL model of Benton and a full tensor model of Melli`es{\textquoteright} and Tabareau{\textquoteright}s tensorial logic. Lastly, we give a double-negation translation of linear logic into FILL that explicitly uses par in addition to tensor.",
keywords = "Categorical model, Classical linear logic, Cut-elimination, Dialectica category, Full intuitionistic linear logic, Linear/non-linear models, Par, Proof theory, Tensorial logic",
author = "Harley Eades and {de Paiva}, Valeria",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2016.; International Symposium on Logical Foundations of Computer Science, LFCS 2016 ; Conference date: 04-01-2016 Through 07-01-2016",
year = "2016",
doi = "10.1007/978-3-319-27683-0_7",
language = "English (US)",
isbn = "9783319276823",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "90--105",
editor = "Anil Nerode and Sergei Artemov",
booktitle = "Logical Foundations of Computer Science - International Symposium, LFCS 2016, Proceedings",
}