直觉证明逻辑的解析演算

IF 0.6 3区 数学 Q2 LOGIC
Brian Hill, F. Poggiolesi
{"title":"直觉证明逻辑的解析演算","authors":"Brian Hill, F. Poggiolesi","doi":"10.1215/00294527-2019-0008","DOIUrl":null,"url":null,"abstract":"The goal of this paper is to take a step towards the resolution of the problem of finding an analytic sequent calculus for the logic of proofs. For this, we focus on the system Ilp, the intuitionistic version of the logic of proofs. First we present the sequent calculus Gilp that is sound and complete with respect to the system Ilp; we prove that Gilp is cut-free and contraction-free, but it still does not enjoy the subformula property. Then, we enrich the language of the logic of proofs and we formulate in this language a second Gentzen calculus Gilp∗. We show that Gilp∗ is a conservative extension of Gilp, and that Gilp∗ satisfies the subformula property. Keyword cut-elimination, logic of proofs, normalisation, proof sequents 2010 MSC: 03F05, 03B60","PeriodicalId":51259,"journal":{"name":"Notre Dame Journal of Formal Logic","volume":"27 1","pages":"353-393"},"PeriodicalIF":0.6000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An Analytic Calculus for the Intuitionistic Logic of Proofs\",\"authors\":\"Brian Hill, F. Poggiolesi\",\"doi\":\"10.1215/00294527-2019-0008\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The goal of this paper is to take a step towards the resolution of the problem of finding an analytic sequent calculus for the logic of proofs. For this, we focus on the system Ilp, the intuitionistic version of the logic of proofs. First we present the sequent calculus Gilp that is sound and complete with respect to the system Ilp; we prove that Gilp is cut-free and contraction-free, but it still does not enjoy the subformula property. Then, we enrich the language of the logic of proofs and we formulate in this language a second Gentzen calculus Gilp∗. We show that Gilp∗ is a conservative extension of Gilp, and that Gilp∗ satisfies the subformula property. Keyword cut-elimination, logic of proofs, normalisation, proof sequents 2010 MSC: 03F05, 03B60\",\"PeriodicalId\":51259,\"journal\":{\"name\":\"Notre Dame Journal of Formal Logic\",\"volume\":\"27 1\",\"pages\":\"353-393\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2019-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Notre Dame Journal of Formal Logic\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1215/00294527-2019-0008\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"LOGIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Notre Dame Journal of Formal Logic","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1215/00294527-2019-0008","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"LOGIC","Score":null,"Total":0}
引用次数: 1

摘要

本文的目标是朝着寻找证明逻辑的解析序列演算问题的解决迈出一步。为此,我们关注系统Ilp,证明逻辑的直觉主义版本。首先,我们给出了关于系统Ilp的完备的序贯演算;我们证明了Gilp是无切割和无收缩的,但它仍然不具有子公式性质。然后,我们丰富了证明逻辑的语言,并在这种语言中表述了第二个根岑微积分Gilp *。证明了Gilp∗是Gilp的保守扩展,并且Gilp∗满足子公式性质。关键词切消,证明逻辑,归一化,证明序列2010 MSC: 03F05, 03B60
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Analytic Calculus for the Intuitionistic Logic of Proofs
The goal of this paper is to take a step towards the resolution of the problem of finding an analytic sequent calculus for the logic of proofs. For this, we focus on the system Ilp, the intuitionistic version of the logic of proofs. First we present the sequent calculus Gilp that is sound and complete with respect to the system Ilp; we prove that Gilp is cut-free and contraction-free, but it still does not enjoy the subformula property. Then, we enrich the language of the logic of proofs and we formulate in this language a second Gentzen calculus Gilp∗. We show that Gilp∗ is a conservative extension of Gilp, and that Gilp∗ satisfies the subformula property. Keyword cut-elimination, logic of proofs, normalisation, proof sequents 2010 MSC: 03F05, 03B60
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.00
自引率
14.30%
发文量
14
审稿时长
>12 weeks
期刊介绍: The Notre Dame Journal of Formal Logic, founded in 1960, aims to publish high quality and original research papers in philosophical logic, mathematical logic, and related areas, including papers of compelling historical interest. The Journal is also willing to selectively publish expository articles on important current topics of interest as well as book reviews.
×
引用
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学术官方微信