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
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

11/23/2017

Functorial Semantics for Relational Theories

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

Algebraic models of simple type theories: a polynomial approach

We develop algebraic models of simple type theories, laying out a framew...
06/05/2020

Leveraging the Information Contained in Theory Presentations

A theorem prover without an extensive library is much less useful to its...
09/23/2020

Behavioral Specification Theories: an Algebraic Taxonomy

We develop a taxonomy of different behavioral specification theories and...
04/17/2019

Sesqui-Pushout Rewriting: Concurrency, Associativity and Rule Algebra Framework

Sesqui-pushout (SqPO) rewriting provides a variant of transformations of...
05/06/2021

Concurrency Theorems for Non-linear Rewriting Theories

Sesqui-pushout (SqPO) rewriting along non-linear rules and for monic mat...
12/18/2015

Quadripolar Relational Model: a framework for the description of borderline and narcissistic personality disorders

Borderline personality disorder and narcissistic personality disorder ar...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.