Filtrations of generalized Veltman models

The filtration method is often used to prove the finite model property of modal logics. We adapt this technique to the generalized Veltman semantics for interpretability logics. In order to preserve the defining properties of generalized Veltman models, we use bisimulations to define adequate filtrations. We give an alternative proof of the finite model property of interpretability logic with respect to Veltman models, and we prove the finite model property of the systems and with respect to generalized Veltman models.