Summary
We define and investigate constructibility in higher order arithmetics. In particular we get an interpretation ofn-order arithmetic inn-order arithmetic without the scheme of choice such that ∈ and the property “to be a well-ordering” are absolute in it and such that this interpretation is minimal among such interpretations.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
[B-H-P] Boyd, R., Hensel, C., Putman, H.: A recursion-theoretic characterization of the ramified analysis hierarchy. Trans. Amer. Math. Soc.141, 37–62 (1969)
[J] Jakubovič, A.M.: O neprotivorečivosti teorii tipov s axiomoj vybora otnositelno teorii tipov. Dokl. Akad. Nauk SSSR261, 825–828 (1981)
[S] Sochor, A.: Interpretations of the alternative set theory. Arch. Math. Logic32, 391–398 (1993)
[V] Vopenka, P.: Mathematics in the alternative set theory. Leipzig: Teubner Texte 1979