Analysis and Extension of Omega-Rule
R. Akiyoshi, G. Mints

TL;DR
This paper extends the Omega-rule to achieve complete cut-elimination in second-order arithmetic systems, providing an ordinal-free proof and analyzing the rule in terms of standard rules for second-order quantifiers.
Contribution
It introduces an extension of the Omega-rule that enables full cut-elimination for systems with second-order quantifiers, connecting finite derivation reductions to standard cut-reduction steps.
Findings
Achieves complete cut-elimination using extended Omega-rule.
Provides an analysis of Omega-rule in terms of standard rules.
Demonstrates the generation of cut-reduction steps for infinitary derivations.
Abstract
-rule was introduced by W. Buchholz to give an ordinal-free cut-elimination proof for a subsystem of analysis with -comprehension. His proof provides cut-free derivations by familiar rules only for arithmetical sequents. When second-order quantifiers are present, they are introduced by -rule and some residual cuts are not eliminated. Using an extension of -rule we obtain (by the same method as W. Buchholz) complete cut-elimination: any derivation of arbitrary sequent is transformed into its cut-free derivation by the standard rules (with induction replaced by -rule). W. Buchholz used -rule to explain how reductions of finite derivations (used by G. Takeuti for subsystems of analysis) are generated by cut-elimination steps applied to derivations with -rule. We show that the same steps generate standard cut-reduction steps for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Logic, Reasoning, and Knowledge · Advanced Algebra and Logic
