对真副协调逻辑的对偶的准完全逻辑:三值情况

Q3 Computer Science

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

Alejandro Hernández-Tello , Verónica Borja Macías , Marcelo E. Coniglio

{"title":"对真副协调逻辑的对偶的准完全逻辑:三值情况","authors":"Alejandro Hernández-Tello , Verónica Borja Macías , Marcelo E. Coniglio","doi":"10.1016/j.entcs.2020.10.006","DOIUrl":null,"url":null,"abstract":"<div>In 2016 Béziau, introduce a restricted notion of paraconsistency, the so-called genuine paraconsistency. A logic is genuine paraconsistent if it rejects the laws φ,¬φ ⊢ ψ and ⊢ ¬(φ ∧ ¬φ). In that paper the author analyzes, among the three-valued logics, which of them satisfy this property. If we consider multiple-conclusion consequence relations, the dual properties of those above mentioned are ⊢ φ,¬φ and ¬(ψ∨¬ψ) ⊢. We call genuine paracomplete logics those rejecting the mentioned properties. We present here an analysis of the three-valued genuine paracomplete logics.</div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":"354 ","pages":"Pages 61-74"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.entcs.2020.10.006","citationCount":"3","resultStr":"{\"title\":\"Paracomplete Logics Dual to the Genuine Paraconsistent Logics: The Three-valued Case\",\"authors\":\"Alejandro Hernández-Tello , Verónica Borja Macías , Marcelo E. Coniglio\",\"doi\":\"10.1016/j.entcs.2020.10.006\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>In 2016 Béziau, introduce a restricted notion of paraconsistency, the so-called genuine paraconsistency. A logic is genuine paraconsistent if it rejects the laws φ,¬φ ⊢ ψ and ⊢ ¬(φ ∧ ¬φ). In that paper the author analyzes, among the three-valued logics, which of them satisfy this property. If we consider multiple-conclusion consequence relations, the dual properties of those above mentioned are ⊢ φ,¬φ and ¬(ψ∨¬ψ) ⊢. We call genuine paracomplete logics those rejecting the mentioned properties. We present here an analysis of the three-valued genuine paracomplete logics.</div>\",\"PeriodicalId\":38770,\"journal\":{\"name\":\"Electronic Notes in Theoretical Computer Science\",\"volume\":\"354 \",\"pages\":\"Pages 61-74\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.entcs.2020.10.006\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Notes in Theoretical Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1571066120300827\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Computer Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Notes in Theoretical Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1571066120300827","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Computer Science","Score":null,"Total":0}

引用次数: 3

摘要

2016年，b ziau，引入一个有限的超一致性概念，所谓的真正的超一致性。一个逻辑是真正的副相容的，如果它拒绝φ、φ φ和φ (φ∧φ)定律。本文分析了三值逻辑中哪些满足这一性质。如果考虑多重结论的结果关系，则上述结果关系的对偶性质是:φ，¬φ和¬(ψ∨¬ψ)∧。我们称那些拒绝上述性质的逻辑为真正的准完全逻辑。本文对三值真准完全逻辑进行了分析。

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

查看原文本刊更多论文

Paracomplete Logics Dual to the Genuine Paraconsistent Logics: The Three-valued Case

In 2016 Béziau, introduce a restricted notion of paraconsistency, the so-called genuine paraconsistency. A logic is genuine paraconsistent if it rejects the laws φ,¬φ ⊢ ψ and ⊢ ¬(φ ∧ ¬φ). In that paper the author analyzes, among the three-valued logics, which of them satisfy this property. If we consider multiple-conclusion consequence relations, the dual properties of those above mentioned are ⊢ φ,¬φ and ¬(ψ∨¬ψ) ⊢. We call genuine paracomplete logics those rejecting the mentioned properties. We present here an analysis of the three-valued genuine paracomplete logics.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

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.