A dual-context sequent calculus for the constructive modal logic S4

MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE(2022)

引用 0|浏览0
暂无评分
摘要
The proof theory of the constructive modal logic S4 (hereafter $\mathsf{CS4}$ ) has been settled since the beginning of this century by means of either standard natural deduction and sequent calculi or by the reconstruction of modal logic through hypothetical and categorical judgments a la Martin-Lof, an approach carried out by using a special kind of sequents, which keeps two separated contexts representing ordinary and enhanced hypotheses, intuitively interpreted as true and valid assumptions. These so-called dual-context sequents, originated in linear logic, are used to define a natural deduction system handling judgments of validity, truth, and possibility, resulting in a formalism equivalent to an axiomatic system for $\mathsf{CS4}$ . However, this proof-theoretical study of $\mathsf{CS4}$ lacks, to the best of our knowledge, its third fundamental constituent, namely a sequent calculus. In this paper, we define such a dual-context formalism, called ${\bf DG_{CS4}}$ , and provide detailed proofs of the admissibility for the ordinary cut rule as well as the elimination of a second cut rule, which manipulates enhanced hypotheses. Furthermore, we make available a formal verification of the equivalence of this proposal with the previously defined axiomatic and dual-context natural deduction systems for $\mathsf{CS4}$ , using the Coq proof-assistant.
更多
查看译文
关键词
Constructive modal logic,sequent calculus,dual-context systems,cut elimination,formal verification,Coq
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要