Alexander Melnikov
Alexander Melnikov
Associate Professor at Victoria University of Wellington, New Zealand
Verified email at vuw.ac.nz - Homepage
Title
Cited by
Cited by
Year
Computable functors and effective interpretability
M Harrison-Trainor, A Melnikov, R Miller, A Montalbán
The Journal of Symbolic Logic 82 (1), 77-97, 2017
532017
Computable model theory.
EB Fokina, VS Harizanov, AG Melnikov
Turing's Legacy, 124-194, 2014
442014
Computably isometric spaces
AG Melnikov
The Journal of Symbolic Logic 78 (4), 1055-1085, 2013
412013
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
382013
Algebraic structures computable without delay
I Kalimullin, A Melnikov, KM Ng
Theoretical Computer Science 674, 73-98, 2017
372017
Effectively categorical abelian groups
R Downey, AG Melnikov
Journal of Algebra 373, 223-248, 2013
322013
Foundations of online structure theory
N Bazhenov, R Downey, I Kalimullin, A Melnikov
Bulletin of Symbolic Logic 25 (2), 141-181, 2019
282019
The classification problem for compact computable metric spaces
AG Melnikov, A Nies
Conference on Computability in Europe, 320-328, 2013
282013
Classes of Ulm type and coding rank-homogeneous trees in other structures
E Fokina, JF Knight, A Melnikov, SM Quinn, C Safranski
The Journal of Symbolic Logic 76 (3), 846-869, 2011
252011
Computable structures and operations on the space of continuous functions
AG Melnikov, KM Ng
Fundamenta Mathematicae 233, 1-41, 2014
232014
Computable completely decomposable groups
R Downey, A Melnikov
Transactions of the American Mathematical Society 366 (8), 4243-4266, 2014
232014
Automatic and polynomial-time algebraic structures
N Bazhenov, M Harrison-Trainor, I Kalimullin, A Melnikov, KM Ng
The Journal of Symbolic Logic 84 (4), 1630-1669, 2019
222019
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, ...
22*
Computable abelian groups
AG Melnikov
Bulletin of Symbolic Logic 20 (3), 315-356, 2014
202014
Computable ordered abelian groups and fields
AG Melnikov
Conference on Computability in Europe, 321-330, 2010
202010
Independence in computable algebra
M Harrison-Trainor, A Melnikov, A Montalbán
Journal of Algebra 443, 441-468, 2015
182015
Enumerations and Completely Decomposable Torsion-Free Abelian Groups.
A Melnikov
Theory of Computing Systems 45 (4), 2009
182009
Computable Polish group actions
A Melnikov, A Montalbán
The Journal of Symbolic Logic 83 (2), 443-460, 2018
162018
Eliminating unbounded search in computable algebra
AG Melnikov
Conference on Computability in Europe, 77-87, 2017
152017
Jump degrees of torsion-free abelian groups
BM Andersen, AM Kach, AG Melnikov, R Solomon
The Journal of Symbolic Logic 77 (4), 1067-1100, 2012
152012
The system can't perform the operation now. Try again later.
Articles 1–20