The Theory of Countable Analytical Sets
Creators
Abstract
The purpose of this paper is the study of the structure of countable sets in the various levels of the analytical hierarchy of sets of reals. It is first shown that, assuming projective determinacy, there is for each odd n a largest countable ∏_n^1 set of reals, C_n (this is also true for n even, replacing ∏_n^1 by Σ_n^1 and has been established earlier by Solovay for n = 2 and by Moschovakis and the author for all even n > 2). The internal structure of the sets C_n is then investigated in detail, the point of departure being the fact that each C_n is a set of Δ_n^1-degrees, wellordered under their usual partial ordering. Finally, a number of applications of the preceding theory is presented, covering a variety of topics such as specification of bases, ω-models of analysis, higher-level analogs of the constructible universe, inductive definability, etc.
Additional Information
© 1975 American Mathematical Society. Received by the editors September 13, 1973. Research partially supported by NSF grant GP 27964.Attached Files
Published - 1997311.pdf
Files
1997311.pdf
Additional details
Identifiers
- Eprint ID
- 38637
- Resolver ID
- CaltechAUTHORS:20130522-132343731
Funding
- NSF
- GP 27964
Dates
- Created
-
2013-05-22Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field
Caltech Custom Metadata
- Caltech groups
- Mathematics Department
- Other Numbering System Name
- MathSciNet Review
- Other Numbering System Identifier
- MR0419235