A Variety Theorem for Relational Universal Algebra

05/11/2021
by   Chad Nester, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/23/2017

Functorial Semantics for Relational Theories

We introduce the concept of Frobenius theory as a generalisation of Lawv...
research
06/30/2020

Algebraic models of simple type theories: a polynomial approach

We develop algebraic models of simple type theories, laying out a framew...
research
01/27/2023

The Produoidal Algebra of Process Decomposition

We introduce the normal produoidal category of monoidal contexts over an...
research
09/23/2020

Behavioral Specification Theories: an Algebraic Taxonomy

We develop a taxonomy of different behavioral specification theories and...
research
05/06/2021

Concurrency Theorems for Non-linear Rewriting Theories

Sesqui-pushout (SqPO) rewriting along non-linear rules and for monic mat...
research
10/18/2019

Universal Composability is Secure Compilation

Universal composability is a framework for the specification and analysi...
research
06/05/2020

Leveraging the Information Contained in Theory Presentations

A theorem prover without an extensive library is much less useful to its...

Please sign up or login with your details

Forgot password? Click here to reset