English
Related papers

Related papers: Monads with arities and their associated theories

200 papers

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

A fundamental result in the theory of monads is the characterisation of the category of algebras for a monad in terms of a pullback of the category of presheaves on the category of free algebras: intuitively, this expresses that every…

Category Theory · Mathematics 2024-10-18 Nathanael Arkor , Dylan McDermott

We characterize the equational theories and Lawvere theories that correspond to the categories of analytic and polynomial monads on Set, and hence also the categories of the symmetric and rigid operads in Set. We show that the category of…

Category Theory · Mathematics 2019-02-20 Stanisław Szawiel , Marek Zawadowski

We extend Bourke and Garner's idempotent adjunction between monads and pretheories to the framework of $\infty$-categories and we use this to prove many classical results about monads in the $\infty$-categorical framework. Amongst other…

Category Theory · Mathematics 2021-06-17 Simon Henry , Nicholas J. Meadows

We characterize the category of monads on $Set$ and the category of Lawvere theories that are equivalent to the category of regular equational theories.

Category Theory · Mathematics 2016-08-14 Stanisław Szawiel , Marek Zawadowski

Given a locally presentable enriched category $\mathcal{E}$ together with a small dense full subcategory $\mathcal A$ of arities, we study the relationship between monads on $\mathcal E$ and identity-on-objects functors out of $\mathcal A$,…

Category Theory · Mathematics 2020-06-03 John Bourke , Richard Garner

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

We generalize the correspondence between theories and monads with arities of arXiv:1101.3064 to $\infty$-categories. Additionally, we introduce the notion of complete theories that is unique to the $\infty$-categorical case and provide a…

Category Theory · Mathematics 2021-06-01 Roman Kositsyn

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

It is well-known that the category of Kleisli algebras for a monoidal monad carries a canonical monoidal structure. We define the notion of a commutative graded monad and present a strictly two-categorical proof that Kleisli algebras for…

Category Theory · Mathematics 2022-04-05 Rowan Poklewski-Koziell

We define a notion of grading of a monoid T in a monoidal category C, relative to a class of morphisms M (which provide a notion of M-subobject). We show that, under reasonable conditions (including that M forms a factorization system),…

Logic in Computer Science · Computer Science 2023-08-01 Flavien Breuvart , Dylan McDermott , Tarmo Uustalu

We establish a duality between monads and monadic morphisms in any $(\infty,2)$-category and characterize monadic morphisms in a wide class of examples. This duality unifies several dualities between algebraic structures and their…

Category Theory · Mathematics 2026-03-19 Hadrian Heine

We study applications of a general approach for arities and arizabilities of theories to group and monoid theories. It is proved that a theory of a group $G$ is aritizable if and only if $G$ is finite. It is shown that this criterion does…

Logic · Mathematics 2021-12-22 Inessa I. Pavlyuk , Sergey V. Sudoplatov

For finitary regular monads T on locally finitely presentable categories we characterize the finitely presentable objects in the category of T-algebras in the style known from general algebra: they are precisely the algebras presentable by…

Category Theory · Mathematics 2019-09-06 Jiří Adámek , Stefan Milius , Lurdes Sousa , Thorsten Wißmann

Lawvere's algebraic theories, or Lawvere theories, underpin a categorical approach to general algebra, and Lawvere's adjunction between semantics and algebraic structure leads to an equivalence between Lawvere theories and finitary monads…

Category Theory · Mathematics 2024-11-19 Rory B. B. Lucyshyn-Wright , Jason Parker

Finitary monads on $\mathsf{Pos}$ are characterized as the precisely the free-algebra monads of varieties of algebras. These are classes of ordered algebras specified by inequations in context. Analagously, finitary enriched monads on…

Category Theory · Mathematics 2020-12-01 Jiří Adámek , Chase Ford , Stefan Milius , Lutz Schröder

There are many category-theoretic notions of algebraic theory, including Lawvere theories, monads, PROPs and operads. The first central notion of this thesis is a common generalisation of these, which we call a proto-theory. In order to…

Category Theory · Mathematics 2017-08-04 Tom Avery

Idempotent analogues of convexity are introduced. It is proved that the category of algebras for the capacity monad in the category of compacta is isomorphic to the category of $(\max,\min)$-idempotent biconvex compacta and their biaffine…

Category Theory · Mathematics 2011-08-08 Oleh Nykyforchyn , Dušan Repovš

It is well-known that every regular language admits a unique minimal deterministic acceptor. Establishing an analogous result for non-deterministic acceptors is significantly more difficult, but nonetheless of great practical importance. To…

Formal Languages and Automata Theory · Computer Science 2023-06-16 Stefan Zetzsche , Alexandra Silva , Matteo Sammartino
‹ Prev 1 2 3 10 Next ›