The complexity of Horn fragments of Linear Logic
Open Access
- 31 October 1994
- journal article
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 69 (2-3) , 195-241
- https://doi.org/10.1016/0168-0072(94)90085-x
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Linearizing intuitionistic implicationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Linearizing intuitionistic implicationAnnals of Pure and Applied Logic, 1993
- Computational interpretations of linear logicTheoretical Computer Science, 1993
- Decision problems for propositional linear logicAnnals of Pure and Applied Logic, 1992
- Bounded linear logic: a modular approach to polynomial-time computabilityTheoretical Computer Science, 1992
- Linear logicTheoretical Computer Science, 1987
- Intuitionistic propositional logic is polynomial-space completeTheoretical Computer Science, 1979