|
This article is cited in 18 scientific papers (total in 18 papers)
A Countable Definable Set Containing no Definable Elements
V. G. Kanoveiab, V. A. Lyubetskiia a Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute), Moscow
b Russian University of Transport
Abstract:
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.
Keywords:
countable sets, definable elements, Jensen's forcing.
Received: 16.06.2015 Revised: 14.04.2017
Citation:
V. G. Kanovei, V. A. Lyubetskii, “A Countable Definable Set Containing no Definable Elements”, Mat. Zametki, 102:3 (2017), 369–382; Math. Notes, 102:3 (2017), 338–349
Linking options:
https://www.mathnet.ru/eng/mzm10842https://doi.org/10.4213/mzm10842 https://www.mathnet.ru/eng/mzm/v102/i3/p369
|
Statistics & downloads: |
Abstract page: | 486 | Full-text PDF : | 54 | References: | 61 | First page: | 26 |
|