Yuri Pritykin, Lecture Notes in Computer Science, 4588, Developments in Language Theory, 2007, 361
Alexander Rabinovich, Lecture Notes in Computer Science, 4207, Computer Science Logic, 2006, 546
Alexander Rabinovich, Wolfgang Thomas, Lecture Notes in Computer Science, 4207, Computer Science Logic, 2006, 562
Thanases Pheidas, Xavier Vidaux, Lecture Notes in Computer Science, 3526, New Computational Paradigms, 2005, 408
С. М. Дудаков, “Трансляционный результат для расширений арифметики Пресбургера одноместной функцией, согласованной со сложением”, Матем. заметки, 76:3 (2004), 362–371 ; S. M. Dudakov, “Collapse Result for Extensions of the Presburger Arithmetic by a Unary Function Compatible with Addition”, Math. Notes, 76:3 (2004), 339–347
А. Л. Семёнов, “Условия конечности для алгебр отношений”, Математическая логика и алгебра, Сборник статей. К 100-летию со дня рождения академика Петра Сергеевича Новикова, Труды МИАН, 242, Наука, МАИК «Наука/Интерпериодика», М., 2003, 103–107 ; A. L. Semenov, “Finiteness Conditions for Algebras of Relations”, Proc. Steklov Inst. Math., 242 (2003), 92–96
Ivan Korec, “A list of arithmetical structures complete with respect to the first-order definability”, Theoretical Computer Science, 257:1-2 (2001), 115
Patrick Cegielski, Denis Richard, “On arithmetical first-order theories allowing encoding and decoding of lists”, Theoretical Computer Science, 222:1-2 (1999), 55
Thanases Pheidas, “Extensions of Hilbert's tenth problem”, J. symb. log, 59:02 (1994), 372
Pascal Michel, “Complexity of logical theories involving coprimality”, Theoretical Computer Science, 106:2 (1992), 221