Bisimulational Categoricity

I will present a result which says that for a complete modal theory t (i.e. a maximal consistent set of modal logic formulae), the following conditions are equivalent: (i) t has a unique model up to bisimulation; (ii) every model of t is bisimilar to a finitely branching one; (iii) t has a finitely branching model. I will further discuss examples (such as the EF-logic) and non-examples (e.g. the modal mu-calculus) of logics for which similar characterisation is possible.

Authors

• Jędrzej Kołodziejski.

Keywords

No keywords are indexed for this paper.