逻辑的代数证明理论

IF 0.7 4区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Giuseppe Greco, Peter Jipsen, Fei Liang, Alessandra Palmigiano, Apostolos Tzimoulis
{"title":"逻辑的代数证明理论","authors":"Giuseppe Greco, Peter Jipsen, Fei Liang, Alessandra Palmigiano, Apostolos Tzimoulis","doi":"10.1145/3632526","DOIUrl":null,"url":null,"abstract":"<p>In this paper we extend the research programme in algebraic proof theory from axiomatic extensions of the full Lambek calculus to logics algebraically captured by certain varieties of normal lattice expansions (normal LE-logics). Specifically, we generalise the <i>residuated frames</i> in [34] to arbitrary signatures of normal lattice expansions (LE). Such a generalization provides a valuable tool for proving important properties of LE-logics in full uniformity. We prove semantic cut elimination for the display calculi D.LE associated with the basic normal LE-logics and their axiomatic extensions with analytic inductive axioms. We also prove the finite model property (FMP) for each such calculus D.LE, as well as for its extensions with analytic structural rules satisfying certain additional properties.</p>","PeriodicalId":50916,"journal":{"name":"ACM Transactions on Computational Logic","volume":"40 5","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2023-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Algebraic proof theory for LE-logics\",\"authors\":\"Giuseppe Greco, Peter Jipsen, Fei Liang, Alessandra Palmigiano, Apostolos Tzimoulis\",\"doi\":\"10.1145/3632526\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>In this paper we extend the research programme in algebraic proof theory from axiomatic extensions of the full Lambek calculus to logics algebraically captured by certain varieties of normal lattice expansions (normal LE-logics). Specifically, we generalise the <i>residuated frames</i> in [34] to arbitrary signatures of normal lattice expansions (LE). Such a generalization provides a valuable tool for proving important properties of LE-logics in full uniformity. We prove semantic cut elimination for the display calculi D.LE associated with the basic normal LE-logics and their axiomatic extensions with analytic inductive axioms. We also prove the finite model property (FMP) for each such calculus D.LE, as well as for its extensions with analytic structural rules satisfying certain additional properties.</p>\",\"PeriodicalId\":50916,\"journal\":{\"name\":\"ACM Transactions on Computational Logic\",\"volume\":\"40 5\",\"pages\":\"\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2023-11-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Transactions on Computational Logic\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1145/3632526\",\"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":"ACM Transactions on Computational Logic","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1145/3632526","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

本文将代数证明理论的研究计划从满Lambek演算的公理化扩展扩展到由正规格展开(正规le -逻辑)的某些变体代数捕捉的逻辑。具体地说,我们将[34]中的剩余框架推广到正规晶格展开(LE)的任意签名。这种推广为证明完全一致的le逻辑的重要性质提供了一个有价值的工具。用解析归纳公理证明了与基本正规le逻辑相关的显示演算的语义切割消除及其公理化扩展。我们还证明了这类微积分的有限模型性质(FMP),以及它的扩展具有满足某些附加性质的解析结构规则。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Algebraic proof theory for LE-logics

In this paper we extend the research programme in algebraic proof theory from axiomatic extensions of the full Lambek calculus to logics algebraically captured by certain varieties of normal lattice expansions (normal LE-logics). Specifically, we generalise the residuated frames in [34] to arbitrary signatures of normal lattice expansions (LE). Such a generalization provides a valuable tool for proving important properties of LE-logics in full uniformity. We prove semantic cut elimination for the display calculi D.LE associated with the basic normal LE-logics and their axiomatic extensions with analytic inductive axioms. We also prove the finite model property (FMP) for each such calculus D.LE, as well as for its extensions with analytic structural rules satisfying certain additional properties.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
ACM Transactions on Computational Logic
ACM Transactions on Computational Logic 工程技术-计算机:理论方法
CiteScore
2.30
自引率
0.00%
发文量
37
审稿时长
>12 weeks
期刊介绍: TOCL welcomes submissions related to all aspects of logic as it pertains to topics in computer science. This area has a great tradition in computer science. Several researchers who earned the ACM Turing award have also contributed to this field, namely Edgar Codd (relational database systems), Stephen Cook (complexity of logical theories), Edsger W. Dijkstra, Robert W. Floyd, Tony Hoare, Amir Pnueli, Dana Scott, Edmond M. Clarke, Allen E. Emerson, and Joseph Sifakis (program logics, program derivation and verification, programming languages semantics), Robin Milner (interactive theorem proving, concurrency calculi, and functional programming), and John McCarthy (functional programming and logics in AI). Logic continues to play an important role in computer science and has permeated several of its areas, including artificial intelligence, computational complexity, database systems, and programming languages. The Editorial Board of this journal seeks and hopes to attract high-quality submissions in all the above-mentioned areas of computational logic so that TOCL becomes the standard reference in the field. Both theoretical and applied papers are sought. Submissions showing novel use of logic in computer science are especially welcome.
×
引用
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学术官方微信