Nikolay Bazhenov

According to our database, Nikolay Bazhenov authored at least 50 papers between 2015 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

On learning down-sets in quasi-orders, and ideals in Boolean algebras.

Nikolay Bazhenov, Manat Mustafa

Theory Comput. Syst., March, 2025

Computably and punctually universal spaces.

Ramil Bagaviev, Ilnur I. Batyrshin, Nikolay Bazhenov, Dmitry Bushtets, Marina Dorzhieva, Heer Tern Koh, Ruslan Kornev, Alexander G. Melnikov, Keng Meng Ng

Ann. Pure Appl. Log., 2025

2024

On diagonal functions for equivalence relations.

Serikzhan A. Badaev, Nikolay A. Bazhenov, Birzhan S. Kalmurzayev, Manat Mustafa

Arch. Math. Log., May, 2024

Primitive recursive reverse mathematics.

Nikolay Bazhenov, Marta Fiori-Carones, Lu Liu, Alexander G. Melnikov

Ann. Pure Appl. Log., January, 2024

On Learning Families of Ideals in Lattices and Boolean Algebras.

Nikolay Bazhenov, Manat Mustafa

Proceedings of the Theory and Applications of Models of Computation, 2024

Learning Families of Algebraic Structures from Text.

Nikolay Bazhenov, Ekaterina B. Fokina, Dino Rossegger, Alexandra A. Soskova, Stefan V. Vatev

Proceedings of the Twenty Years of Theoretical and Practical Synergies, 2024

On Arithmetical Numberings in Reverse Mathematics.

Nikolay Bazhenov, Marta Fiori-Carones, Manat Mustafa

Proceedings of the Twenty Years of Theoretical and Practical Synergies, 2024

2023

Computable Stone spaces.

Nikolay Bazhenov, Matthew Harrison-Trainor, Alexander G. Melnikov

Ann. Pure Appl. Log., October, 2023

Learning algebraic structures with the help of Borel equivalence relations.

Nikolay Bazhenov, Vittorio Cipriani, Luca San Mauro

Theor. Comput. Sci., March, 2023

Computable Heyting Algebras with Distinguished Atoms and Coatoms.

Nikolay Bazhenov

J. Log. Lang. Inf., March, 2023

On the main scientific achievements of Victor Selivanov.

Nikolay Bazhenov, Takayuki Kihara, Svetlana Selivanova, Dieter Spreen

Comput., 2023

Preface.

Nikolay Bazhenov, Takayuki Kihara, Svetlana Selivanova

Comput., 2023

Complexity of Σ⁰_n-classifications for definable subsets.

Svetlana Aleksandrova, Nikolay Bazhenov, Maxim V. Zubkov

Arch. Math. Log., 2023

Degree Spectra, and Relative Acceptability of Notations.

Nikolay Bazhenov, Dariusz Kalocinski

Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

2022

Rogers semilattices of punctual numberings.

Nikolay Bazhenov, Manat Mustafa, Sergei Ospichev

Math. Struct. Comput. Sci., 2022

On the effective universality of mereological theories.

Nikolay Bazhenov, Hsing-chien Tsai

Math. Log. Q., 2022

Rogers semilattices of limitwise monotonic numberings.

Nikolay Bazhenov, Manat Mustafa, Zhansaya Tleuliyeva

Math. Log. Q., 2022

Relatively acceptable notation.

Nikolay Bazhenov, Dariusz Kalocinski

CoRR, 2022

Primitive recursive equivalence relations and their primitive recursive complexity.

Nikolay Bazhenov, Keng Meng Ng, Luca San Mauro, Andrea Sorbi

Comput., 2022

On bi-embeddable categoricity of algebraic structures.

Nikolay Bazhenov, Dino Rossegger, Maxim V. Zubkov

Ann. Pure Appl. Log., 2022

On Two Types of Concept Lattices in the Theory of Numberings.

Nikolay Bazhenov, Manat Mustafa, Anvar M. Nurakunov

Proceedings of the Theory and Applications of Models of Computation, 2022

Intrinsic Complexity of Recursive Functions on Natural Numbers with Standard Order.

Nikolay Bazhenov, Dariusz Kalocinski, Michal Wroclawski

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Well-Orders Realized by C.E. Equivalence Relations.

Nikolay Bazhenov, Maxim V. Zubkov

Proceedings of the Revolutions and Revelations in Computability, 2022

Calculating the Mind Change Complexity of Learning Algebraic Structures.

Nikolay Bazhenov, Vittorio Cipriani, Luca San Mauro

Proceedings of the Revolutions and Revelations in Computability, 2022

2021

On the Turing complexity of learning finite families of algebraic structures.

Nikolay Bazhenov, Luca San Mauro

J. Log. Comput., 2021

Degrees of bi-embeddable categoricity.

Nikolay Bazhenov, Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro

Comput., 2021

Approximating Approximate Reasoning: Fuzzy Sets and the Ershov Hierarchy.

Nikolay Bazhenov, Manat Mustafa, Sergei Ospichev, Luca San Mauro

Proceedings of the Logic, Rationality, and Interaction - 8th International Workshop, 2021

2020

Online presentations of finitely generated structures.

Nikolay Bazhenov, Iskander Sh. Kalimullin, Alexander G. Melnikov, Keng Meng Ng

Theor. Comput. Sci., 2020

Decompositions of decidable abelian groups.

Nikolay Bazhenov, Sergey Goncharov, Alexander G. Melnikov

Int. J. Algebra Comput., 2020

Learning families of algebraic structures from informant.

Nikolay Bazhenov, Ekaterina B. Fokina, Luca San Mauro

Inf. Comput., 2020

Classifying equivalence relations in the Ershov hierarchy.

Nikolay Bazhenov, Manat Mustafa, Luca San Mauro, Andrea Sorbi, Mars M. Yamaleev

Arch. Math. Log., 2020

Semilattices of Punctual Numberings.

Nikolay Bazhenov, Manat Mustafa, Sergei Ospichev

Proceedings of the Theory and Applications of Models of Computation, 2020

Definable Subsets of Polynomial-Time Algebraic Structures.

Nikolay Bazhenov

Proceedings of the Computer Science - Theory and Applications, 2020

A Note on Computable Embeddings for Ordinals and Their Reverses.

Nikolay Bazhenov, Stefan V. Vatev

Proceedings of the Beyond the Horizon of Computability, 2020

2019

Automatic and Polynomial-Time Algebraic Structures.

Nikolay Bazhenov, Matthew Harrison-Trainor, Iskander Sh. Kalimullin, Alexander G. Melnikov, Keng Meng Ng

J. Symb. Log., 2019

Computable Contact Algebras.

Nikolay Bazhenov

Fundam. Informaticae, 2019

Foundations of Online Structure Theory.

Nikolay Bazhenov, Rod Downey, Iskander Sh. Kalimullin, Alexander G. Melnikov

Bull. Symb. Log., 2019

Elementary theories and hereditary undecidability for semilattices of numberings.

Nikolay Bazhenov, Manat Mustafa, Mars M. Yamaleev

Arch. Math. Log., 2019

Degrees of bi-embeddable categoricity of equivalence structures.

Nikolay Bazhenov, Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro

Arch. Math. Log., 2019

Computable Isomorphisms of Distributive Lattices.

Nikolay Bazhenov, Manat Mustafa, Mars M. Yamaleev

Proceedings of the Theory and Applications of Models of Computation, 2019

Bounded Reducibility for Computable Numberings.

Nikolay Bazhenov, Manat Mustafa, Sergei Ospichev

Proceedings of the Computing with Foresight and Industry, 2019

Effective Embeddings for Pairs of Structures.

Nikolay Bazhenov, Hristo Ganchev, Stefan V. Vatev

Proceedings of the Computing with Foresight and Industry, 2019

2018

Autostability spectra for decidable structures.

Nikolay Bazhenov

Math. Struct. Comput. Sci., 2018

Degrees of Categoricity and spectral Dimension.

Nikolay Bazhenov, Iskander Sh. Kalimullin, Mars M. Yamaleev

J. Symb. Log., 2018

Degrees of Categoricity for Prime and Homogeneous Models.

Nikolay Bazhenov, Margarita Marchuk

Proceedings of the Sailing Routes in the World of Computation, 2018

2017

A Note on Effective Categoricity for Linear Orderings.

Nikolay Bazhenov

Proceedings of the Theory and Applications of Models of Computation, 2017

Degrees of Categoricity of Rigid Structures.

Nikolay Bazhenov, Mars M. Yamaleev

Proceedings of the Unveiling Dynamics and Complexity, 2017

Turing Computable Embeddings, Computable Infinitary Equivalence, and Linear Orders.

Nikolay Bazhenov

Proceedings of the Unveiling Dynamics and Complexity, 2017

2016

Categoricity Spectra for Polymodal Algebras.

Nikolay Bazhenov

Stud Logica, 2016

2015

Prime Model with No Degree of Autostability Relative to Strong Constructivizations.

Nikolay Bazhenov

Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015