This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Yu. L. Ershov,Theory of Enumerations [in Russian], Nauka, Moscow (1980).
R. I. Soare,Recursively Enumerable Sets and Degrees, Springer, Berlin (1987).
H. Rogers,Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).
Translated fromAlgebra i Logika, Vol. 32, No. 1, pp. 34–44, January–February, 1993.
Translated by A. Morozov
About this article
Cite this article
Bereznyuk, S.L. The number of nonequivalent computable indexations for a fixed family of sets. Algebr Logic 32, 17–23 (1993). https://doi.org/10.1007/BF02260928
- Mathematical Logic
- Computable Indexation
- Fixed Family