Power-set functors and saturated trees

DOI10.4230/LIPICS.CSL.2011.5MaRDI QIDQ2915670zbMATH OpenOpenAlexFDO

Authors Jiří Adámek, Stefan Milius, Lawrence S. Moss, Lurdes Sousa

Publication date 18 September 2012

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_d1dd.html

zbMATH Keywords

final coalgebramodal logicextensional treepower-set functorsaturated tree

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Categorical logic, topoi (03G30)

Recommendations

• On final coalgebras of power-set functors and saturated trees
• On the final sequence of a finitary set functor
• A modal proof theory for final polynomial coalgebras
• A note on expressive coalgebraic logics for finitary set functors
• On the greatest fixed point of a set functor

Cited in

(4)

• A ghost at \(\omega_1\)
• On final coalgebras of power-set functors and saturated trees
• Types for Proofs and Programs
• A description based on languages of the final non-deterministic automaton

This page was built for publication: Power-set functors and saturated trees

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