Discrete Lawvere theories and monads
Author:
Open Access
- 21 January 2026
- journal article
- research article
- Published by Cambridge University Press (CUP) in Mathematical Structures in Computer Science
- Vol. 36, e1
Abstract
We show that, under certain assumptions, strongly finitary enriched monads are given by discrete enriched Lawvere theories. On the other hand, monads given by discrete enriched Lawvere theories preserve surjections.Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Discrete equational theoriesMathematical Structures in Computer Science, 2024
- A categorical view of varieties of ordered algebrasMathematical Structures in Computer Science, 2022
- Metric monadsMathematical Structures in Computer Science, 2021
- Monads and theoriesAdvances in Mathematics, 2019
- Discrete Lawvere TheoriesLecture Notes in Computer Science, 2005
- Locally Presentable and Accessible Categories1994
- Finite-product-preserving functors, Kan extensions, and strongly-finitary 2-monadsApplied Categorical Structures, 1993
- Universal algebra in a closed categoryJournal of Pure and Applied Algebra, 1980
- Varieties of ordered algebrasJournal of Computer and System Sciences, 1976
- Some Aspects of Equational Categories1966