Skip to main content
SpringerLink
Log in

Classes with pairwise equivalent enumerations

  • Conference paper
  • First Online:
Logical Foundations of Computer Science (LFCS 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 813))

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. Rogers, H. jr. Gödel numberings of partial recursive functions. J. Symb. Logic, v.23, n.3(1958), 331–341.

    Google Scholar 

  2. Pour-El, M. B. Gödel numberings versus Friedberg numberings. Proc. Amer. Math. Soc., v.15, n.2(1964), 252–255.

    Google Scholar 

  3. Ershov, Yu. L. Numerations of families of general recursive functions. Sibirsk. Matem. Zhurn., v.8, n.5(1967), 1015–1025 (Russian).

    Google Scholar 

  4. Ershov, Yu. L. The theory of numberings. Nauka, Moscow, 1977 (Russian).

    Google Scholar 

  5. Lavrov, I. A. Computable numberings. Logic, Foundations of Mathematics and Computability Theory, pp.195–206, D. Reidel Publishing Company, Dordrecht-Holland, 1977.

    Google Scholar 

  6. Mal'cev, A. I. Positive and negative enumerations. Soviet Math. Dokl., v.6(1965), 75–77.

    Google Scholar 

  7. V'jugin, V. V. Certain examples of upper semilattice of computable numerations. Algebra and Logic, v.12, n.5(1973), 287–296.

    Google Scholar 

  8. Selivanov. V. L. The numerations of families of general recursive functions. Algebra and Logic, v.15(1976), 128–141.

    Google Scholar 

  9. Badaev, S. A. On computable enumerations of the families of total recursive functions. Algebra and Logic, v.16, n.2(1977), 83–98.

    Google Scholar 

  10. Goncharov, S. S. Positive computable enumerations. Doklady Akademii Nauk (of Russia), v.332, n.2(1993), 142–143 (Russian).

    Google Scholar 

Download references

Authors
  1. S. S. Goncharov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. A. Badaev
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Anil Nerode Yu. V. Matiyasevich

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goncharov, S.S., Badaev, S.A. (1994). Classes with pairwise equivalent enumerations. In: Nerode, A., Matiyasevich, Y.V. (eds) Logical Foundations of Computer Science. LFCS 1994. Lecture Notes in Computer Science, vol 813. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58140-5_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-58140-5_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58140-6

  • Online ISBN: 978-3-540-48442-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation