Bases for parametrized iterativity

DOI10.1016/J.IC.2008.05.002MaRDI QIDQ1004388zbMATH OpenOpenAlexFDO

Authors Jiří Adámek, Stefan Milius, Jiří Velebil

Publication date 4 March 2009

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2008.05.002

zbMATH Keywords

iterative algebraiterative theorylocally presentable categorymonadparametrized signature

Mathematics Subject Classification ID

Categories of machines, automata (18B20) Theories (e.g., algebraic theories), structure, and semantics (18C10) Algebraic theory of languages and automata (68Q70)

Review text

Parametrized iterativity of an algebra means the existence of unique solutions of all finitary recursive systems of equations where the recursion is allowed to use only some variables (chosen as a parameter). A generalized definition of iterative recursive system of equations for a general category of algebras is presented. An algebra is iterative if every such system has a unique solution. A functor is called finitary if it preserves all colimits of updirected diagrams. A base for a locally presentable category \(\mathcal A\) is a functor from \(\mathcal A\) into the category of all monadic algebras over finitary functors. It is proved that for every base there exists a free iterative algebra over a finitely presentable object and it can be constructed by colimit construction.

Recommendations

• scientific article; zbMATH DE number 6740664
• Base modules for parametrized iterativity
• Algebras with parametrized iterativity
• Iterative algebras for a base
• Recursive structures in involutive bases theory
• The cardinality of parametric bases in chain logics
• Base-cover paracompactness
• scientific article; zbMATH DE number 883961
• Iterated altans and their properties
• Iterability for (transfinite) stacks

Cites work

• A Perspective View of Discrete Automata and Their Design
• A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on
• Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads
• Algebras with parametrized iterativity
• Coequalizers and free triples
• Fundamental properties of infinite trees
• Generalizing Substitution
• scientific article; zbMATH DE number 3458870 (Why is no real title available?)
• scientific article; zbMATH DE number 1216133 (Why is no real title available?)
• scientific article; zbMATH DE number 575948 (Why is no real title available?)
• Iterative algebras
• Iterative algebras at work
• Iterative algebras for a base
• Regular trees and the free iterative theory
• Terminal coalgebras and free iterative theories
• Unique fixed points vs. least fixed points

Cited in

(6)

• Complete Elgot monads and coalgebraic resumptions
• Base modules for parametrized iterativity
• Algebras with parametrized iterativity
• Iterative algebras for a base
• Iterability for (transfinite) stacks
• scientific article; zbMATH DE number 6740664 (Why is no real title available?)

This page was built for publication: Bases for parametrized iterativity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1004388)