In this paper, we focus on the intuitionistic propositional logic extended with a local operator [22] (also called nucleus [21]); such logic is commonly named lax logic after [9]. We prove that unification is finitary in this logic and supply algorithms for computing a basis of unifiers and for recognizing admissibility of inference rules, following analogous known results for intuitionistic logic.
Unification in lax logic
Ghilardi, S.;Lenzi, G.
2022-01-01
Abstract
In this paper, we focus on the intuitionistic propositional logic extended with a local operator [22] (also called nucleus [21]); such logic is commonly named lax logic after [9]. We prove that unification is finitary in this logic and supply algorithms for computing a basis of unifiers and for recognizing admissibility of inference rules, following analogous known results for intuitionistic logic.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.