Scholarlink

We formalize a sequent calculus mG3 for multi-sequents. Our multi-sequent is a sequence of the usual sequents representing successive applications of the cut-rule. Proof-reduction rules for eliminating the cut-rule are represented as proof-construction rules in mG3. Cut-eliminability is then characterized by provability in mG3.

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

Proof Construction Style Representation of Cut-Elimination

  • 章节

  • 发表日期：

    2026年

查看全文
  • Ryo Takemura

摘要

We formalize a sequent calculus mG3 for multi-sequents. Our multi-sequent is a sequence of the usual sequents representing successive applications of the cut-rule. Proof-reduction rules for eliminating the cut-rule are represented as proof-construction rules in mG3. Cut-eliminability is then characterized by provability in mG3.