Мақаланы E-mail арқылы жіберу 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
Қосымша файлдар
