𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Proof-search and Proof Nets in Mixed Linear Logic

✍ Scribed by D. Galmiche; J.M. Notin

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
254 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,

THE JUDGEMENT CALCULUS FOR INTUITIONISTI
THE JUDGEMENT CALCULUS FOR INTUITIONISTIC LINEAR LOGIC: PROOF THEORY AND SEMANTICS
✍ Silvio Valentini πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 958 KB

## Abstract In this paper we propose a new set of rules for a judgement calculus, i.e. a typed lambda calculus, based on Intuitionistic Linear Logic; these rules ease the problem of defining a suitable mathematical semantics. A proof of the canonical form theorem for this new system is given: it as