Alexander G. Melnikov

According to our database, Alexander G. Melnikov authored at least 43 papers between 2007 and 2025.

Collaborative distances:

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

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

Primitive recursive reverse mathematics.

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

Ann. Pure Appl. Log., January, 2024

2023

Separating notions in effective topology.

Alexander G. Melnikov, Keng Meng Ng

Int. J. Algebra Comput., December, 2023

Computable Stone spaces.

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

Ann. Pure Appl. Log., October, 2023

Computably Compact Metric Spaces.

Rodney G. Downey, Alexander G. Melnikov

Bull. Symb. Log., June, 2023

Punctually presented structures I: Closure theorems.

Marina Dorzhieva, Alexander G. Melnikov

Comput., 2023

2021

Foundations of Online Structure Theory II: The Operator Approach.

Rod Downey, Alexander G. Melnikov, Keng Meng Ng

Log. Methods Comput. Sci., 2021

Punctual definability on structures.

Iskander Sh. Kalimullin, Alexander G. Melnikov, Antonio Montalbán

Ann. Pure Appl. Log., 2021

Non-density in punctual computability.

Noam Greenberg, Matthew Harrison-Trainor, Alexander G. Melnikov, Dan Turetsky

Ann. Pure Appl. Log., 2021

2020

Online presentations of finitely generated structures.

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

Theor. Comput. Sci., 2020

Computability of Polish Spaces up to Homeomorphism.

Matthew Harrison-Trainor, Alexander G. Melnikov, Keng Meng Ng

J. Symb. Log., 2020

Punctual Categoricity and Universality.

Rod Downey, Noam Greenberg, Alexander G. Melnikov, Keng Meng Ng, Daniel Turetsky

J. Symb. Log., 2020

On the Complexity of Classifying Lebesgue Spaces.

Tyler Brown, Timothy H. McNicholl, Alexander G. Melnikov

J. Symb. Log., 2020

Graphs are not universal for online computability.

Rodney G. Downey, Matthew Harrison-Trainor, Iskander Sh. Kalimullin, Alexander G. Melnikov, Daniel Turetsky

J. Comput. Syst. Sci., 2020

Decompositions of decidable abelian groups.

Nikolay Bazhenov, Sergey Goncharov, Alexander G. Melnikov

Int. J. Algebra Comput., 2020

Turing reducibility in the fine hierarchy.

Alexander G. Melnikov, Victor L. Selivanov, Mars M. Yamaleev

Ann. Pure Appl. Log., 2020

Computable Analysis and Classification Problems.

Rodney G. Downey, Alexander G. Melnikov

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

Foundations of Online Structure Theory.

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

Bull. Symb. Log., 2019

Categorical linearly ordered structures.

Rod Downey, Alexander G. Melnikov, Keng Meng Ng

Ann. Pure Appl. Log., 2019

Random Subgroups of Rationals.

Ziyuan Gao, Sanjay Jain, Bakhadyr Khoussainov, Wei Li, Alexander G. Melnikov, Karen Seidel, Frank Stephan

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018

Computable Polish Group Actions.

Alexander G. Melnikov, Antonio Montalbán

J. Symb. Log., 2018

Uniform Procedures in uncountable Structures.

Noam Greenberg, Alexander G. Melnikov, Julia F. Knight, Daniel Turetsky

J. Symb. Log., 2018

Torsion-free abelian groups with optimal Scott families.

Alexander G. Melnikov

J. Math. Log., 2018

2017

Algebraic structures computable without delay.

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

Theor. Comput. Sci., 2017

New Degree Spectra of Abelian Groups.

Alexander G. Melnikov

Notre Dame J. Formal Log., 2017

Computable Functors and Effective interpretability.

Matthew Harrison-Trainor, Alexander G. Melnikov, Russell G. Miller, Antonio Montalbán

J. Symb. Log., 2017

A Friedberg enumeration of equivalence structures.

Rodney G. Downey, Alexander G. Melnikov, Keng Meng Ng

J. Math. Log., 2017

Eliminating Unbounded Search in Computable Algebra.

Alexander G. Melnikov

Proceedings of the Unveiling Dynamics and Complexity, 2017

2016

Abelian p-groups and the Halting problem.

Rodney G. Downey, Alexander G. Melnikov, Keng Meng Ng

Ann. Pure Appl. Log., 2016

2015

On -categoricity of equivalence relations.

Rod Downey, Alexander G. Melnikov, Keng Meng Ng

Ann. Pure Appl. Log., 2015

2014

Iterated effective embeddings of abelian p-groups.

Rodney G. Downey, Alexander G. Melnikov, Keng Meng Ng

Int. J. Algebra Comput., 2014

Computable Abelian Groups.

Alexander G. Melnikov

Bull. Symb. Log., 2014

Computable model theory.

Ekaterina B. Fokina, Valentina S. Harizanov, Alexander G. Melnikov

Proceedings of the Turing's Legacy: Developments from Turing's Ideas in Logic, 2014

2013

Computably isometric spaces.

Alexander G. Melnikov

J. Symb. Log., 2013

The Classification Problem for Compact Computable Metric Spaces.

Alexander G. Melnikov, André Nies

Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012

Jump degrees of torsion-free abelian groups.

Brooke M. Andersen, Asher M. Kach, Alexander G. Melnikov, Reed Solomon

J. Symb. Log., 2012

2011

Classes of Ulm type and coding rank-homogeneous trees in other structures.

Ekaterina B. Fokina, Julia F. Knight, Alexander G. Melnikov, Sara Quinn, C. Safranski

J. Symb. Log., 2011

2010

Decidability and Computability of Certain Torsion-Free Abelian Groups.

Rodney G. Downey, Sergei S. Goncharov, Asher M. Kach, Julia F. Knight, Oleg V. Kudinov, Alexander G. Melnikov, Daniel Turetsky

Notre Dame J. Formal Log., 2010

Computable Ordered Abelian Groups and Fields.

Alexander G. Melnikov

Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

2009

Enumerations and Completely Decomposable Torsion-Free Abelian Groups.

Alexander G. Melnikov

Theory Comput. Syst., 2009

0^"-Categorical Completely Decomposable Torsion-Free Abelian Groups.

Alexander G. Melnikov

Proceedings of the Mathematical Theory and Computational Practice, 2009

2007

Enumerations and Torsion Free Abelian Groups.

Alexander G. Melnikov

Proceedings of the Computation and Logic in the Real World, 2007