Full completeness of the multiplicative linear logic of Chu spaces
Authors:
- H. DevarajanHDH. Devarajan
- D. HughesDHD. Hughes
- G. PlotkinGPG. Plotkin
- V. PrattVPV. Pratt
- 20 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1000, 234-243
Abstract
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 functors on the category of Chu spaces over 2.Keywords
This publication has 11 references indexed in Scilit:
- Chu spaces as a semantic bridge between linear logic and mathematicsTheoretical Computer Science, 2003
- Linear logic, totality and full completeness2002
- Dinatural numbersJournal of Pure and Applied Algebra, 1998
- Chu I: cofree equivalences, dualities and *-autonomous categoriesMathematical Structures in Computer Science, 1997
- Towards Full Completeness of the Linear Logic of Chu SpacesElectronic Notes in Theoretical Computer Science, 1997
- Linear Läuchli semanticsAnnals of Pure and Applied Logic, 1996
- Games and full Completeness for multiplicative Linear Logic1992
- The structure of multiplicativesArchive for Mathematical Logic, 1989
- Linear logicTheoretical Computer Science, 1987
- *-Autonomous Categories1979