1. E. Ianovski, R. Miller, S. Ng, and A. Nies, “Complexity of equivalence relations and preorders from computability theory,” J. Symbolic Logic (in press).
2. A. G. Melnikov and A. Nies, Proceedings of the American Mathematical Society 141(8), 2885 (2013).
3. A. G. Melnikov and A. Nies, in Proceedings of CiE (Springer, Berlin, 2013), pp. 320–328.