Skip to main content
Log in

A proof-theoretic analysis of collection

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract.

By a result of Paris and Friedman, the collection axiom schema for \(\Sigma_{n+1}\) formulas, \(B\Sigma_{n+1}\), is \(\Pi_{n+2}\) conservative over \(I\Sigma_n\). We give a new proof-theoretic proof of this theorem, which is based on a reduction of \(B\Sigma_n\) to a version of collection rule and a subsequent analysis of this rule via Herbrand's theorem. A generalization of this method allows us to improve known results on reflection principles for \(B\Sigma_n\) and to answer some technical questions left open by Sieg [23] and Hájek [9]. We also give a new proof of independence of \(B\Sigma_{n+1}\) over \(I\Sigma_n\) by a direct recursion-theoretic argument and answer an open problem formulated by Gaifman and Dimitracopoulos [8].

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received February 23, 1996

Rights and permissions

Reprints and permissions

About this article

Cite this article

Beklemishev, L. A proof-theoretic analysis of collection. Arch Math Logic 37, 275–296 (1998). https://doi.org/10.1007/s001530050099

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001530050099

Navigation