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

Просмотр по теме "computable set"

Просмотр по теме "computable set"

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

  • Partial Decidable Presentations in Hyperarithmetic 
    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 ...
  • Positive Numberings in Admissible Sets 
    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.
  • Positive Presentations of Families Relative to e-Oracles 
    Kalimullin I.; Puzarenko V.; Faizrahmanov M. (2018)
    © 2018, Pleiades Publishing, Ltd. We introduce the notion of A-numbering which generalizes the classical notion of numbering. All main attributes of classical numberings are carried over to the objects considered here. The ...

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

Просмотр

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