Best Unifiers in Transitive Modal Logics

Studia Logica 99 (1-3):321-336 (2011)
  Copy   BIBTEX


This paper offers a brief analysis of the unification problem in modal transitive logics related to the logic S4 : S4 itself, K4, Grz and Gödel-Löb 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



    Upload a copy of this work     Papers currently archived: 79,971

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Modal incompleteness revisited.Tadeusz Litak - 2004 - Studia Logica 76 (3):329 - 342.
Kripke semantics for modal substructural logics.Norihiro Kamide - 2002 - Journal of Logic, Language and Information 11 (4):453-470.
Hereditarily structurally complete modal logics.V. V. Rybakov - 1995 - Journal of Symbolic Logic 60 (1):266-288.
On the completeness of first degree weakly aggregative modal logics.Peter Apostoli - 1997 - Journal of Philosophical Logic 26 (2):169-180.


Added to PP

28 (#432,542)

6 months
1 (#478,598)

Historical graph of downloads
How can I increase my downloads?