Skip to main content
SpringerLink
Log in

Two theorems on computable numberings

  • Published:
Algebra and Logic Aims and scope

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

Literature Cited

  1. Yu. L. Ershov, “Hyper-hypersimplem-powers,” Algebra Logika,8, No. 5, 523–552 (1969).

    Google Scholar 

  2. S. S. Marchenkov, “On computable numberings of families of general recursive functions,” Algebra Logika,11, No. 5, 586–607 (1972).

    Google Scholar 

  3. I. A. Lavrov, “Computable numberings,” Fifth Internat. Congr. Logic Methodology Philosophy of Science, Contributed Papers, Canada (1975).

  4. Yu. L. Ershov, “Numberings of families of general recursive functions,” Sib. Mat. Zh.,8, No. 5, 1015–1025 (1967).

    Google Scholar 

  5. Yu. L. Ershov, Theory of Numberings [in Russian], Vol. I, Novosibirsk (1969).

  6. H. Rogers, Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill (1967).

  7. Yu. L. Ershov, Theory of Numberings [in Russian], Vol. II, Novosibirsk (1973).

  8. I. A. Lavrov, “Certain properties of the retracts of a Post numbering,” Algebra Logika,13, No. 6, 662–675 (1974).

    Google Scholar 

Download references

Authors
  1. V. L. Selivanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Algebra i Logika, Vol. 15, No. 4, pp. 470–484, July–August, 1976.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Selivanov, V.L. Two theorems on computable numberings. Algebra and Logic 15, 297–306 (1976). https://doi.org/10.1007/BF01875946

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation