模态弱克莱因逻辑:公理化和关系语义学

IF 0.7 4区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS
S Bonzio, N Zamperlin
{"title":"模态弱克莱因逻辑:公理化和关系语义学","authors":"S Bonzio, N Zamperlin","doi":"10.1093/logcom/exae046","DOIUrl":null,"url":null,"abstract":"Weak Kleene logics are three-valued logics characterized by the presence of an infectious truth-value. In their external versions, as they were originally introduced by Bochvar [4] and Halldén [30], these systems are equipped with an additional connective capable of expressing whether a formula is classically true. In this paper we further expand the expressive power of external weak Kleen logics by modalizing them with a unary operator. The addition of an alethic modality gives rise to the two systems $\\textsf{B}_{\\text{e}}^{\\square }$ and $\\textsf{PWK}^{\\Box }_{\\text{e}} $, which have two different readings of the modal operator. We provide these logics with a complete and decidable Hilbert-style axiomatization w.r.t. a three-valued possible worlds semantics. The starting point of these calculi are new axiomatizations for the non-modal bases $\\textsf{B}_{\\text{e}}$ and $\\textsf{PWK}_{\\text{e}}$, which we provide using the recent algebraization results about these two logics. In particular, we prove the algebraizability of $\\textsf{PWK}_{\\text{e}}$. Finally some standard extensions of the basic modal systems are provided with their completeness results w.r.t. special classes of frames.","PeriodicalId":50162,"journal":{"name":"Journal of Logic and Computation","volume":"15 1","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2024-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Modal weak Kleene logics: axiomatizations and relational semantics\",\"authors\":\"S Bonzio, N Zamperlin\",\"doi\":\"10.1093/logcom/exae046\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Weak Kleene logics are three-valued logics characterized by the presence of an infectious truth-value. In their external versions, as they were originally introduced by Bochvar [4] and Halldén [30], these systems are equipped with an additional connective capable of expressing whether a formula is classically true. In this paper we further expand the expressive power of external weak Kleen logics by modalizing them with a unary operator. The addition of an alethic modality gives rise to the two systems $\\\\textsf{B}_{\\\\text{e}}^{\\\\square }$ and $\\\\textsf{PWK}^{\\\\Box }_{\\\\text{e}} $, which have two different readings of the modal operator. We provide these logics with a complete and decidable Hilbert-style axiomatization w.r.t. a three-valued possible worlds semantics. The starting point of these calculi are new axiomatizations for the non-modal bases $\\\\textsf{B}_{\\\\text{e}}$ and $\\\\textsf{PWK}_{\\\\text{e}}$, which we provide using the recent algebraization results about these two logics. In particular, we prove the algebraizability of $\\\\textsf{PWK}_{\\\\text{e}}$. Finally some standard extensions of the basic modal systems are provided with their completeness results w.r.t. special classes of frames.\",\"PeriodicalId\":50162,\"journal\":{\"name\":\"Journal of Logic and Computation\",\"volume\":\"15 1\",\"pages\":\"\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2024-08-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Logic and Computation\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1093/logcom/exae046\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Logic and Computation","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1093/logcom/exae046","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

弱克莱因逻辑是三值逻辑,其特点是存在传染性真值。这些系统的外部版本最初是由 Bochvar [4] 和 Halldén [30] 提出的,它们配备了一个额外的连接词,能够表达公式是否经典为真。在本文中,我们通过用一元算子对它们进行模态化,进一步扩展了外部弱 Kleen 逻辑的表达能力。增加了一个alethic模态之后,就产生了$\textsf{B}_{text{e}}^{\square }$和$\textsf{PWK}^{Box }_{\text{e}}这两个系统。$,它们的模态算子有两种不同的读法。我们为这些逻辑提供了与三值可能世界语义相关的完整且可解的希尔伯特式公理化。这些计算的起点是非模态基$\textsf{B}_{text{e}}$和$\textsf{PWK}_{text{e}}$的新公理化。特别是,我们证明了 $\textsf{PWK}_{\text{e}}$ 的可代数性。最后,我们提供了基本模态系统的一些标准扩展及其与特殊类框架的完备性结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Modal weak Kleene logics: axiomatizations and relational semantics
Weak Kleene logics are three-valued logics characterized by the presence of an infectious truth-value. In their external versions, as they were originally introduced by Bochvar [4] and Halldén [30], these systems are equipped with an additional connective capable of expressing whether a formula is classically true. In this paper we further expand the expressive power of external weak Kleen logics by modalizing them with a unary operator. The addition of an alethic modality gives rise to the two systems $\textsf{B}_{\text{e}}^{\square }$ and $\textsf{PWK}^{\Box }_{\text{e}} $, which have two different readings of the modal operator. We provide these logics with a complete and decidable Hilbert-style axiomatization w.r.t. a three-valued possible worlds semantics. The starting point of these calculi are new axiomatizations for the non-modal bases $\textsf{B}_{\text{e}}$ and $\textsf{PWK}_{\text{e}}$, which we provide using the recent algebraization results about these two logics. In particular, we prove the algebraizability of $\textsf{PWK}_{\text{e}}$. Finally some standard extensions of the basic modal systems are provided with their completeness results w.r.t. special classes of frames.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Logic and Computation
Journal of Logic and Computation 工程技术-计算机:理论方法
CiteScore
1.90
自引率
14.30%
发文量
82
审稿时长
6-12 weeks
期刊介绍: Logic has found application in virtually all aspects of Information Technology, from software engineering and hardware to programming and artificial intelligence. Indeed, logic, artificial intelligence and theoretical computing are influencing each other to the extent that a new interdisciplinary area of Logic and Computation is emerging. The Journal of Logic and Computation aims to promote the growth of logic and computing, including, among others, the following areas of interest: Logical Systems, such as classical and non-classical logic, constructive logic, categorical logic, modal logic, type theory, feasible maths.... Logical issues in logic programming, knowledge-based systems and automated reasoning; logical issues in knowledge representation, such as non-monotonic reasoning and systems of knowledge and belief; logics and semantics of programming; specification and verification of programs and systems; applications of logic in hardware and VLSI, natural language, concurrent computation, planning, and databases. The bulk of the content is technical scientific papers, although letters, reviews, and discussions, as well as relevant conference reviews, are included.
×
引用
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学术官方微信