Kripke-Completeness and Sequent Calculus for Quasi-Boolean Modal Logic

IF 0.6 3区 数学 Q2 LOGIC Studia Logica Pub Date : 2024-03-06 DOI:10.1007/s11225-024-10095-4
{"title":"Kripke-Completeness and Sequent Calculus for Quasi-Boolean Modal Logic","authors":"","doi":"10.1007/s11225-024-10095-4","DOIUrl":null,"url":null,"abstract":"<h3>Abstract</h3> <p>Quasi-Boolean modal algebras are quasi-Boolean algebras with a modal operator satisfying the interaction axiom. Sequential quasi-Boolean modal logics and the relational semantics are introduced. Kripke-completeness for some quasi-Boolean modal logics is shown by the canonical model method. We show that every descriptive persistent quasi-Boolean modal logic is canonical. The finite model property of some quasi-Boolean modal logics is proved. A cut-free Gentzen sequent calculus for the minimal quasi-Boolean logic is developed and we show that it has the Craig interpolation property.</p>","PeriodicalId":48979,"journal":{"name":"Studia Logica","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2024-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Studia Logica","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s11225-024-10095-4","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"LOGIC","Score":null,"Total":0}
引用次数: 0

Abstract

Quasi-Boolean modal algebras are quasi-Boolean algebras with a modal operator satisfying the interaction axiom. Sequential quasi-Boolean modal logics and the relational semantics are introduced. Kripke-completeness for some quasi-Boolean modal logics is shown by the canonical model method. We show that every descriptive persistent quasi-Boolean modal logic is canonical. The finite model property of some quasi-Boolean modal logics is proved. A cut-free Gentzen sequent calculus for the minimal quasi-Boolean logic is developed and we show that it has the Craig interpolation property.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
准布尔模态逻辑的克里普克完备性和序列微积分
摘要 准布尔模态逻辑是具有满足交互公理的模态算子的准布尔模态逻辑。介绍了顺序准布尔模态逻辑和关系语义。用典型模型法证明了一些准布尔模态逻辑的克里普克完备性。我们证明了每一个描述性持久准布尔模态逻辑都是典型的。证明了一些准布尔模态逻辑的有限模型性质。我们为最小准布尔逻辑建立了一个无切割的根岑序列微积分,并证明它具有克雷格插值特性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Studia Logica
Studia Logica MATHEMATICS-LOGIC
CiteScore
1.70
自引率
14.30%
发文量
43
审稿时长
6-12 weeks
期刊介绍: The leading idea of Lvov-Warsaw School of Logic, Philosophy and Mathematics was to investigate philosophical problems by means of rigorous methods of mathematics. Evidence of the great success the School experienced is the fact that it has become generally recognized as Polish Style Logic. Today Polish Style Logic is no longer exclusively a Polish speciality. It is represented by numerous logicians, mathematicians and philosophers from research centers all over the world.
期刊最新文献
Quantum Interpretation of Semantic Paradox: Contextuality and Superposition Quantale Valued Sets: Categorical Constructions and Properties Editorial Introduction Dummett’s Theory of Truth as a Source of Connexivity Topic-Based Communication Between Agents
×
引用
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