Decidability of the interpolation problem and of related properties in tabular logics
Algebra i logika, Tome 48 (2009) no. 6, pp. 754-792
Voir la notice de l'article provenant de la source Math-Net.Ru
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.
Keywords:
decidability, tabular logics, interpolation property, Beth definability property, Hallden property.
@article{AL_2009_48_6_a3,
author = {L. L. Maksimova},
title = {Decidability of the interpolation problem and of related properties in tabular logics},
journal = {Algebra i logika},
pages = {754--792},
publisher = {mathdoc},
volume = {48},
number = {6},
year = {2009},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/AL_2009_48_6_a3/}
}
L. L. Maksimova. Decidability of the interpolation problem and of related properties in tabular logics. Algebra i logika, Tome 48 (2009) no. 6, pp. 754-792. http://geodesic.mathdoc.fr/item/AL_2009_48_6_a3/