Proof nets sequentialisation in multiplicative linear logic
نویسندگان
چکیده
منابع مشابه
Proof nets sequentialisation in multiplicative linear logic
We provide an alternative proof of the sequentialisation theorem for proof nets of multiplicative linear logic. Namely, we show how a proof net can be transformed into a sequent calculus proof simply by properly adding to it some special edges, called sequential edges, which express the sequentiality constraints given by sequent calculus. © 2008 Elsevier B.V. All rights reserved.
متن کاملOn Proof Nets for Multiplicative Linear Logic with Units
In this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theory of unit-free multiplicative proof nets. A linking is no longer a set of axiom links but a tree in which the axiom links are subtrees. These trees will be identified according to an equivalence relation based on a simple form of graph rewriting...
متن کاملProof Nets for Multiplicative Cyclic Linear Logic and Lambek Calculus
This paper presents a simple and intuitive syntax for proof nets of the multiplicative cyclic fragment (McyLL) of linear logic (LL). The proposed correctness criterion for McyLL proof nets can be considered as the non-commutative counterpart of the famous Danos contraction criterion for proof nets of the pure multiplicative fragment (MLL) of LL. Unlike the most part of current syntaxes for non-...
متن کاملProof Nets with Explicit Negation for Multiplicative Linear Logic
Multiplicative linear logic (MLL) was introduced in Gi87] as a one-sided sequent calculus: linear negation is a notion that is deened, via De Morgan identities. One obtains proof nets for MLL by identifying derivations in the one-sided calculus that are equal up to a permutation of inference rules. In this paper we consider a similar quotient for the formulation of MLL as a two-sided sequent ca...
متن کاملCorrectness of Multiplicative Proof Nets Is Linear
We reformulate Danos contractibility criterion in terms of a sort of unification. As for term unification, a direct implementation of the unification criterion leads to a quasi-linear algorithm. Linearity is obtained after observing that the disjoint-set unionfind at the core of the unification criterion is a special case of union-find with a real linear time solution.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2008
ISSN: 0168-0072
DOI: 10.1016/j.apal.2008.04.002