Literature cited
V. K. Bulitko, "Reducibility by Zhelankin tables," Sib. Mat. Zh.,21, No. 3, 23–31 (1980).
A. N. Degtev, "Hypersimple sets with retraced complements," Algebra Logika,10, No. 3, 235–246 (1971).
A. N. Degtev, "Some results on upper semilattices and m-degrees," Algebra Logika,18, No. 6, 664–679 (1979).
A. N. Degtev, "Relations between complete sets," Izv. Vyssh. Uchebn. Zaved., Mat., No. 5, 50–55 (1980).
A. N. Degtev, "A comparison of linear reducibility with other table-type reducibilities," Algebra Logika,21, No. 5, 511–529 (1982).
A. N. Degtev, "Relations between degrees of table type," Algebra Logika,22, No. 1, 35–52 (1983).
G. N. Kobzev, "The complete btt-degree," Algebra Logika,13, No. 1, 22–25 (1974).
S. S. Marchenkov, "Recursively enumerable minimal btt-degrees," Mat. Sb.,103, No. 4, 550–562 (1977).
A. H. Lachlan, "A note on universal sets," J. Symbolic Logic,31, No. 4, 573–574 (1966).
C. E. M. Yates, "Recursively enumerable sets and retracing functions," Z. Math. Logik Grund1. Math.,8, No. 4, 331–345 (1962).
Additional information
Translated from Algebra i Logika, Vol. 22, No. 3, pp. 243–259, May–June, 1983.
Rights and permissions
About this article
Cite this article
Degtev, A.N. Relations between reducibilities of table type. Algebra and Logic 22, 173–185 (1983). https://doi.org/10.1007/BF01978978
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01978978