English
Related papers

Related papers: Monads on Categories of Relational Structures

200 papers

Three themes of general topology: quotient spaces; absolute retracts; and inverse limits - are reapproached here in the setting of metrizable uniform spaces, with an eye to applications in geometric and algebraic topology. The results…

Geometric Topology · Mathematics 2022-11-21 Sergey A. Melikhov

We assign a relational structure to any finite algebra in a canonical way, using solution sets of equations, and we prove that this relational structure is polymorphism-homogeneous if and only if the algebra itself is…

Logic · Mathematics 2024-02-14 Endre Tóth , Tamás Waldhauser

One way of studying a relational structure is to investigate functions which are related to that structure and which leave certain aspects of the structure invariant. Examples are the automorphism group, the self-embedding monoid, the…

Logic · Mathematics 2011-05-31 Manuel Bodirsky , Michael Pinsker

We introduce a new algebraic construction, {\em monop}, that combines monoids (with respect to the product of species), and operads (monoids with respect to the substitution of species) in the same algebraic structure. By the use of…

Combinatorics · Mathematics 2017-07-04 Miguel Méndez , Rafael Sánchez

We present generalized algebraic theories corresponding to slightly modified versions of two of the type theories in our paper Type Theory with Explicit Universe Polymorphism. We first present a generalized algebraic theory for categories…

Logic in Computer Science · Computer Science 2026-03-05 Marc Bezem , Thierry Coquand , Peter Dybjer , Martín Escardó

The starting point of algebraic language theory is that regular languages of finite words are exactly those recognized by finite monoids. This finiteness condition gives rise to a topological space whose points, called profinite words,…

Logic in Computer Science · Computer Science 2026-02-10 Vincent Moreau

We define and study a notion of $\textit{commutant}$ for $\mathcal{V}$-enriched $\mathcal{J}$-algebraic theories for a system of arities $\mathcal{J}$, recovering the usual notion of commutant or centralizer of a subring as a special case…

Category Theory · Mathematics 2017-09-12 Rory B. B. Lucyshyn-Wright

Taking inspiration from the monadicity of complete atomic Boolean algebras, we prove that profinite modal algebras are monadic over Set. While analyzing the monadic functor, we recover the universal model construction - a construction…

Logic · Mathematics 2025-07-09 Matteo De Berardinis , Silvio Ghilardi

The goal of this paper is to prove coherence results with respect to relational graphs for monoidal monads and comonads, i.e. monads and comonads in a monoidal category such that the endofunctor of the monad or comonad is a monoidal functor…

Category Theory · Mathematics 2010-01-08 K. Dosen , Z. Petric

The investigation and classification of non-unique factorization phenomena has attracted some interest in recent literature. For finitely generated monoids, S.T. Chapman and P.A. Garc\'ia-S\'anchez, together with several co-authors, derived…

Number Theory · Mathematics 2011-04-05 Andreas Philipp

In this paper, we use the language of monads, comonads and Eilenberg-Moore categories to describe a categorical framework for $A_\infty$-algebras and $A_\infty$-coalgebras, as well as $A_\infty$-modules and $A_\infty$-comodules over them…

Category Theory · Mathematics 2024-05-14 Abhishek Banerjee , Anita Naolekar

We prove a topological completeness theorem for the modal logic GLP containing operators $\langle\lambda\rangle$ for $\lambda \in$ Ord intended to capture progressively stronger notions of consistency in mathematical theories. We show that,…

Logic · Mathematics 2019-05-07 Juan P. Aguilera

A categorical model of the multiplicative and exponential fragments of intuitionistic linear logic ($\mathsf{MELL}$), known as a \emph{linear category}, is a symmetric monoidal closed category with a monoidal coalgebra modality (also known…

Logic in Computer Science · Computer Science 2023-06-22 Jean-Simon Pacaud Lemay

We construct what we call a Kirby category, a monoidal category whose morphisms are smooth 4-manifolds, projecting down to another monoidal category whose morphisms are orientable 3-manifolds, the projection being induced by the boundary…

Geometric Topology · Mathematics 2013-10-01 Renaud Gauthier

Categorical Universal Logic is a theory of monad-relativised hyperdoctrines (or fibred universal algebras), which in particular encompasses categorical forms of both first-order and higher-order quantum logics as well as classical,…

Quantum Physics · Physics 2014-12-31 Yoshihiro Maruyama

We provide graded extensions of algebraic theories and Lawvere theories that correspond to graded monads. We prove that graded algebraic theories, graded Lawvere theories, and finitary graded monads are equivalent via equivalence of…

Logic in Computer Science · Computer Science 2020-03-05 Satoshi Kura

We introduce the subject of modal model theory, where one studies a mathematical structure within a class of similar structures under an extension concept that gives rise to mathematically natural notions of possibility and necessity. A…

Logic · Mathematics 2020-09-22 Joel David Hamkins , Wojciech Aleksander Wołoszyn

Let $\mathbb{E}_d$ denote the little discs operad for $1 \le d \le \infty$ and let $\mathcal{C}$ be an $\infty$-category all of whose mapping spaces are $n$-truncated. We prove that when considering $\mathbb{E}_d$-monoids in $\mathcal{C}$,…

Algebraic Topology · Mathematics 2023-04-26 Shaul Barkan

We study linear versions of Reedy categories in relation with finite dimensional algebras and abelian model structures. We prove that, for a linear Reedy category $\mathcal{C}$ over a field, the category of left $\mathcal{C}$--modules…

Representation Theory · Mathematics 2025-09-23 Georgios Dalezios , Jan Stovicek

In their work on second-order equational logic, Fiore and Hur have studied presentations of simply typed languages by generating binding constructions and equations among them. To each pair consisting of a binding signature and a set of…

Logic in Computer Science · Computer Science 2019-07-16 Benedikt Ahrens , André Hirschowitz , Ambroise Lafont , Marco Maggesi