Results 1 
3 of
3
From proof nets to the free * autonomous category
 Logical Methods in Computer Science, 2(4:3):1–44, 2006. Available from: http://arxiv.org/abs/cs/0605054. [McK05] Richard McKinley. Classical categories and deep inference. In Structures and Deduction 2005 (Satellite Workshop of ICALP’05
, 2005
"... Vol. 2 (4:3) 2006, pp. 1–44 www.lmcsonline.org ..."
The Shuffle Hopf Algebra and Noncommutative Full Completeness
, 1999
"... We present a full completeness theorem for the multiplicative fragment of a variant of noncommutative linear logic, Yetter's cyclic linear logic (CyLL). The semantics is obtained by interpreting proofs as dinatural transformations on a category of topological vector spaces, these transformati ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
We present a full completeness theorem for the multiplicative fragment of a variant of noncommutative linear logic, Yetter's cyclic linear logic (CyLL). The semantics is obtained by interpreting proofs as dinatural transformations on a category of topological vector spaces, these transformations being equivariant 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 this space has as a basis the denotations of cutfree proofs in CyLL+MIX. This can be viewed as a fully faithful representation of a free *autonomous category, canonically enriched over vector spaces. This paper