ITERATION ALGEBRAS

Author:

BLOOM STEPHEN L.1,ÉSIK ZOLTÁN2

Affiliation:

1. Stevens Institute of Technology, Department of Computer Science, Hoboken, NJ 07030, USA

2. A. József University, Bolyai Institute, Szeged, Hungary

Abstract

We assume the reader has some familiarity with theories and iteration theories. The main topic of the paper is properties of varieties of iteration algebras. After a preliminary section which contains all of the necessary definitions, we spend some time on a coproduct construction which is needed to prove a fundamental lemma: for each iteration theory T, any T-algebra is a retract of a T-iteration algebra. The proof of the lemma shows that only one property of iteration theories is used: the parameter identity. Hence, the lemma applies to any preiteration theory in which this identity is valid. It follows from this fact that the variety of all T-iteration algebras has “nice” properties only when every T-algebra is an iteration algebra. Some of the possible pathology in varieties of iteration algebras is demonstrated. It is shown that for each set Z of non-negative integers there is a variety of iteration algebras having an n-generated free algebra iff n∈Z. Also given is a theorem characterizing certain functors between varieties of iteration theories which are induced by iteration theory morphisms. We find an explicit description of all of the theory congruences on theories of partial functions. The last section is connected with the strong iteration algebras introduced in a paper by Ésik (1983).

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Cited by 10 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Non-associative Kleene Algebra and Temporal Logics;Relational and Algebraic Methods in Computer Science;2017

2. Is observational congruence on μ-expressions axiomatisable in equational Horn logic?;Information and Computation;2010-06

3. Axiomatizing the equational theory of regular tree languages;The Journal of Logic and Algebraic Programming;2010-02

4. Greibach Normal Form in Algebraically Complete Semirings;Computer Science Logic;2002

5. On the Equational Definition of the Least Prefixed Point;Mathematical Foundations of Computer Science 2001;2001

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3