Remote Access Proceedings of the American Mathematical Society
Green Open Access

Proceedings of the American Mathematical Society

ISSN 1088-6826(online) ISSN 0002-9939(print)

 

 

A forcing proof of the Kechris-Moschovakis constructibility theorem


Author: Andreas Blass
Journal: Proc. Amer. Math. Soc. 47 (1975), 195-197
DOI: https://doi.org/10.1090/S0002-9939-1975-0351819-2
MathSciNet review: 0351819
Full-text PDF Free Access

Abstract | References | Additional Information

Abstract: We show, by forcing, that every subset of $ {\aleph _1}$ whose codes form a $ \Sigma _2^1$ set of reals must be constructible.


References [Enhancements On Off] (What's this?)


Additional Information

DOI: https://doi.org/10.1090/S0002-9939-1975-0351819-2
Article copyright: © Copyright 1975 American Mathematical Society