逻辑常数与算术形式

IF 0.6 Q2 LOGIC
Sebastian G. W. Speitel
{"title":"逻辑常数与算术形式","authors":"Sebastian G. W. Speitel","doi":"10.12775/llp.2023.012","DOIUrl":null,"url":null,"abstract":"This paper reflects on the limits of logical form set by a novel criterion of logicality proposed in (Bonnay and Speitel, 2021). The interest stems from the fact that the delineation of logical terms according to the criterion exceeds the boundaries of standard first-order logic. Among ‘novel’ logical terms is the quantifier “there are infinitely many”. Since the structure of the natural numbers is categorically characterisable in a language including this quantifier we ask: does this imply that arithmetical forms have been reduced to logical forms? And, in general, what other conditions need to be satisfied for a form to qualify as “fully logical”? We survey answers to these questions.","PeriodicalId":43501,"journal":{"name":"Logic and Logical Philosophy","volume":" ","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2023-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Logical Constants and Arithmetical Forms\",\"authors\":\"Sebastian G. W. Speitel\",\"doi\":\"10.12775/llp.2023.012\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper reflects on the limits of logical form set by a novel criterion of logicality proposed in (Bonnay and Speitel, 2021). The interest stems from the fact that the delineation of logical terms according to the criterion exceeds the boundaries of standard first-order logic. Among ‘novel’ logical terms is the quantifier “there are infinitely many”. Since the structure of the natural numbers is categorically characterisable in a language including this quantifier we ask: does this imply that arithmetical forms have been reduced to logical forms? And, in general, what other conditions need to be satisfied for a form to qualify as “fully logical”? We survey answers to these questions.\",\"PeriodicalId\":43501,\"journal\":{\"name\":\"Logic and Logical Philosophy\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2023-06-23\",\"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.012\",\"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.012","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"LOGIC","Score":null,"Total":0}
引用次数: 0

摘要

本文反思了(Bonnay和Speitel,2021)中提出的一个新的逻辑性标准所设定的逻辑形式的极限。这种兴趣源于这样一个事实,即根据该标准对逻辑项的描述超过了标准一阶逻辑的边界。在“新颖”的逻辑术语中,有一个量词“有无限多”。既然自然数的结构在包括这个量词的语言中是明确可表征的,我们要问:这是否意味着算术形式已经被简化为逻辑形式?一般来说,一个表格要符合“完全合乎逻辑”的条件,还需要满足哪些其他条件?我们调查这些问题的答案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Logical Constants and Arithmetical Forms
This paper reflects on the limits of logical form set by a novel criterion of logicality proposed in (Bonnay and Speitel, 2021). The interest stems from the fact that the delineation of logical terms according to the criterion exceeds the boundaries of standard first-order logic. Among ‘novel’ logical terms is the quantifier “there are infinitely many”. Since the structure of the natural numbers is categorically characterisable in a language including this quantifier we ask: does this imply that arithmetical forms have been reduced to logical forms? And, in general, what other conditions need to be satisfied for a form to qualify as “fully logical”? We survey answers to these questions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.00
自引率
40.00%
发文量
29
×
引用
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学术官方微信