{"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}
引用次数: 1
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
期刊介绍:
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.