This is a preview of subscription content, log in via an institution to check access.
Literature cited
C. E. Yates, "Recursively enumerable sets and retracing functions," Z. Math. Logik Grundlagen Math.,8, No. 4, 331–345 (1962).
K. J. Appel and T. G. McLaughlin, "On properties of regressive sets," Trans. Amer. Math. Soc.,115, No. 3, 83–93 (1965).
T. G. McLaughlin, "Retraceable sets and recursive permutations," Proc. Amer. Math. Soc.,17, No. 2, 427–429 (1966).
T. G. McLaughlin, "Strong reducibility on hypersimple sets," Notre Dame J. Formal Logic,6, No. 3, 229–234 (1965).
J. S. Ullian, "Splinters of recursive functions," J. Symbolic Logic,25, No. 1, 33–38 (1960).
P. R. Young, "On pseudo-creative sets, splinters, and bounded-truth-table reducibility," Z. Math. Logik. Grundlagen Math.,13, No. 1, 25–31 (1967).
D. A. Martin, "A theorem on hyperhypersimple sets," J. Symbolic Logic,28, No. 4, 273–278 (1963).
Additional information
Translated from Algebra i Logika, Vol. 9, No. 6, pp. 651–660, November–December, 1970.
Rights and permissions
About this article
Cite this article
Degtev, A.N. Remarks on retraceable, regressive, and pointwise-decomposable sets. Algebr Logic 9, 390–395 (1970). https://doi.org/10.1007/BF02219042
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02219042