【24h】

Profinite Monads, Profinite Equations, and Reiterman's Theorem

机译:有限单子,有限方程和Reiterman定理

获取原文

摘要

Profinite equations are an indispensable tool for the algebraic classification of formal languages. Reiterman's theorem states that they precisely specify pseudo-varieties, 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 oo-monoids, etc.
机译:有限方程是形式语言代数分类的必不可少的工具。雷特曼定理指出,它们精确地指定了伪变数,即在有限乘积,子代数和商下封闭的有限代数的类别。本文将Reiterman定理推广到各种(D)代数(有序)代数上的monad T的有限Eilenberg-Moore代数:一类有限T代数是伪变数,前提是它可以通过有限(等式)方程表示。作为一种应用,有限代数的拟性通过有限蕴涵被证明是可表示的。其他示例包括有限阶代数,有限类别,有限oo-monoids等。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号