Three New Genuine Five-valued Logics Intended to Model Non-trivial Concepts

Q3 Computer Science Electronic Notes in Theoretical Computer Science Pub Date : 2020-12-01 DOI:10.1016/j.entcs.2020.10.012

Mauricio Osorio, Claudia Zepeda

引用次数: 0

Abstract

We introduce three 5-valued paraconsistent logics that we name FiveASP1, FiveASP2 and FiveASP3. Each of these logics is genuine and paracomplete. The new value is called e attempting to model the notion of ineffability. If one drops e from any of these logics one obtains a well known 4-valued logic introduced by Avron. If, on the other hand one drops the “implication” connective from any of these logics, one obtains Priest logic FDEe. We present some properties of these logics.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

拟模拟非平凡概念的三种新真五值逻辑

我们引入了三个5值的副一致逻辑，我们将其命名为FiveASP1、FiveASP2和FiveASP3。这些逻辑中的每一个都是真实的和准完整的。这个新值被称为e，它试图对不可言说的概念进行建模。如果从这些逻辑中去掉e，就得到了一个众所周知的由Avron引入的4值逻辑。另一方面，如果从这些逻辑中去掉连接的“暗示”，就可以得到Priest逻辑FDEe。我们给出了这些逻辑的一些性质。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Electronic Notes in Theoretical Computer Science Computer Science-Computer Science (all)

自引率

0.00%

发文量

期刊介绍： ENTCS is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication and the availability on the electronic media is appropriate. Organizers of conferences whose proceedings appear in ENTCS, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.

期刊最新文献

Preface Murphree's Numerical Term Logic Tableaux A Note on Constructive Interpolation for the Multi-Modal Logic Km Paracomplete Logics Dual to the Genuine Paraconsistent Logics: The Three-valued Case Building a Maximal Independent Set for the Vertex-coloring Problem on Planar Graphs