Results 1  10
of
6,263
Relating Natural Deduction and Sequent Calculus for Intuitionistic NonCommutative Linear Logic
, 1999
"... We present a sequent calculus for intuitionistic noncommutative 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 cutfree derivations, and arbitrary natura ..."
Abstract

Cited by 29 (16 self)
 Add to MetaCart
We present a sequent calculus for intuitionistic noncommutative 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 cutfree derivations, and arbitrary
MFPS XV Preliminary Version Relating Natural Deduction and Sequent Calculus for Intuitionistic NonCommutative Linear Logic
"... We present a sequent calculus for intuitionistic noncommutative 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 cutfree derivations, and arbitrary natura ..."
Abstract
 Add to MetaCart
We present a sequent calculus for intuitionistic noncommutative 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 cutfree derivations, and arbitrary
Natural Deduction for Intuitionistic NonCommutative Linear Logic
 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications (TLCA'99
, 1999
"... We present a system of natural deduction and associated term calculus for intuitionistic noncommutative linear logic (INCLL) as a conservative extension of intuitionistic linear logic. We prove subject reduction and the existence of canonical forms in the implicational fragment. ..."
Abstract

Cited by 36 (16 self)
 Add to MetaCart
We present a system of natural deduction and associated term calculus for intuitionistic noncommutative linear logic (INCLL) as a conservative extension of intuitionistic linear logic. We prove subject reduction and the existence of canonical forms in the implicational fragment.
A Term Calculus for Intuitionistic Linear Logic
, 1993
"... . In this paper we consider the problem of deriving a term assignment system for Girard's Intuitionistic Linear Logic for both the sequent calculus and natural deduction proof systems. Our system differs from previous calculi (e.g. that of Abramsky [1]) and has two important properties which th ..."
Abstract

Cited by 89 (12 self)
 Add to MetaCart
. In this paper we consider the problem of deriving a term assignment system for Girard's Intuitionistic Linear Logic for both the sequent calculus and natural deduction proof systems. Our system differs from previous calculi (e.g. that of Abramsky [1]) and has two important properties which
Noncommutativity and MELL in the Calculus of Structures
 OF LECTURE NOTES IN COMPUTER SCIENCE
, 2001
"... We introduce the calculus of structures: it is more general than the sequent calculus and it allows for cut elimination and the subformula property. We show a simple extension of multiplicative linear logic, by a selfdual noncommutative operator inspired by CCS, that seems not to be expressible in ..."
Abstract

Cited by 62 (25 self)
 Add to MetaCart
We introduce the calculus of structures: it is more general than the sequent calculus and it allows for cut elimination and the subformula property. We show a simple extension of multiplicative linear logic, by a selfdual noncommutative operator inspired by CCS, that seems not to be expressible
Natural Deduction for Intuitionistic Linear Logic
, 1993
"... The paper deals with two versions of the fragment with unit, tensor, linear implication and storage operator (the exponential !) of intuitionistic linear logic. The first version, ILL, appears in a paper by Benton, Bierman, Hyland and de Paiva; the second one, ILL + , is described in this paper. I ..."
Abstract

Cited by 34 (0 self)
 Add to MetaCart
in spirit to the necessitation rule for the normalizable version of S4 discussed by Prawitz in his monograph "Natural Deduction". It is relatively easy to adapt Prawitz's treatment of natural deduction for intuitionistic logic to ILL + ; in particular one can formulate a notion of strong
Linear logic as a framework for specifying sequent calculus
 Lecture Notes in Logic 17, Logic Colloquium’99
, 2004
"... Abstract. In recent years, intuitionistic logic and type systems have been used in numerous computational systems as frameworks for the specification of natural deduction proof systems. As we shall illustrate here, linear logic can be used similarly to specify the more general setting of sequent cal ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
Abstract. In recent years, intuitionistic logic and type systems have been used in numerous computational systems as frameworks for the specification of natural deduction proof systems. As we shall illustrate here, linear logic can be used similarly to specify the more general setting of sequent
Term Assignment for Intuitionistic Linear Logic
, 1992
"... In this paper we consider the problem of deriving a term assignment system for Girard's Intuitionistic Linear Logic for both the sequent calculus and natural deduction proof systems. Our system differs from previous calculi (e.g. that of Abramsky) and has two important properties which they lac ..."
Abstract

Cited by 62 (11 self)
 Add to MetaCart
In this paper we consider the problem of deriving a term assignment system for Girard's Intuitionistic Linear Logic for both the sequent calculus and natural deduction proof systems. Our system differs from previous calculi (e.g. that of Abramsky) and has two important properties which
Results 1  10
of
6,263