Bialgebras in Rel

Authors:
Masahito Hasegawa
Affiliations:
Research Institute for Mathematical Sciences, Kyoto University, Kyoto, Japan
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2010

Citing 11
Cited 0

Linear logic

Theoretical Computer Science
Nonsymmetric *-autonomous categories

Theoretical Computer Science
Two applications of analytic functors

Theoretical Computer Science - Special issue on theories of types and proofs
Models of Sharing Graphs: A Categorical Semantics of Let and Letrec

Models of Sharing Graphs: A Categorical Semantics of Let and Letrec
Uncertain Programming

Uncertain Programming
Glueing and orthogonality for models of linear logic

Theoretical Computer Science - Category theory and computer science
Geometry of Interaction and linear combinatory algebras

Mathematical Structures in Computer Science
A Categorical Semantics of Quantum Protocols

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
On traced monoidal closed categories

Mathematical Structures in Computer Science
Asynchronous Games 3 An Innocent Model of Linear Logic

Electronic Notes in Theoretical Computer Science (ENTCS)
Quantum Groups

Quantum Groups

Quantified Score

Hi-index	0.01

Visualization

Abstract

We study bialgebras in the compact closed category Rel of sets and binary relations. We show that various monoidal categories with extra structure arise as the categories of (co)modules of bialgebras in Rel. In particular, for any group G we derive a ribbon category of crossed G-sets as the category of modules of a Hopf algebra in Rel which is obtained by the quantum double construction. This category of crossed G-sets serves as a model of the braided variant of propositional linear logic.