Relative completeness of arithmetical numberings
Mathematical Structures in Computer Science · 2026 · 36
DOI: 10.1017/s0960129526100541 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematical Structures in Computer Science, online erschienen am 10.04.2026. Verfasst von Marat Faizrahmanov. Die Arbeit nennt 28 Literaturangaben.
Abstract (Originalsprache)
This paper studies two approaches to relativizing the notions of complete and precomplete numbering. The first one was introduced by Selivanov in the late 1980s, and it strengthens the standard definitions of complete and precomplete numbering. The second one was introduced by Badaev, Goncharov, and Sorbi in the early 2000s, and it is the full relativization of these two concepts. In the first part of the paper, we study how these two approaches differ from each other. In the second part, we study Mal’cev’s object uniquely for the relativized complete numberings.
Zitieren
APA
Faizrahmanov, M. (2026). Relative completeness of arithmetical numberings. Mathematical Structures in Computer Science, 36. https://doi.org/10.1017/s0960129526100541
Vancouver
Faizrahmanov M. Relative completeness of arithmetical numberings. Mathematical Structures in Computer Science. 2026;36. doi:10.1017/s0960129526100541
BibTeX
@article{Faizrahmanov2026,
author = {Faizrahmanov, Marat},
title = {Relative completeness of arithmetical numberings},
journal = {Mathematical Structures in Computer Science},
year = {2026},
volume = {36},
doi = {10.1017/s0960129526100541}
}
EUVIMED