范畴三段论的一个新的代数判定--基于Dagel图的判定
A New Algorithmic Decision for Categorical Syllogisms via Caroll's Diagrams
摘要:
本文讨论了一个演算系统SLCD(SyllogisticLogicwithCarrollDiagrams),它给出了用图进行逻辑推理的一种形式化方法,它表示了基本的阿伦特范畴命题,并证明了它们在删除中间项的三段论推理准则下是封闭的。因此,它的实施,让形式主义包括同步双边和三边的数学外观和一个天真的算法性质。而且,不需要专门的知识或专门的能力来理解和使用它,因此,我们给出了一个有效的算法,用于确定是否有效的三段论推理使用SLCD。
英文摘要:
In this paper, we deal with a calculus system SLCD (Syllogistic Logic with Carroll Diagrams), which gives a formal approach to logical reasoning with diagrams, for representations of the fundamental Aristotelian categorical propositions and show that they are closed under the syllogistic criterion of inference which is the deletion of middle term. Therefore, it is implemented to let the formalism comprise synchronically bilateral and trilateral diagrammatical appearance and a naive algorithmic nature. And also, there is no need specific knowledge or exclusive ability to understand as well as to use it. Consequently, we give an effective algorithm used to determine whether a syllogistic reasoning valid or not by using SLCD.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。