Dominic J. D. Hughes
Rob J. Van Glabbeek
Abstract
A cornerstone of the theory of proof nets for unit-free multiplicative linear logic (MLL) is the abstract representation of cut-free proofs modulo inessential rule commutation. The only known extension to additives, based on monomial weights, fails to preserve this key feature: a host of cut-free monomial proof nets can correspond to the same cut-free proof. Thus, the problem of finding a satisfactory notion of proof net for unit-free multiplicative-additive linear logic (MALL) has remained open since the inception of linear logic in 1986. We present a new definition of MALL proof net which remains faithful to the cornerstone of the MLL theory.
Supplemental Material
Available for Download
Online appendix to designing mediation for context-aware applications. The appendix supports the information on page 784.
- Abramsky, S. and Jagadeesan, R. 1994. Games and full completeness for multiplicative linear logic. J. Symb. Logic 59, 2, 543--574. Google Scholar
Digital Library
- 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. Google Scholar
- Barr, M. 1979. *-Autonomous categories. Lecture Notes in Mathematics, vol. 752. Springer-Verlag, New York.Google Scholar
- 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. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- Blute, R., Hamano, M., and Scott, P. 2005. Softness of hypercoherences and MALL full completeness. Ann. Pure Appl. Logic 131, 1--63.Google ScholarCross Ref
- Blute, R. F. and Scott, P. J. 1996. Linear Läuchli semantics. Ann. Pure Appl. Logic 77, 101--142.Google ScholarCross Ref
- Danos, V. and Regnier, L. 1989. The structure of multiplicatives. Arch. Math. Logic 28, 181--203.Google ScholarCross Ref
- 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. Google Scholar
- Dosen, K. and Petrić, Z. 2004. Proof-Theoretical Coherence. Preprint, Mathematical Institute, Belgrade.Google Scholar
- Girard, J.-Y. 1987. Linear logic. Theoret. Comput. Sci. 50, 1--102. Google ScholarDigital Library
- Girard, J.-Y. 1990. Quantifiers in linear logic II. In Proceedings of the Nuovi problemi della logica e della filosofia della scienze (Viareggio, Italy). Clueb, Bologna.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- Hamano, M. 2004. Softness of MALL proof-structures and a correctness criterion with Mix. Arch. Math. Logic 43, 6, 751--794.Google ScholarCross Ref
- Hughes, D. J. D. 2002. A canonical graphical syntax for non-empty finite products and sums. Technical report, http://boole.stanford.edu/~dominic/papers.Google Scholar
- Hughes, D. J. D. 2004. Proofs without syntax. Annals of Math., to appear. Archived: http://arxiv.org/abs/math/0408282.Google Scholar
- Hughes, D. J. D. 2005. Logic without syntax. Tech. rep. http://arxiv.org/abs/math/0504065.Google Scholar
- 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.Google Scholar
- Joyal, A. 1995. Free bicomplete categories. Math. Reports XVII, 219--225.Google Scholar
- Ketonen, J. and Weyhrauch, R. 1984. A decidable fragment of predicate calculus. Theoret. Comput. Sci. 32, 297--307.Google ScholarCross Ref
- 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. Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- Tan, A. 1997. Full completeness for models of linear logic. Ph.D. thesis, King's College, University of Cambridge.Google Scholar
Index Terms
- Proof nets for unit-free multiplicative-additive linear logic
Recommendations
Conflict nets: Efficient locally canonical MALL proof nets
LICS '16: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer ScienceProof nets for MLL (unit-free multiplicative linear logic) and ALL (unit-free additive linear logic) are graphical abstractions of proofs which are efficient (proofs translate in linear time) and canonical (invariant under rule commutation). This paper ...
Proof Nets for Herbrand’s Theorem
This article explores Herbrand’s theorem as the source of a natural notion of abstract proof object for classical logic, embodying the “essence” of a sequent calculus proof. We see how to view a calculus of abstract Herbrand proofs (Herbrand nets) as an ...
Constructive linear-time temporal logic: Proof systems and Kripke semantics
In this paper we study a version of constructive linear-time temporal logic (LTL) with the ''next'' temporal operator. The logic is originally due to Davies, who has shown that the proof system of the logic corresponds to a type system for binding-time ...
Comments