×
Yates, C. E. M.

On the degrees of index sets. (English) Zbl 0143.25401

Trans. Am. Math. Soc. 121, 309-328 (1966).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0143.25401

Cited in 20 Documents

Keywords:

mathematical logic
Cite Review PDF
Full Text: DOI

References:

[1] J. C. E. Dekker, A theorem on hypersimple sets, Proc. Amer. Math. Soc. 5 (1954), 791 – 796. · Zbl 0056.24902
[2] J. C. E. Dekker and J. Myhill, Some theorems on classes of recursively enumerable sets, Trans. Amer. Math. Soc. 89 (1958), 25 – 59. · Zbl 0083.00302
[3] J. C. E. Dekker and J. Myhill, Retraceable sets, Canad. J. Math. 10 (1958), 357 – 373. · Zbl 0082.01505 · doi:10.4153/CJM-1958-035-x
[4] Richard M. Friedberg, Two recursively enumerable sets of incomparable degrees of unsolvability (solution of Post’s problem, 1944), Proc. Nat. Acad. Sci. U.S.A. 43 (1957), 236 – 238. · Zbl 0080.24302
[5] Stephen Cole Kleene, Introduction to metamathematics, D. Van Nostrand Co., Inc., New York, N. Y., 1952. · Zbl 0047.00703
[6] Donald A. Martin, Classes of recursively enumerable sets and degrees of unsolvability, Z. Math. Logik Grundlagen Math. 12 (1966), 295 – 310. · Zbl 0181.30504
[7] John Myhill, Creative sets, Z. Math. Logik Grundlagen Math. 1 (1955), 97 – 108. · Zbl 0065.00105
[8] Emil L. Post, Recursively enumerable sets of positive integers and their decision problems, Bull. Amer. Math. Soc. 50 (1944), 284 – 316. · Zbl 0063.06328
[9] Hartley Rogers Jr., Computing degrees of unsolvability, Math. Ann. 138 (1959), 125 – 140. · Zbl 0086.01101 · doi:10.1007/BF01342939
[10] Gerald E. Sacks, Degrees of unsolvability, Princeton University Press, Princeton, N.J., 1963. · Zbl 0143.25302
[11] Gerald E. Sacks, The recursively enumerable degrees are dense, Ann. of Math. (2) 80 (1964), 300 – 312. · Zbl 0135.00702 · doi:10.2307/1970393
[12] Gerald E. Sacks, A maximal set which is not complete, Michigan Math. J. 11 (1964), 193 – 205. · Zbl 0135.24903
[13] Raymond M. Smullyan, Theory of formal systems, Annals of Mathematics Studies, No. 47, Princeton University Press, Princeton, N.J., 1961. · Zbl 0097.24503
[14] C. E. M. Yates, Recursively enumerable sets and retracing functions, Z. Math. Logik Grundlagen Math. 8 (1962), 331 – 345. · Zbl 0111.00904
[15] C. E. M. Yates, A minimal pair of recursively enumerable degrees, J. Symbolic Logic 31 (1966), 159 – 168. · Zbl 0143.25402 · doi:10.2307/2269807
[16] -, On the degrees of index-sets. II (in preparation).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.