超连接逻辑和全连接逻辑的关联语义

IF 0.6 Q2 LOGIC

Logic and Logical Philosophy Pub Date : 2023-06-21 DOI:10.12775/llp.2023.011

J. Malinowski, Ricardo Arturo Nicolás-Francisco

{"title":"超连接逻辑和全连接逻辑的关联语义","authors":"J. Malinowski, Ricardo Arturo Nicolás-Francisco","doi":"10.12775/llp.2023.011","DOIUrl":null,"url":null,"abstract":"In this paper we present a characterization of hyper-connexivity by means of a relating semantics for Boolean connexive logics. We also show that the minimal Boolean connexive logic is Abelardian, strongly consistent, Kapsner strong and antiparadox. We give an example showing that the minimal Boolean connexive logic is not simplificative. This shows that the minimal Boolean connexive logic is not totally connexive.","PeriodicalId":43501,"journal":{"name":"Logic and Logical Philosophy","volume":" ","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2023-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Relating Semantics for Hyper-Connexive and Totally Connexive Logics\",\"authors\":\"J. Malinowski, Ricardo Arturo Nicolás-Francisco\",\"doi\":\"10.12775/llp.2023.011\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we present a characterization of hyper-connexivity by means of a relating semantics for Boolean connexive logics. We also show that the minimal Boolean connexive logic is Abelardian, strongly consistent, Kapsner strong and antiparadox. We give an example showing that the minimal Boolean connexive logic is not simplificative. This shows that the minimal Boolean connexive logic is not totally connexive.\",\"PeriodicalId\":43501,\"journal\":{\"name\":\"Logic and Logical Philosophy\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2023-06-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Logic and Logical Philosophy\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.12775/llp.2023.011\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"LOGIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Logic and Logical Philosophy","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.12775/llp.2023.011","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"LOGIC","Score":null,"Total":0}

引用次数: 0

摘要

本文利用布尔连接逻辑的关联语义给出了超连接的表征。我们还证明了最小布尔连接逻辑是Abelardian的、强一致的、Kapsner强的和反悖论的。我们给出了一个例子来证明最小布尔连接逻辑是不简化的。这表明最小布尔连接逻辑不是完全连接的。

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

查看原文本刊更多论文

Relating Semantics for Hyper-Connexive and Totally Connexive Logics

In this paper we present a characterization of hyper-connexivity by means of a relating semantics for Boolean connexive logics. We also show that the minimal Boolean connexive logic is Abelardian, strongly consistent, Kapsner strong and antiparadox. We give an example showing that the minimal Boolean connexive logic is not simplificative. This shows that the minimal Boolean connexive logic is not totally connexive.

求助全文

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

来源期刊

Logic and Logical Philosophy Multiple-

CiteScore

1.00

自引率

40.00%

发文量