Dugundji's theorem revisited (Q2254571)

According to \textit{J. Dugundji}'s well-known theorem [J. Symb. Log. 5, 150--151 (1940; Zbl 0024.09703)], no system between \({\mathbf {S1}}\) and \({\mathbf {S5}}\) can be characterized by finite matrices. The authors recall this classical result and its proof, and show how it can be extended to a wider spectrum of modal systems. Namely, they demonstrate that no system between \({\mathbf {S0.5}}^0\) and \({\mathbf {S5}}\) (Theorem 5.3), as well as between \({\mathbf {C2}}\) and \({\mathbf {S5}}\) (Theorem 5.4), as well as between \({\mathbf K}\) and \({\mathbf {GL}}\) (Theorem 5.8), whose non-modal fragment is between \({\mathbf PC}^\supset\) and \({\mathbf {PC}}\), can be characterized by finite matrices. Here, \({\mathbf K}\) is the minimal system of normal modal logic, \({\mathbf {GL}} ={\mathbf K} + \square p \supset \square\square p + \square(\square p \supset p) \supset \square p\), and \({\mathbf {PC}}^\supset\) is the implicational fragment of classical propositional calculus. The authors further consider the so-called \textit{tabularity property} by \textit{A. Chagrov} and \textit{M. Zakharyaschev} [Modal logic. Oxford: Clarendon Press (1997; Zbl 0871.03007)], according to which a modal system is tabular if and only if it can be characterized by a finite Kripke frame. They show that no extension of \({\mathbf K}\) contained in \({\mathbf {GL}}\) is tabular.