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

Просмотр по теме "Computable model theory"

Просмотр по теме "Computable model theory"

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

  • Fokina E.; Kalimullin I.; Miller R. (2009)
    Defining the degree of categoricity of a computable structure M to be the least degree d for which M is d-computably categorical, we investigate which Turing degrees can be realized as degrees of categoricity. We show that ...
  • Frolov A.; Kalimullin I.; Miller R. (2009)
    An algebraic field extension of ℚ or ℤ/(p) may be regarded either as a structure in its own right, or as a subfield of its algebraic closure F (either ℚ or ℤ/(p)). We consider the Turing degree spectrum of F in both cases, ...

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

Просмотр

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