Skip to main content
SpringerLink
Log in

A generalization of selivanov's theorem

  • Published:
Siberian Mathematical Journal Aims and scope Submit manuscript

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

References

  1. V. L. Selivanov, “Two theorems on computable enumerations,” Algebra i Logika,15, No. 4, 470–484 (1976).

    Google Scholar 

  2. Yu. L. Ershov, The Theory of Enumerations [in Russian], Nauka, Moscow (1980).

    Google Scholar 

  3. S. L. Bereznyuk, “On the number of nonequivalent computable indexings of a fixed family of sets,” Algebra i Logika,32, No. 1, 34–44 (1993).

    Google Scholar 

  4. V. P. Dobritsa, “Local classes and computable indexings,” Algebra i Logika,26, No. 2, 165–190 (1987).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Novosibirsk

    S. L. Bereznyuk & M. V. Gailit

Authors
  1. S. L. Bereznyuk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. V. Gailit
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research is supported by the International Science Foundation(Grant NQ 6000) and the Russian Foundation for Basic Research (Grant 96-01-16014).

Translated fromSibirskii Matematicheskii Zhurnal, Vol. 37, No. 3, pp. 506–518, May–June, 1996.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bereznyuk, S.L., Gailit, M.V. A generalization of selivanov's theorem. Sib Math J 37, 436–446 (1996). https://doi.org/10.1007/BF02104845

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02104845

Search

Navigation