Skip to main content
SpringerLink
Log in

Minimal 1-degrees and truth-table reducibility

  • 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

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, “Positive equivalences,” Algebra i Logika,10, No. 6, 620–650 (1971).

    Google Scholar 

  2. A. H. Lachlan, “Two theorems on many-one degrees of recursively enumerable sets,” Algebra i Logika,11, No. 2, 216–229 (1972).

    Google Scholar 

Download references

Authors
  1. A. N. Degtev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Sibirskii Matematicheskii Zhurnal, Vol. 17, No. 5, pp. 1014–1022, September–October. 1976.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Degtev, A.N. Minimal 1-degrees and truth-table reducibility. Sib Math J 17, 751–757 (1976). https://doi.org/10.1007/BF00966373

Download citation

  • Received:

  • Issue Date:

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

Search

Navigation