| J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambrige Tracts in Theoretical Computer Science, Cambridge University Press, 1989. |
....two modal operators, and . These three steps are described in more detail in the following paragraphs. The resulting logic is surprisingly natural, from both proof theoretic and computational standpoints. In particular, Gentzen style cut elimination, a crucial proof theoretic property (see [Gen69, GLT89], for example) has been established for linear logic in [Gir87a] This yields consistency and provides a natural computational mechanism that resembles reduction in lambda calculus (e.g. HS86, GLT89] The derivation of linear logic begins by dropping the structural rules contraction and ....
.... In particular, Gentzen style cut elimination, a crucial proof theoretic property (see [Gen69, GLT89] for example) has been established for linear logic in [Gir87a] This yields consistency and provides a natural computational mechanism that resembles reduction in lambda calculus (e.g. [HS86, GLT89]) The derivation of linear logic begins by dropping the structural rules contraction and weakening, which are an essential part of classical and intuitionistic logic. Each rule may be applied to either the left or right side of a sequent. On the left, contraction allows repeated assumptions of ....
J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambrige Tracts in Theoretical Computer Science, Cambridge University Press, 1989.
....We also establish membership in np for the multiplicative fragment, np completeness for the multiplicative fragment extended with unrestricted weakening, and undecidability for certain fragments of noncommutative propositional linear logic. 1 Introduction Linear logic, introduced by Girard [14, 18, 17], is a refinement of classical logic which may be derived from a Gentzen style sequent calculus axiomatization of classical logic in three steps. The resulting sequent system Lincoln CS.Stanford.EDU Department of Computer Science, Stanford University, Stanford, CA 94305, and the Computer ....
....reuse or consumption is only allowed locally , at formulas specifically marked with or (respectively) The resulting logic is natural from both proof theoretic and computational standpoints. In particular, Gentzenstyle cut elimination, a central property in the prooftheoretic tradition (see [13, 18], for example) has been established for linear logic [14] Cut elimination establishes consistency and provides a natural computational mechanism that resembles reduction in lambda calculus (e.g. 22, 18] An early application of the resource sensitive aspect of the logic was the implementation ....
[Article contains additional citation context not shown here]
J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambrige Tracts in Theoretical Computer Science, Cambridge University Press, 1989.
No context found.
J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambrige Tracts in Theoretical Computer Science, Cambridge University Press, 1989.
No context found.
J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambrige Tracts in Theoretical Computer Science, Cambridge University Press, 1989.
No context found.
J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambrige Tracts in Theoretical Computer Science, Cambridge University Press, 1989.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC