Abstract
In this article, we give a definition of the bounded total sets, and the properties of the e-degrees of the bounded total sets are studied.
Similar content being viewed by others
References
Soare, R.I., Recursively Enumerable Sets and Degrees, Berlin: Springer, 1987.
Fridberg, R., and Rogers H., Reducibility and Completness for Sets of Integers, Z. Math. Logic Grundl. Math., 1959, pp. 117–125.
McEvoy, K., Jumps of Quasi-Minimal Enumeration Degrees, J. Symb. Logic, 1985, pp. 839–848.
Solon, B., and Rozhkov, S., Enumeration Degrees of the Bounded Total Sets, LNCS 3959 “Theory and Applications of Models of Computation”, Proceedings of Third International Conference, TAMC 2006, Beijing, 2006, pp. 737–745.
Gutteridge, L., Some Results on e-Reducibility., Ph.D. Dissertation, Burnaby, 1971.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © S.V. Rozhkov, 2009, published in Modelirovanie i Analiz Informatsionnykh Sistem, 2009, No. 2, pp. 83–87.
About this article
Cite this article
Rozhkov, S.V. Properties of e-degrees of the bounded total sets. Aut. Conrol Comp. Sci. 44, 452–454 (2010). https://doi.org/10.3103/S0146411610070126
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0146411610070126