🤖 AI Summary
本文提出了一种新的简化证明方法，用于直觉主义自然演绎的弱规范化问题，该方法仅使用切割规则，并提供了确定缩减子证明或整个证明的具体局部规则。
📝 Abstract
We present a new proof of weak normalization for intuitionistic natural deduction. The distinguishing features of this proof are that it works only with cuts rather than cut segments, provides explicit local rules for determining whether to contract a whole proof or reduce one of its subproofs, and in the latter case, which subproof to reduce. We also discuss a formalization of the entire proof in Lean, and present a deterministic algorithm for weak normalization.