Skip to main content
Log in

On Reducibility of Partial Recursive Functions

  • 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

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

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Dëgtev A. N., “On reducibility of enumerations,” Mat. Sb., 112, No. 2, 207–219 (1980).

    Google Scholar 

  2. Dëgtev A. N., “Reducibility of partial recursive functions. I,” Sibirsk. Mat. Zh., 16, No. 5, 970–988 (1975).

    Google Scholar 

  3. Dëgtev A. N., “Reducibility of partial recursive functions. II,” Sibirsk. Mat. Zh., 17, No. 4, 765–744 (1977).

    Google Scholar 

  4. Jockusch C. G., “Semirecursive sets and positive reducibility,” Trans. Amer. Math. Soc., 131, No. 2, 420–436 (1968).

    Google Scholar 

  5. Dëgtev A. N., “On multiple positive reducibility,” Sibirsk. Mat. Zh., 34, No. 2, 74–76 (1993).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dëgtev, A.N., Sakunova, E.S. On Reducibility of Partial Recursive Functions. Siberian Mathematical Journal 41, 1111–1114 (2000). https://doi.org/10.1023/A:1004820220189

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1004820220189

Keywords

Navigation