This is a preview of subscription content, log in via an institution to check access.
Literature cited
R. M. Smullyan, “Effectively simple sets,” Proc. Am. Math. Soc.,15, No. 4, 893–894 (1964).
D. A. Martin, “Completeness, the recursion theorem, and effectively simple sets,” Proc. Am. Math. Soc.,17, No. 4, 838–842 (1966).
A. H. Lachlan, “Complete recursively enumerable sets,” Proc. Am. Math. Soc., No. 1, 99–102 (1968).
M. M. Arslanov, “Effectively hypersimple sets,” Algebra Logika,8, No. 2, 143–153 (1969).
M. M. Arslanov, “Completely hypersimple sets,” Izv. Vyssh. Uchebn. Zaved., Mat., No. 4(59), 30–35 (1970).
D. A. Martin, “A theorem on hypersimple sets,” J. Symbolic Logic,28, No. 2, 273–278 (1968).
M. M. Arslanov, “Generalizations of a fixed point theorem,” Izv. Vyssh. Uchebn. Zaved., Mat., No. 5(228), 9–15 (1981).
H. Rogers, Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill (1967).
E. L. Post, “Recursively enumerable sets of positive integers and their decision problems,” Bull. Am. Math. Soc.,50, No. 2, 284–316 (1944).
S. Tennenbaum, “Degree of unsolvability and the rate of growth of functions,” Not. Am. Math. Soc.,8, No. 3, 608 (1961).
C. G. Jockush and R. J. Soare, “Post's problem and his hypersimple sets,” J. Symbolic Logic,38, 446–452 (1973).
P. Cohen and C. G. Jockush, “A lattice property of Post's simple set,” Ill. J. Math.,19, No. 3, 450–453 (1975).
Author information
Authors and Affiliations
Additional information
Translated from Matematicheskie Zametki, Vol. 38, No. 2, pp. 302–309, August, 1985.
Rights and permissions
About this article
Cite this article
Arslanov, M.M. Effectively hyperimmune sets and majorants. Mathematical Notes of the Academy of Sciences of the USSR 38, 677–680 (1985). https://doi.org/10.1007/BF01156252
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01156252