Abstract—
This paper is devoted to the study of \(eT\)-reducibility, i.e., the most intuitively general algorithmic reducibility, which is both enumeration and decision reducibilities. The corresponding degree structure, that is, the upper semilattice \({{{\mathbf{D}}}_{{{\mathbf{eT}}}}}\) of \(eT\)-degrees is considered. It is shown that it is possible to correctly define a jump operation on \({{{\mathbf{D}}}_{{{\mathbf{eT}}}}}\) by using the \(T\)-jump or \(e\)-jump of sets. The local properties of \(eT\)-degrees, such as totality and computable enumerability, are considered. It is proven that all degrees between the smallest element and the first jump in \({{{\mathbf{D}}}_{{{\mathbf{eT}}}}}\) are computably enumerable; moreover, these degrees contain computably enumerable sets and only them. The existence of nontotal \(eT\)-degrees is established. Based on this, we obtain some results on the relations between degrees; in particular, the fact that every \(eT\)-degree is either completely contained in some \(T\)-degree or \(e\)-degree, or completely coincides with it, implies that nontotal \(e\)-degrees are contained in the \(T\)-degrees located above the second \(T\)-jump and coincide with the corresponding nontotal \(eT\)-degrees.
Similar content being viewed by others
REFERENCES
Rogers, H., Theory of Recursive Functions and Effective Computability, The MIT Press, 1987.
Soare, R.I., Recursively Enumerable Sets and Degrees, Springer 1999.
Hodzhayanc, M.Yu., On the structure of e-degrees, Izv. Akad. Nauk ArSSR Mat., 1980, vol. XV, no. 3, pp. 165–175.
Polyakov, E.A. and Rozinas, M.G., Teoriya algoritmov (Algorithm Theory), Ivanovo: Ivanovsk. Gos. Univ., 1976.
Kleene, S.C. and Post, E.L., The upper semi-lattice of degrees of recursive unsolvability, Ann. Math., 1954, vol. 59, pp. 379–407.
Case, J., Enumeration reducibility and partial degrees, Ann. Math. Logic, 1971, vol. 2, no. 4, pp. 419–439.
Rozinas, M.G., Jump operation for some types of reducibility, VINITI Dep. 3185-76, 1976.
Medvedev, Yu.T., Degrees of difficulty of mass problems, Dokl. AN SSSR, 1955, vol. 104, pp. 501–504.
Hodzhayanc, M.Yu., e-Degrees, T-degrees, and axiomatic theories, Dokl. Akad. Nauk ArSSR, 1981, vol. 73, no. 2, pp. 73–77.
Solon, B.Ya., About the relationship between e-degrees and T-degrees, Izv. Vuzov, Mat., 1995, vol. 3, pp. 51–61.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
CONFLICT OF INTEREST
The authors declare that they have no conflicts of interest.
ADDITIONAL INFORMATION
Roman R. Iarullin, orcid.org/0000-0003-1604-5599, graduate student.
Additional information
Translated by I. Tselishcheva
About this article
Cite this article
Iarullin, R.R. eT-Reducibility of Sets. Aut. Control Comp. Sci. 54, 615–618 (2020). https://doi.org/10.3103/S0146411620070196
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0146411620070196