Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy

Journal of Symbolic Logic 37 (2):281-292 (1972)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272973

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,716

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Axt Paul. Enumeration and the Grzegorczyk hierarchy. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, Bd. 9 , S. 53–65. [REVIEW]Rózsa Péter - 1965 - Journal of Symbolic Logic 30 (1):90-91.
John R. Steel and W. Hugh Woodin, HOD as a core model, Ordinal Definability and Recursion Theory: The Cabal Seminar, vol. III (A. S. Kechris, B. Löwe, and J. R. Steel, editors), Lecture Notes in Logic 43, Association for Symbolic Logic and Cambridge University Press, 2016, pp. 257–343. [REVIEW]Ernest Schimmerling - 2016 - Bulletin of Symbolic Logic 22 (4):521-524.
Enumeration and the Grzegorczyk Hierarchy.Paul Axt - 1965 - Journal of Symbolic Logic 30 (1):90-91.
Herbrand analyses.Wilfried Sieg - 1991 - Archive for Mathematical Logic 30 (5-6):409-441.
Some Hierarchies of Primitive Recursive Functions on Term Algebras.Klaus-Hilmar Sprenger - 1997 - Mathematical Logic Quarterly 43 (2):251-286.
Ordinal analysis of simple cases of bar recursion.W. A. Howard - 1981 - Journal of Symbolic Logic 46 (1):17-30.
Recursion in Kolmogorov's R-operator and the ordinal σ3.Thomas John - 1986 - Journal of Symbolic Logic 51 (1):1-11.
Grzegorczyk A.. Elementarily definable analysis. Fundamenta mathematicae, Bd. 41 Heft 2 , S. 311–338.Paul Lorenzen - 1958 - Journal of Symbolic Logic 23 (4):444-445.
Kleene S. C.. On notation for ordinal numbers.Rózsa Péter - 1939 - Journal of Symbolic Logic 4 (2):93-94.
M. D. Gladstone. A reduction of the recursion scheme. The journal of symbolic logic, Bd. 32 , S. 505–508.Rozsa Peter - 1970 - Journal of Symbolic Logic 35 (4):591.

Analytics

Added to PP
2009-01-28

Downloads
67 (#345,674)

6 months
14 (#237,366)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Proof theory and ordinal analysis.W. Pohlers - 1991 - Archive for Mathematical Logic 30 (5-6):311-376.
Ackermann’s substitution method.Georg Moser - 2006 - Annals of Pure and Applied Logic 142 (1):1-18.
Subsystems of true arithmetic and hierarchies of functions.Z. Ratajczyk - 1993 - Annals of Pure and Applied Logic 64 (2):95-152.
Czego informatycy nauczyli się od Andrzeja Grzegorczyka?Andrzej Salwicki - 2012 - Studies in Logic, Grammar and Rhetoric 27 (40).

Add more citations

References found in this work

Eine Klassifikation der ε 0 ‐Rekursiven Funktionen.Helmut Schwichtenberg - 1971 - Mathematical Logic Quarterly 17 (1):61-74.
A classification of the ordinal recursive functions.S. S. Wainer - 1970 - Archive for Mathematical Logic 13 (3-4):136-153.
Hierarchies of number-theoretic functions. I.M. H. Löb & S. S. Wainer - 1970 - Archive for Mathematical Logic 13 (1-2):39-51.

Add more references