Full Completeness of the Multiplicative Linear Logic of Chu Spaces

We prove full completeness of multiplicative linear logic (MLL) without MIX under the Chu interpretation. In particular we show that the cut-free proofs of MLL theorems are in a natural bijection with the binary logical transformations of the corresponding operations on the category of Chu spaces on a two-letter alphabet. This is the online version of the paper of the same title appearing in the LICS'99 proceedings.

• Type: Conference
• Year: 1999
• Where: LICS
• Authors: Harish Devarajan, Dominic J. D. Hughes, Gordon D. Plotkin, Vaughan R. Pratt
• Keywords: Automated Reasoning, Binary Logical Transformations, LICS 1999, MLL Theorems, Multiplicative Linear Logic