安格尔和麦考尔会见万辛

Pub Date : 2024-02-17 DOI:10.1007/s11225-023-10083-0
Hitoshi Omori, Andreas Kapsner
{"title":"安格尔和麦考尔会见万辛","authors":"Hitoshi Omori, Andreas Kapsner","doi":"10.1007/s11225-023-10083-0","DOIUrl":null,"url":null,"abstract":"<p>In this paper, we introduce a new logic, which we call <b>AM3</b>. It is a connexive logic that has several interesting properties, among them being <i>strongly connexive</i> and validating the <i>Converse Boethius Thesis</i>. These two properties are rather characteristic of the difference between, on the one hand, Angell and McCall’s <b>CC1</b> and, on the other, Wansing’s <b>C</b>. We will show that in other aspects, as well, <b>AM3</b> combines what are, arguably, the strengths of both <b>CC1</b> and <b>C</b>. It also allows us an interesting look at how connexivity and the intuitionistic understanding of negation relate to each other. However, some problems remain, and we end by pointing to a large family of weaker logics that <b>AM3</b> invites us to further explore.</p>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Angell and McCall Meet Wansing\",\"authors\":\"Hitoshi Omori, Andreas Kapsner\",\"doi\":\"10.1007/s11225-023-10083-0\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>In this paper, we introduce a new logic, which we call <b>AM3</b>. It is a connexive logic that has several interesting properties, among them being <i>strongly connexive</i> and validating the <i>Converse Boethius Thesis</i>. These two properties are rather characteristic of the difference between, on the one hand, Angell and McCall’s <b>CC1</b> and, on the other, Wansing’s <b>C</b>. We will show that in other aspects, as well, <b>AM3</b> combines what are, arguably, the strengths of both <b>CC1</b> and <b>C</b>. It also allows us an interesting look at how connexivity and the intuitionistic understanding of negation relate to each other. However, some problems remain, and we end by pointing to a large family of weaker logics that <b>AM3</b> invites us to further explore.</p>\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2024-02-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s11225-023-10083-0\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s11225-023-10083-0","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在本文中,我们介绍了一种新的逻辑,称之为 AM3。它是一种具有几个有趣性质的连通逻辑,其中包括强连通性和验证了匡衡波爱修斯定理。这两个特性是安格尔和麦考尔的 CC1 与万辛的 C 之间的区别。我们将证明,在其他方面,AM3 也结合了 CC1 和 C 的优点。然而,一些问题依然存在,我们最后指出了AM3中的一大批弱逻辑,并邀请我们进一步探讨。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
分享
查看原文
Angell and McCall Meet Wansing

In this paper, we introduce a new logic, which we call AM3. It is a connexive logic that has several interesting properties, among them being strongly connexive and validating the Converse Boethius Thesis. These two properties are rather characteristic of the difference between, on the one hand, Angell and McCall’s CC1 and, on the other, Wansing’s C. We will show that in other aspects, as well, AM3 combines what are, arguably, the strengths of both CC1 and C. It also allows us an interesting look at how connexivity and the intuitionistic understanding of negation relate to each other. However, some problems remain, and we end by pointing to a large family of weaker logics that AM3 invites us to further explore.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信