Skip to main content
SpringerLink
Log in

Existence of a degree of extendability of a partially recursive function, which is not a degree of separability

  • Published:
Mathematical notes of the Academy of Sciences of the USSR 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

Literature cited

  1. Yu. T. Medvedev, “Degrees of difficulty of mass problems,” Dokl. Akad. Nauk SSSR,104, 501–504 (1955).

    Google Scholar 

  2. H. Rodgers, Theory of Recursive Functions and Effective Computability, McGraw-Hill (1967).

  3. V. A. Dushskii, “The extension of partially recursive functions and functions with recursive graphs,” Mat. Zametki,5, No. 2, 261–267 (1969).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Brest State University, USSR

    E. Z. Dyment

Authors
  1. E. Z. Dyment
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Matematicheskie Zametki, Vol. 32, No. 1, pp. 83–88, July, 1982.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dyment, E.Z. Existence of a degree of extendability of a partially recursive function, which is not a degree of separability. Mathematical Notes of the Academy of Sciences of the USSR 32, 521–523 (1982). https://doi.org/10.1007/BF01137227

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation