Skip to main content
Log in

Partial ordering of degrees of alternative m-reducibility

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

Literature Cited

  1. A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka, Moscow (1965).

    Google Scholar 

  2. V. K. Bulitko, “Reducibility by Zhegalkin linear tables,” Sib. Mat. Zh.,21, No. 3, 22–31 (1980).

    Google Scholar 

  3. Yu. L. Ershov, Theory of Numerations [in Russian], Nauka, Moscow (1977).

    Google Scholar 

  4. An. A. Mal'tsev, “The structure of the semilattice of tt1-degrees,” Sib. Mat. Zh.,26, No. 2, 132–140 (1985).

    Google Scholar 

  5. A. H. Lachlan, “Initial segments of many-one degrees,” Can. J. Math.,22, No. 1, 75–85 (1970).

    Google Scholar 

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

Download references

Authors

Additional information

Novosibirsk. Translated from Sibirskii Matematicheskii Zhurnal, Vol. 28, No. 1, pp. 172–181, January–February, 1987.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mal'tsev, A.A. Partial ordering of degrees of alternative m-reducibility. Sib Math J 28, 131–139 (1987). https://doi.org/10.1007/BF00970222

Download citation

  • Received:

  • Issue Date:

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

Navigation