Partial (i.e. unfinished) proofs can be represented by partial proof terms. These are proof terms expressing gaps in incomplete derivations with the help of formal sequents, that is, sequents occurring as proper components of the syntax of proof terms. Our previous paper applied this methodology to intuitionistic propositional logic, to show that focusing in sequent calculus corresponds to intercalation in bidirectional natural deduction. The main goal of this paper is to extend these results to classical logic, using the same methodology. We consider the focused sequent calculus \(LKT\) and a bidirectional natural deduction system with alternative conclusions, \(NKT\) . In the latter system the admissible typing rule for structural substitution is in fact an elimination rule for an implications which is an alternative conclusion.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Proof Search in Classical Propositional Logic with Partial Proof Terms

  • José Espírito Santo,
  • Ana Catarina Sousa

摘要

Partial (i.e. unfinished) proofs can be represented by partial proof terms. These are proof terms expressing gaps in incomplete derivations with the help of formal sequents, that is, sequents occurring as proper components of the syntax of proof terms. Our previous paper applied this methodology to intuitionistic propositional logic, to show that focusing in sequent calculus corresponds to intercalation in bidirectional natural deduction. The main goal of this paper is to extend these results to classical logic, using the same methodology. We consider the focused sequent calculus \(LKT\) and a bidirectional natural deduction system with alternative conclusions, \(NKT\) . In the latter system the admissible typing rule for structural substitution is in fact an elimination rule for an implications which is an alternative conclusion.