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

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

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

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

  • Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy 
    Faizrahmanov M. (2010)
    If ν and μ are some Δcomputable numberings of families of sets of the naturals then P(x,y) ⇔ ν(x)′ ≠ μ(y) is a Σpredicate. Deriving corollaries from this result, we obtain a sufficient condition for existence of a Δcomputable ...
  • Computable Positive and Friedberg Numberings in Hyperarithmetic 
    Kalimullin I.S.; Puzarenko V.G.; Faizrakhmanov M.K. (2020)
    © 2020, Springer Science+Business Media, LLC, part of Springer Nature. We point out an existence criterion for positive computable total Π11 -numberings of families of subsets of a given Π11 -set. In particular, it is ...
  • 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 ...
  • Some Properties of the Upper Semilattice of Computable Families of Computably Enumerable Sets 
    Faizrakhmanov M.K. (2021)
    We look at specific features of the algebraic structure of an upper semilattice of computable families of computably enumerable sets in Ω. It is proved that ideals of minuend and finite families of Ω coincide. We deal with ...
  • WEAK REDUCIBILITY OF COMPUTABLE AND GENERALIZED COMPUTABLE NUMBERINGS 
    Ivanova Z.K.; Faizrahmanov M.K. (2021)
    We consider universal and minimal computable numberings with respect to weak reducibility. A family of total functions that have a universal numbering and two non-weakly equivalent computable numberings is constructed. A ...

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

Просмотр

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