Тип публикации: статья из журнала

Год издания: 1997

Ключевые слова: Admissibility of inference rules, Decidability, Local finiteness, Polymodal logic

Аннотация: We investigate a poly-modal logic S5 nC which has n-modalities (n 1) satisfying the axioms of S5 and has axioms expressing permutability of modalities. We show that the logic S5 nC is complete concerning Kripke semantics, has the finite model property and is decidable, however we prove S5nC is not locally finite. A main result conПоказать полностьюsists of an algorithmic criterion for recognizing the admissibility of inference rules in S5 nC, i.e. the logic S5 nC is decidable with respect to the admissibility.

Журнал: SUT Journal of Mathematics

Выпуск журнала: Vol. 33, Is. 1

Номера страниц: 1-9

• Alexeev P.A. (Department of Mathematics, Krasnoyarsk State University, Av. Svobodnyi 79, 660062 Krasnoyarsk, Russian Federation)
• Golovanov M.I. (Department of Mathematics, Krasnoyarsk State University, Av. Svobodnyi 79, 660062 Krasnoyarsk, Russian Federation)

• Scopus
• Ядро РИНЦ (eLIBRARY.RU)