Summary
This paper gives a recursive generalization of a strong notation system of ordinals, which was devellopped by Jäger [3]. The generalized systemT(V′) is based on a hierarchy of Veblen-functions for inaccessible ordinals. The definition ofT(V′) assumes the existence of a weak Mahlo-ordinal. The wellordering ofT(V′) is provable in a formal system of second order arithmetic with the axiom schema ofΠ 12 -comprehension in a similar way, as it is proved in [6] for the weaker notation systemT(V′).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literatur
Buchholz, W.: Kollabierungsfunktionen. Vortrag München 1982
Drake, F.R.: Set theory. An introduction to large cardinals. Amsterdam: Elsevier, North-Holland 1974
Jäger, G.:ϱ-inaccessible ordinals, collapsing functions and a recursive notation system. Arch. Math. Logik24, 49–62 (1984)
Schütte, K.: Kennzeichnung von Ordnungszahlen durch rekursiv erklärte Funktionen. Math. Ann.127, 16–32 (1954)
Schütte, K.: Majorisierungsrelationen und Fundamentalfolgen eines Ordinalzahlensystems von G. Jäger. Arch. Math. Logik26, 29–55 (1986/87)
Schütte, K.: Ein Wohlordnungsbeweis für das OrdinalzahlensystemT(V′). Arch. Math. Logik27, 5–20 (1988)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Schütte, K. Eine ErweiterungT(V′) des Ordinalzahlensystems 58-0158-0158-01(Λ0) von G. Jäger. Arch Math Logic 27, 85–99 (1988). https://doi.org/10.1007/BF01625837
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01625837