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

Просмотр по автору "Puzarenko V."

Просмотр по автору "Puzarenko V."

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

  • Faizrahmanov M.; Kach A.; Kalimullin I.; Montalbán A.; Puzarenko V. (2019)
    © 2019 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim It is proved that for every countable structure A and a computable successor ordinal α there is a countable structure A−α which is (Formula presented.) -least among all ...
  • 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.; 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 ...
  • Kalimullin S.; Puzarenko V. (2009)
    A reducibility on families of subsets of natural numbers is introduced which allows the family per se to be treated without its representation by natural numbers being fixed. This reducibility is used to study a series of ...
  • Faizrahmanov M.; Kalimullin I.; Montalbán A.; Puzarenko V. (2017)
    © J.UCS. Studying the Σ-reducibility of families introduced by [Kalimullin and Puzarenko 2009] we show that for every set X ≥ T ∅׳_there is a family of sets F which is the Σ-least countable family whose Σ-jump is Σ-equivalent ...

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

Просмотр

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