Электронный архив

Просмотр по теме "numbering"

Просмотр по теме "numbering"

Отсортировать по:Сортировать:Результаты поиска на странице:

  • Faizrahmanov M.K.; Puzarenko V.G. (2021)
    Abstract: We study in this paper negative A-numberings where A are admissible structures. We establish that a series of classical assumptions is remained to hold for negative A-numberings in the case of the application of ...
  • Kalimullin I.; Puzarenko V.; Faizrahmanov M. (2019)
    © 2019, Pleiades Publishing, Inc. We study the problem of the existence of decidable and positive Π11- and Σ11-numberings of the families of Π11- and Σ11-cones with respect to inclusion. Some laws are found that reflect ...
  • Kalimullin I.S.; Puzarenko V.G.; Faizrahmanov M.K. (2020)
    © 2020, Pleiades Publishing, Ltd. We construct the example of an admissible set A such that there exists a positive computable A-numbering of the family of all A-c.e. sets, whereas any negative computable A-numberings are absent.
  • Selivanov V.L. (2021)
    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 ...

Поиск в электронном архиве

Просмотр

Моя учетная запись