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

Просмотр по теме "Categoricity spectrum"

Просмотр по теме "Categoricity spectrum"

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

  • Bazhenov N. (2016)
    © 2016, Springer Science+Business Media Dordrecht.We investigate effective categoricity for polymodal algebras (i.e., Boolean algebras with distinguished modalities). We prove that the class of polymodal algebras is complete ...
  • Bazhenov N. (2016)
    © 2016 Springer Science+Business Media DordrechtWe investigate effective categoricity for polymodal algebras (i.e., Boolean algebras with distinguished modalities). We prove that the class of polymodal algebras is complete ...
  • Fokina E.; Frolov A.; Kalimullin I. (2016)
    © 2016 by University of Notre Dame. For a computable structure M, the categoricity spectrum is the set of all Turing degrees capable of computing isomorphisms among arbitrary computable copies of M. If the spectrum has a ...
  • 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 ...
  • Bazhenov N.; Yamaleev M. (2017)
    © Springer International Publishing AG 2017. We prove that there exists a properly 2-c.e. Turing degree d which cannot be a degree of categoricity of a rigid structure.

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

Просмотр

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