Strong completeness with respect to finite kripke models

We prove that each intermediate or normal modal logic is strongly complete with respect to a class of finite Kripke frames iff it is tabular, i.e. the respective variety of pseudo-Boolean or modal algebras, corresponding to it, is generated by a finite algebra. The author wishes to thank the Editors for calling his attention to the fact that the result of this paper concerning the intermediate logics was announced earlier by A. Wroński at the conference “Logical calculi”, Wrocław, October 5–7, 1975, though without proof. Wroński's result has not been published.