Skip to main content

On a proof-theoretical analysis of Σ 11 -AC, Σ 11 -DC and Δ 11 -CA

  • Conference paper
  • First Online:
Logic Programming and Automated Reasoning (LPAR 1994)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 822))

  • 130 Accesses

Abstract

We present a simple method of embedding of δ 11 -CA, σ 11 -AC and σ 11 -DC into \(RA_{\varepsilon _0 } ,(RA + PAC)_{\varepsilon _0 }\), and \((RA + PDC)_{\varepsilon _0 }\) respectively, where PAC is Predicative Axiom of Choice and PDC is Predicative Axiom of Dependent Choice, These ramified systems are known to have proof-theoretic ordinals Φε 00, which in the case of PAC and PDC can be proved by normalization of Ramified Analysis with Hilbert's epsilon-symbol. In all cases (particularly, of δ 11 -CA) our embedding is straightforward and avoids any intermediate steps (like σ 11 -Reflection), which was always the case before.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Schütte: Proof Theory. Springer, 1977

    Google Scholar 

  2. G. Jäger, K. Schütte: Eine syntaktische Abrenzung der (δ 11 -CA)-Analysis. In: Bayerische Akademie der Wissenschaften, Sitzungsberichte, Munich, J. 1979, 15–34.

    Google Scholar 

  3. S. Tupailo: Normalization for Arithmetical Comprehension with Restricted Occurrences of Hilbert's Epsilon Symbol, Eesti TA Toimetised, Füüsika-Matemaatika, kd. 42, nr. 4, 1993, lk. 289–299.

    Google Scholar 

  4. S. Tupailo: Normalization for Ramified Analysis with Hilbert's Epsilon-Symbol, to be published.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Frank Pfenning

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tupailo, S. (1994). On a proof-theoretical analysis of Σ 11 -AC, Σ 11 -DC and Δ 11 -CA. In: Pfenning, F. (eds) Logic Programming and Automated Reasoning. LPAR 1994. Lecture Notes in Computer Science, vol 822. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58216-9_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-58216-9_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58216-8

  • Online ISBN: 978-3-540-48573-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics