Petri Nets, Horn Programs, Linear Logic, and Vector Games

Linear Logic was introduced by Girard as a resource-sensitive refinement of classical logic. Linear Logic is of considerable interest for Computer Science. In this paper we focus on the correlations between natural fragments of Linear Logic and a number of basic concepts related to different branches of Computer Science such as Concurrency Theory, Theory of Computations, Horn Programming, and Game Theory. In particular, such a complete correspondence allows us to introduce several new semantics for Linear Logic and to clarify many results on the complexity of natural fragments of Linear Logic.

[1]  Roberto Gorrieri,et al.  Implicative formulae in the proofs of computations' analogy , 1989, POPL '90.

[2]  Max I. Kanovich.  Horn programming in linear logic is NP-complete , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[3]  Carl A. Gunter,et al.  Nets as Tensor Theories , 1989 .

[4]  M. Nivat.  Fiftieth volume of theoretical computer science , 1988 .

[5]  Thomas Streicher,et al.  Games semantics for linear logic , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  Johan van Benthem,et al.  Language in action , 1991, J. Philos. Log..

[8]  A. Meyer,et al.  The complexity of the word problems for commutative semigroups and polynomial ideals , 1982 .

[9]  Vaughan R. Pratt,et al.  Event Spaces and their Linear Logic , 1991, AMAST.

[10]  Andreas Blass,et al.  A Game Semantics for Linear Logic , 1992, Ann. Pure Appl. Log..

[11]  M. Minsky.  Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines , 1961 .

[12]  Radha Jagadeesan,et al.  Games and full completeness for multiplicative linear logic , 1992, Journal of Symbolic Logic.

[13]  José Meseguer,et al.  From Petri Nets to Linear Logic , 1989, Category Theory and Computer Science.

[14]  Jean-Yves Girard,et al.  Linear Logic , 1987, Theor. Comput. Sci..

[15]  Max I. Kanovich,et al.  The Complexity of Horn Fragments of Linear Logic , 1994, Ann. Pure Appl. Log..

[16]  Ugo Montanari,et al.  Axiomatizing net computations and processes , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[17]  Natarajan Shankar,et al.  Linearizing intuitionistic implication , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[18]  Andre Scedrov,et al.  Bounded Linear Logic: A Modular Approach to Polynomial-Time Computability , 1992, Theor. Comput. Sci..

[19]  Radha Jagadeesan,et al.  Games and Full Completeness for Multiplicative Linear Logic , 1994, J. Symb. Log..

[20]  Carl A. Gunter,et al.  Normal process representatives , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[21]  Natarajan Shankar,et al.  Decision problems for propositional linear logic , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[22]  Ernst W. Mayr.  An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..

[23]  Max I. Kanovich,et al.  Efficient Program Synthesis: Semantics, Logic, Complexity , 1991, Theoretical Aspects of Computer Software.