Proof nets for unit-free multiplicative-additive linear logic

ACM Transactions on Computational Logic

Volumn 6, Issue 4, 2005, Pages 784-842

  Hughes, Dominic J D ^a,b   Van Glabbeek, Rob J ^a,c  

^a STANFORD UNIVERSITY   (United States)

^b Stanford University   (United States)

^c UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Additives; Cut elimination; Linear logic; Proof nets

Indexed keywords

CUT ELIMINATION; LINEAR LOGIC; MULTIPLICATIVE-ADDITIVE LINEAR LOGIC (MALL); PROOF NETS;

ALGEBRA; COMPUTATIONAL METHODS; FORMAL LOGIC; LINEAR SYSTEMS;

PETRI NETS;

EID: 26944467760     PISSN: 15293785     EISSN: 15293785     Source Type: Journal    
DOI: 10.1145/1094622.1094629     Document Type: Conference Paper

References (25)

1. ABRAMSKY, S. AND JAGADEESAN, R. 1994. Games and full completeness for multiplicative linear logic. J. Symb. Logic 59, 2, 543-574.
2. ABRAMSKY, S. AND MELLIÈS, P.-A. 1999. Concurrent games and full completeness. In Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science (Trento, Italy, July). IEEE Computer Society Press, Los Alamitos, CA, 431-442.
3. BARR, M. 1979. *-Autonomous categories. Lecture Notes in Mathematics, vol. 752. Springer-Verlag, New York.
4. BELLIN, G. AND KETONEN, J. 1992. A decision procedure revisited: Notes on direct logic, linear logic and its implementation. Theoret. Comput. Sci. 95, 115-142.
5. BLUTE, R. F., COCKETT, J. R. B., SEELY, R. A. G., AND TRIMBLE, T. H. 1996. Natural deduction and coherence for weakly distributive categories. J. Pure Appl. Alg. 113, 229-296.
6. BLUTE, R., HAMANO, M., AND SCOTT, P. 2005. Softness of hypercoherences and MALL full completeness. Ann. Pure Appl. Logic 131, 1-63.
7. BLUTE, R. P. AND SCOTT, P. J. 1996. Linear Läuchli semantics. Ann. Pure Appl. Logic 77, 101-142.
8. DANOS, V. AND REGNIER, L. 1989. The structure of multiplicatives. Arch. Math. Logic 28, 181-203.
9. DEVARAJAN, H., HUGHES, D. J. D., PLOTKIN, G. D. P., AND PRATT, V. R. 1999. Full completeness of the multiplicative linear logic of Chu spaces. In Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science (Trento, Italy, July). IEEE Computer Society Press, Los Alamitos, CA, 234-245.
10. DOŠEN, K. AND PETRIĆ, Z. 2004. Proof-Theoretical Coherence. Preprint, Mathematical Institute, Belgrade.
11. GIRARD, J.-Y. 1987. Linear logic. Theoret. Comput. Sci. 50, 1-102.
12. GIRARD, J.-Y. 1990. Quantifiers in linear logic II. In Proceedings of the Nuoviproblemi della logica e della filosofia della scienze (Viareggio, Italy). Clueb, Bologna.
13. GIRARD, J.-Y. 1996. Proof-nets: The parallel syntax for proof theory. In Logic and Algebra. Lecture Notes In Pure and Applied Mathematics, vol. 180. Marcel Dekker, New York.
14. GIRARD, J.-Y. 1999. On the meaning of logical rules I: Syntax vs. semantics. In Computational Logic, U. Berger and H. Schwichtenberg, Eds., NATO ASI Series 165, vol. 14. Springer-Verlag, New York, 215-272.
15. HAMANO, M. 2004. Softness of MALL proof-structures and a correctness criterion with Mix. Arch. Math. Logic 43, 6, 751-794.
16. HUGHES, D. J. D. 2002. A canonical graphical syntax for non-empty finite products and sums. Technical report, http://boole.stanford.edu/~dominic/papers.
17. HUGHES, D. J. D. 2004. Proofs without syntax. Annals of Math., to appear. Archived: http://arxiv.org/abs/math/0408282.
18. HUGHES, D. J. D. 2005. Logic without syntax. Tech. rep. http://arxiv.org/abs/math/0604066.
19. HYLAND, J. M. E. AND ONG, C.-H. L. 1993. Fair games and full completeness for multiplicative linear logic without the Mix-rule. On Ong's web page, http://users.comlab.ox.ac.uk/luke.ong.
20. JOYAL, A. 1995. Free bicomplete categories. Math. Reports XVII, 219-225.
21. KETONEN, J. AND WEYHRAUCH, R. 1984. A decidable fragment of predicate calculus. Theoret. Comput. Sci. 32, 297-307.
22. LAMARCHE, F. AND STRASSBURGER, L. 2005. Naming proofs in classical propositional logic. In Typed Lambda Calculi and Applications (TLCA 2005). Lecture Notes in Computer Science, vol. 3461. Springer-Verlag, New York, 246-261.
23. LAURENT, O. AND TORTURA DE FALCO, L. 2004. Slicing polarized additive normalization. In Linear Logic in Computer Science, T. Ehrhard, J.-Y. Girard, P. Ruet and P. Scott, Eds. London Mathematical Society Lecture Note Series 316, Cambridge University Press.
24. LOADER, R. 1994. Linear logic, totality and full completeness. In Proceedings of the 9th Annual IEEE Symposium on Logic in Computer Science (Paris, July). IEEE Computer Society Press, Los Alamitos, CA, 292-298.
25. TAN, A. 1997. Full completeness for models of linear logic. Ph.D. thesis, King's College, University of Cambridge.