Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-26T13:00:19.298Z Has data issue: false hasContentIssue false

On the Kleene degrees of Π 1 1 sets

Published online by Cambridge University Press:  12 March 2014

Theodore A. Slaman*
Affiliation:
Department of Mathematics, University of Chicago, Chicago, Illinois 60637

Abstract

Let A and B be subsets of the reals. Say that A K B, if there is a real a such that the relation “xB” is uniformly ⊿1 (a, A) in . This reducibility induces an equivalence relation ≡ K on the sets of reals; the ≡ K -equivalence class of a set is called its Kleene degree. Let be the structure that consists of the Kleene degrees and the induced partial order ≥. A substructure of that is of interest is , the Kleene degrees of the sets of reals. If sharps exist, then there is not much to , as Steel [9] has shown that the existence of sharps implies that has only two elements: the degree of the empty set and the degree of the complete set. Legrand [4] used the hypothesis that there is a real whose sharp does not exist to show that there are incomparable elements in ; in the context of V = L, Hrbáček has shown that is dense and has no minimal pairs. The Hrbáček results led Simpson [6] to make the following conjecture: if V = L, then forms a universal homogeneous upper semilattice with 0 and 1. Simpson's conjecture is shown to be false by showing that if V = L, then Gödel's maximal thin set is the infimum of two strictly larger elements of .

The second main result deals with the notion of jump in . Let A′ be the complete Kleene enumerable set relative to A. Say that A is low-n if A (n) has the same degree as ⊘(n), and A is high-n if A(n) has the same degree as ⊘(n+1). Simpson and Weitkamp [7] have shown that there is a high (high-1) incomplete set in L. They have also shown that various other sets are neither high nor low in L. Legrand [5] extended their results by showing that, if there is a real x such that x# does not exist, then there is an element of that, for all n, is neither low-n nor high-n. In §2, ZFC is used to show that, for all n, if A is and low-n then A is Borel. The proof uses a strengthened version of Jensen's theorem on sequences of admissible ordinals that appears in [7, Simpson-Weitkamp].

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1986

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] Gandy, R. O., Generalized recursive Junctionals of finite type and hierarchies of functionals, Annales de la Faculté des Sciences de l'Université de Clermont-Ferrand, no. 35 (1967), pp. 524.Google Scholar
[2] Harrington, L. A., Analytic determinacy and 0 # , this Journal, vol. 43 (1978), pp. 685693.Google Scholar
[3] Hrbáček, K., photocopied notes, 1981.Google Scholar
[4] Legrand, S., The Borel analogue of the Friedberg-Muchnik result (to appear).Google Scholar
[5] Legrand, S., A type 2 version of a question of Sacks (to appear).Google Scholar
[6] Simpson, S. G., Four test problems in generalized recursion theory, Proceedings of the sixth international congress on logic, methodology and philosophy of science, Hannover, 1979, North-Holland, Amsterdam, 1982, pp. 263270.Google Scholar
[7] Simpson, S. G. and Weitkamp, G., High and low degrees of coanalytic sets, this Journal, vol. 48 (1983), pp. 356368.Google Scholar
[8] Solovay, R., Determinacy and type 2 recursion (abstract), this Journal, vol. 36 (1971), p. 374.Google Scholar
[9] Steel, J. R., Analytic sets and Borel isomorphisms, Fundamenta Mathematicae, vol. 108 (1980), pp. 8388.CrossRefGoogle Scholar
[10] Spector, C., Hyperarithmetical quantifiers, Fundamenta Mathematicae, vol. 48 (1959/1960), pp. 313320.CrossRefGoogle Scholar
[11] Weitkamp, G., Kleene recursion over the continuum, Ph.D. thesis, Pennsylvania State University, University Park, Pennsylvania, 1980.Google Scholar