Taming Multirelations
Logic in Computer Science
2015-06-16 v2
Abstract
Binary multirelations generalise binary relations by associating elements of a set to its subsets. We study the structure and algebra of multirelations under the operations of union, intersection, sequential and parallel composition, as well as finite and infinite iteration. Starting from a set-theoretic investigation, we propose axiom systems for multirelations in contexts ranging from bi-monoids to bi-quantales.
Cite
@article{arxiv.1501.05147,
title = {Taming Multirelations},
author = {Hitoshi Furusawa and Georg Struth},
journal= {arXiv preprint arXiv:1501.05147},
year = {2015}
}
Comments
34 pages, 4 figures