Fixed points of set functors: how many iterations are needed?

DOI10.1007/S10485-016-9451-1zbMath1375.18013OpenAlexW2511252833MaRDI QIDQ328655

T. Palm, Jiří Adámek, Václav Koubek

Publication date: 20 October 2016

Published in: Applied Categorical Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10485-016-9451-1

zbMATH Keywords

terminal coalgebrafilter functorset functorsterminal chain

Mathematics Subject Classification ID

Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30) Ordinal and cardinal numbers (03E10)

Related Items (1)

Fixed Points of Functors - A Short Abstract

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relatively terminal coalgebras
• On the final sequence of a finitary set functor
• On tree coalgebras and coalgebra presentations
• Terminal coalgebras in well-founded set theory
• On final coalgebras of power-set functors and saturated trees
• Coequalizers and free triples
• Initial algebras and terminal coalgebras in many-sorted sets

This page was built for publication: Fixed points of set functors: how many iterations are needed?