Standard

Precomplete Numberings. / Selivanov, V. L.

In: Journal of Mathematical Sciences (United States), Vol. 256, No. 1, 01.07.2021, p. 96-124.

Research output: Contribution to journal › Article › peer-review

Harvard

Selivanov, VL 2021, 'Precomplete Numberings', Journal of Mathematical Sciences (United States), vol. 256, no. 1, pp. 96-124. https://doi.org/10.1007/s10958-021-05422-2

APA

Selivanov, V. L. (2021). Precomplete Numberings. Journal of Mathematical Sciences (United States), 256(1), 96-124. https://doi.org/10.1007/s10958-021-05422-2

Vancouver

Selivanov VL. Precomplete Numberings. Journal of Mathematical Sciences (United States). 2021 Jul 1;256(1):96-124. https://doi.org/10.1007/s10958-021-05422-2

Author

Selivanov, V. L. / Precomplete Numberings. In: Journal of Mathematical Sciences (United States). 2021 ; Vol. 256, No. 1. pp. 96-124.

BibTeX

@article{9d5e0d746f364d1aa73368bcd7441625,
title = "Precomplete Numberings",
abstract = "In this survey, we discuss the theory of precomplete numberings, which appear frequently in computability theory. Precomplete numberings are closely related to some versions of the fixed-point theorem having an important methodological value. Sometimes, this allows one to replace cumbersome proofs based on the so-called priority method by elegant and simple applications of this theorem. In a sense, this paper covers the part of computability theory that may be developed by elementary methods.",
keywords = "03C57, 03D45, complete numbering, hierarchy, index set, numbering, precomplete numbering, reducibility, universality",
author = "Selivanov, {V. L.}",
year = "2021",
month = jul,
day = "1",
doi = "10.1007/s10958-021-05422-2",
language = "English",
volume = "256",
pages = "96--124",
journal = "Journal of Mathematical Sciences",
issn = "1072-3374",
publisher = "Springer Nature",
number = "1",

}

RIS

TY - JOUR

T1 - Precomplete Numberings

AU - Selivanov, V. L.

PY - 2021/7/1

Y1 - 2021/7/1

N2 - In this survey, we discuss the theory of precomplete numberings, which appear frequently in computability theory. Precomplete numberings are closely related to some versions of the fixed-point theorem having an important methodological value. Sometimes, this allows one to replace cumbersome proofs based on the so-called priority method by elegant and simple applications of this theorem. In a sense, this paper covers the part of computability theory that may be developed by elementary methods.

AB - In this survey, we discuss the theory of precomplete numberings, which appear frequently in computability theory. Precomplete numberings are closely related to some versions of the fixed-point theorem having an important methodological value. Sometimes, this allows one to replace cumbersome proofs based on the so-called priority method by elegant and simple applications of this theorem. In a sense, this paper covers the part of computability theory that may be developed by elementary methods.

KW - 03C57

KW - 03D45

KW - complete numbering

KW - hierarchy

KW - index set

KW - numbering

KW - precomplete numbering

KW - reducibility

KW - universality

UR - http://www.scopus.com/inward/record.url?scp=85106731406&partnerID=8YFLogxK

U2 - 10.1007/s10958-021-05422-2

DO - 10.1007/s10958-021-05422-2

M3 - Article

AN - SCOPUS:85106731406

VL - 256

SP - 96

EP - 124

JO - Journal of Mathematical Sciences

JF - Journal of Mathematical Sciences

SN - 1072-3374

IS - 1

ER -

ID: 126991092