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

DOI10.1007/S10485-016-9451-1zbMATH Open1375.18013OpenAlexW2511252833MaRDI QIDQ328655FDOQ328655

Authors: 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

Recommendations

• Initial algebras and terminal coalgebras in many-sorted sets
• On the final sequence of a finitary set functor
• Relatively terminal coalgebras
• On the greatest fixed point of a set functor
• scientific article; zbMATH DE number 7379294

zbMATH Keywords

filter functorset functorsterminal chainterminal coalgebra

Mathematics Subject Classification ID

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

Cites Work

• On tree coalgebras and coalgebra presentations
• Coequalizers and free triples
• Title not available (Why is that?)
• On the final sequence of a finitary set functor
• Terminal coalgebras in well-founded set theory
• On final coalgebras of power-set functors and saturated trees
• Initial algebras and terminal coalgebras in many-sorted sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Relatively terminal coalgebras
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Initial algebras and terminal coalgebras in many-sorted sets
• Fixed Points of Functors - A Short Abstract

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

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