Decidability of the interpolation problem and of related properties in tabular logics

Propositional modal and positive logics are considered as well as extensions of Johansson's minimal logic. It is proved that basic versions of the interpolation property and of the Beth definability property, and also the Hallden property, are decidable on the class of tabular logics, i.e., logics given by finitely many finite algebras. Algorithms are described for constructing counterexamples to each of the properties mentioned in handling cases where the logic under consideration does not possess the required property.