We present a full completeness theorem for the multiplicative fragment of a variant of non-commutative linear logic known as cyclic linear logic (CyLL), rst dened by Yetter. The semantics is obtained by considering dinatural transformations on a category of topological vec-tor spaces which are equivariant under certain actions of a noncocommutative Hopf algebra, called the shue 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 can be viewed as a fully faithful representation of a free -autonomous category, canonically enriched over vector spaces. This work is a natural extension of the authors ' previous work, ...
AbstractWe introduce proof nets and sequent calculus for the multiplicative fragment of non-commutat...
AbstractWe investigate the linear logic of Chu spaces as defined by its dinaturality semantics. For ...
We extend the multiplicative fragment of linear logic with a non-commutative connective (called befo...
AbstractWe present a full completeness theorem for the multiplicative fragment of a variant of nonco...
We prove full completeness of multiplicative linear logic (MLL) without MIX under the Chu interpret...
ABSTRACT. We give a denition of categorical model for the multiplicative fragment of non-commutative...
This work presents a computational interpretation of the construction process for cyclic linear logi...
We investigate the linear logic of Chu spaces as defined by its dinaturality semantics. For those fo...
AbstractWe prove a full completeness theorem for multiplicative–additive linear logic (i.e. MALL) us...
AbstractThis work presents a computational interpretation of the construction process for cyclic lin...
Abstract It is now well-established that the so-called focalization property plays a central role in...
International audienceThe exponential modality of linear logic associates to every formula A a commu...
The exponential modality of linear logic associates a commutative comonoid!A to every formula A, thi...
We introduce a new correctness criterion for multiplicative non commutative proof nets which can be ...
AbstractIt is well-known that every proof net of a non-commutative version of MLL (Multiplicative fr...
AbstractWe introduce proof nets and sequent calculus for the multiplicative fragment of non-commutat...
AbstractWe investigate the linear logic of Chu spaces as defined by its dinaturality semantics. For ...
We extend the multiplicative fragment of linear logic with a non-commutative connective (called befo...
AbstractWe present a full completeness theorem for the multiplicative fragment of a variant of nonco...
We prove full completeness of multiplicative linear logic (MLL) without MIX under the Chu interpret...
ABSTRACT. We give a denition of categorical model for the multiplicative fragment of non-commutative...
This work presents a computational interpretation of the construction process for cyclic linear logi...
We investigate the linear logic of Chu spaces as defined by its dinaturality semantics. For those fo...
AbstractWe prove a full completeness theorem for multiplicative–additive linear logic (i.e. MALL) us...
AbstractThis work presents a computational interpretation of the construction process for cyclic lin...
Abstract It is now well-established that the so-called focalization property plays a central role in...
International audienceThe exponential modality of linear logic associates to every formula A a commu...
The exponential modality of linear logic associates a commutative comonoid!A to every formula A, thi...
We introduce a new correctness criterion for multiplicative non commutative proof nets which can be ...
AbstractIt is well-known that every proof net of a non-commutative version of MLL (Multiplicative fr...
AbstractWe introduce proof nets and sequent calculus for the multiplicative fragment of non-commutat...
AbstractWe investigate the linear logic of Chu spaces as defined by its dinaturality semantics. For ...
We extend the multiplicative fragment of linear logic with a non-commutative connective (called befo...