Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/proof-nets-for-unit-free-multiplicative-additive-linear-logic-ke787DpHRL
References (29)
-
F. Lamarche, Lutz Straßburger (2005)
Naming Proofs in Classical Propositional Logic -
R. Blute, J. Cockett, R. Seely, T. Trimble (1996)
Natural deduction and coherence for weakly distributive categoriesJournal of Pure and Applied Algebra, 113
-
R. Blute, P. Scott (1996)
Linear L Auchli Semantics -
(2003)
Received November -
R. Blute, M. Hamano, P. Scott (2005)
Softness of hypercoherences and MALL full completenessAnn. Pure Appl. Log., 131
-
(1990)
Quantifiers in linear logic II -
Dominic Hughes (2005)
Logic Without SyntaxarXiv: Logic
-
J. Girard (1999)
On the meaning of logical rules I : Syntax versus semantics -
(2005)
ACM Transactions on Computational Logic -
(2004)
Proof-Theoretical Coherence. Preprint, Mathematical Institute -
P. Lincoln (1992)
Linear logicSIGACT News, 23
-
R. Loader (1994)
Linear logic, totality and full completenessProceedings Ninth Annual IEEE Symposium on Logic in Computer Science
-
Olivier Laurent, L. Falco (2004)
Linear Logic in Computer Science: Slicing Polarized Additive Normalization, 316
-
J. Girard (1998)
On the meaning of logical rules I: syntax vs. semanticsACM Transactions on Computational Logic
-
(1995)
Free bicomplete categories -
Jussi Ketonen, R. Weyhrauch (1984)
A Decidable Fragment of Predicate CalculusTheor. Comput. Sci., 32
-
R. Blute, Phil Scott (1996)
Linear Läuchli SemanticsAnn. Pure Appl. Log., 77
-
Glabbeek -
Dominic Hughes (2004)
Proofs without syntaxAnnals of Mathematics, 164
-
M. Hamano (2004)
Softness of MALL proof-structures and a correctness criterion with MixArchive for Mathematical Logic, 43
-
J. Girard (1987)
Linear LogicTheor. Comput. Sci., 50
-
Dominic Hughes (2002)
A canonical graphical syntax for non-empty finite products a nd sums -
J. Girard (1996)
PROOF-NETS : THE PARALLEL SYNTAX FOR PROOF-THEORY -
H. Devarajan, Dominic Hughes, G. Plotkin, V. Pratt (1999)
Full completeness of the multiplicative linear logic of Chu spacesProceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)
-
G. Bellin, Jussi Ketonen (1992)
A Decision Procedure Revisited: Notes on Direct Logic, Linear Logic and its ImplementationTheor. Comput. Sci., 95
-
S. Abramsky, Paul-André Melliès (1999)
Concurrent games and full completenessProceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)
-
S. Abramsky, R. Jagadeesan (1992)
Games and full completeness for multiplicative linear logicJournal of Symbolic Logic, 59
-
A Appendix: Separation Throughout this appendix θ is a proof net on a cut sequent Γ. 9 For vertices x and y of the graph G θ -
V. Danos, L. Regnier (1989)
The structure of multiplicativesArchive for Mathematical Logic, 28
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 2005 by ACM Inc.
- ISSN
- 1529-3785
- DOI
- 10.1145/1094622.1094629
- Publisher site
- See Article on Publisher Site
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.
Journal
ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery
Published: Oct 1, 2005