Decision problems for propositional linear logic

Authors:
P. Lincoln;J. Michell;A. Scedrov;N. Shankar
Affiliations:
Dept. of Comput. Sci., Stanford Univ., CA, USA;Dept. of Comput. Sci., Stanford Univ., CA, USA;-;-
Venue:
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Year:
1990

Citing 0
Cited 4

Effective finite-valued approximations of general propositional logics

Pillars of computer science
On model checking boolean BI

CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Linear logic

Communications of the ACM
On the Complexity of Linear Authorization Logics

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.02

Visualization

Abstract

It is shown that, unlike most other propositional (quantifier-free) logics, full propositional linear logic is undecidable. Further, it is provided that without the model storage operator, which indicates unboundedness of resources, the decision problem becomes PSPACE-complete. Also established are membership in NP for the multiplicative fragment, NP-completeness for the multiplicative fragment extended with unrestricted weakening, and undecidability for certain fragments of noncommutative propositional linear logic.