Recursively Mahlo Ordinals and Inductive Definitions

TLDR: A characterization of recursively Mahlo ordinals and inductive definitions is given in this article, and a characterization of the first recursive hyper-Mahlo ordinal is provided.

Abstract: Publisher Summary 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.