A Mezei-Wright theorem for categorical algebras

DOI10.1016/j.tcs.2009.06.040zbMath1186.68244OpenAlexW1980091988MaRDI QIDQ1044831

Zoltán Ésik, Stephen L. Bloom

Publication date: 15 December 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.06.040

zbMATH Keywords

fixed point equations

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Structure theory of algebraic structures (08A05) Theories (e.g., algebraic theories), structure, and semantics (18C10)

Related Items

A note on ordinal DFAs ⋮ ALGEBRAIC LINEAR ORDERINGS ⋮ The ordinal generated by an ordinal grammar is computable

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recursion and iteration in continuous theories: the M-construction
• The category-theoretic solution of recursive program schemes
• Fundamental properties of infinite trees
• Algebraic semantics
• IO and OI. II
• Fixed-point constructions in order-enriched categories
• Equational elements in additive algebras
• Some remarks on finitary and iterative monads
• The equational theory of regular words
• Equational logic of circular data type specification
• Inductive \(^{*}\)-semirings
• Matrix and matricial iteration theories. I
• Final Coalgebras And a Solution Theorem for Arbitrary Endofunctors
• Regular and Algebraic Words and Ordinals
• Initial Algebra Semantics and Continuous Algebras
• Continuous Additive Algebras and Injective Simulations of Synchronization Trees
• Elgot Algebras
• Algebraic automata and context-free sets