Alexander Melnikov
Alexander Melnikov
Senior lecturer at Massey University, Auckland, New Zealand
Verified email at massey.ac.nz - Homepage
Title
Cited by
Cited by
Year
Computable functors and effective interpretability
M Harrison-Trainor, A Melnikov, R Miller, A Montalbán
arXiv preprint arXiv:1506.02737, 2015
502015
Computable model theory.
EB Fokina, VS Harizanov, AG Melnikov
Turing's Legacy, 124-194, 2014
382014
Limitwise monotonic sequences and degree spectra of structures
I Kalimullin, B Khoussainov, A Melnikov
Proceedings of the American Mathematical Society 141 (9), 3275-3289, 2013
352013
Computably isometric spaces
AG Melnikov
Journal of Symbolic Logic 78 (4), 1055-1085, 2013
312013
Effectively categorical abelian groups
R Downey, AG Melnikov
Journal of Algebra 373, 223-248, 2013
302013
Algebraic structures computable without delay
I Kalimullin, A Melnikov, KM Ng
Theoretical Computer Science 674, 73-98, 2017
272017
The classification problem for compact computable metric spaces
AG Melnikov, A Nies
Conference on Computability in Europe, 320-328, 2013
262013
Classes of Ulm type and coding rank-homogeneous trees in other structures
E Fokina, JF Knight, A Melnikov, SM Quinn, C Safranski
Journal of Symbolic Logic 76 (3), 846-869, 2011
242011
Computable completely decomposable groups
R Downey, A Melnikov
Transactions of the American Mathematical Society 366 (8), 4243-4266, 2014
212014
Computable structures and operations on the space of continuous functions
AG Melnikov, KM Ng
Fundamenta Mathematicae 233, 1-41, 2014
202014
Computable ordered abelian groups and fields
AG Melnikov
Conference on Computability in Europe, 321-330, 2010
192010
Foundations of online structure theory
N Bazhenov, R Downey, I Kalimullin, A Melnikov
Bulletin of Symbolic Logic 25 (2), 141-181, 2019
182019
Automatic and Polynomial-Time Algebraic Structures.
N Bazhenov, M Harrison-Trainor, IS Kalimullin, AG Melnikov, KM Ng
J. Symb. Log. 84 (4), 1630-1669, 2019
172019
This is a manuscript accepted for publication in The Journal of Symbolic Logic. Changes are likely to be introduced during the production process.
N BAZHENOV, M HARRISON-TRAINOR, I KALIMULLIN, A MELNIKOV, ...
17*
Independence in computable algebra
M Harrison-Trainor, A Melnikov, A Montalbán
Journal of Algebra 443, 441-468, 2015
162015
Enumerations and completely decomposable torsion-free abelian groups
AG Melnikov
Theory of Computing Systems 45 (4), 897-916, 2009
162009
Decidability and computability of certain torsion-free abelian groups
RG Downey, SS Goncharov, AM Kach, JF Knight, OV Kudinov, ...
Notre Dame Journal of Formal Logic 51 (1), 85-96, 2010
142010
Computable Polish Group Actions.
AG Melnikov, A Montalbán
J. Symb. Log. 83 (2), 443-460, 2018
132018
Computable abelian groups
AG Melnikov
The Bulletin of Symbolic Logic, 315-356, 2014
132014
Turing's Legacy: Developments from Turing's ideas in logic
R Downey
Cambridge University Press, 2014
132014
The system can't perform the operation now. Try again later.
Articles 1–20