scientific article; zbMATH DE number 4016884

From MaRDI portal
Publication:3028996





[For the entire collection see Zbl 0566.00001.] Any ordinal can be constructed as direct limit of the partially ordered systems of all of its finite embeddings. For countable ordinals we may extract subsystems which are ordered by integers. They induce well- orderings with natural choices of fundamental sequences. The subrecursive hierarchy defined over the well-ordering is called slow-growing hierarchy. This paper concerns the relation among the slow-growing hierarchy and the ordinals it represents as direct limit. Giving a notion of recursive definability of ordinals it investigates the ordinals thus associated with some recursive classes. The notion is then used to define a large subrecursive class by recursion over well-orderings. The primitive recursive functors and ordinals and subrecursive classes of functors and ordinals are discussed together with properties and relations among them.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3028996)