Alexander G. Melnikov

Orcid: 0000-0001-8781-7432

Affiliations:
  • Massey University, New Zealand


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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Computably and punctually universal spaces.
Ann. Pure Appl. Log., 2025

2024
Primitive recursive reverse mathematics.
Ann. Pure Appl. Log., January, 2024

2023
Separating notions in effective topology.
Int. J. Algebra Comput., December, 2023

Computable Stone spaces.
Ann. Pure Appl. Log., October, 2023

Computably Compact Metric Spaces.
Bull. Symb. Log., June, 2023

Punctually presented structures I: Closure theorems.
Comput., 2023

2021
Foundations of Online Structure Theory II: The Operator Approach.
Log. Methods Comput. Sci., 2021

Punctual definability on structures.
Ann. Pure Appl. Log., 2021

Non-density in punctual computability.
Ann. Pure Appl. Log., 2021

2020
Online presentations of finitely generated structures.
Theor. Comput. Sci., 2020

Computability of Polish Spaces up to Homeomorphism.
J. Symb. Log., 2020

Punctual Categoricity and Universality.
J. Symb. Log., 2020

On the Complexity of Classifying Lebesgue Spaces.
J. Symb. Log., 2020

Graphs are not universal for online computability.
J. Comput. Syst. Sci., 2020

Decompositions of decidable abelian groups.
Int. J. Algebra Comput., 2020

Turing reducibility in the fine hierarchy.
Ann. Pure Appl. Log., 2020

Computable Analysis and Classification Problems.
Proceedings of the Beyond the Horizon of Computability, 2020

2019
Automatic and Polynomial-Time Algebraic Structures.
J. Symb. Log., 2019

Foundations of Online Structure Theory.
Bull. Symb. Log., 2019

Categorical linearly ordered structures.
Ann. Pure Appl. Log., 2019

Random Subgroups of Rationals.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018
Computable Polish Group Actions.
J. Symb. Log., 2018

Uniform Procedures in uncountable Structures.
J. Symb. Log., 2018

Torsion-free abelian groups with optimal Scott families.
J. Math. Log., 2018

2017
Algebraic structures computable without delay.
Theor. Comput. Sci., 2017

New Degree Spectra of Abelian Groups.
Notre Dame J. Formal Log., 2017

Computable Functors and Effective interpretability.
J. Symb. Log., 2017

A Friedberg enumeration of equivalence structures.
J. Math. Log., 2017

Eliminating Unbounded Search in Computable Algebra.
Proceedings of the Unveiling Dynamics and Complexity, 2017

2016
Abelian p-groups and the Halting problem.
Ann. Pure Appl. Log., 2016

2015
On -categoricity of equivalence relations.
Ann. Pure Appl. Log., 2015

2014
Iterated effective embeddings of abelian p-groups.
Int. J. Algebra Comput., 2014

Computable Abelian Groups.
Bull. Symb. Log., 2014

Computable model theory.
Proceedings of the Turing's Legacy: Developments from Turing's Ideas in Logic, 2014

2013
Computably isometric spaces.
J. Symb. Log., 2013

The Classification Problem for Compact Computable Metric Spaces.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012
Jump degrees of torsion-free abelian groups.
J. Symb. Log., 2012

2011
Classes of Ulm type and coding rank-homogeneous trees in other structures.
J. Symb. Log., 2011

2010
Decidability and Computability of Certain Torsion-Free Abelian Groups.
Notre Dame J. Formal Log., 2010

Computable Ordered Abelian Groups and Fields.
Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

2009
Enumerations and Completely Decomposable Torsion-Free Abelian Groups.
Theory Comput. Syst., 2009

0<sup>"</sup>-Categorical Completely Decomposable Torsion-Free Abelian Groups.
Proceedings of the Mathematical Theory and Computational Practice, 2009

2007
Enumerations and Torsion Free Abelian Groups.
Proceedings of the Computation and Logic in the Real World, 2007


  Loading...