Hostname: page-component-78c5997874-4rdpn Total loading time: 0 Render date: 2024-11-16T15:18:30.233Z Has data issue: false hasContentIssue false

Borel sets and hyperdegrees1

Published online by Cambridge University Press:  12 March 2014

Harvey M. Friedman*
Affiliation:
Suny at Buffalo, Amherst, New York 14226

Extract

This paper is concerned with the hyderdegrees of elements of uncountable Borel subsets of ωω. The Borel subsets of ωω are the so-called Δ11 subsets of ωω, which are the subsets of ωω that are Δ11 in some parameter f: ωω.

The results of this paper were inspired by two earlier results about the hyperdegrees of elements of Σ11 subsets of ωω. The first is known as the Gandy basis theorem, and asserts that the collection of functions of strictly lower hyperdegree than the hyperjump form a basis for the Σ11 subsets of ωω (see Rogers [3, p. 421]). The second is that there exists an uncountable Σ11 subset of ωω no element of which is hyperarithmetic in any other. The latter is credited to Feferman in Harrison [1], and appears there as Corollary 2.7, p. 537.

Two questions arise. Can we find other basis theorems if we replace Σ11 by Δ11 in Gandy's result? Can we replace Σ11 by Δ11 in Feferman's result?

We simultaneously answer the first positively, and the second negatively by proving that any hyperdegree, in which the hyperjump is hyperarithmetic, forms a basis for the Δ11 subsets of ωω with no hyperarithmetic elements. We conjecture that this holds also for uncountable Δ11 subsets of ωω. This conjecture is open despite the recent claim in Notices of the American Mathematical Society, vol. 19 (1972), p. A616, Abstract 696-02-10.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1973

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.)

Footnotes

1

This research partially supported by NSF GP-13335 and NSF GP-29254.

References

REFERENCES

[1]Harrison, J., Recursive pseudo-well-orderings, Transactions of the American Mathematical Society, vol. 131 (1968), pp. 526543.Google Scholar
[2]Jockusch, C. and Soars, R., A minimal pair of Π10 classes, this Journal, vol. 36 (1971), pp. 6678.Google Scholar
[3]Rogers, H., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967.Google Scholar