Permutative logic (PL) is a noncommutative variant of multiplicative linear logic (MLL) arising from recent investigations concerning the topology of linear proofs. Permutative sequents are structured as oriented surfaces with boundary whose topological complexity is able to encode some information about the exchange in sequential proofs. In this paper we provide a complete permutative sequent calculus by extending that one of PL with rules for additives and exponentials. This extended system, here called permutative linear logic (PLL), is shown to be a conservative extension of linear logic and able to enjoy cut-elimination. Moreover, some basic isomorphisms are pointed out. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Pulcini, G. (2007). Permutative additives and exponentials. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4790 LNAI, pp. 469–483). Springer Verlag. https://doi.org/10.1007/978-3-540-75560-9_34
Mendeley helps you to discover research relevant for your work.