Other language title
اتحاد در منطق سستي
Title of article
Unification in lax logic
Author/Authors
Ghilardi, S Università degli Studi di Milano - Department of Mathematics - via Cesare Saldini 50, milano , Lenzi, G University of Salerno - Department of Mathematics - via Giovanni Paolo II, 84084 Fisciano (SA)
Pages
15
From page
61
To page
75
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.
Farsi abstract
در اين مقاله، ما بر منطق گزاره شهو دي با يك عملگر محلي ] 22 [ )كه آن را هسته ] 21 [ نيز مي نامند د(
تمركز كرده ايم. چنين منط قي معمولاً به نام منطق سست )ضعيف( ] 9[ ناميده مي شود. ما ثابت م يكنيم كه
وحدت در اين منطق نهايي است و الگوريتم هاي مورد نياز را براي محاسبه پايه متحد كننده ها و تشخ يص
پ ذيرفتن قواعد استنباطي، به دنبال نتايج شناخته شده مشابه برا ي منطق شهو دي، ارائه ميدهد .
Keywords
Nuclei , lax logic , unification theory , admissible inference rules
Journal title
Journal of Algebraic Hyperstructures and Logical Algebras
Serial Year
2022
Record number
2712102
Link To Document