Email this article A countable definable set containing no definable elements
- Authors: Kanovei V.G.1,2, Lyubetsky V.A.1
-
Affiliations:
- Kharkevich Institute for Information Transmission Problems (IITP) of the Russian Academy of Sciences
- Moscow State University of Railway Engineering (MIIT)
- Issue: Vol 102, No 3-4 (2017)
- Pages: 338-349
- Section: Article
- URL: https://journal-vniispk.ru/0001-4346/article/view/150105
- DOI: https://doi.org/10.1134/S0001434617090048
- ID: 150105
Cite item
Open Access
Access granted
Subscription Access
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
About the authors
V. G. Kanovei
Kharkevich Institute for Information Transmission Problems (IITP) of the Russian Academy of Sciences; Moscow State University of Railway Engineering (MIIT)
Author for correspondence.
Email: kanovei@iitp.ru
Russian Federation, Moscow; Moscow
V. A. Lyubetsky
Kharkevich Institute for Information Transmission Problems (IITP) of the Russian Academy of Sciences
Email: kanovei@iitp.ru
Russian Federation, Moscow
Supplementary files
