Alexander G. Melnikov

Publication Activity (10 Years)

Years Active: 2007-2025
Publications (10 Years): 31

Top Topics

Group Activities

Algebraic Structures

Top Venues

Ann. Pure Appl. Log.

Bull. Symb. Log.

Int. J. Algebra Comput.

Publications

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) (2025)
Nikolay Bazhenov, Marta Fiori-Carones, Lu Liu, Alexander G. Melnikov
Primitive recursive reverse mathematics. Ann. Pure Appl. Log. 175 (Issue 1, Part A) (2024)
Rodney G. Downey, Alexander G. Melnikov
Computably Compact Metric Spaces. Bull. Symb. Log. 29 (2) (2023)
Nikolay Bazhenov, Matthew Harrison-Trainor, Alexander G. Melnikov
Computable Stone spaces. Ann. Pure Appl. Log. 174 (9) (2023)
Marina Dorzhieva, Alexander G. Melnikov
Punctually presented structures I: Closure theorems. Comput. 12 (4) (2023)
Alexander G. Melnikov, Keng Meng Ng
Separating notions in effective topology. Int. J. Algebra Comput. 33 (8) (2023)
Rod Downey, Alexander G. Melnikov, Keng Meng Ng
Foundations of Online Structure Theory II: The Operator Approach. Log. Methods Comput. Sci. 17 (3) (2021)
Noam Greenberg, Matthew Harrison-Trainor, Alexander G. Melnikov, Dan Turetsky
Non-density in punctual computability. Ann. Pure Appl. Log. 172 (9) (2021)
Iskander Sh. Kalimullin, Alexander G. Melnikov, Antonio Montalbán
Punctual definability on structures. Ann. Pure Appl. Log. 172 (8) (2021)
Alexander G. Melnikov, Victor L. Selivanov, Mars M. Yamaleev
Turing reducibility in the fine hierarchy. Ann. Pure Appl. Log. 171 (7) (2020)
Nikolay Bazhenov, Iskander Sh. Kalimullin, Alexander G. Melnikov, Keng Meng Ng
Online presentations of finitely generated structures. Theor. Comput. Sci. 844 (2020)
Rod Downey, Noam Greenberg, Alexander G. Melnikov, Keng Meng Ng, Daniel Turetsky
Punctual Categoricity and Universality. J. Symb. Log. 85 (4) (2020)
Rodney G. Downey, Matthew Harrison-Trainor, Iskander Sh. Kalimullin, Alexander G. Melnikov, Daniel Turetsky
Graphs are not universal for online computability. J. Comput. Syst. Sci. 112 (2020)
Tyler Brown, Timothy H. McNicholl, Alexander G. Melnikov
On the Complexity of Classifying Lebesgue Spaces. J. Symb. Log. 85 (3) (2020)
Rodney G. Downey, Alexander G. Melnikov
Computable Analysis and Classification Problems. CiE (2020)
Nikolay Bazhenov, Sergey Goncharov, Alexander G. Melnikov
Decompositions of decidable abelian groups. Int. J. Algebra Comput. 30 (1) (2020)
Matthew Harrison-Trainor, Alexander G. Melnikov, Keng Meng Ng
Computability of Polish Spaces up to Homeomorphism. J. Symb. Log. 85 (4) (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)
Ziyuan Gao, Sanjay Jain, Bakhadyr Khoussainov, Wei Li, Alexander G. Melnikov, Karen Seidel, Frank Stephan
Random Subgroups of Rationals. MFCS (2019)
Rod Downey, Alexander G. Melnikov, Keng Meng Ng
Categorical linearly ordered structures. Ann. Pure Appl. Log. 170 (10) (2019)
Ziyuan Gao, Sanjay Jain, Bakhadyr Khoussainov, Wei Li, Alexander G. Melnikov, Karen Seidel, Frank Stephan
Random Subgroups of Rationals. CoRR (2019)
Noam Greenberg, Alexander G. Melnikov, Julia F. Knight, Daniel Turetsky
Uniform Procedures in uncountable Structures. J. Symb. Log. 83 (2) (2018)
Alexander G. Melnikov
Torsion-free abelian groups with optimal Scott families. J. Math. Log. 18 (1) (2018)
Alexander G. Melnikov, Antonio Montalbán
Computable Polish Group Actions. J. Symb. Log. 83 (2) (2018)
Matthew Harrison-Trainor, Alexander G. Melnikov, Russell G. Miller, Antonio Montalbán
Computable Functors and Effective interpretability. J. Symb. Log. 82 (1) (2017)
Iskander Sh. Kalimullin, Alexander G. Melnikov, Keng Meng Ng
Algebraic structures computable without delay. Theor. Comput. Sci. 674 (2017)
Rodney G. Downey, Alexander G. Melnikov, Keng Meng Ng
A Friedberg enumeration of equivalence structures. J. Math. Log. 17 (2) (2017)
Alexander G. Melnikov
New Degree Spectra of Abelian Groups. Notre Dame J. Formal Log. 58 (4) (2017)
Alexander G. Melnikov
Eliminating Unbounded Search in Computable Algebra. CiE (2017)
Rodney G. Downey, Alexander G. Melnikov, Keng Meng Ng
Abelian p-groups and the Halting problem. Ann. Pure Appl. Log. 167 (11) (2016)
Rod Downey, Alexander G. Melnikov, Keng Meng Ng
On -categoricity of equivalence relations. Ann. Pure Appl. Log. 166 (9) (2015)
Alexander G. Melnikov
Computable Abelian Groups. Bull. Symb. Log. 20 (3) (2014)
Rodney G. Downey, Alexander G. Melnikov, Keng Meng Ng
Iterated effective embeddings of abelian p-groups. Int. J. Algebra Comput. 24 (7) (2014)
Alexander G. Melnikov, André Nies
The Classification Problem for Compact Computable Metric Spaces. CiE (2013)
Alexander G. Melnikov
Computably isometric spaces. J. Symb. Log. 78 (4) (2013)
Brooke M. Andersen, Asher M. Kach, Alexander G. Melnikov, Reed Solomon
Jump degrees of torsion-free abelian groups. J. Symb. Log. 77 (4) (2012)
Ekaterina B. Fokina, Julia F. Knight, Alexander G. Melnikov, Sara Quinn, C. Safranski
Classes of Ulm type and coding rank-homogeneous trees in other structures. J. Symb. Log. 76 (3) (2011)
Rodney G. Downey, Sergei S. Goncharov, Asher M. Kach, Julia F. Knight, Oleg V. Kudinov, Alexander G. Melnikov, Daniel Turetsky
Decidability and Computability of Certain Torsion-Free Abelian Groups. Notre Dame J. Formal Log. 51 (1) (2010)
Alexander G. Melnikov
Computable Ordered Abelian Groups and Fields. CiE (2010)
Alexander G. Melnikov
-Categorical Completely Decomposable Torsion-Free Abelian Groups. CiE (2009)
Alexander G. Melnikov
Enumerations and Completely Decomposable Torsion-Free Abelian Groups. Theory Comput. Syst. 45 (4) (2009)
Alexander G. Melnikov
Enumerations and Torsion Free Abelian Groups. CiE (2007)