Alexander G. Melnikov

Office: INMS 3.05
Address: The Institute of Natural and Mathematical Sciences, Private Bag 102 904 NSMC Albany 0745 AUCKLAND
Email: alexander.g.melnikov@gmail.com

Academic CV

Click here for my CV which contains full journal references.

What's new?

Effectively closed subgroups of S. Preprint. With Greenberg, Nies, and Turetsky.
Eliminating unbounded search in computable algebra. CiE invited paper (accepted).
Computable torsion abelian groups. Preprint. With Ng.
Computable topological groups and Pontryagin duality. Preprint.
Uniform procedures in uncountable structures. Submitted. With Greenberg, Knight, and Turetsky.
On a question of Kalimullin. Submitted. With Downey and Igusa.
Computable distributive lattices. Submitted. With Bazhenov, Frolov, and Kalimullin.
A Friedberg enumeration of equivalence structures. Submitted. With Downey and Ng.
Torsion-free abelian groups with optimal Scott families. Submitted.
Structures computable without delay. Submitted. With Kalimullin and Ng.
Computable Polish group actions. Submitted. With Montalban.

PhD dissertations

Computability and Structure. PhD dissertation, The University of Auckland.
Effective properties of completely decomposable abelian groups. CSc (PhD) dissertation (in Russian).

Surveys

Computable Abelian Groups. The Bulletin of Symbolic Logic.
Computable Model Theory. ASL Lecture Notes in Logic. With Ekaterina Fokina and Valentina Harizanov.

Journal papers and papers in refereed conference proceedings

On computable field embeddings and difference closed fields. To appear in Canadian Journal of Mathematics. With Miller and Harrison-Trainor.
Computable functors and effective interpretability. To appear in Journal of Symbolic Logic. With Harroson-Trainor, Miller, and Montalban.
Proper divisibility in computable rings. To appear in Journal of Algebra. With Greenberg.
Independence in effective algebra. Journal of Algebra. With Montalban and Harrison-Trainor.
Abelian groups and the halting problem. To Appear in Annals fo Pure and Applied Logic. With Downey and Ng.
On Delta2-categoricity of equivalence relations. Annals of Pure and Applied Logic. With Downey and Ng.
New Degree Spectra of Abelian Groups. To appear in Notre Dame Journal of Formal Logic.
Iterated Effective Embeddings of Abelian p-Groups. International Journal of Algebra and Computation. With Downey and Ng.
Comparing Classes of Finite Sums. Algebra i Logika. With Uri Andrews, Dmitriy Dushenin, Cameron Hill, Julia Knight.
Computable Completely Decomposable Groups. Transactions of the American Mathematical Society. With Rod Downey.
Effectively Categorical Abelian Groups. Journal of Algebra. With Rod Downey.
Jump Degrees of Torsion-Free Abelian Groups. The Journal of Symbolic Logic. With Brooke Andersen, Asher Kach and D. Reed Solomon.
Limitwise Monotonic Sequences and Degree Spectra of Structures. Proceedings of the American Mathematical Society. With Iskander Kalimullin and Bakhadyr Khoussainov.
Ulm type, and Coding Rank-Homogeneous Trees in Other Structures. The Journal of Symbolic Logic. With Ekaterina Fokina, Julia F. Knight, C. Maher, and Sara Quinn.
Transforming Trees into Abelian Groups. New Zealand Journal of Mathematics.
Enumerations and Completely Decomposable Torsion-Free Abelian Groups. Theory Comput. Syst.
Decidability and Computability of Certain Torsion-Free Abelian Groups. Notre Dame Journal of Formal Logic. With Rod Downey, Sergei S. Goncharov, Asher Kach, Julia F. Knight, Oleg V. Kudinov, and Daniel Turetsky.
Computable Ordered Abelian Groups and Fields. CiE 2010.
Computable Structures and Operations on the Space of Continuous Functions. Fundamenta Mathematicae. With Keng Meng Ng
Computably Isometric Spaces. The Journal of Symbolic Logic.
The Classification Problem for Compact Computable Metric Spaces. CiE 2013. With Andre Nies.
Randomness and K-triviality in Computable Metric Spaces. Proceedings of the American Mathematical Society. With Andre Nies.

Other writings

Hrushovski constructions and randomizations in computable model theory. A review published in The Bulletin of Symbolic Logic.