首页> 外文会议>Latin American symposium on 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代数的公理化。结果表明,威尔克代数没有有限公理化。这一事实意味着,即使通过“超恒等性”,迭代代数也不具有有限的公理化。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号