Skip to main content
Log in

Relations between table-type degrees

  • 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

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

Instant access to the full article PDF.

Literature cited

  1. V. K. Bulitko, "Reducibility with Zhegalkin linear tables," Sib. Mat. Zh.,21, No. 3, 23–31 (1980).

    Google Scholar 

  2. A. N. Degtev, "Hypersimple sets with retraceable complements," Algebra Logika,10, No. 3, 235–246 (1971).

    Google Scholar 

  3. A. N. Degtev, "Ontt- andm-degrees," Algebra Logika,12, No. 2, 143–161 (1973).

    Google Scholar 

  4. A. N. Degtev, "Three theorems ontt -degrees," Algebra Logika,17, No. 2, 134–143 (1978).

    Google Scholar 

  5. A. N. Degtev, "Some results on upper semilattices andm-degrees," Algebra Logika,18, No. 6, 664–679 (1979).

    Google Scholar 

  6. A. N. Degtev, "Relations between complete sets," Izv. Vyssh. Uchebn. Zaved., Mat., No. 5, 26–31 (1981).

  7. A. N. Degtev, "A comparison of linear reducibility with different table-type reducibilities," Algebra Logika,21, No. 5, 511–529 (1982).

    Google Scholar 

  8. S. S. Marchenkov, "Recursively enumerable minimalBtt-degrees," Mat. Sb.,103, No. 4, 550–562 (1977).

    Google Scholar 

  9. C. Jockusch, "Relationships between reducibilities," Trans. Am. Math. Soc.,142, No. 1, 229–237 (1969).

    Google Scholar 

Download references

Authors

Additional information

Translated from Algebra i Logika, Vol. 22, No. 1, pp. 35–52, January–February, 1983.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Degtev, A.N. Relations between table-type degrees. Algebra and Logic 22, 26–39 (1983). https://doi.org/10.1007/BF01979647

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation