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

Просмотр по автору "Kalimullin I.S."

Просмотр по автору "Kalimullin I.S."

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

  • 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 ...
  • Constructing Punctually Categorical Semigroups 
    Kalimullin I.S. (2020)
  • Degree Spectra of Structures 
    Kalimullin I.S.; Selivanov V.L.; Frolov A.N. (2021)
    In this survey, we discuss computability spectra of countable structures that provide a natural measure of non-computability of a structure. This notion is a main tool for investigating algorithmic properties of countable ...
  • Degrees of Enumerations of Countable Wehner-Like Families 
    Kalimullin I.S.; Faizrahmanov M.K. (2021)
    This paper is a survey of results on countable families with natural degree spectra. These results were obtained by a modification of the methodology proposed by Wechner, who first found a family of sets with the spectrum ...
  • 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.
  • Punctual Categoricity Relative to a Computable Oracle 
    Kalimullin I.S.; Melnikov A.G. (2021)
    Abstract: We are studying the punctual structures, i.e., the primitive recursive structures on the whole set of integers. The punctual categoricity relative to a computable oracle f means that between any two punctual ...
  • Punctual Categoricity Spectra of Computably Categorical Structures 
    Bazhenov N.A.; Kalimullin I.S. (2021)
  • Semidecidable Numberings in Admissible Sets 
    Kalimullin I.S.; Puzarenko V.G.; Faizrakhmanov M.K. (2020)
  • Strong Degrees of Categoricity and Weak Density 
    Bazhenov N.A.; Kalimullin I.S.; Yamaleev M.M. (2020)
    © 2020, Pleiades Publishing, Ltd. Abstract: It is well-known that every c.e. Turing degree is the degree of categoricity of a rigid structure. In this work we study the possibility of extension of this result to properly ...

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

Просмотр

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