Abstract
We shall establish that any semirecursive η-hyperhypersimple set has partial Turing degree.
Similar content being viewed by others
Literature cited
E. Post, “Recursively enumerable sets of positive integers and their decision problems,” Bull. Amer. Math. Soc.,50, 284–316 (1944).
C. G. Jockusch, “Semirecursive sets and positive reducibility,” Trans. Amer. Math. Soc.,131, No. 2, 420–436 (1968).
A. H. Lachlan, “Two theorems on many-one degrees of recursively enumerable sets,” Algebra i Logika,11, No. 2, 216–229 (1972).
A. N. Degtev, “tt- and m-degrees,” Algebra i Logika,12, No. 2, 143–161 (1973).
H. Rogers, Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill (1967).
Yu. L. Ershov, “Positive equivalences,” Algebra i Logika,10, No. 6, 620–650 (1971).
V. D. Solov'ev, “Q-reducibility and hyperhypersimple sets,” in: Probability Methods and Cybernetics, Vols. 10–11, Kazan (1974), pp. 121–128.
Author information
Authors and Affiliations
Additional information
Translated from Matematicheskie Zametki, Vol. 20, No. 4, pp. 473–478, October, 1976.
Rights and permissions
About this article
Cite this article
Marchenkov, S.S. One class of partial sets. Mathematical Notes of the Academy of Sciences of the USSR 20, 823–825 (1976). https://doi.org/10.1007/BF01098896
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01098896