Skip to main content
Log in

Subfamilies of special elements of complete numberings

  • Published:
Algebra and Logic Aims and scope

Abstract

Any subfamily of a given at most countable non-empty family can be converted into a set of all special elements of a suitable numbering.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Yu. L. Ershov, Numeration Theory [in Russian], Nauka, Moscow (1977).

    Google Scholar 

  2. S. A. Badaev, S. S. Goncharov, and A. Sorbi, “Completeness and universality of arithmetical numberings,” in Computability and Models, S. B. Cooper and S. S. Goncharov (eds.), Kluwer Academic/Plenum Publishers, New York (2003), pp. 11–44.

    Google Scholar 

  3. Yu. L. Ershov, “On a hierarchy of sets II,” Algebra Logika, 7, No. 1, 15–47 (1968).

    MathSciNet  Google Scholar 

  4. S. D. Denisov and I. A. Lavrov, “Complete numberings with infinitely many special elements,” Algebra Logika, 9, No. 5, 503–509 (1970).

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

__________

Translated from Algebra i Logika, Vol. 45, No. 6, pp. 758–764, November–December, 2006.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Khisamiev, Z.G. Subfamilies of special elements of complete numberings. Algebr Logic 45, 431–434 (2006). https://doi.org/10.1007/s10469-006-0039-y

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10469-006-0039-y

Keywords

Navigation