Profinite Monads, Profinite Equations, and Reiterman's Theorem
Formal Languages and Automata Theory
2016-01-07 v2 Category Theory
Abstract
Profinite equations are an indispensable tool for the algebraic classification of formal languages. Reiterman's theorem states that they precisely specify pseudovarieties, i.e. classes of finite algebras closed under finite products, subalgebras and quotients. In this paper Reiterman's theorem is generalised to finite Eilenberg-Moore algebras for a monad T on a variety D of (ordered) algebras: a class of finite T-algebras is a pseudovariety iff it is presentable by profinite (in-)equations. As an application, quasivarieties of finite algebras are shown to be presentable by profinite implications. Other examples include finite ordered algebras, finite categories, finite infinity-monoids, etc.
Cite
@article{arxiv.1511.02147,
title = {Profinite Monads, Profinite Equations, and Reiterman's Theorem},
author = {Liang-Ting Chen and Jiri Adamek and Stefan Milius and Henning Urbat},
journal= {arXiv preprint arXiv:1511.02147},
year = {2016}
}
Comments
Accepted for presentation at FoSSaCS'16