English

Analysis and Extension of Omega-Rule

Logic 2011-03-15 v2

Abstract

Ω\Omega-rule was introduced by W. Buchholz to give an ordinal-free cut-elimination proof for a subsystem of analysis with Π11\Pi^{1}_{1}-comprehension. His proof provides cut-free derivations by familiar rules only for arithmetical sequents. When second-order quantifiers are present, they are introduced by Ω\Omega-rule and some residual cuts are not eliminated. Using an extension of Ω\Omega-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 ω\omega-rule). W. Buchholz used Ω\Omega-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 Ω\Omega-rule. We show that the same steps generate standard cut-reduction steps for infinitary derivations with familiar standard rules for second-order quantifiers. This provides an analysis of Ω\Omega-rule in terms of standard rules and ordinal-free cut-elimination proof for the system with the standard rules for second-order quantifiers. In fact we treat the subsystem of Π11\Pi^{1}_{1}-CA (of the same strength as ID1ID_{1}) that W. Buchholz used for his explanation of finite reductions. Extension to full Π11\Pi^{1}_{1}-CA is forthcoming in another paper.

Cite

@article{arxiv.0904.4742,
  title  = {Analysis and Extension of Omega-Rule},
  author = {R. Akiyoshi and G. Mints},
  journal= {arXiv preprint arXiv:0904.4742},
  year   = {2011}
}
R2 v1 2026-06-21T12:56:42.544Z