Linear Logic Properly Displayed
Not on the map. Why?
Abstract (arXiv)
We introduce proper display calculi for intuitionistic, bi-intuitionistic and classical linear logics with exponentials, which are sound, complete, conservative, and enjoy cut-elimination and subformula property. Based on the same design, we introduce a variant of Lambek calculus with exponentials, aimed at capturing the controlled application of exchange and associativity. Properness (i.e. closure under uniform substitution of all parametric parts in rules) is the main interest and added value of the present proposal, and allows for the smoothest proof of cut-elimination. Our proposal builds on an algebraic and order-theoretic analysis of linear logic, and applies the guidelines of the multi-type methodology in the design of display calculi.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 13 Nov 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1.
1 paper.
- 2022Introducing Proof Tree Automata and Proof Tree Graphscited by 0
- 2022Introducing Proof Tree Automata and Proof Tree Graphs13 Jun 2022