On Projective Ordinals
- Creators
-
Kechris, Alexander S.
Abstract
We study in this paper the projective ordinals δ^1_n, where δ^1_n = sup{ξ: ξ is the length of ɑ Δ^1_n prewellordering of the continuum}. These ordinals were introduced by Moschovakis in [8] to serve as a measure of the "definable length" of the continuum. We prove first in §2 that projective determinacy implies δ^1_n < δ^1_n for all even n > 0 (the same result for odd n is due to Moschovakis). Next, in the context of full determinacy, we partly generalize (in §3) the classical fact that δ^1_1 ℵ_l and the result of Martin that δ^1_3 = ℵ_(ω + 1) by proving that δ^1_(n2+1) = λ^+_(2n+1), where λ_(2n+1) is a cardinal of cofinality ω. Finally we discuss in §4 the connection between the projective ordinals and Solovay's uniform indiscernibles. We prove among other things that ∀α (α^# exists) implies that every δ^1_n with n ≥ 3 is a fixed point of the increasing enumeration of the uniform indiscernibles.
Additional Information
© 1974 Association for Symbolic Logic. Received August 5, 1972. The results in this paper are included in the author's doctoral dissertation submitted to the University of California, Los Angeles, in June 1972. The author would like to express his sincerest thanks to his thesis advisor, Professor Yiannis N. Moschovakis, both for creating his interest in descriptive set theory and for his guidance and encouragement. The preparation of the paper was partially supported by NSF grant GP-27964.Attached Files
Published - 2272639.pdf
Files
Name | Size | Download all |
---|---|---|
md5:bc298798b3bc1b3adbd160061b7f3d93
|
1.1 MB | Preview Download |
Additional details
- Eprint ID
- 38704
- Resolver ID
- CaltechAUTHORS:20130529-103426984
- NSF
- GP-27964
- Created
-
2013-05-30Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field
- Other Numbering System Name
- Zentralblatt MATH Identifier
- Other Numbering System Identifier
- 0292.02056