Nikolay Bazhenov

From MaRDI portal
(Redirected from Person:1670716)


List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
On learning down-sets in quasi-orders, and ideals in Boolean algebras
Theory of Computing Systems
2025-01-13Paper
On learning families of ideals in lattices and Boolean algebras
 
2024-11-12Paper
On learning for families of algebraic structures
Lobachevskii Journal of Mathematics
2024-11-08Paper
Computably and punctually universal spaces
Annals of Pure and Applied Logic
2024-10-07Paper
Degree spectra, and relative acceptability of notations
 
2024-09-25Paper
Decidable categoricity spectra for almost prime models
Algebra and Logic
2024-09-04Paper
A note on joins and meets for positive linear preorders
Sibirskie Elektronnye Matematicheskie Izvestiya
2024-08-14Paper
Every \(\Delta^0_2\) Polish space is computable topological
Proceedings of the American Mathematical Society
2024-06-13Paper
On diagonal functions for equivalence relations
Archive for Mathematical Logic
2024-04-16Paper
Computable reducibility for computable linear orders of type \(\omega \)
Journal of Mathematical Sciences (New York)
2024-02-01Paper
On the main scientific achievements of Victor Selivanov
Computability
2024-01-31Paper
A note on the degree structure of primitive recursive m-reducibility
 
2023-11-26Paper
Primitive recursive reverse mathematics
Annals of Pure and Applied Logic
2023-10-12Paper
On the effective universality of mereological theories
Mathematical Logic Quarterly
2023-09-12Paper
Rogers semilattices of limitwise monotonic numberings
Mathematical Logic Quarterly
2023-09-12Paper
Computable Heyting algebras with distinguished atoms and coatoms
Journal of Logic, Language and Information
2023-08-16Paper
On two types of concept lattices in the theory of numberings
Lecture Notes in Computer Science
2023-08-04Paper
Computable Stone spaces
Annals of Pure and Applied Logic
2023-07-26Paper
Complexity of \(\Sigma^0_n\)-classifications for definable subsets
Archive for Mathematical Logic
2023-04-27Paper
Learning algebraic structures with the help of Borel equivalence relations
Theoretical Computer Science
2023-03-10Paper
On universal positive graphs
Siberian Mathematical Journal
2023-03-02Paper
Computable embeddability for algebraic structures
Asian-European Journal of Mathematics
2023-02-02Paper
Primitive recursive equivalence relations and their primitive recursive complexity
Computability
2023-01-12Paper
Minimal generalized computable numberings and families of positive preorders
Algebra and Logic
2023-01-04Paper
Semilattices of punctual numberings
 
2022-12-22Paper
A note on computable embeddings for ordinals and their reverses
 
2022-12-16Paper
Calculating the mind change complexity of learning algebraic structures
 
2022-12-07Paper
Well-orders realized by C.E. equivalence relations
 
2022-12-07Paper
Rogers semilattices of punctual numberings
Mathematical Structures in Computer Science
2022-11-17Paper
Definable Subsets of Polynomial-Time Algebraic Structures
Computer Science – Theory and Applications
2022-10-19Paper
Index sets for classes of positive preorders
Algebra and Logic
2022-08-22Paper
Approximating approximate reasoning: fuzzy sets and the Ershov hierarchy
 
2022-06-24Paper
Relatively acceptable notation
 
2022-05-02Paper
On bi-embeddable categoricity of algebraic structures
Annals of Pure and Applied Logic
2022-01-18Paper
Computable embeddings for pairs of linear orders
Algebra and Logic
2021-12-01Paper
Punctual categoricity spectra of computably categorical structures
Algebra and Logic
2021-12-01Paper
On the Turing complexity of learning finite families of algebraic structures
Journal Of Logic And Computation
2021-11-09Paper
Learning algebraic structures with the help of Borel equivalence relations
 
2021-10-27Paper
HKSS-completeness of modal algebras
Sibirskie Elektronnye Matematicheskie Izvestiya
2021-10-19Paper
Intrinsic complexity of recursive functions on natural numbers with standard order
 
2021-10-04Paper
On categoricity spectra for locally finite graphs
Siberian Mathematical Journal
2021-09-27Paper
Punctual equivalence relations and their (punctual) complexity
 
2021-09-09Paper
Approximating approximate reasoning: Fuzzy sets and the Ershov hierarchy
 
2021-07-21Paper
Categoricity spectra of computable structures
Journal of Mathematical Sciences (New York)
2021-06-29Paper
Degrees of bi-embeddable categoricity
Computability
2021-06-25Paper
Theories of Rogers semilattices of analytical numberings
Lobachevskii Journal of Mathematics
2021-06-07Paper
On universal pairs in the Ershov hierarchy
Siberian Mathematical Journal
2021-02-03Paper
Numberings in the analytical hierarchy
Algebra and Logic
2021-01-08Paper
Learning families of algebraic structures from informant
Information and Computation
2020-12-15Paper
The structure of computably enumerable preorder relations
Algebra and Logic
2020-12-04Paper
Strong degrees of categoricity and weak density
Lobachevskii Journal of Mathematics
2020-11-11Paper
Minimal equivalence relations in hyperarithmetical and analytical hierarchies
Lobachevskii Journal of Mathematics
2020-10-27Paper
Online presentations of finitely generated structures
Theoretical Computer Science
2020-10-21Paper
Classifying equivalence relations in the Ershov hierarchy
Archive for Mathematical Logic
2020-10-15Paper
Rogers semilattices in the analytical hierarchy: The case of finite families
 
2020-10-02Paper
A note on decidable categoricity and index sets
Sibirskie Elektronnye Matematicheskie Izvestiya
2020-09-24Paper
Bounded reducibility for computable numberings
 
2020-05-12Paper
Effective embeddings for pairs of structures
 
2020-05-12Paper
Weakly precomplete equivalence relations in the Ershov hierarchy
Algebra and Logic
2020-02-28Paper
Constructing decidable graphs from decidable structures
Algebra and Logic
2020-02-28Paper
Decompositions of decidable abelian groups
International Journal of Algebra and Computation
2020-02-17Paper
Comparing the isomorphism types of equivalence structures and preorders
 
2020-01-22Paper
A Note on Computable Embeddings for Ordinals and Their Reverses
 
2020-01-17Paper
AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
Journal of Symbolic Logic
2020-01-10Paper
Isomorphism types of Rogers semilattices in the analytical hierarchy
 
2019-12-11Paper
On decidability of list structures
Siberian Mathematical Journal
2019-11-01Paper
Computable contact algebras
Fundamenta Informaticae
2019-10-31Paper
Computable isomorphisms of distributive lattices
 
2019-10-15Paper
FOUNDATIONS OF ONLINE STRUCTURE THEORY
The Bulletin of Symbolic Logic
2019-08-01Paper
Rogers semilattices for families of equivalence relations in the Ershov hierarchy
Siberian Mathematical Journal
2019-07-18Paper
Degrees of bi-embeddable categoricity of equivalence structures
Archive for Mathematical Logic
2019-07-04Paper
Elementary theories and hereditary undecidability for semilattices of numberings
Archive for Mathematical Logic
2019-03-27Paper
Computable bi-embeddable categoricity
Algebra and Logic
2019-03-13Paper
Computable embeddings for pairs of linear orders
 
2019-01-07Paper
Degrees of autostability for prime Boolean algebras
Algebra and Logic
2018-11-14Paper
Degrees of autostability relative to strong constructivizations of graphs
Siberian Mathematical Journal
2018-11-13Paper
Degrees of categoricity for prime and homogeneous models
 
2018-09-06Paper
On dark computably enumerable equivalence relations
Siberian Mathematical Journal
2018-06-20Paper
Degrees of categoricity and spectral dimension
Journal of Symbolic Logic
2018-05-02Paper
Effective categoricity for distributive lattices and Heyting algebras
Lobachevskii Journal of Mathematics
2017-09-20Paper
Boolean algebras realized by c.e. equivalence relations
Sibirskie Elektronnye Matematicheskie Izvestiya
2017-09-11Paper
Turing computable embeddings, computable infinitary equivalence, and linear orders
 
2017-08-04Paper
Degrees of categoricity of rigid structures
 
2017-08-04Paper
Degrees of autostability relative to strong constructivizations for Boolean algebras
Algebra and Logic
2017-07-18Paper
Degrees of categoricity vs. strong degrees of categoricity
Algebra and Logic
2017-07-18Paper
Degrees of autostability for linear orders and linearly ordered abelian groups
Algebra and Logic
2017-07-18Paper
The index set of the groups autostable relative to strong constructivizations
Siberian Mathematical Journal
2017-06-30Paper
A note on effective categoricity for linear orderings
Lecture Notes in Computer Science
2017-05-19Paper
Categoricity spectra for polymodal algebras
Studia Logica
2017-03-02Paper
Automatic structures and the theory of lists
Sibirskie Elektronnye Matematicheskie Izvestiya
2016-07-28Paper
The index set of linear orderings that are autostable relative to strong constructivizations
 
2016-07-22Paper
2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms
Journal of Mathematical Sciences
2016-07-22Paper
Boolean algebras with distinguished endomorphisms and generating trees
Journal of Mathematical Sciences
2016-07-22Paper
Index sets of autostable relative to strong constructivizations constructive models for familiar classes
Doklady Mathematics
2016-01-29Paper
Computable numberings of the class of Boolean algebras with distinguished endomorphisms
Algebra and Logic
2015-11-13Paper
The branching theorem and computable categoricity in the Ershov hierarchy
Algebra and Logic
2015-10-27Paper
Prime model with no degree of autostability relative to strong constructivizations
Evolving Computability
2015-10-20Paper
The index set of Boolean algebras autostable relative to strong constructivizations
Siberian Mathematical Journal
2015-09-28Paper
Autostability spectra for Boolean algebras
Algebra and Logic
2015-07-28Paper
scientific article; zbMATH DE number 6261978 (Why is no real title available?)
 
2014-02-26Paper
On \(\Delta^0_2\)-categoricity of Boolean algebras
 
2014-02-26Paper
Degrees of categoricity for superatomic Boolean algebras
Algebra and Logic
2014-02-06Paper
Computable categoricity of the Boolean algebra \(\mathfrak{B}(\omega )\) with a distinguished automorphism
Algebra and Logic
2013-11-27Paper
Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism
Algebra and Logic
2013-02-21Paper
A Lopez-Escobar Theorem for Continuous Domains
 
N/APaper
Learning Families of Algebraic Structures from Text
 
N/APaper


Research outcomes over time


This page was built for person: Nikolay Bazhenov