License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2013.197
URN: urn:nbn:de:0030-drops-41981
Go to the corresponding LIPIcs Volume Portal

Clouston, Ranald ; Dawson, Jeremy ; Goré, Rajeev ; Tiu, Alwen

Annotation-Free Sequent Calculi for Full Intuitionistic Linear Logic

18.pdf (0.6 MB)


Full Intuitionistic Linear Logic (FILL) is multiplicative intuitionistic linear logic extended with par. Its proof theory has been notoriously difficult to get right, and existing sequent calculi all involve inference rules with complex annotations to guarantee soundness and cut-elimination. We give a simple and annotation-free display calculus for FILL which satisfies Belnap’s generic cut-elimination theorem. To do so, our display calculus actually handles an extension of FILL, called Bi-Intuitionistic Linear Logic (BiILL), with an ‘exclusion’ connective defined via an adjunction with par. We refine our display calculus for BiILL into a cut-free nested sequent calculus with deep inference in which the explicit structural rules of the display calculus become admissible. A separation property guarantees that proofs of FILL formulae in the deep inference calculus contain no trace of exclusion. Each such rule is sound for the semantics of FILL, thus our deep inference calculus and display calculus are conservative over FILL. The deep inference calculus also enjoys the subformula property and terminating backward proof search, which gives the NP-completeness of BiILL and FILL.

BibTeX - Entry

  author =	{Ranald Clouston and Jeremy Dawson and Rajeev Gor{\'e} and Alwen Tiu},
  title =	{{Annotation-Free Sequent Calculi for Full Intuitionistic Linear Logic}},
  booktitle =	{Computer Science Logic 2013 (CSL 2013)},
  pages =	{197--214},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-60-6},
  ISSN =	{1868-8969},
  year =	{2013},
  volume =	{23},
  editor =	{Simona Ronchi Della Rocca},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-41981},
  doi =		{10.4230/LIPIcs.CSL.2013.197},
  annote =	{Keywords: Linear logic, display calculus, nested sequent calculus, deep inference}

Keywords: Linear logic, display calculus, nested sequent calculus, deep inference
Collection: Computer Science Logic 2013 (CSL 2013)
Issue Date: 2013
Date of publication: 02.09.2013

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