1. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979; Mir, Moscow, 1982).
2. L. Lipshitz, “Some remarks on the Diophantine problem for addition and divisibility,” Bull. Soc. Math. Belg. Ser. B 33, 41–52 (1981).
3. L. Lipshitz, “The Diophantine problem for addition and divisibility,” Trans. Am. Math. Soc. 235, 271–283 (1976).
4. A. Bel’tyukov, “Decidability of the universal theory of the natural numbers with addition and divisibility,” Zap. Nauchn. Semin. LOMI 60, 15–28 (1976).
5. C. Haase, PhD Thesis (Univ. of Oxford, Oxford, 2012).