On the greatest fixed point of a set functor

DOI10.1016/0304-3975(95)00011-KzbMath0874.18001OpenAlexW2057895129MaRDI QIDQ672316

Jiří Adámek, Václav Koubek

Publication date: 28 February 1997

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

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00011-k

zbMATH Keywords

signatureterminal coalgebrametric completionCPO-completionfinite iterationsgreatest fixed point of set functor

Mathematics Subject Classification ID

Partial orders, general (06A06) Semantics in the theory of computing (68Q55) Categories admitting limits (complete categories), functors preserving limits, completions (18A35) Categories of sets, characterizations (18B05)

Related Items

Coalgebras for Bisimulation of Weighted Automata over Semirings, Algebraic-coalgebraic specification in CoCASL, Coalgebraic modal logic: soundness, completeness and decidability of local consequence, The category-theoretic solution of recursive program schemes, Presenting functors on many-sorted varieties and applications, On final coalgebras of continuous functors, Infinite trees and completely iterative theories: A coalgebraic view, Unnamed Item, Unnamed Item, Indexed containers, Initial algebras and terminal coalgebras in many-sorted sets, A Coalgebraic View of Infinite Trees and Iteration, From Varieties of Algebras to Covarieties of Coalgebras, Realization of Coinductive Types, A compositional approach to defining logics for coalgebras, Category theory for operational semantics, Domain theory, testing and simulation for labelled Markov processes, On the final sequence of a finitary set functor, A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata, On final coalgebras of power-set functors and saturated trees, Unnamed Item, A small final coalgebra theorem, Definability, Canonical Models, Compactness for Finitary Coalgebraic Modal Logic, Towards coalgebraic behaviourism, On Iteratable Endofunctors, Structural operational semantics for continuous state stochastic transition systems, Unnamed Item, Corecursion up-to via causal transformations, Functorial Coalgebraic Logic: The Case of Many-sorted Varieties

Cites Work

• Least fixed point of a functor
• Categorical constructions of free algebras, colimits, and completions of partial algebras
• Terminal coalgebras in well-founded set theory
• A fixpoint theorem for complete categories
• Completions of Partially Ordered Sets
• The Category-Theoretic Solution of Recursive Domain Equations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item