Back to Search Start Over

Finitary monads on the category of posets

Authors :
Chase Ford
Stefan Milius
Jiří Adámek
Lutz Schröder
Source :
Mathematical Structures in Computer Science. 31:799-821
Publication Year :
2021
Publisher :
Cambridge University Press (CUP), 2021.

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.

Subjects

Subjects :
Pure mathematics
Mathematics - Category Theory
Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)
Context (language use)
Computer Science Applications
Mathematics::Logic
TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES
Mathematics (miscellaneous)
Monotone polygon
TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS
Computer Science::Logic in Computer Science
Mathematics::Category Theory
ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION
FOS: Mathematics
Finitary
Category Theory (math.CT)
Mathematics

Details

ISSN :
14698072 and 09601295
Volume :
31
Database :
OpenAIRE
Journal :
Mathematical Structures in Computer Science
Accession number :
edsair.doi.dedup.....fc81a4e68d755c10b30a4d61d5df43fc

Tools

Authors Abstract Subjects Details