超序列框架中的S5风格非标准模态

IF 0.6 Q2 LOGIC Logic and Logical Philosophy Pub Date : 2021-12-16 DOI:10.12775/llp.2021.020
Y. Petrukhin
{"title":"超序列框架中的S5风格非标准模态","authors":"Y. Petrukhin","doi":"10.12775/llp.2021.020","DOIUrl":null,"url":null,"abstract":"The aim of the paper is to present some non-standard modalities (such as non-contingency, contingency, essence and accident) based on S5-models in a framework of cut-free hypersequent calculi. We also study negated modalities, i.e. negated necessity and negated possibility, which produce paraconsistent and paracomplete negations respectively. As a basis for our calculi, we use Restall's cut-free hypersequent calculus for S5. We modify its rules for the above-mentioned modalities and prove strong soundness and completeness theorems by a Hintikka-style argument. As a consequence, we obtain a cut admissibility theorem. Finally, we present a constructive syntactic proof of cut elimination theorem.","PeriodicalId":43501,"journal":{"name":"Logic and Logical Philosophy","volume":" ","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2021-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"S5-Style Non-Standard Modalities in a Hypersequent Framework\",\"authors\":\"Y. Petrukhin\",\"doi\":\"10.12775/llp.2021.020\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The aim of the paper is to present some non-standard modalities (such as non-contingency, contingency, essence and accident) based on S5-models in a framework of cut-free hypersequent calculi. We also study negated modalities, i.e. negated necessity and negated possibility, which produce paraconsistent and paracomplete negations respectively. As a basis for our calculi, we use Restall's cut-free hypersequent calculus for S5. We modify its rules for the above-mentioned modalities and prove strong soundness and completeness theorems by a Hintikka-style argument. As a consequence, we obtain a cut admissibility theorem. Finally, we present a constructive syntactic proof of cut elimination theorem.\",\"PeriodicalId\":43501,\"journal\":{\"name\":\"Logic and Logical Philosophy\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2021-12-16\",\"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.2021.020\",\"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.2021.020","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"LOGIC","Score":null,"Total":0}
引用次数: 0

摘要

本文的目的是在无割超序列演算的框架下,提出基于S5模型的一些非标准模式(如非偶然性、偶然性、本质和偶然性)。我们还研究了否定模式,即否定必然性和否定可能性,它们分别产生半一致否定和半完全否定。作为我们演算的基础,我们对S5使用Restall的无割超序列演算。我们修改了它对上述模态的规则,并用Hintikka式的论证证明了强稳健性和完备性定理。因此,我们得到了一个割可容许定理。最后,我们给出了割消去定理的构造性句法证明。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
S5-Style Non-Standard Modalities in a Hypersequent Framework
The aim of the paper is to present some non-standard modalities (such as non-contingency, contingency, essence and accident) based on S5-models in a framework of cut-free hypersequent calculi. We also study negated modalities, i.e. negated necessity and negated possibility, which produce paraconsistent and paracomplete negations respectively. As a basis for our calculi, we use Restall's cut-free hypersequent calculus for S5. We modify its rules for the above-mentioned modalities and prove strong soundness and completeness theorems by a Hintikka-style argument. As a consequence, we obtain a cut admissibility theorem. Finally, we present a constructive syntactic proof of cut elimination theorem.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.00
自引率
40.00%
发文量
29
期刊最新文献
Paradoxes versus Contradictions in Logic of Sentential Operators Constructive Logic is Connexive and Contradictory KD45 with Propositional Quantifiers Logical Forms, Substitutions and Information Types Logical Forms: Validity and Variety of Formalizations
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1