Computably enumerable sets of reals in constructive mathematical analysis
Logic Journal of the IGPL · 27.07.2026 · 34 (4)
DOI: 10.1093/jigpal/jzag040 ↗Kurz gefasst
Fachartikel in der Zeitschrift Logic Journal of the IGPL, online erschienen am 22.06.2026. Verfasst von Marat Faizrahmanov und 2 weiteren Autor:innen. Die Arbeit nennt 27 Literaturangaben.
Abstract (Originalsprache)
In the literature, there are several common approaches to defining a c.e. set of constructive objects. In the first one, the non-empty set is called c.e. if it is the range of a computable function or if it is the domain of a partial computable function. In the second one, the set is called c.e. if it has a computable numbering. In this paper, we study how the approaches to defining a c.e. set of effective reals represented by constructive reals and Specker reals are related to each other.
Zitieren
APA
Faizrahmanov, M., Nodirov, S., & Zainetdinov, D. (2026). Computably enumerable sets of reals in constructive mathematical analysis. Logic Journal of the IGPL, 34(4). https://doi.org/10.1093/jigpal/jzag040
Vancouver
Faizrahmanov M, Nodirov S, Zainetdinov D. Computably enumerable sets of reals in constructive mathematical analysis. Logic Journal of the IGPL. 2026;34(4). doi:10.1093/jigpal/jzag040
BibTeX
@article{Faizrahmanov2026,
author = {Faizrahmanov, Marat and Nodirov, Shohruh and Zainetdinov, Damir},
title = {Computably enumerable sets of reals in constructive mathematical analysis},
journal = {Logic Journal of the IGPL},
year = {2026},
volume = {34},
number = {4},
doi = {10.1093/jigpal/jzag040}
}
EUVIMED