Bisimulations and filtrations in modal logic

Valentin Shehtman (Institute for information Transmission Problems, Russia) and Ilya Shapirovsky (Institute for information Transmission Problems, Russia)

In this course we will study two powerful techniques in propositional modal logic – bisimulations and filtrations. They will be used for proof of two important properties of logics – local finiteness and the finite model property. The latter properties are crucial for computational issues – most of decision procedures rely on structure of finite models.

The course is supposed for the audience with the background in modal logic including the basic notions and theorems (canonical models, frame morphisms etc.)
It is essentially based on the works of the authors in recent two decades as well as classical results of the previous period (by K. Segerberg, J. Van Benthem, K. Fine and others).

Course Materials