Finitary monads on the category of posets

Ford M, Adámek J, Milius S, Schröder L (2021)

Publication Language: English

Publication Type: Journal article, Original article

Publication year: 2021

Journal

Mathematical Structures in Computer Science Cambridge University Press (CUP)

Pages Range: 1--23

URI: https://www.cambridge.org/core/journals/mathematical-structures-in-computer-science/article/finitary-monads-on-the-category-of-posets/C4F502C0D4264D68484EE6CCB5E3590F

DOI: 10.1017/S0960129521000360

Abstract

Finitary monads on Pos are characterized as precisely the free-algebra monads of varieties of algebras. These are classes of ordered algebras specified by inequations in context. Analogously, finitary enriched monads on Pos are characterized: here we work with varieties of coherent algebras which means that their operations are monotone.

Authors with CRIS profile

Matthew Ford Lehrstuhl für Informatik 8 (Theoretische Informatik) Stefan Milius Lehrstuhl für Informatik 8 (Theoretische Informatik) Lutz Schröder Lehrstuhl für Informatik 8 (Theoretische Informatik)

Related research project(s)

Cyberkriminalität und forensische Informatik (Cybercrime) Oct. 1, 2019 - March 31, 2024

Involved external institutions

Technische Universität Braunschweig DE Germany (DE)

How to cite

APA:

Ford, M., Adámek, J., Milius, S., & Schröder, L. (2021). Finitary monads on the category of posets. Mathematical Structures in Computer Science, 1--23. https://dx.doi.org/10.1017/S0960129521000360

MLA:

Ford, Matthew, et al. "Finitary monads on the category of posets." Mathematical Structures in Computer Science (2021): 1--23.

BibTeX: Download