Abstract

this paper we will restrict attention to propositional linear logic. The sequent calculus notation, due to Gentzen [10], uses roman letters for propositions, and greek letters for sequences of formulas. A sequent is composed of two sequences of formulas separated by a `, or turnstile symbol. One may read the sequent \Delta ` \Gamma as asserting that the multiplicative conjunction of the formulas in \Delta together imply the multiplicative disjunction of the formulas in \Gamma. A sequent calculus proof rule consists of a set of hypothesis sequents, displayed above a horizontal line, and a single conclusion sequent, displayed below the line, as below: Hypothesis1 Hypothesis2 Conclusion 4 Connections to Other Logics

Citations

406	The mathematics of sentence structure - Lambek - 1958
290	Logic programming with focusing proofs in linear logic - Andreoli - 1992
283	Logic Programming in a Fragment of Intuitionistic Linear Logic - Hodas, Miller - 1994
201	Linear objects: Logical processes with built-in inheritance - Andreoli, Pareschi - 1991
149	Interaction Nets - Lafont - 1990
108	The Complexity of the Word Problem for Commutative Semigroups - Mayr, Meyer - 1982
89	The linear abstract machine - Lafont - 1988
85	Decision problems for propositional linear logic - Lincoln, Mitchell, et al. - 1992
85	Is there a use for linear logic - Wadler - 1991
81	Quantales, observational logic, and process semantics - Abramsky, Vickers - 1993
79	Recursive unsolvability of Post’s problem of “Tag” and other topics in theory of Turing machines - Minsky - 1961
72	Decidability of reachability in vector addition systems - Kosaraju - 1982
71	Single-threaded polymorphic lambda calculus - Guzman, Hudak - 1990
63	Petri nets to linear logic - Mart-Oliet, Meseguer - 1989
60	Bounded linear logic: a modular approach to polynomial-time computability - Girard, Scedrov, et al. - 1992
53	A brief guide to linear logic - Scedrov - 1993
44	LiLac: a functional programming language based on Linear Logic - Mackie - 1993
43	Operational aspects of linear lambda calculus - Lincoln, Mitchell - 1992
31	Computational interpretations of linear logic, Theoretical Computer Science 111 - Abramsky - 1993
30	Normal process representatives - Gehlot, Gunter - 1990
30	Constant-Only Multiplicative Linear Logic is NP-Complete - Lincoln, Winkler - 1994
28	A Decidable Fragment of Predicate Calculus - Ketonen, Weyhrauch - 1984
24	There's no substitute for Linear Logic - Wadler - 1991
23	Nets as tensor theories - Gunter, Gehlot - 1989
22	programming in linear logic is NP-complete - Horn - 2002
21	Event Spaces and their Linear Logic - Pratt - 1991
20	A logic for concurrency - Asperti - 1987
20	The multiplicative fragment of linear logic is NP-complete - Kanovich - 1991
17	Linear logic and interference control - O’Hearn - 1991
17	Linearity and laziness - Wakeling, Runciman - 1991
16	The undecidability of entailment and relevant implication - Urquhart - 1984
15	A linear semantics for allowed logic programs - Cerrito - 1990
15	The linear abstract machine. Theoretical Computer Science, 59(1– 2):157–180 - Lafont - 1988
13	Implicative formulae in the “proofs as computations” analogy - Asperti, Ferrari, et al. - 1990
12	From categorial grammar to bilinear logic - Lambek - 1993
7	Collected Works. Edited by M.E - Gentzen - 1969
7	Intersection logic - S, Roversi - 2001
6	Linear ML - Chirimar, Gunter, et al. - 1992
5	Topics in Modal and Many-valued Logic - Meyer - 1966
3	La logique lin'eaire. Pour La Science, ' Edition Francaise de Scientific American - Girard - 1990
2	Language in Action - VanBentham - 1991
1	Is there a use for linear logic? To Appear ACM/IFIP PEPM - North-Holland - 1991