Volgen
Alexander Melnikov
Alexander Melnikov
Associate Professor at Victoria University of Wellington, New Zealand
Geverifieerd e-mailadres voor vuw.ac.nz - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
Computably isometric spaces
AG Melnikov
The Journal of Symbolic Logic 78 (4), 1055-1085, 2013
642013
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
632017
Computable model theory.
EB Fokina, VS Harizanov, AG Melnikov
Turing's Legacy, 124-194, 2014
592014
Algebraic structures computable without delay
I Kalimullin, A Melnikov, KM Ng
Theoretical Computer Science 674, 73-98, 2017
572017
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
442013
Foundations of online structure theory
N Bazhenov, R Downey, I Kalimullin, A Melnikov
Bulletin of Symbolic Logic 25 (2), 141-181, 2019
412019
The classification problem for compact computable metric spaces
AG Melnikov, A Nies
Conference on Computability in Europe, 320-328, 2013
402013
Effectively categorical abelian groups
R Downey, AG Melnikov
Journal of Algebra 373, 223-248, 2013
342013
Computable structures and operations on the space of continuous functions
AG Melnikov, KM Ng
Fundamenta Mathematicae 233, 1-41, 2014
332014
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
292019
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, ...
29*
Computable abelian groups
AG Melnikov
Bulletin of Symbolic Logic 20 (3), 315-356, 2014
282014
Computable completely decomposable groups
R Downey, A Melnikov
Transactions of the American Mathematical Society 366 (8), 4243-4266, 2014
252014
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
Enumerations and completely decomposable torsion-free abelian groups
AG Melnikov
Theory of Computing Systems 45 (4), 897-916, 2009
252009
Computable Polish group actions
A Melnikov, A Montalbán
The Journal of Symbolic Logic 83 (2), 443-460, 2018
242018
Independence in computable algebra
M Harrison-Trainor, A Melnikov, A Montalbán
Journal of Algebra 443, 441-468, 2015
232015
Computable topological groups and Pontryagin duality
A Melnikov
Transactions of the American Mathematical Society 370 (12), 8709-8737, 2018
222018
Eliminating unbounded search in computable algebra
AG Melnikov
Unveiling Dynamics and Complexity: 13th Conference on Computability in …, 2017
212017
Foundations of online structure theory II: The operator approach
R Downey, A Melnikov, KM Ng
Logical Methods in Computer Science 17, 2021
202021
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20