Best Unifiers in Transitive Modal Logics


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

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

Идентификатор DOI: 10.1007/s11225-011-9354-y

Ключевые слова: Modal logics, unification, best unifiers, admissible rules

Аннотация: This paper offers a brief analysis of the unification problem in modal transitive logics related to the logic S4: S4 itself, K4, Grz and Godel-Lob provability logic GL. As a result, new, but not the first, algorithms for the construction of 'best' unifiers in these logics are being proposed. The proposed algorithms are based on ourПоказать полностьюearlier approach to solve in an algorithmic way the admissibility problem of inference rules for S4 and Grz. The first algorithms for the construction of 'best' unifiers in the above mentioned logics have been given by S. Ghilardi in [16]. Both the algorithms in [16] and ours are not much computationally efficient. They have, however, an obvious significant theoretical value a portion of which seems to be the fact that they stem from two different methodological approaches.

Ссылки на полный текст



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

Номера страниц: 321-336

ISSN журнала: 00393215

Место издания: NEW YORK

Издатель: SPRINGER


  • Rybakov Vladimir V. (Manchester Metropolitan Univ, Sch Comp Math & IT, Manchester M1 5GD, Lancs, England; Siberian Fed Univ, Math Inst, Krasnoyarsk, Russia)