Algorithmic Problem of Axiomatization of Tabular Normal Modal Logic. Alexander V. Chagrov

Alexander V. Chagrov
Algorithmic Problem of Axiomatization of Tabular Normal Modal Logic
Abstract
The main results: solving the old algorithmic problems of tabularity and coincidence of normal modal logics with given tabular logic. The problem of tabularity is undecidable; the problem of coinciting is decidable only when given tabular logic is inconsistent. There are other results; open problems are discussed.

in Russian