Relating natural deduction and sequent calculus for intuitionistic non-commutative linear logic

Abstract

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 deductions to sequent derivations with cut. This gives us a syntactic proof of normalization for a rich system of non-commutative natural deduction and its associated λ-calculus. INCLL conservatively extends linear logic with means to express sequencing, which has applications in functional programming, logical frameworks, logic programming, and natural language parsing. ©1999 Published by Elsevier Science B. V.