𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Forward and Backward Chaining in Linear Logic (Extended Abstract)

✍ Scribed by James A. Harland; David J. Pym; Michael Winikoff

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
158 KB
Volume
37
Category
Article
ISSN
1571-0661

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Complexity of Local Proof Search in
The Complexity of Local Proof Search in Linear Logic: (Extended Abstract)
✍ Patrick D. Lincoln; John C. Mitchell; Andre Scedrov πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 473 KB

Proof search in linear logic is known to be di cult: the provability of propositional linear logic formulas is undecidable. Even without the modalities, multiplicativeadditive fragment of propositional linear logic, mall, i s k n o wn to be pspace-complete, and the pure multiplicative fragment, mll,