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.
Preview
Unable to display preview. Download preview PDF.
References
K. Schütte: Proof Theory. Springer, 1977
G. Jäger, K. Schütte: Eine syntaktische Abrenzung der (δ 11 -CA)-Analysis. In: Bayerische Akademie der Wissenschaften, Sitzungsberichte, Munich, J. 1979, 15–34.
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.
S. Tupailo: Normalization for Ramified Analysis with Hilbert's Epsilon-Symbol, to be published.
Author information
Authors and Affiliations
Editor information
Rights 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