𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Local computation in linear logic

✍ Scribed by Ugo Solitro; Silvio Valentini


Book ID
102941880
Publisher
John Wiley and Sons
Year
1993
Tongue
English
Weight
613 KB
Volume
39
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

This work deals with the exponential fragment of Girard's linear logic ([3]) without the contraction rule, a logical system which has a natural relation with the direct logic ([10], [7]). A new sequent calculus for this logic is presented in order to remove the weakening rule and recover its behavior via a special treatment of the propositional constants, so that the process of cut‐elimination can be performed using only β€œlocal” reductions. Hence a typed calculus, which admits only local rewriting rules, can be introduced in a natural manner. Its main properties β€” normalizability and confluence β€” has been investigated; moreover this calculus has been proved to satisfy a Curry‐Howard isomorphism ([6]) with respect to the logical system in question. MSC: 03B40, 03F05.


πŸ“œ SIMILAR VOLUMES


The Complexity of Local Proof Search in
✍ 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,

Induction in linear logic
✍ Fumihiko Yamaguchi; Masakazu Nakanishi πŸ“‚ Article πŸ“… 1996 πŸ› Springer 🌐 English βš– 423 KB