Skip to main content
SpringerLink
Log in

Hereditary sets and tabular reducibility

  • 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. I. A. Lavrov, "Answer to a question of P. R. Yang," Algebra i Logika,7, No. 2, 48–54 (1968).

    Google Scholar 

  2. J. C. E. Dekker and J. Myhill, "Retraceable sets," Canad. J. Math.,10, 357–373 (1958).

    Google Scholar 

  3. C. Jockush, "Semirecursive sets and positive reducibility," Trans. Amer. Math. Soc.,131, 420–436 (1968).

    Google Scholar 

  4. C. Jockusch, "Relationships between reducibilities," Trans. Amer. Math. Soc.,142, 229–237 (1969).

    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 Algebra i Logika, Vol. 11, No. 3, pp. 257–269, May–June, 1972.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Degtev, A.N. Hereditary sets and tabular reducibility. Algebr Logic 11, 145–152 (1972). https://doi.org/10.1007/BF02218609

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation