A Countable Definable Set Containing no Definable Elements
Matematičeskie zametki, Tome 102 (2017) no. 3, pp. 369-382
Voir la notice de l'article provenant de la source Math-Net.Ru
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, Jensen's forcing.
Mots-clés : definable elements
Mots-clés : definable elements
@article{MZM_2017_102_3_a3,
author = {V. G. Kanovei and V. A. Lyubetskii},
title = {A {Countable} {Definable} {Set} {Containing} no {Definable} {Elements}},
journal = {Matemati\v{c}eskie zametki},
pages = {369--382},
publisher = {mathdoc},
volume = {102},
number = {3},
year = {2017},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MZM_2017_102_3_a3/}
}
V. G. Kanovei; V. A. Lyubetskii. A Countable Definable Set Containing no Definable Elements. Matematičeskie zametki, Tome 102 (2017) no. 3, pp. 369-382. http://geodesic.mathdoc.fr/item/MZM_2017_102_3_a3/