AbstractWe present a full completeness theorem for the multiplicative fragment of a variant of noncommutative linear logic known as cyclic linear logic (CyLL), first defined by Yetter. The semantics is obtained by considering dinatural transformations on a category of topological vector spaces which are invariant under certain actions of a noncocommutative Hopf algebra, called the shuffle algebra. Multiplicative sequents are assigned a vector space of such dinaturals, and we show that the space has the denotations of cut-free proofs in CyLL+MIX as a basis.This work is a natural extension of the authors' previous work, “Linear Läuchli Semantics”, where a similar theorem is obtained for the commutative logic. In that paper, we consider dinatu...
The exponential modality of linear logic associates a commutative comonoid!A to every formula A, thi...
AbstractIt is now well-established that the so-called focalization property plays a central role in ...
International audienceThe exponential modality of linear logic associates a commutative comonoid !A ...
We present a full completeness theorem for the multiplicative fragment of a variant of non-commutati...
This work presents a computational interpretation of the construction process for cyclic linear logi...
AbstractIt is well-known that every proof net of a non-commutative version of MLL (Multiplicative fr...
AbstractWe prove a full completeness theorem for multiplicative–additive linear logic (i.e. MALL) us...
AbstractWe introduce proof nets and sequent calculus for the multiplicative fragment of non-commutat...
We prove full completeness of multiplicative linear logic (MLL) without MIX under the Chu interpret...
We introduce a new correctness criterion for multiplicative non commutative proof nets which can be ...
Abstract It is now well-established that the so-called focalization property plays a central role in...
AbstractThis work presents a computational interpretation of the construction process for cyclic lin...
AbstractWe study three fragments of multiplicative linear logic with circular exchange, respectively...
ABSTRACT. We give a denition of categorical model for the multiplicative fragment of non-commutative...
Permutative logic (PL) is a noncommutative variant of multiplicative linear logic (MLL) arising fro...
The exponential modality of linear logic associates a commutative comonoid!A to every formula A, thi...
AbstractIt is now well-established that the so-called focalization property plays a central role in ...
International audienceThe exponential modality of linear logic associates a commutative comonoid !A ...
We present a full completeness theorem for the multiplicative fragment of a variant of non-commutati...
This work presents a computational interpretation of the construction process for cyclic linear logi...
AbstractIt is well-known that every proof net of a non-commutative version of MLL (Multiplicative fr...
AbstractWe prove a full completeness theorem for multiplicative–additive linear logic (i.e. MALL) us...
AbstractWe introduce proof nets and sequent calculus for the multiplicative fragment of non-commutat...
We prove full completeness of multiplicative linear logic (MLL) without MIX under the Chu interpret...
We introduce a new correctness criterion for multiplicative non commutative proof nets which can be ...
Abstract It is now well-established that the so-called focalization property plays a central role in...
AbstractThis work presents a computational interpretation of the construction process for cyclic lin...
AbstractWe study three fragments of multiplicative linear logic with circular exchange, respectively...
ABSTRACT. We give a denition of categorical model for the multiplicative fragment of non-commutative...
Permutative logic (PL) is a noncommutative variant of multiplicative linear logic (MLL) arising fro...
The exponential modality of linear logic associates a commutative comonoid!A to every formula A, thi...
AbstractIt is now well-established that the so-called focalization property plays a central role in ...
International audienceThe exponential modality of linear logic associates a commutative comonoid !A ...