On final coalgebras of power-set functors and saturated trees
From MaRDI portal
Publication:2516577
DOI10.1007/S10485-014-9372-9zbMath1328.03059OpenAlexW47566850WikidataQ122206229 ScholiaQ122206229MaRDI QIDQ2516577
Jiří Adámek, Stefan Milius, Lawrence S. Moss, Lurdes Sousa, Paul Blain Levy
Publication date: 3 August 2015
Published in: Applied Categorical Structures (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10316/43810
Modal logic (including the logic of norms) (03B45) Categorical logic, topoi (03G30) Ordinal and cardinal numbers (03E10)
Related Items (4)
The costructure–cosemantics adjunction for comodels for computational effects ⋮ Fixed points of set functors: how many iterations are needed? ⋮ Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the final sequence of a finitary set functor
- Coequational logic for accessible functors
- On the greatest fixed point of a set functor
- On coalgebra based on classes
- Universal coalgebra: A theory of systems
- Terminal coalgebras in well-founded set theory
- Finite models constructed from canonical formulas
- A fixpoint theorem for complete categories
- Normal forms in modal logic
- Power-Set Functors and Saturated Trees.
- Initial algebras and terminal coalgebras in many-sorted sets
- A Cook's Tour of the Finitary Non-Well-Founded Sets
- Monoid-labeled transition systems
- A final coalgebra theorem
- Coalgebraic modal logic of finite rank
This page was built for publication: On final coalgebras of power-set functors and saturated trees