Solving polynomial fixed point equations

DOI10.1007/3-540-58338-6_58zbMath1496.08005OpenAlexW2125585193MaRDI QIDQ5096869

Stephen L. Bloom, Zoltán Ésik

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1994 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58338-6_58

Mathematics Subject Classification ID

Applications of universal algebra in computer science (08A70) Semantics in the theory of computing (68Q55)

Related Items

Axiomatizing the equational theory of regular tree languages ⋮ The equational logic of fixed points ⋮ Completeness of Park induction ⋮ Unnamed Item ⋮ On diagonal fixed points of increasing functions ⋮ Unnamed Item ⋮ Group axioms for iteration ⋮ The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics

Cites Work

• Fixed-point operations on ccc's. I
• Algebras of iteration theories
• Iterative algebras
• Independence of the equational axioms for iteration theories
• Unique fixed points vs. least fixed points
• Complete systems of \(\mathcal B\)-rational identities
• n-Rational Algebras II. Varieties and Logic of inequalities
• Varieties of Iteration Theories
• Initial Algebra Semantics and Continuous Algebras
• SOME EQUATIONAL LAWS OF INITIALITY IN 2CCC’S
• ITERATION ALGEBRAS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item