Remarks about the unification type of several non-symmetric non-transitive modal logics
Résumé
The problem of unification in a normal modal logic L can be defined as follows: given a formula ϕ, determine whether there exists a substitution σ such that σ (ϕ) is in L. In this paper, we prove that for several non-symmetric non-transitive modal logics, there exists unifiable formulas that possess no minimal complete set of unifiers.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...