Logics for Coalgebras and Applications to Computer Science

algebras axiom base category bisimulation bounded bStr category of coalgebras category theory chapter characterise coalgebra morphisms coalgebraic logic Coalgebraic Methods cocongruences codomain coequalisers cofree coalgebra cointersections colimits comonad coproducts coreflection morphism corollary covariety creates factorisations definition diagram endofunctor equalisers equational logic example factorisation structure factorisation system fibration fibred final coalgebra follows forgetful functor formulas full subcategory functor on Set generalised given infinitary injective isomorphic kernel pair Kripke frames Kripke models largest behavioural equivalence largest bisimulation left adjoint logic for coalgebras M-coreflective M)-category M)-factorisation modal logic monad morphism ƒ morphisms N-coalgebras N,E)-structures Notes in Theoretical notion objects observational operations preserves weak pullbacks propositional variables pushouts quotients reflective subcategories Remark right adjoint Rutten semantics sinks in Ɛ small coproducts specifications Strong Mono structure for sinks subcoalgebras Theoretical Computer Science unique universal coalgebra