Computing most general unifiers in Euclidean modal logics - Logique, Interaction, Langue et Calcul Access content directly
Preprints, Working Papers, ... (Preprint) Year : 2024

Computing most general unifiers in Euclidean modal logics

Abstract

We prove that all extensions of K5 have unary unification, even with parameters. Our proof is constructive in the sense that we can effectively compute, in 4-exponential space, a most general unifier for any unifiable formula. In particular, this proves that unification and admissibility are decidable. We also investigate special unification types: we show that K5 and KD5 are transparent, and we characterize the projective extensions of K5.
Fichier principal
Vignette du fichier
main.pdf (507.02 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04244893 , version 1 (16-10-2023)
hal-04244893 , version 2 (21-05-2024)

Licence

Identifiers

  • HAL Id : hal-04244893 , version 2

Cite

Quentin Gougeon. Computing most general unifiers in Euclidean modal logics. 2024. ⟨hal-04244893v2⟩
204 View
44 Download

Share

Gmail Mastodon Facebook X LinkedIn More