Аннотация:
A class of frames based on a class of $LTK$-frames is considered. The polymodal decidable calculus in modal language with three modalities is found which is complete with respect to the class of inductive nearly $LTK$-frames. It is proved that it is finite approximated by the class of finite inductive nearly $LTK$-frames.
Ключевые слова:polymodal logic, Kripke frames, axiomatization, completeness, finite model property.