A countable definable set containing no definable elements
- 31 Downloads
The consistency of the existence of a countable definable set of reals, containing no definable elements, is established. The model, where such a set exists, is obtained by means of a countable product of Jensen’s forcing with finite support.
Keywordscountable sets definable elements Jensen’s forcing
Unable to display preview. Download preview PDF.
- 2.A. Tarski, “DerWahrheitsbegriff in den formalisierten Sprachen,” Stud. Philos. 1, 261–405 (1936).Google Scholar
- 4.V. G. Kanovei and V. A. Lyubetsky, Modern Set Theory: Absolutely Unsolvable Classical Problems (MTsNMO, Moscow, 2013) [in Russian].Google Scholar
- 6.A Question About Ordinal Definable Real Numbers, in Mathoverflow (2010), http://mathoverflow. net/questions/17608.Google Scholar
- 7.A. Enayat, Ordinal Definable Numbers, in Foundations of Mathematics (2010), http://cs.nyu.edu/ pipermail/fom/2010-July/014944.html.Google Scholar
- 9.V. Kanovei, Borel Equivalence Relations. Structure and Classification, in Univ. Lecture Ser. (Amer. Math. Soc., Providence, RI, 2008), Vol.44.Google Scholar
- 11.R. Jensen, “Definable sets of minimal degree,” in Mathematical Logic and Foundations of Set Theory (North-Holland, Amsterdam, 1970), pp. 122–128.Google Scholar
- 12.V. G. Kanovei and V. A. Lyubetsky, “Non-uniformizable sets of second projective level with countable cross-sections in the form of Vitali classes,” Izv. Ross. Akad. Nauk, Ser. Mat. 82 (1) (2018) (in press) [Izv. Math. 82 (1) (2018), in press].Google Scholar
- 15.V. G. Kanovei, “The projective hierarchy of N. N. uzin: The current state-of-the-art in the theory,” in Handbook of Mathematical Logic, Part II: Set Theory, Supplement to the Russian translation (Nauka, Moscow, 1982), pp. 273–364 [in Russian].Google Scholar