English
Related papers

Related papers: A Variety Theorem for Relational Universal Algebra

200 papers

Hypersubstitutions are mappings which map operation symbols to terms. Terms can be visualized by trees. Hypersubstitutions can be extended to mappings defined on sets of trees. The nodes of the trees, describing terms, are labelled by…

Rings and Algebras · Mathematics 2008-12-03 Klaus Denecke , Jorg Koppitz , Slavcho Shtrakov

The development of mathematics has been characterized by the increasing interconnectivity of seemingly separate disciplines. Such interplay has been facilitated by a massive development in formalism; category theory has provided a common…

Algebraic Geometry · Mathematics 2018-12-03 Aurel Malapani

The paper is a short supplement of the longer paper "The Algebraic Proof of the Universality Theorem", preprint math.AG/0402045. In this short note, we outline the geometric meaning of Universality theorem (conjecture by Gottsche) as a…

Algebraic Geometry · Mathematics 2007-05-23 Ai-Ko Liu

A coextensive category can be defined as a category $\mathcal{C}$ with finite products such that for each pair $X,Y$ of objects in $\mathcal{C}$, the canonical functor $\times\colon X/\mathcal{C} \times Y/\mathcal{C} \to (X \times…

Category Theory · Mathematics 2020-08-11 David Neal Broodryk

We develop a homotopical variant of the classic notion of an algebraic theory as a tool for producing deformations of homotopy theories. From this, we extract a framework for constructing and reasoning with obstruction theories and spectral…

Algebraic Topology · Mathematics 2025-08-13 William Balderrama

Type theory plays an important role in foundations of mathematics as a framework for formalizing mathematics and a base for proof assistants providing semi-automatic proof checking and construction. Derivation of each theorem in type theory…

Logic · Mathematics 2021-02-23 Farida Kachapova

Categorical universal algebra can be developed either using Lawvere theories (single-sorted finite product theories) or using monads, and the category of Lawvere theories is equivalent to the category of finitary monads on Set. We show how…

Category Theory · Mathematics 2011-04-14 Stephen Lack , Jiri Rosicky

We present the formalization of a theory of syntax with bindings that has been developed and refined over the last decade to support several large formalization efforts. Terms are defined for an arbitrary number of constructors of varying…

Logic in Computer Science · Computer Science 2017-07-04 Lorenzo Gheri , Andrei Popescu

Classes of algebraic structures that are defined by equational laws are called varieties or equational classes. A variety is finitely generated if it is defined by the laws that hold in some fixed finite algebra. We show that every…

Rings and Algebras · Mathematics 2014-04-01 Erhard Aichinger , Peter Mayr

The aim of this paper is to give new representation theorems for extended contact algebras. These representation theorems are based on equivalence relations.

Logic in Computer Science · Computer Science 2020-09-22 Philippe Balbiani , Tatyana Ivanova

Given a variety of universal algebras. A method is suggested for describing automorphisms of a category of free algebras of this variety. Applying this general method all automorphisms of such categories are found in two cases: 1) for the…

Rings and Algebras · Mathematics 2007-05-23 Boris Plotkin , Grigori Zhitomirski

We study generalized splines from the perspective of the representation theory of the category of graphs with contractions. Our main theorem proves a kind of finite generation, which in turn implies the existence of a ``universal generating…

Combinatorics · Mathematics 2026-05-26 Jacob Matherne , Eric Ramos , Julianna Tymoczko

We describe the role of algebraic extensions in the theory of commutative, unital normed algebras, with special attention to uniform algebras. We shall also compare these constructions and show how they are related to each other.

Functional Analysis · Mathematics 2007-05-23 Thomas William Dawson

We introduce string diagrams as a formal mathematical, graphical language to represent, compose, program and reason about games. The language is well established in quantum physics, quantum computing and quantum linguistic with the…

Computer Science and Game Theory · Computer Science 2016-04-21 Jules Hedges , Evguenia Shprits , Viktor Winschel , Philipp Zahn

We define an easily verifiable notion of an atomic formula having uniformly bounded arrays in a structure $M$. We prove that if $T$ is a complete $L$-theory, then $T$ is mutually algebraic if and only if there is some model $M$ of $T$ for…

Logic · Mathematics 2020-11-11 Michael C. Laskowski , Caroline A. Terry

Following ideas of Lawvere and Linton we prove that classical varieties are precisely the exact categories with a varietal generator. This means a strong generator which is abstractly finite and regularly projective. An analogous…

Category Theory · Mathematics 2024-02-23 Jiri Adamek

A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…

Rings and Algebras · Mathematics 2017-08-04 Nathan BeDell

Proof nets are a syntax for linear logic proofs which gives a coarser notion of proof equivalence with respect to syntactic equality together with an intuitive geometrical representation of proofs. In this paper we give an alternative…

Logic in Computer Science · Computer Science 2018-06-21 Matteo Acclavio

A relation algebra is measurable if the identity element is a sum of atoms, and the square x;1;x of each subidentity atom x is a sum of non-zero functional elements. These functional elements form a group Gx. We prove that a measurable…

Logic · Mathematics 2025-02-12 Hajnal Andréka , Steven Givant

We develop an algebraic language theory based on the notion of an Eilenberg--Moore algebra. In comparison to previous such frameworks the main contribution is the support for algebras with infinitely many sorts and the connection to logic…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Achim Blumensath