๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Intuitionistic Proof Transformations: Complexity and Applications: Extended Abstract

โœ Scribed by Uwe Egly; Stephan Schmitt

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
714 KB
Volume
17
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,