A Variety Theorem for Relational Universal Algebra
Category Theory
2021-11-09 v2 Logic in Computer Science
Abstract
We develop an analogue of universal algebra in which generating symbols are interpreted as relations. We prove a variety theorem for these relational algebraic theories, in which we find that their categories of models are precisely the definable categories. The syntax of our relational algebraic theories is string-diagrammatic, and can be seen as an extension of the usual term syntax for algebraic theories.
Cite
@article{arxiv.2105.04958,
title = {A Variety Theorem for Relational Universal Algebra},
author = {Chad Nester},
journal= {arXiv preprint arXiv:2105.04958},
year = {2021}
}
Comments
16 pages including bibliography. Appeared at RAMICS 2021