Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH scholarly article en Heijltjes, Willem B.; Hughes, Dominic J. D.; Straßburger, Lutz http://www.dagstuhl.de/lipics License
when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-105297
URL:

; ;

Proof Nets for First-Order Additive Linear Logic

pdf-format:


Abstract

We present canonical proof nets for first-order additive linear logic, the fragment of linear logic with sum, product, and first-order universal and existential quantification. We present two versions of our proof nets. One, witness nets, retains explicit witnessing information to existential quantification. For the other, unification nets, this information is absent but can be reconstructed through unification. Unification nets embody a central contribution of the paper: first-order witness information can be left implicit, and reconstructed as needed. Witness nets are canonical for first-order additive sequent calculus. Unification nets in addition factor out any inessential choice for existential witnesses. Both notions of proof net are defined through coalescence, an additive counterpart to multiplicative contractibility, and for witness nets an additional geometric correctness criterion is provided. Both capture sequent calculus cut-elimination as a one-step global composition operation.

BibTeX - Entry

@InProceedings{heijltjes_et_al:LIPIcs:2019:10529,
  author =	{Willem B. Heijltjes and Dominic J. D. Hughes and Lutz Stra{\ss}burger},
  title =	{{Proof Nets for First-Order Additive Linear Logic}},
  booktitle =	{4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019)},
  pages =	{22:1--22:22},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-107-8},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{131},
  editor =	{Herman Geuvers},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/10529},
  URN =		{urn:nbn:de:0030-drops-105297},
  doi =		{10.4230/LIPIcs.FSCD.2019.22},
  annote =	{Keywords: linear logic, first-order logic, proof nets, Herbrand's theorem}
}

Keywords: linear logic, first-order logic, proof nets, Herbrand's theorem
Seminar: 4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019)
Issue date: 2019
Date of publication: 2019


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI