Computability pp 227-247 | Cite as

Ordinal Trees and Computable Ordinals

  • Klaus Weihrauch
Part of the EATCS Monographs on Theoretical Computer Science book series (EATCS, volume 9)


In chapter 2.6 we have indicated how appropriate finite path trees can be used for specifying infinite computable production processes. We shall generalize Definition 2.7.5 of trees by also admitting nodes with infinite branching. Such nodes will serve as names for functions with infinitely many arguments such as “\( \mathop {\lim }\limits_{n \to \infty } \)”. For measuring the height of such trees the denumerable ordinal numbers, i.e. the numbers of Cantor’s second number class, are needed. We shall define the effective numberings of the computable trees over the (unrestricted) signature a. As the main application we derive a standard numbering of the computable ordinals. We prove that the computable ordinals can be characterized by total numberings of well-orders for which v(i) ≤ v(j) is decidable. Our approach differs slightly from Kleene’s original one.


Number Class Ordinal Number Order Type Standard Numbering Bibliographical Note 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Klaus Weihrauch
    • 1
  1. 1.FB Mathematik und InformatikFern Universität HagenHagenGermany

Personalised recommendations