Nikolay Bazhenov

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 43

Top Topics

Distributive Lattices

Recursively Enumerable

Algebraic Structures

Top Venues

Arch. Math. Log.

Publications

Nikolay Bazhenov, Marta Fiori-Carones, Lu Liu, Alexander G. Melnikov
Primitive recursive reverse mathematics. Ann. Pure Appl. Log. 175 (Issue 1, Part A) (2024)
Nikolay Bazhenov, Dariusz Kalocinski
Degree Spectra, and Relative Acceptability of Notations. CSL (2023)
Svetlana Aleksandrova, Nikolay Bazhenov, Maxim V. Zubkov
-classifications for definable subsets. Arch. Math. Log. 62 (1) (2023)
Nikolay Bazhenov, Matthew Harrison-Trainor, Alexander G. Melnikov
Computable Stone spaces. Ann. Pure Appl. Log. 174 (9) (2023)
Nikolay Bazhenov, Takayuki Kihara, Svetlana Selivanova, Dieter Spreen
On the main scientific achievements of Victor Selivanov. Comput. 12 (4) (2023)
Nikolay Bazhenov
Computable Heyting Algebras with Distinguished Atoms and Coatoms. J. Log. Lang. Inf. 32 (1) (2023)
Nikolay Bazhenov, Vittorio Cipriani, Luca San Mauro
Learning algebraic structures with the help of Borel equivalence relations. Theor. Comput. Sci. 951 (2023)
Nikolay Bazhenov, Takayuki Kihara, Svetlana Selivanova
Preface. Comput. 12 (4) (2023)
Nikolay Bazhenov, Hsing-chien Tsai
On the effective universality of mereological theories. Math. Log. Q. 68 (1) (2022)
Nikolay Bazhenov, Keng Meng Ng, Luca San Mauro, Andrea Sorbi
Primitive recursive equivalence relations and their primitive recursive complexity. Comput. 11 (3-4) (2022)
Nikolay Bazhenov, Manat Mustafa, Sergei Ospichev
Rogers semilattices of punctual numberings. Math. Struct. Comput. Sci. 32 (2) (2022)
Nikolay Bazhenov, Dariusz Kalocinski
Relatively acceptable notation. CoRR (2022)
Nikolay Bazhenov, Dariusz Kalocinski, Michal Wroclawski
Intrinsic Complexity of Recursive Functions on Natural Numbers with Standard Order. STACS (2022)
Nikolay Bazhenov, Maxim V. Zubkov
Well-Orders Realized by C.E. Equivalence Relations. CiE (2022)
Nikolay Bazhenov, Manat Mustafa, Zhansaya Tleuliyeva
Rogers semilattices of limitwise monotonic numberings. Math. Log. Q. 68 (2) (2022)
Nikolay Bazhenov, Dino Rossegger, Maxim Zubkov
On bi-embeddable categoricity of algebraic structures. Ann. Pure Appl. Log. 173 (3) (2022)
Nikolay Bazhenov, Vittorio Cipriani, Luca San Mauro
Calculating the Mind Change Complexity of Learning Algebraic Structures. CiE (2022)
Nikolay Bazhenov, Manat Mustafa, Anvar M. Nurakunov
On Two Types of Concept Lattices in the Theory of Numberings. TAMC (2022)
Nikolay Bazhenov, Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro
Degrees of bi-embeddable categoricity. Comput. 10 (1) (2021)
Nikolay Bazhenov, Manat Mustafa, Sergei Ospichev, Luca San Mauro
Approximating Approximate Reasoning: Fuzzy Sets and the Ershov Hierarchy. LORI (2021)
Nikolay Bazhenov, Luca San Mauro
On the Turing complexity of learning finite families of algebraic structures. J. Log. Comput. 31 (7) (2021)
Nikolay Bazhenov, Manat Mustafa, Luca San Mauro, Andrea Sorbi, Mars M. Yamaleev
Classifying equivalence relations in the Ershov hierarchy. Arch. Math. Log. 59 (7-8) (2020)
Nikolay Bazhenov, Iskander Sh. Kalimullin, Alexander G. Melnikov, Keng Meng Ng
Online presentations of finitely generated structures. Theor. Comput. Sci. 844 (2020)
Nikolay Bazhenov, Stefan V. Vatev
A Note on Computable Embeddings for Ordinals and Their Reverses. CiE (2020)
Nikolay Bazhenov, Ekaterina B. Fokina, Luca San Mauro
Learning families of algebraic structures from informant. Inf. Comput. 275 (2020)
Nikolay Bazhenov, Manat Mustafa, Sergei Ospichev
Semilattices of Punctual Numberings. TAMC (2020)
Nikolay Bazhenov
Definable Subsets of Polynomial-Time Algebraic Structures. CSR (2020)
Nikolay Bazhenov, Sergey Goncharov, Alexander G. Melnikov
Decompositions of decidable abelian groups. Int. J. Algebra Comput. 30 (1) (2020)
Nikolay Bazhenov, Rod Downey, Iskander Sh. Kalimullin, Alexander G. Melnikov
Foundations of Online Structure Theory. Bull. Symb. Log. 25 (2) (2019)
Nikolay Bazhenov, Matthew Harrison-Trainor, Iskander Sh. Kalimullin, Alexander G. Melnikov, Keng Meng Ng
Automatic and Polynomial-Time Algebraic Structures. J. Symb. Log. 84 (4) (2019)
Nikolay Bazhenov, Manat Mustafa, Sergei Ospichev
Bounded Reducibility for Computable Numberings. CiE (2019)
Nikolay Bazhenov, Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro
Degrees of bi-embeddable categoricity of equivalence structures. Arch. Math. Log. 58 (5-6) (2019)
Nikolay Bazhenov, Hristo Ganchev, Stefan V. Vatev
Effective Embeddings for Pairs of Structures. CiE (2019)
Nikolay Bazhenov
Computable Contact Algebras. Fundam. Informaticae 167 (4) (2019)
Nikolay Bazhenov, Manat Mustafa, Mars M. Yamaleev
Computable Isomorphisms of Distributive Lattices. TAMC (2019)
Nikolay Bazhenov, Manat Mustafa, Mars M. Yamaleev
Elementary theories and hereditary undecidability for semilattices of numberings. Arch. Math. Log. 58 (3-4) (2019)
Nikolay Bazhenov
Autostability spectra for decidable structures. Math. Struct. Comput. Sci. 28 (3) (2018)
Nikolay Bazhenov, Margarita Marchuk
Degrees of Categoricity for Prime and Homogeneous Models. CiE (2018)
Nikolay Bazhenov, Iskander Sh. Kalimullin, Mars M. Yamaleev
Degrees of Categoricity and spectral Dimension. J. Symb. Log. 83 (1) (2018)
Nikolay Bazhenov
Turing Computable Embeddings, Computable Infinitary Equivalence, and Linear Orders. CiE (2017)
Nikolay Bazhenov, Mars M. Yamaleev
Degrees of Categoricity of Rigid Structures. CiE (2017)
Nikolay Bazhenov
A Note on Effective Categoricity for Linear Orderings. TAMC (2017)
Nikolay Bazhenov
Categoricity Spectra for Polymodal Algebras. Stud Logica 104 (6) (2016)
Nikolay Bazhenov
Prime Model with No Degree of Autostability Relative to Strong Constructivizations. CiE (2015)