Algebras whose underlying set is a complete partial order and whose term-operations are continuous may be equipped with a least fixed point operation μx.t. The set of all equations involving the μ-operation which hold in all continuous algebras determines the variety of iteration algebras. A simple argument is given here reducing the ax-iomatization 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". © Springer-Verlag Berlin Heidelberg 2000.
CITATION STYLE
Bloom, S. L., & Ésik, Z. (2000). Iteration algebras are not finitely axiomatizable. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1776 LNCS, pp. 367–376). https://doi.org/10.1007/10719839_36
Mendeley helps you to discover research relevant for your work.