Final coalgebras are ideal completions of initial algebras

Journal of Logic and Computation

Volumn 12, Issue 2, 2002, Pages 217-242

  Adámek, Jiří ^a  

^a TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

Author keywords

Algebraically complete; Complete partial order; Final coalgebra; Ideal completion; Initial algebra; Locally presentable category

Indexed keywords

COMPUTATION THEORY; COMPUTER SCIENCE; NUMBER THEORY; SET THEORY; THEOREM PROVING; TREES (MATHEMATICS);

COALGEBRAS;

ALGEBRA;

EID: 0036540234     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/12.2.217     Document Type: Conference Paper

References (10)

1. Free algebras and automata realizations in the language of categories
2. Recursive data types in algebraically ω-complete categories
3. On final coalgebras and continuous functors
4. On the greatest fixed point of a set functor
5. Tree constructions of free continuous algebras
6. Terminal coalgebras in well-founded set theory
7. Lokal präsentierbare kategorien
8. On coalgebra of real numbers
9. Terminal sequences for accessible endofunctors