Abstract
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.
Publisher
Cambridge University Press (CUP)
Reference16 articles.
1. Lachlan A. H. , On the lattice of r.e;. sets, Transactions of the American Mathematical Society (to appear).
2. Recursively Enumerable Sets and Retracing Functions
3. Approximations of functions on the integers
4. Robinson R. W. , Two theorems on hyperhypersimple sets, Transactions of the American Mathematical Society (to appear).
5. Recursively enumerable sets of positive integers and their decision problems
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献