Advertisement

Siberian Mathematical Journal

, Volume 37, Issue 3, pp 436–446 | Cite as

A generalization of selivanov's theorem

  • S. L. Bereznyuk
  • M. V. Gailit
Article

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    V. L. Selivanov, “Two theorems on computable enumerations,” Algebra i Logika,15, No. 4, 470–484 (1976).Google Scholar
  2. 2.
    Yu. L. Ershov, The Theory of Enumerations [in Russian], Nauka, Moscow (1980).Google Scholar
  3. 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. 4.
    V. P. Dobritsa, “Local classes and computable indexings,” Algebra i Logika,26, No. 2, 165–190 (1987).Google Scholar

Copyright information

© Plenum Publishing Corporation 1996

Authors and Affiliations

  • S. L. Bereznyuk
    • 1
  • M. V. Gailit
    • 1
  1. 1.Novosibirsk

Personalised recommendations