Skip to main content
Log in

Properties of e-degrees of the bounded total sets

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

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.

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.

Similar content being viewed by others

References

  1. Soare, R.I., Recursively Enumerable Sets and Degrees, Berlin: Springer, 1987.

    Google Scholar 

  2. Fridberg, R., and Rogers H., Reducibility and Completness for Sets of Integers, Z. Math. Logic Grundl. Math., 1959, pp. 117–125.

  3. McEvoy, K., Jumps of Quasi-Minimal Enumeration Degrees, J. Symb. Logic, 1985, pp. 839–848.

  4. 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.

  5. Gutteridge, L., Some Results on e-Reducibility., Ph.D. Dissertation, Burnaby, 1971.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to S. V. Rozhkov.

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

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0146411610070126

Keywords

Navigation