Hostname: page-component-cd9895bd7-p9bg8 Total loading time: 0 Render date: 2024-12-25T06:53:13.877Z Has data issue: false hasContentIssue false

Closure properties of almost-finiteness classes in recursive function theory

Published online by Cambridge University Press:  12 March 2014

Heinrich Rolletschek*
Affiliation:
University of Delaware, Newark, Delaware 19711

Extract

In this paper we will investigate closure properties of the class of immune sets and of other, more restricted classes of sets of natural numbers under union and similar operations. Our main theorem states that there exists a hyperhyperimmune set A such that A join A is not hyperhyperimmune. We will prove this result in §3. The remaining questions about closure properties are all much easier and will be answered in §2.

We consider the closure properties which are given in the following

Definition. Let bea. class of subsets of N.

(i) is closed under join, if A join B whenever A and B.

(ii) is closed under self-join, if A join A whenever A.

(iii) is closed under union, if AB whenever A and B.

(iv) is closed under cartesian product, if A × B whenever A and B.

(v) is closed under cartesian self-product, if A × A whenever A.

The almost-finiteness classes we consider are the following:

1 = {XX is immune};

2 = {X simple};

3 = {XX is hyperimmune};

4 = {X is hypersimple};

5 = {XX is strongly hyperimmune};

6 = {X is strongly hypersimple};

7 = {XX is hyperhyperimmune};

8 = {XX is strongly hyperhyperimmune};

9 = {X is hyperhypersimple};

10 = {XX is dense immune};

11 = {X is dense simple}.

The definitions are all contained in Rogers [4, Chapter 12] and/or in Robinson [3]. In addition we could consider the class of -strongly hyperimmune sets and classes defined by lim-properties; see Rogers [4, pp. 243–244]. For other classes, however, such as the class of cohesive sets, the questions become trivial.

Our aim is to establish the table on the next page.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1983

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Cooper, S. B., Jump-equivalence of -hyperhyperimmune sets, this Journal, vol. 37 (1972), pp. 598600.Google Scholar
[2]Dekker, J. C. E., Two notes on recursively enumerable sets, Proceedings of the American Mathematical Society, vol. 4 (1953), pp. 495501.CrossRefGoogle Scholar
[3]Robinson, R. W., Simplicity of recursively enumerable sets, this Journal, vol. 32 (1967), pp. 162172.Google Scholar
[4]Rogers, H., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967.Google Scholar