Published December 1972
| public
Journal Article
Two theorems about projective sets
Abstract
In this paper we prove two (rather unrelated) theorems about projective sets. The first one asserts that subsets of ℵ_1 which are ∑^1_2 in the codes are constructible; thus it extends the familiar theorem of Shoenfield that ∑^1_2 subsets of ω are constructible. The second is concerned with largest countable ∑^1_(2n) sets and establishes their existence under the hypothesis of Projective Determinacy and the assumption that there exist only countably many ordinal definable reals.
Additional Information
© 1972 Springer. Received October 19, 1971. Y. N. Moschovakis is a Sloan Foundation Fellow. During the preparation of this paper, both authors were partially supported by NSF Grant GP-27964.Additional details
- Eprint ID
- 38706
- DOI
- 10.1007/BF02764630
- Resolver ID
- CaltechAUTHORS:20130529-155104187
- GP-27964
- NSF
- Created
-
2013-05-30Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field
- Other Numbering System Name
- MathSciNet Review
- Other Numbering System Identifier
- MR0323544