default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNikolay Bazhenov 0001
Person information
- affiliation: Sobolev Institute of Mathematics, Novosibirsk, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
[j28]Ramil Bagaviev, Ilnur I. Batyrshin
, Nikolay Bazhenov, Dmitry Bushtets, Marina Dorzhieva, Heer Tern Koh, Ruslan Kornev, Alexander G. Melnikov, Keng Meng Ng:
Computably and punctually universal spaces. Ann. Pure Appl. Log. 176(1): 103491 (2025)- 2024
- [j27]Serikzhan A. Badaev, Nikolay A. Bazhenov, Birzhan S. Kalmurzayev, Manat Mustafa:
On diagonal functions for equivalence relations. Arch. Math. Log. 63(3-4): 259-278 (2024) - [j26]Nikolay Bazhenov, Marta Fiori-Carones, Lu Liu, Alexander G. Melnikov:
Primitive recursive reverse mathematics. Ann. Pure Appl. Log. 175(Issue 1, Part A): 103354 (2024) - 2023
- [j25]Svetlana Aleksandrova, Nikolay Bazhenov, Maxim V. Zubkov:
Complexity of Σ0n-classifications for definable subsets. Arch. Math. Log. 62(1-2): 239-256 (2023) - [j24]Nikolay Bazhenov, Matthew Harrison-Trainor, Alexander G. Melnikov:
Computable Stone spaces. Ann. Pure Appl. Log. 174(9): 103304 (2023) - [j23]Nikolay Bazhenov, Takayuki Kihara, Svetlana Selivanova:
Preface. Comput. 12(4): 299 (2023) - [j22]Nikolay Bazhenov, Takayuki Kihara, Svetlana Selivanova, Dieter Spreen:
On the main scientific achievements of Victor Selivanov. Comput. 12(4): 301-314 (2023) - [j21]Nikolay Bazhenov:
Computable Heyting Algebras with Distinguished Atoms and Coatoms. J. Log. Lang. Inf. 32(1): 3-18 (2023) - [j20]Nikolay Bazhenov, Vittorio Cipriani, Luca San Mauro:
Learning algebraic structures with the help of Borel equivalence relations. Theor. Comput. Sci. 951: 113762 (2023) - 2022
- [j19]Nikolay Bazhenov, Dino Rossegger, Maxim V. Zubkov:
On bi-embeddable categoricity of algebraic structures. Ann. Pure Appl. Log. 173(3): 103060 (2022) - [j18]Nikolay Bazhenov, Keng Meng Ng, Luca San Mauro, Andrea Sorbi:
Primitive recursive equivalence relations and their primitive recursive complexity. Comput. 11(3-4): 187-221 (2022) - [j17]Nikolay Bazhenov, Hsing-chien Tsai:
On the effective universality of mereological theories. Math. Log. Q. 68(1): 48-66 (2022) - [j16]Nikolay Bazhenov, Manat Mustafa, Zhansaya Tleuliyeva:
Rogers semilattices of limitwise monotonic numberings. Math. Log. Q. 68(2): 213-226 (2022) - [j15]Nikolay Bazhenov, Manat Mustafa, Sergei Ospichev:
Rogers semilattices of punctual numberings. Math. Struct. Comput. Sci. 32(2): 164-188 (2022) - 2021
- [j14]Nikolay Bazhenov, Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro:
Degrees of bi-embeddable categoricity. Comput. 10(1): 1-16 (2021) - [j13]Nikolay Bazhenov, Luca San Mauro:
On the Turing complexity of learning finite families of algebraic structures. J. Log. Comput. 31(7): 1891-1900 (2021) - 2020
- [j12]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): 835-864 (2020) - [j11]Nikolay Bazhenov, Ekaterina B. Fokina, Luca San Mauro:
Learning families of algebraic structures from informant. Inf. Comput. 275: 104590 (2020) - [j10]Nikolay Bazhenov, Sergey Goncharov, Alexander G. Melnikov:
Decompositions of decidable abelian groups. Int. J. Algebra Comput. 30(1): 49-90 (2020) - [j9]Nikolay Bazhenov, Iskander Sh. Kalimullin, Alexander G. Melnikov, Keng Meng Ng:
Online presentations of finitely generated structures. Theor. Comput. Sci. 844: 195-216 (2020) - 2019
- [j8]Nikolay Bazhenov, Manat Mustafa, Mars M. Yamaleev:
Elementary theories and hereditary undecidability for semilattices of numberings. Arch. Math. Log. 58(3-4): 485-500 (2019) - [j7]Nikolay Bazhenov, Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro:
Degrees of bi-embeddable categoricity of equivalence structures. Arch. Math. Log. 58(5-6): 543-563 (2019) - [j6]Nikolay Bazhenov, Rod Downey, Iskander Sh. Kalimullin, Alexander G. Melnikov:
Foundations of Online Structure Theory. Bull. Symb. Log. 25(2): 141-181 (2019) - [j5]Nikolay Bazhenov:
Computable Contact Algebras. Fundam. Informaticae 167(4): 257-269 (2019) - [j4]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): 1630-1669 (2019) - 2018
- [j3]Nikolay Bazhenov, Iskander Sh. Kalimullin, Mars M. Yamaleev:
Degrees of Categoricity and spectral Dimension. J. Symb. Log. 83(1): 103-116 (2018) - [j2]Nikolay Bazhenov:
Autostability spectra for decidable structures. Math. Struct. Comput. Sci. 28(3): 392-411 (2018) - 2016
- [j1]Nikolay Bazhenov:
Categoricity Spectra for Polymodal Algebras. Stud Logica 104(6): 1083-1097 (2016)
Conference and Workshop Papers
- 2024
- [c20]Nikolay Bazhenov, Marta Fiori-Carones, Manat Mustafa:
On Arithmetical Numberings in Reverse Mathematics. CiE 2024: 126-138 - [c19]Nikolay Bazhenov, Ekaterina B. Fokina, Dino Rossegger, Alexandra A. Soskova, Stefan V. Vatev:
Learning Families of Algebraic Structures from Text. CiE 2024: 166-178 - [c18]Nikolay Bazhenov, Manat Mustafa:
On Learning Families of Ideals in Lattices and Boolean Algebras. TAMC 2024: 1-13 - 2023
- [c17]Nikolay Bazhenov, Dariusz Kalocinski:
Degree Spectra, and Relative Acceptability of Notations. CSL 2023: 11:1-11:20 - 2022
- [c16]Nikolay Bazhenov, Vittorio Cipriani, Luca San Mauro:
Calculating the Mind Change Complexity of Learning Algebraic Structures. CiE 2022: 1-12 - [c15]Nikolay Bazhenov, Maxim V. Zubkov:
Well-Orders Realized by C.E. Equivalence Relations. CiE 2022: 13-23 - [c14]Nikolay Bazhenov, Dariusz Kalocinski, Michal Wroclawski:
Intrinsic Complexity of Recursive Functions on Natural Numbers with Standard Order. STACS 2022: 8:1-8:20 - [c13]Nikolay Bazhenov, Manat Mustafa, Anvar M. Nurakunov:
On Two Types of Concept Lattices in the Theory of Numberings. TAMC 2022: 79-92 - 2021
- [c12]Nikolay Bazhenov, Manat Mustafa, Sergei Ospichev, Luca San Mauro:
Approximating Approximate Reasoning: Fuzzy Sets and the Ershov Hierarchy. LORI 2021: 1-13 - 2020
- [c11]Nikolay Bazhenov, Stefan V. Vatev:
A Note on Computable Embeddings for Ordinals and Their Reverses. CiE 2020: 1-13 - [c10]Nikolay Bazhenov:
Definable Subsets of Polynomial-Time Algebraic Structures. CSR 2020: 142-154 - [c9]Nikolay Bazhenov, Manat Mustafa, Sergei Ospichev:
Semilattices of Punctual Numberings. TAMC 2020: 1-12 - 2019
- [c8]Nikolay Bazhenov, Hristo Ganchev, Stefan V. Vatev:
Effective Embeddings for Pairs of Structures. CiE 2019: 84-95 - [c7]Nikolay Bazhenov, Manat Mustafa, Sergei Ospichev:
Bounded Reducibility for Computable Numberings. CiE 2019: 96-107 - [c6]Nikolay Bazhenov, Manat Mustafa, Mars M. Yamaleev:
Computable Isomorphisms of Distributive Lattices. TAMC 2019: 28-41 - 2018
- [c5]Nikolay Bazhenov, Margarita Marchuk:
Degrees of Categoricity for Prime and Homogeneous Models. CiE 2018: 40-49 - 2017
- [c4]Nikolay Bazhenov:
Turing Computable Embeddings, Computable Infinitary Equivalence, and Linear Orders. CiE 2017: 141-151 - [c3]Nikolay Bazhenov, Mars M. Yamaleev:
Degrees of Categoricity of Rigid Structures. CiE 2017: 152-161 - [c2]Nikolay Bazhenov:
A Note on Effective Categoricity for Linear Orderings. TAMC 2017: 85-96 - 2015
- [c1]Nikolay Bazhenov:
Prime Model with No Degree of Autostability Relative to Strong Constructivizations. CiE 2015: 117-126
Informal and Other Publications
- 2022
- [i1]Nikolay Bazhenov, Dariusz Kalocinski:
Relatively acceptable notation. CoRR abs/2205.00791 (2022)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 02:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
