论文信息 - Simplicity of recursively enumerable sets

Simplicity of recursively enumerable sets

In §1 is given a characterization of strongly hypersimple sets in terms of weak arrays which is in appearance more restrictive than the original definition. §1 also includes a new characterization of hyperhypersimple sets. This one is interesting because in §2 a characterization of dense simple sets is shown which is identical in all but the use of strong arrays instead of weak arrays. Another characterization of hyperhypersimple sets, in terms of descending sequences of sets, is given in §3. Also a theorem showing strongly contrasting behavior for simple sets is presented. In §4 a r-maximal set which is not contained in any maximal set is constructed.

Robert W. Robinson | R. W. Robinson

[1] Robert W. Robinson,et al. Two theorems on hyperhypersimple sets , 1967 .

[2] Donald A. Martin,et al. Classes of Recursively Enumerable Sets and Degrees of Unsolvability , 1966 .

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

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

[5] T. G. McLaughlin,et al. Some observations on quasicohesive sets. , 1964 .

[6] G. F. Rose,et al. Approximations of functions on the integers. , 1963 .

[7] C. E. M. Yates,et al. Recursively Enumerable Sets and Retracing Functions , 1962 .

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

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