Showing changes from revision #2 to #3:
Added | Removed | Changed
A modal formula is derived from the language of a logic inductively by: if is a formula of , then is a modal formula. We denote the collection of modal formulas by .
A Kripke frame aka. modal frame is a pair of a set and a binary relation . a relation is equivalently a function sending to the set of its successors.
A Kripke model is a triple where is a Kripke frame and a relation (sometimes called forcing relation) subject to the following list of axioms:
(1) iff is not in .
(2) iff is not in or
(3) iff for all with
(Note that we used here the notation to express the “propositional interpretation” of being a member of the relation.)
A formula is called to be valid in a model resp. valid in a frame resp. valid in a class of frames if for all resp. for all all relations resp. for all for all all relations .
A binary relation is equivalently a function where denotes the (covariant) power set functor sending an to the set of its -successors and a morphism . In other words: a frame is a coalgebra for the power set functor.
Generalizing this construction for relations of higher arity one obtains coalgebras for the functor for any modal similarity type .
Kripke models one obtains as coalgebras of the functor where is the set of propositional variables. To see this note that a valuation is equivalently a -coloring of : a functor .
The functors and from above are examples of Polynomial functors.
(…
(Definition 146, p.392) A polynomial functor is a -valued functor inductively defined by
where denotes the identity functor, denotes the constant functor on an object , denotes the coproduct functor of two polynomial functors, and likewise for the product functor, denotes the exponent functor .
A Kripke polynomial functor is inductively defined by
where denotes the composition of a polynomial functor with the power set functor .
(…)
(p.392) Kripke frames are -coalgebras, and Kripke models are coalgebras for the functor .