Fixed points of set functors: how many iterations are needed?
type: Item
instance of: scholarly article
title: Fixed points of set functors: how many iterations are needed?
zbMATH Open document ID: 1375.18013
author: T. Palm
author: Jiří Adámek
author: Václav Koubek
published in: Applied Categorical Structures
publication date: 2016-10-20T00:00:00Z
Mathematics Subject Classification ID: 18A30
Mathematics Subject Classification ID: 03E10
zbMATH DE Number: 6641510
zbMATH Keywords: set functors
zbMATH Keywords: terminal coalgebra
zbMATH Keywords: terminal chain
zbMATH Keywords: filter functor
MaRDI profile type: Publication
full work available at URL: s10485-016-9451-1
OpenAlex ID: W2511252833
cites work: Q4044767
cites work: On final coalgebras of power-set functors and saturated trees
cites work: On tree coalgebras and coalgebra presentations
cites work: Initial algebras and terminal coalgebras in many-sorted sets
cites work: Relatively terminal coalgebras
cites work: Coequalizers and free triples
cites work: Terminal coalgebras in well-founded set theory
cites work: Q4046228
cites work: Q5620720
cites work: Q5574731
cites work: Q4065693
cites work: On the final sequence of a finitary set functor
DOI: 10.1007/S10485-016-9451-1
description: scientific article; zbMATH DE number 6641510