paperbot · PL 论文追踪

全部论文 待读 收藏

P2 A Constructive Logic with Classical Proofs and Refutations

一种带经典证明与反驳的构造性逻辑
LICS 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)2021匹配度 2/10 · 该论文属于纯证明论/类型系统与形式语义研究,未涉及用户核心关注点的静态分析、LLM/Agent、浮点程序分析或贝叶斯程序分析;仅与PL形式化理论有边缘关联,不匹配其交叉方向。引用 0 inbox
Pablo Barenbaum, Teodoro Freund
crossref: 2026-09-12

AI 速览

一句话:提出区分肯定/否定与强/经典四模态的经典命题逻辑保守扩张,并给出自然演绎、Kripke语义与项赋值系统。

该文研究经典命题逻辑的一个保守扩张,其核心是区分四种陈述模态:命题可被肯定或否定,且可为强命题或经典命题。强命题的证明在某种意义上必须是构造性的,而经典命题的证明可借助反证法。系统采用自然演绎风格,作者证明其相对一个 Kripke 语义是可靠且完备的。随后从命题即类型对应出发,给出项赋值系统,并证明归约的合流性;强规范化证明通过翻译到带 Mendler 式递归的 System F 来完成。该工作为同时容纳构造性证明与经典证明/反驳的逻辑提供了统一的证明论与类型论框架。

问题
如何在一个逻辑系统中统一构造性证明与经典证明/反驳,并使其成为经典命题逻辑的保守扩张。
方法
定义区分肯定/否定与强/经典四种模态的自然演绎系统,给出 Kripke 语义,并从命题即类型对应出发建立项赋值系统;强规范化通过翻译到带 Mendler 式递归的 System F 证明。
评估
通过可靠性与完备性定理、归约的合流性以及强规范化证明进行理论评估。
原文摘要(Abstract)

We study a conservative extension of classical propositional logic distinguishing between four modes of statement: a proposition may be affirmed or denied, and it may be strong or classical. Proofs of strong propositions must be constructive in some sense, whereas proofs of classical propositions proceed by contradiction. The system, in natural deduction style, is shown to be sound and complete with respect to a Kripke semantics. We develop the system from the perspective of the propositions-as-types correspondence by deriving a term assignment system with confluent reduction. The proof of strong normalization relies on a translation to System F with Mendler-style recursion.

链接与引用

DOI 原文 ·

BibTeX
@inproceedings{paperbot6229,
  title = {A Constructive Logic with Classical Proofs and Refutations},
  author = {Pablo Barenbaum and Teodoro Freund},
  booktitle = {LICS},
  year = {2021},
  doi = {10.1109/lics52264.2021.9470649}
}