Proof nets for unit-free multiplicative-additive linear logic

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2003, Pages 1-10

  Hughes, Dominic ^a   Van Glabbeek, Rob ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; PROBLEM SOLVING; TENSORS;

LINEAR LOGIC;

FORMAL LOGIC;

EID: 0042468071     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. [AJ94] S. ABRAMSKY & R. JAGADEESAN (1994): Games and full completeness for multiplicative linear logic. Journal of Symbolic Logic 59(2), pp. 543-574.
2. [AM99] S. ABRAMSKY & P.-A. MELLIÈS (1999): Concurrent games and full completenes. In Proc. LICS'99, IEEE, pp. 431-442.
3. [BCST96] R. F. BLUTE, J. R. B. COCKETT, R. A. G. SEELY & T. H. TRIMBLE (1996): Natural deduction and coherence for weakly distributive categories. Journal of Pure and Applied Algebra 113, pp. 229-296.
4. [BS96] R. F. BLUTE & P. J. SCOTT (1996): Linear Läuchli semantics. Annnals of Pure & Applied Logic 77, pp. 101-142.
5. [DHPP99] H. DEVARAJAN, D. HUGHES, G. PLOTKIN & V. R. PRATT (1999): Full completeness of the multiplicative linear logic of chu spaces. In Proc, LlCS'99, IEEE, pp. 234-245.
6. [DR89] V. DANOS & L. REGNIER (1989): The structure of multiplicatives. Arch. Math. Logic 28, pp. 181-203.
7. [Gir87] J.-Y. GIRARD (1987): Linear logic. Theoretical Computer Science 50, pp. 1-102.
8. [Gir96] J.-Y. GIRARD (1996): Proof-nets: the parallel syntax for proof theory. Logic and Algebra. Marcel Dekker.
9. [HO93] J. M. E. HYLAND & C.-H. L. ONG (1993): Fair games and full completeness for multiplicative linear logic without the Mix-Rule. On Ong's web page.
10. [Loa94] R. LOADER (1994): Linear logic, totality and full completeness. In Proc. LICS'94, IEEE, pp. 292-298.
11. [Tan97] A. TAN (1997): Full completeness for models of linear logic. PhD thesis, University of Cambridge.