Hostname: page-component-586b7cd67f-t7czq Total loading time: 0 Render date: 2024-11-28T14:22:18.083Z Has data issue: false hasContentIssue false
  • English
  • Français

Forcing with Δ perfect trees and minimal Δ-degrees

Published online by Cambridge University Press:  12 March 2014

Alexander S. Kechris
Alexander S. Kechris*
Affiliation:
California Institute of Technology, Pasadena, California 91125
Get access Rights & Permissions [Opens in a new window]

Extract

This paper is a sequel to [3] and it contains, among other things, proofs of the results announced in the last section of that paper.

In §1, we use the general method of [3] together with reflection arguments to study the properties of forcing with Δ perfect trees, for certain Spector pointclasses Γ, obtaining as a main result the existence of a continuum of minimal Δ-degrees for such Γ's, under determinacy hypotheses. In particular, using PD, we prove the existence of continuum many minimal Δ½n+1-degrees, for all n.

Following an idea of Leo Harrington, we extend these results in §2 to show the existence of minimal strict upper bounds for sequences of Δ-degrees which are not too far apart. As a corollary, it is computed that the length of the natural hierarchy of Δ½n+1-degrees is equal to ω when n ≥ 1. (By results of Sacks and Richter the length of the natural hierarchy of -degrees is known to be equal to the first recursively inaccessible ordinal.)

We will follow in this paper standard notation and terminology, as in Moschovakis' book [7]. Letters e, i, j, k, l, m, n vary over the set of natural numbers ω, a, b, c over the Cantor space 2ω and α, β, γ, δ, … over the set of reals ωω. Finally ξ, η, κ, λ always denote ordinals.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 46 , Issue 4 , December 1981 , pp. 803 - 816
Copyright
Copyright © Association for Symbolic Logic 1981

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]Friedman, H., Minimality in the Δ½-degrees, Fundamenta Matkematicae, vol. 81 (1973), pp. 183–192.CrossRefGoogle Scholar
[2]Gandy, R.O. and Sacks, G.E., A minimal hyperdegree, Fundamenta Matkematicae, vol. 61 (1967), pp. 215–223.CrossRefGoogle Scholar
[3]Kechris, A.S., Forcing in analysis, Higker set theory. Proceedings, Oberwolfach, Germany, 1977 (Müller, G.H. and Scott, D.S., Editors), Lecture Notes in Mathematics, vol. 669, Springer-Verlag, Berlin and New York, 1978, pp. 277–302.Google Scholar
[4]Kechris, A.S., The theory of countable analytical sets, Transactions of the American Mathematical Society, vol. 202 (1975), pp. 259–297.CrossRefGoogle Scholar
[5]Kechris, A.S., Minimal upper bounds for sequences of Δ½n-degrees, this Journal, vol. 43 (1978), pp. 502–507.Google Scholar
[6]Kechris, A.S., Spector second order classes and reflection, Generalized recursion tkeory. II (Fenstad, J.E., Gandy, R.O. and Sacks, G.E., Editors), North-Holland, Amsterdam, 1978, pp. 147–183.Google Scholar
[7]Moschovakis, Y.N., Descriptive set tkeory, North-Holland, Amsterdam, 1980.Google Scholar
[8]Moschovakis, Y.N., Inductive scales on inductive sets, Cabal Seminar 76–77, Proceedings of the Caltech-UCLA Logic Seminar, 1976–1977 (Kechris, A.S. and Moschovakis, Y.N., Editors), Lecture Notes in Matkematics, vol. 689, Springer-Verlag, Berlin and New York, 1978, pp. 185–192.Google Scholar
[9]Sacks, G.E., Countable admissible ordinals and hyperdegrees, Advances in Matkematics, vol. 20 (1976), pp. 213–262.Google Scholar
[10]Solovay, R., Hyperarithmetically encodable reals, Transactions of the American Mathematical Society, vol. 239 (1978), pp. 99–122.CrossRefGoogle Scholar