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.
CITATION STYLE
Kanovich, M. I. (1994). Petri nets, horn programs, linear logic, and vector games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 789 LNCS, pp. 642–666). Springer Verlag. https://doi.org/10.1007/3-540-57887-0_119
Mendeley helps you to discover research relevant for your work.