Petri nets, Horn programs, Linear Logic and vector games
Author:
- Max I. KanovichMKMax I. Kanovich
- 1 September 1995
- journal article
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 75 (1-2) , 107-135
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- The complexity of Horn fragments of Linear LogicAnnals of Pure and Applied Logic, 1994
- Linear logic as a logic of computationsAnnals of Pure and Applied Logic, 1994
- Computational interpretations of linear logicTheoretical Computer Science, 1993
- On the unity of logicAnnals of Pure and Applied Logic, 1993
- A game semantics for linear logicAnnals of Pure and Applied Logic, 1992
- Bounded linear logic: a modular approach to polynomial-time computabilityTheoretical Computer Science, 1992
- A new constructive logic: classic logicMathematical Structures in Computer Science, 1991
- Geometry of interaction 2: Deadlock-free algorithms1990
- Linear logicTheoretical Computer Science, 1987
- Parallel program schemataJournal of Computer and System Sciences, 1969