An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Yiannis N. Moschovakis. Elementary induction on abstract structures. Studies in logic and the foundations of mathematics, vol. 77. North-Holland Publishing Company, Amsterdam and London, and American Elsevier Publishing Company, Inc., New York, 1974, x + 218 pp. - Volume 44 Issue 1
An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
This chapter discusses the recursively Mahlo ordinals and inductive definitions. A characterization of the first recursively Mahlo ordinal and the first recursively hyper-Mahlo ordinalis provided. The large countable ordinals are obtained as the closure ordinals of inductive definitions. Inductive definitions play a central role in hierarchy theory. A classic example is the theory of recursive ordinals. The usual systems of notations for the recursive ordinals are inductively defined by very simple (arithmetic) operations. A version of the Candy theorem on the existence of selection operators is the basic tool. A typical system is defined by an inductive definition consisting of several cases, depending on whether the ordinal reached at a given stage was zero, a successor, notationally singular, and notationally regular.
T. G. McLaughlin. Some remarks on extensibility, confluence of paths, branching properties, and index sets, for certain recursively enumerable graphs. Illinois journal of mathematics, vol. 11 (1967), pp. 257–279. - Volume 34 Issue 3
In [11] the constructive ordinals were extended to constructive finite number classes by using systems of notations where mappings at limit ordinals are just partial recursive functions. It turned out that these systems are equivalent, both in terms of ordinals represented and the forms of the sets of notations, to extensions obtained by using mappings at limit ordinals which are partial recursive in (sets of notations for) previously defined number classes. In this article these results are extended to constructive transfinite number classes. We present a system (F, ||) which, in terms of our analogy with the classical ordinals, provides notations for the ordinals less than the first “constructively inaccessible” ordinal, and show that the above equivalence holds at least this far.
Gaisi Takeuti and Akiko Kino. On hierarchies of predicates of ordinal numbers. Journal of the Mathematical Society of Japan, vol. 14 (1962), pp. 199–232. - Akiko Kino and Gaisi Takeuti. A note on predicates of ordinal numbers. Journal of the Mathematical Society of Japan, vol. 14 (1962), pp. 367–378. - Volume 33 Issue 2
Hilary Putnam. Uniqueness ordinals in higher constructive number classes. Essays on the foundations of mathematics, dedicated to A. A. Fraenkel on his seventieth anniversary, edited by Y. Bar-Hillel, E. I. J. Poznanski, M. O. Rabin, and A. Robinson for The Hebrew University of Jerusalem, Magnes Press, Jerusalem 1961, and North-Holland Publishing Company, Amsterdam1962, pp. 190–206. - Volume 31 Issue 1
An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.