English
Related papers

Related papers: Towards enriched universal algebra

200 papers

An enhanced Leibniz algebra is an algebraic struture that arises in the context of particular higher gauge theories describing self-interacting gerbes. It consists of a Leibniz algebra $(\mathbb{V},[ \cdot, \cdot ])$, a bilinear form on…

Algebraic Topology · Mathematics 2019-09-04 Thomas Strobl , Friedrich Wagemann

In this paper, we explore the interaction between two monoidal structures: a multiplicative one, for the encoding of pairing, and an additive one, for the encoding of choice. We propose a colored PROP to model computation in this framework,…

Logic in Computer Science · Computer Science 2025-05-21 Kostia Chardonnet , Marc de Visme , Benoît Valiron , Renaud Vilmart

The principle behind algebraic language theory for various kinds of structures, such as words or trees, is to use a compositional function from the structures into a finite set. To talk about compositionality, one needs some way of…

Logic in Computer Science · Computer Science 2015-02-18 Mikołaj Bojańczyk

We decribe the correspondence between normalised $\omega$-operads and certain lax monoidal structures on the category of globular sets. As with ordinary monoidal categories, one has a notion of category enriched in a lax monoidal category.…

Category Theory · Mathematics 2008-03-26 Michael Batanin , Mark Weber

In this paper, we extend diagrammatic reasoning in monoidal categories with algebraic operations and equations. We achieve this by considering monoidal categories that are enriched in the category of Eilenberg-Moore algebras for a monad.…

Logic in Computer Science · Computer Science 2024-01-30 Alejandro Villoria , Henning Basold , Alfons Laarman

We investigate the phenomenon that "every monad is a linear state monad". We do this by studying a fully-complete state-passing translation from an impure call-by-value language to a new linear type theory: the enriched call-by-value…

Programming Languages · Computer Science 2015-07-01 Rasmus Ejlers Møgelberg , Sam Staton

Universal algebra uniformly captures various algebraic structures, by expressing them as equational theories or abstract clones. The ubiquity of algebraic structures in mathematics and related fields has given rise to several variants of…

Category Theory · Mathematics 2019-03-19 Soichiro Fujii

Programs with a continuous state space or that interact with physical processes often require notions of equivalence going beyond the standard binary setting in which equivalence either holds or does not hold. In this paper we explore the…

Logic in Computer Science · Computer Science 2021-10-28 Fredrik Dahlqvist , Renato Neves

The well-known Lawvere category R of extended real positive numbers comes with a monoidal closed structure where the tensor product is the sum. But R has another such structure, given by multiplication, which is *-autonomous. Normed sets,…

Category Theory · Mathematics 2007-05-23 Marco Grandis

Regular languages -- the languages accepted by deterministic finite automata -- are known to be precisely the languages recognized by finite monoids. This characterization is the origin of algebraic language theory. In this paper, we…

Formal Languages and Automata Theory · Computer Science 2025-05-06 Fabian Lenke , Stefan Milius , Henning Urbat , Thorsten Wißmann

In this paper, we enlarge the language of MTL-algebras by a unary operation $\forall$ equationally described so as to abstract algebraic properties of the universal quantifier "for any" in its original meaning. The resulting class of…

Logic · Mathematics 2019-10-10 Jun Tao Wang

These are lecture notes on the algebraic approach to regular languages. The classical algebraic approach is for finite words; it uses semigroups instead of automata. However, the algebraic approach can be extended to structures beyond…

Formal Languages and Automata Theory · Computer Science 2020-08-27 Mikołaj Bojańczyk

Monads are of interest both in semantics and in higher dimensional algebra. It turns out that the idea behind usual notion finitary monads (whose values on all sets can be computed from their values on finite sets) extends to a more general…

Category Theory · Mathematics 2012-01-18 Charles Grellois

In this work, we explore a double categorical framework for categories of enriched graphs, categories and the newly introduced notion of cocategories. A fundamental goal is to establish an enrichment of V-categories in V-cocategories, which…

Category Theory · Mathematics 2018-09-27 Christina Vasilakopoulou

An algebraically expandable (AE) class is a class of algebraic structures axiomatizable by sentences of the form $\forall \exists! \land p = q$. For a logic $L$ algebraized by a quasivariety $\mathcal{Q}$ we show that the AE-subclasses of…

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

We introduce enriched notions of purity depending on the left class $\mathcal E$ of a factorization system on the base $\mathcal V$ of enrichment. Ordinary purity is given by the class of surjective mappings in the category of sets. Under…

Category Theory · Mathematics 2024-12-24 Jiří Rosický , Giacomo Tendas

In a previous paper, we showed that profinite $L$-algebras (where $L$ is a variety of modal algebras generated by its finite members) are monadic over $\mathbf{Set}$. This monadicity result suggests that profinite $L$-algebras could be…

Logic · Mathematics 2025-11-21 Matteo De Berardinis , Silvio Ghilardi

We introduce a framework for universal algebra in categories of relational structures given by finitary relational signatures and finitary or infinitary Horn theories, with the arity $\lambda$ of a Horn theory understood as a strict upper…

Category Theory · Mathematics 2021-07-09 Chase Ford , Stefan Milius , Lutz Schröder

First order formulas in a relational signature can be considered as operations on the relations of an underlying set, giving rise to multisorted algebras we call first order algebras. We present universal axioms so that an algebra satisfies…

Logic · Mathematics 2015-08-03 Lawrence Valby