Presenting Finite Posets
Logic in Computer Science
2015-05-28 v1
Abstract
We introduce a monoidal category whose morphisms are finite partial orders, with chosen minimal and maximal elements as source and target respectively. After recalling the notion of presentation of a monoidal category by the means of generators and relations, we construct a presentation of our category, which corresponds to a variant of the notion of bialgebra.
Keywords
Cite
@article{arxiv.1505.07161,
title = {Presenting Finite Posets},
author = {Samuel Mimram},
journal= {arXiv preprint arXiv:1505.07161},
year = {2015}
}
Comments
In Proceedings TERMGRAPH 2014, arXiv:1505.06818