论文信息 - Classes of Recursively Enumerable Sets and Degrees of Unsolvability - 字舞流文

Classes of Recursively Enumerable Sets and Degrees of Unsolvability

Donald A. Martin | D. A. Martin

[1] C. E. M. Yates,et al. Three theorems on the degrees of recursively enumerable sets , 1965 .

[2] Gerald E. Sacks,et al. A maximal set which is not complete. , 1964 .

[3] Joseph S. Ullian,et al. Splinters of recursive functions , 1960, Journal of Symbolic Logic.

[4] Hartley RogersJr.,et al. Computing degrees of unsolvability , 1959 .

[5] R. Friedberg. Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication , 1958, Journal of Symbolic Logic.

[6] H. G. Rice,et al. RECURSIVE AND RECURSIVELY ENUMERABLE ORDERS( , 1956 .

[7] J. C. E. Dekker,et al. A theorem on hypersimple sets , 1954 .

[8] Emil L. Post. Recursively enumerable sets of positive integers and their decision problems , 1944 .