Profinite monads, profinite equations, and Reiterman's theorem

Algebraic theory of languages and automata (68Q70) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Products, amalgamated products, and other kinds of limits and colimits (08B25)

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.

Recommendations

Cites work

Cited in

(13)

This page was built for publication: Profinite monads, profinite equations, and Reiterman's theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811362)