首页> 外文会议>International Conference, Latin American Theoretical Informatics >Iteration Algebras Are Not Finitely Axiomatizable Extended Abstract
【24h】

Iteration Algebras Are Not Finitely Axiomatizable Extended Abstract

机译:迭代代数不是有限的公正扩展摘要

获取原文

摘要

Algebras whose underlying set is a complete partial order and whose term-operations are continuous may be equipped with a least fixed point operation umx.t. The set of all equations involving the um-operation which hold in all continuous algebras determines the variety of iteration algebras. A simple argument is given here reducing the axiomatization of iteration algebras to that of Wilke algebras. It is shown that Wilke algebras do not have a finite axiomatization. This fact implies that iteration algebras do not have a finite axiomatization, even by "hyperidentities".
机译:底层集是完整部分顺序的代数,其术语 - 操作是连续的,可以配备最小的定点操作UMX.T.涉及在所有连续代数中保持的UM操作的所有方程集决定了迭代代数的各种。这里给出了一个简单的论点,将迭代代数的公理化降低到Wilke代数的迭代代数。结果表明,Wilke代数没有有限的公理化。这一事实暗示迭代代数甚至没有有限的公理化,即使是“Hyperidentification”。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号