Finitary Functors: From Set to Preord and Poset

DOI10.1007/978-3-642-22944-2_7zbMath1343.18001OpenAlexW56167739MaRDI QIDQ3090863

Alexander Kurz, Adriana Balan

Publication date: 2 September 2011

Published in: Algebra and Coalgebra in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22944-2_7

zbMATH Keywords

simulationliftingembeddingextensionrelatorexact square(final) coalgebra

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65) Special properties of functors (faithful, full, etc.) (18A22) Preorders, orders, domains and lattices (viewed as categories) (18B35) Categories of sets, characterizations (18B05)

Related Items (8)

Minimality Notions via Factorization Systems and Examples ⋮ Up-to techniques for behavioural metrics via fibrations ⋮ (Metric) Bisimulation Games and Real-Valued Modal Logics for Coalgebras ⋮ Positive monotone modal logic ⋮ A general account of coinduction up-to ⋮ Extending set functors to generalised metric spaces ⋮ Limits in categories of Vietoris coalgebras ⋮ Saturated Kripke structures as Vietoris coalgebras

This page was built for publication: Finitary Functors: From Set to Preord and Poset