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

Просмотр по автору "Bazhenov N."

Просмотр по автору "Bazhenov N."

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

  • Automatic and Polynomial-Time Algebraic Structures 
    Bazhenov N.; Harrison-Trainor M.; Kalimullin I.; Melnikov A.; Ng K. (2019)
    Copyright © The Association for Symbolic Logic 2019. A structure is automatic if its domain, functions, and relations are all regular languages. Using the fact that every automatic structure is decidable, in the literature ...
  • Automatic structures and the theory of lists 
    Bazhenov N. (2015)
    © 2015 Bazhenov N.A. Goncharov constructed the axiomatic theory of linear lists over the elements of a given data type. We study algorithmic complexity for models of this theory. We prove that the enriched list structure ...
  • Categoricity Spectra for Polymodal Algebras 
    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 ...
  • Categoricity Spectra for Polymodal Algebras 
    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 ...
  • Classifying equivalence relations in the Ershov hierarchy 
    Bazhenov N.; Mustafa M.; San Mauro L.; Sorbi A.; Yamaleev M. (2020)
    © 2020, The Author(s). Computably enumerable equivalence relations (ceers) received a lot of attention in the literature. The standard tool to classify ceers is provided by the computable reducibility ⩽ c. This gives rise ...
  • Computable isomorphisms of distributive lattices 
    Bazhenov N.; Mustafa M.; Yamaleev M. (2019)
    © Springer Nature Switzerland AG 2019. A standard tool for the classifying computability-theoretic complexity of equivalence relations is provided by computable reducibility. This gives rise to a rich degree-structure which ...
  • Degrees of Autostability Relative to Strong Constructivizations for Boolean Algebras 
    Bazhenov N. (2016)
    © 2016, Springer Science+Business Media New York.It is proved that for every computable ordinal α, the Turing degree 0(α)is a degree of autostability of some computable Boolean algebra and is also a degree of autostability ...
  • Degrees of Autostability Relative to Strong Constructivizations for Boolean Algebras 
    Bazhenov N. (2016)
    © 2016 Springer Science+Business Media New YorkIt is proved that for every computable ordinal α, the Turing degree 0(α) is a degree of autostability of some computable Boolean algebra and is also a degree of autostability ...
  • Degrees of categoricity of rigid structures 
    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.
  • FOUNDATIONS OF ONLINE STRUCTURE THEORY 
    Bazhenov N.; Downey R.; Kalimullin I.; Melnikov A. (2019)
    Copyright © 2019 The Association for Symbolic Logic. The survey contains a detailed discussion of methods and results in the new emerging area of online punctual structure theory. We also state several open problems.
  • Online presentations of finitely generated structures 
    Bazhenov N.; Kalimullin I.; Melnikov A.; Ng K.M. (2020)
    © 2020 Elsevier B.V. We systematically investigate into the online content of finitely generated structures. The online content of a potentially infinite algebraic or combinatorial structure is perhaps best reflected by ...

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

Просмотр

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