A countable definable set containing no definable elements
- 作者: Kanovei V.G.1,2, Lyubetsky V.A.1
-
隶属关系:
- Kharkevich Institute for Information Transmission Problems (IITP) of the Russian Academy of Sciences
- Moscow State University of Railway Engineering (MIIT)
- 期: 卷 102, 编号 3-4 (2017)
- 页面: 338-349
- 栏目: Article
- URL: https://journals.rcsi.science/0001-4346/article/view/150105
- DOI: https://doi.org/10.1134/S0001434617090048
- ID: 150105
如何引用文章
详细
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.
作者简介
V. Kanovei
Kharkevich Institute for Information Transmission Problems (IITP) of the Russian Academy of Sciences; Moscow State University of Railway Engineering (MIIT)
编辑信件的主要联系方式.
Email: kanovei@iitp.ru
俄罗斯联邦, Moscow; Moscow
V. Lyubetsky
Kharkevich Institute for Information Transmission Problems (IITP) of the Russian Academy of Sciences
Email: kanovei@iitp.ru
俄罗斯联邦, Moscow
补充文件
