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

Some recent talks

Bases and generating sets in computable algebra. Mal'cev Meeting 2015, Novosibirsk.
Computable metric space theory is a generalization of effective algebra. CCA 2014, Darmstadt.
Iterated embeddings of computable p-groups. ASL 2014 North American Meeting.
Completely decomposable groups are arithmetically categorical. Computable structures and definability 2012, Sobolev Institute of Mathematics, Novosibirsk, Russia.
Computably categorical spaces. Computability and Complexity in Analysis 2012, Cambridge.
Hyperarithmetical categoricity and abelian groups. Semantics and Syntax: A Legacy of Alan Turing. Isaac Newton Institute for Mathematical Sciences, Cambridge, 2012.
Coding undecidable sets into computable abelian groups. Number Theory, Discrete Mathematics, and Their Applications. Tsighua University, China, 2012.
Interactions of computability and abelian group theory. Asian Logic Colloquium 2011 in Wellington.
Categoricity in computable metric spaces. Analysis and Randomness in Auckland, 2011.
Effective properties of abelian groups. Mal’tsev Meeting 2011 in Novosibirsk.