...
首页> 外文期刊>Mathematical structures in computer science >Initial algebras and terminal coalgebras in many-sorted sets
【24h】

Initial algebras and terminal coalgebras in many-sorted sets

机译:初等代数和终极代数

获取原文
获取原文并翻译 | 示例

摘要

We prove that the iterative construction of initial algebras converges for endofunctors F of many-sorted sets whenever F has an initial algebra. In the case of one-sorted sets, the convergence takes n steps where n is either an infinite regular cardinal or is at most 3. Dually, the existence of a many-sorted terminal coalgebra implies that the iterative construction of a terminal coalgebra converges. Moreover, every endofunctor with a fixed-point pair larger than the number of sorts is proved to have a terminal coalgebra. As demonstrated by James Worell, the number of steps here need not be a cardinal even in the case of a single sort: it is w + w for the finite power-set functor. The above results do not hold for related categories, such as graphs: we present non-constructive initial algebras and terminal coalgebras.
机译:我们证明,当F具有初始代数时,初始代数的迭代构造对于许多排序集合的终结符F收敛。在单分类集合的情况下,收敛采取n阶,其中n是无限正则基数或至多3。对偶,存在多种分类的终极代数表示迭代迭代的终极定理是收敛的。此外,事实证明,每个定点对大于分类数的内终结子都具有末尾的代数。正如詹姆士·沃雷尔(James Worell)所展示的,此处的步数不必是基数,即使在单一种类的情况下:有限功率设定函子也是w + w。以上结果不适用于相关类别,例如图形:我们提供了非构造性初始代数和末尾代数。

著录项

  • 来源
    《Mathematical structures in computer science 》 |2011年第2期| p.481-509| 共29页
  • 作者

    JIRI ADAMEK; VERA TRNKOVA;

  • 作者单位

    Institut fur Theoretische Informatik, Technische Universitiit Braunschweig, Germany;

    Mathematical Institute, Charles University Prague, Prague, Czech Republic;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号