Abstract
The concepts of sQ-reducibility and sQ1-reducibility are considered, and it is shown that these concepts coincide on the class of recursively enumerable sets. Moreover, a description of sQ-complete recursively enumerable sets is presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature cited
J. Myhill, “Creative sets,” Z. Math. Logik Grundl. Math., No. 1, 97–108 (1955).
H. Rodgers, Theory of Recursively Enumerable Sets and Effective Computation [Russian translation], Mir, Moscow (1972).
R. M. Friedberg and H. Rodgers, “Reducibility and completeness for sets of integers,” Z. Math. Logik Grundl. Math.,5, 117–125 (1959).
J. T. Gill and P. H. Morris, “On subcreative sets and S-reducibility,” J. Symb. Logic,39, No. 4, 669–677 (1974).
M. I. Kanovich, “On the complexity of the solution of algorithms,” Dokl. Akad. Nauk SSSR,186, No. 5, 1008–1009 (1968).
R. Sh. Omanadze, “Relations between certain types of reducibility,” Soobshch. Akad. Nauk Gruzii,140, No. 3, 473–476 (1990).
T. G. McLaughlin, “On a class of complete simple sets,” Canad. Math. Bull.,8, 33–37 (1965).
Author information
Authors and Affiliations
Additional information
Translated from Matematicheskie Zametki, Vol. 52, No. 3, pp. 102–107, September, 1992.
Rights and permissions
About this article
Cite this article
Omanadze, R.S. On sQ-completeness of recursively enumerable sets. Math Notes 52, 948–952 (1992). https://doi.org/10.1007/BF01209615
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01209615