About the unification type of modal logic K5 and its extensions
Résumé
Introduction : We prove that all extensions of K45 have projective unification and K5 and some of its extensions are of unification type 1. The breakdown of the paper is as follows. Firstly, we prove in Proposition 9 that if L contains K45 then every formula has extension property in L. Secondly, generalizing some results obtained in [6], we prove in Proposition 13 that if L contains K5 then every L-unifiable formula is L-filtering. Thirdly, imitating arguments used in [18, 19], we prove in Proposition 20 that if L contains K5 then every formula having extension property in L is L-projective. Fourthly, we prove in Proposition 21 that if L contains K5 and L is global1 then for all substitutions σ, every formula L-unified by σ is implied by an L-projective formula based on the variables of the given formula and having σ as one of its L-unifiers.
Domaines
Logique en informatique [cs.LO]Origine | Fichiers produits par l'(les) auteur(s) |
---|