𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Experiments in linear natural deduction

✍ Scribed by Simone Martini; Andrea Masini


Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
853 KB
Volume
176
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

✦ Synopsis


We investigate several fragments of multiplicative linear logic, in a natural deduction setting and with the aim of a better understanding of the par connective. We study, first, a pre-tensorial calculus, which is strengthened then in the standard tensorial fragment. The addition of a further pre-tensorial connective yields (a natural deduction version of) Full Intuitionistic Linear Logic. A further strengthening of the rules leads to the full classical multiplicative logic. Some prooftheoretical properties of the systems are investigated.


πŸ“œ SIMILAR VOLUMES


A systematic deduction of linear natural
✍ Rafael PicΓ³n πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 808 KB

Natural Approach equations of a finite element are the discrete counterpart of the continuous field elastic equations (equilibrium, compatibility and constitutive), and their use has clear advantages, in different contexts, over classical stiffness procedures. This paper presents a systematic, algor

Full Lambek Calculus in natural deductio
✍ Ernst Zimmermann πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 50 KB

## Abstract A formulation of Full Lambek Calculus in the framework of natural deduction is given (Β© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

Consistency of Heyting arithmetic in nat
✍ Annika Kanckos πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 153 KB πŸ‘ 1 views

## Abstract A proof of the consistency of Heyting arithmetic formulated in natural deduction is given. The proof is a reduction procedure for derivations of falsity and a vector assignment, such that each reduction reduces the vector. By an interpretation of the expressions of the vectors as ordina

Relating Natural Deduction and Sequent C
✍ Jeff Polakow; Frank Pfenning πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 851 KB

We present a sequent calculus for intuitionistic non-commutative linear logic (INCLL), show that it satisfies cut elimination, and investigate its relationship to a natural deduction system for the logic. We show how normal natural deductions correspond to cut-free derivations, and arbitrary natural