Decision problems for propositional linear logic

Annals of Pure and Applied Logic

Volumn 56, Issue 1-3, 1992, Pages 239-311

  Lincoln, Patrick ^a,b   Mitchell, John ^a   Scedrov, Andre ^c   Shankar, Natarajan ^b  

^a STANFORD UNIVERSITY   (United States)

^b SRI INTERNATIONAL   (United States)

^c UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38249013556     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/0168-0072(92)90075-B     Document Type: Article

References (42)

1. Linear objects: Logical processes with built-in inheritance
2. A logic for concurrency
3. Implicative formulae in the ‘proofs as computations’ analogy
4. The semantics and proof theory of linear logic
5. Connection graphs
6. Mechanizing proof theory: resource-aware logics and proof-transformations to extract implicit information
7. A linear semantics for allowed logic programs
8. Alternation
9. On the finite containment problem for Petri nets
10. The structure of multiplicatives
11. Normal process representatives
12. Linear logic
13. Towards a geometry of interaction
14. La logique linéaire, Pour La Science
15. Proofs and Types
16. Bounded linear logic: A modular approach to polynomial time computability
17. Nets as tensor theories
18. Single-threaded polymorphic lambda calculus
19. A decidable fragment of predicate calculus
20. Decidability of reachability in vector addition systems
21. The linear abstract machine
22. Interaction nets
23. The mathematics of sentence structure
24. How to program an infinite abacus
25. Decision problems for propositional linear logic
26. The reachability problem is exponential-space hard
27. From Petri nets to linear logic
28. An algorithm for the general Petri net reachability problem
29. The complexity of the word problems for commulative semigroups and polynomial ideals
30. Petri nets and large finite sets
31. Topics in modal and many-valued logic
32. Recursive unsolvability of Post's problem of ‘tag’ and other topics in the theory of Turing machines
33. Recursive unsolvability of a problem of Thue
34. A Brief guide to linear logic
35. The undecidability of entailment and relevant implication
36. Quantales and (noncommutative) linear logic