Meaning and identity of proofs in a bilateralist setting: A two-sorted typed Lambda-calculus for proofs and refutations

IF 0.7 4区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Sara Ayhan
{"title":"Meaning and identity of proofs in a bilateralist setting: A two-sorted typed Lambda-calculus for proofs and refutations","authors":"Sara Ayhan","doi":"10.1093/logcom/exae014","DOIUrl":null,"url":null,"abstract":"In this paper, I will develop a $\\lambda $-term calculus, $\\lambda ^{2Int}$, for a bi-intuitionistic logic and discuss its implications for the notions of sense and denotation of derivations in a bilateralist setting. Thus, I will use the Curry–Howard correspondence, which has been well-established between the simply typed $\\lambda $-calculus and natural deduction systems for intuitionistic logic, and apply it to a bilateralist proof system displaying two derivability relations, one for proving and one for refuting. The basis will be the natural deduction system of Wansing’s bi-intuitionistic logic 2Int, which I will turn into a term-annotated form. Therefore, we need a type theory that extends to a two-sorted typed $\\lambda $-calculus. I will present such a term-annotated proof system for 2Int and prove a Dualization Theorem relating proofs and refutations in this system. On the basis of these formal results, I will argue that this gives us interesting insights into questions about sense and denotation as well as synonymy and identity of proofs from a bilateralist point of view.","PeriodicalId":50162,"journal":{"name":"Journal of Logic and Computation","volume":"108 1","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2024-04-02","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/exae014","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, I will develop a $\lambda $-term calculus, $\lambda ^{2Int}$, for a bi-intuitionistic logic and discuss its implications for the notions of sense and denotation of derivations in a bilateralist setting. Thus, I will use the Curry–Howard correspondence, which has been well-established between the simply typed $\lambda $-calculus and natural deduction systems for intuitionistic logic, and apply it to a bilateralist proof system displaying two derivability relations, one for proving and one for refuting. The basis will be the natural deduction system of Wansing’s bi-intuitionistic logic 2Int, which I will turn into a term-annotated form. Therefore, we need a type theory that extends to a two-sorted typed $\lambda $-calculus. I will present such a term-annotated proof system for 2Int and prove a Dualization Theorem relating proofs and refutations in this system. On the basis of these formal results, I will argue that this gives us interesting insights into questions about sense and denotation as well as synonymy and identity of proofs from a bilateralist point of view.
双边主义环境中证明的意义和特性:用于证明和反驳的双排序类型 Lambda 微积分
在本文中,我将为双直觉主义逻辑开发一种$\lambda $项微积分,即$\lambda ^{2Int}$,并讨论它对双边主义环境中派生的意义和指称概念的影响。因此,我将使用在简单类型的 $\lambda $ 微积分与直觉主义逻辑的自然演绎法系统之间建立起来的柯里-霍华德对应关系,并将其应用于显示两种可推导性关系(一种用于证明,一种用于反驳)的双边主义证明系统。我们将以万兴的双直觉主义逻辑 2Int 的自然演绎系统为基础,并将其转化为术语注释形式。因此,我们需要一个能扩展到双排序类型$\lambda $算子的类型理论。我将为 2Int 提出这样一个术语注释的证明系统,并证明这个系统中有关证明和反驳的二元化定理。在这些形式化结果的基础上,我将论证,从双边主义的角度来看,这给我们带来了关于意义和指称以及同义和同一性证明问题的有趣见解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
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学术官方微信