Abstract
In Chapter 2.2 we have defined how a numbering v of a set S induces a computability theory on the set S. We have shown that the numbering v of a set S is determined uniquely (up to equivalence) by the computability theory induced by it (Lemma 2.2.8, Conclusion 2.2.9). In this chapter we shall study for which effectivity conditions numberings satisfying these conditions exist. As a main result we shall show that for sets which are defined as closures numberings defined via generation trees are natural.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Weihrauch, K. (1987). Effective Numberings. In: Computability. EATCS Monographs on Theoretical Computer Science, vol 9. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-69965-8_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-69965-8_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-69967-2
Online ISBN: 978-3-642-69965-8
eBook Packages: Springer Book Archive