About the unification type of K + [][]⊥ - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

About the unification type of K + [][]⊥

Résumé

The unification problem in a propositional logic is to determine, given a formula φ, whether there exists a substitution σ such that σ(φ) is in that logic. In that case, σ is a unifier of φ. When a unifiable formula has minimal complete sets of unifiers, it is either infinitary, finitary, or unitary, depending on the cardinality of its minimal complete sets of unifiers. Otherwise, it is nullary. In this paper, we prove that in modal logic K+□□⊥, unifiable formulas are either finitary, or unitary.
Fichier principal
Vignette du fichier
UNIF_2020_paper_1.pdf (282.82 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02936473 , version 1 (11-09-2020)

Identifiants

Citer

Philippe Balbiani, Cigdem Gencer, Maryam Rostamigiv, Tinko Tinchev. About the unification type of K + [][]⊥. 34th International Workshop on Unification (UNIF 2020), Jun 2020, Paris, France. pp.481-497, ⟨10.1007/s10472-021-09768-w⟩. ⟨hal-02936473⟩
37 Consultations
64 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More