多模态逻辑的线性逻辑框架

IF 0.4 4区 计算机科学 Q4 COMPUTER SCIENCE, THEORY & METHODS Mathematical Structures in Computer Science Pub Date : 2022-10-01 DOI:10.1017/S0960129522000366
Bruno Xavier, C. Olarte, Elaine Pimentel
{"title":"多模态逻辑的线性逻辑框架","authors":"Bruno Xavier, C. Olarte, Elaine Pimentel","doi":"10.1017/S0960129522000366","DOIUrl":null,"url":null,"abstract":"Abstract One of the most fundamental properties of a proof system is analyticity, expressing the fact that a proof of a given formula F only uses subformulas of F. In sequent calculus, this property is usually proved by showing that the \n$\\mathsf{cut}$\n rule is admissible, i.e., the introduction of the auxiliary lemma H in the reasoning “if H follows from G and F follows from H, then F follows from G” can be eliminated. The proof of cut admissibility is usually a tedious, error-prone process through several proof transformations, thus requiring the assistance of (semi-)automatic procedures. In a previous work by Miller and Pimentel, linear logic ( \n$\\mathsf{LL}$\n ) was used as a logical framework for establishing sufficient conditions for cut admissibility of object logical systems (OL). The OL’s inference rules are specified as an \n$\\mathsf{LL}$\n theory and an easy-to-verify criterion sufficed to establish the cut-admissibility theorem for the OL at hand. However, there are many logical systems that cannot be adequately encoded in \n$\\mathsf{LL}$\n , the most symptomatic cases being sequent systems for modal logics. In this paper, we use a linear-nested sequent ( \n$\\mathsf{LNS}$\n ) presentation of \n$\\mathsf{MMLL}$\n (a variant of LL with subexponentials), and show that it is possible to establish a cut-admissibility criterion for \n$\\mathsf{LNS}$\n systems for (classical or substructural) multimodal logics. We show that the same approach is suitable for handling the \n$\\mathsf{LNS}$\n system for intuitionistic logic.","PeriodicalId":49855,"journal":{"name":"Mathematical Structures in Computer Science","volume":"32 1","pages":"1176 - 1204"},"PeriodicalIF":0.4000,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A linear logic framework for multimodal logics\",\"authors\":\"Bruno Xavier, C. Olarte, Elaine Pimentel\",\"doi\":\"10.1017/S0960129522000366\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract One of the most fundamental properties of a proof system is analyticity, expressing the fact that a proof of a given formula F only uses subformulas of F. In sequent calculus, this property is usually proved by showing that the \\n$\\\\mathsf{cut}$\\n rule is admissible, i.e., the introduction of the auxiliary lemma H in the reasoning “if H follows from G and F follows from H, then F follows from G” can be eliminated. The proof of cut admissibility is usually a tedious, error-prone process through several proof transformations, thus requiring the assistance of (semi-)automatic procedures. In a previous work by Miller and Pimentel, linear logic ( \\n$\\\\mathsf{LL}$\\n ) was used as a logical framework for establishing sufficient conditions for cut admissibility of object logical systems (OL). The OL’s inference rules are specified as an \\n$\\\\mathsf{LL}$\\n theory and an easy-to-verify criterion sufficed to establish the cut-admissibility theorem for the OL at hand. However, there are many logical systems that cannot be adequately encoded in \\n$\\\\mathsf{LL}$\\n , the most symptomatic cases being sequent systems for modal logics. In this paper, we use a linear-nested sequent ( \\n$\\\\mathsf{LNS}$\\n ) presentation of \\n$\\\\mathsf{MMLL}$\\n (a variant of LL with subexponentials), and show that it is possible to establish a cut-admissibility criterion for \\n$\\\\mathsf{LNS}$\\n systems for (classical or substructural) multimodal logics. We show that the same approach is suitable for handling the \\n$\\\\mathsf{LNS}$\\n system for intuitionistic logic.\",\"PeriodicalId\":49855,\"journal\":{\"name\":\"Mathematical Structures in Computer Science\",\"volume\":\"32 1\",\"pages\":\"1176 - 1204\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2022-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematical Structures in Computer Science\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1017/S0960129522000366\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical Structures in Computer Science","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1017/S0960129522000366","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 1

摘要

证明系统的一个最基本的性质是解析性,它表示一个给定公式F的证明只使用F的子公式。在序演学中,通常通过证明$\mathsf{cut}$规则是可接受的来证明这一性质,即在“如果H从G引出,F从H引出,那么F从G引出”推理中引入辅助引理H是可以消除的。切割可采性的证明通常是一个冗长且容易出错的过程,需要经过多次证明转换,因此需要(半)自动化程序的帮助。在Miller和Pimentel之前的工作中,线性逻辑($\mathsf{LL}$)被用作建立对象逻辑系统(OL)切容许的充分条件的逻辑框架。OL的推理规则被指定为$\mathsf{LL}$理论和一个易于验证的准则,足以建立手头OL的可割性定理。然而,有许多逻辑系统不能在$\mathsf{LL}$中充分编码,最典型的情况是模态逻辑的顺序系统。在本文中,我们使用$\mathsf{MMLL}$的线性嵌套序列($\mathsf{LNS}$)表示,并证明了对于(经典或子结构)多模态逻辑,$\mathsf{LNS}$系统可以建立一个切容许准则。我们证明了同样的方法也适用于处理直觉逻辑的$\mathsf{LNS}$系统。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A linear logic framework for multimodal logics
Abstract One of the most fundamental properties of a proof system is analyticity, expressing the fact that a proof of a given formula F only uses subformulas of F. In sequent calculus, this property is usually proved by showing that the $\mathsf{cut}$ rule is admissible, i.e., the introduction of the auxiliary lemma H in the reasoning “if H follows from G and F follows from H, then F follows from G” can be eliminated. The proof of cut admissibility is usually a tedious, error-prone process through several proof transformations, thus requiring the assistance of (semi-)automatic procedures. In a previous work by Miller and Pimentel, linear logic ( $\mathsf{LL}$ ) was used as a logical framework for establishing sufficient conditions for cut admissibility of object logical systems (OL). The OL’s inference rules are specified as an $\mathsf{LL}$ theory and an easy-to-verify criterion sufficed to establish the cut-admissibility theorem for the OL at hand. However, there are many logical systems that cannot be adequately encoded in $\mathsf{LL}$ , the most symptomatic cases being sequent systems for modal logics. In this paper, we use a linear-nested sequent ( $\mathsf{LNS}$ ) presentation of $\mathsf{MMLL}$ (a variant of LL with subexponentials), and show that it is possible to establish a cut-admissibility criterion for $\mathsf{LNS}$ systems for (classical or substructural) multimodal logics. We show that the same approach is suitable for handling the $\mathsf{LNS}$ system for intuitionistic logic.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science 工程技术-计算机:理论方法
CiteScore
1.50
自引率
0.00%
发文量
30
审稿时长
12 months
期刊介绍: Mathematical Structures in Computer Science is a journal of theoretical computer science which focuses on the application of ideas from the structural side of mathematics and mathematical logic to computer science. The journal aims to bridge the gap between theoretical contributions and software design, publishing original papers of a high standard and broad surveys with original perspectives in all areas of computing, provided that ideas or results from logic, algebra, geometry, category theory or other areas of logic and mathematics form a basis for the work. The journal welcomes applications to computing based on the use of specific mathematical structures (e.g. topological and order-theoretic structures) as well as on proof-theoretic notions or results.
期刊最新文献
On Hofmann–Streicher universes T0-spaces and the lower topology GADTs are not (Even partial) functors A linear linear lambda-calculus Countability constraints in order-theoretic approaches to computability
×
引用
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