Author:
Muchnik An. A.,Semenov A. L.
Reference11 articles.
1. A. L. Semenov, “Presburgerness of Predicates Regular in Two Number Systems,” Sib. Math. J. 18 (2), 289–300 (1977).
2. An. A. Muchnik, “The definable criterion for definability in Presburger arithmetic and its applications,” Theoret. Comput. Sci. 290 (3), 1433–1444 (2003).
3. A. Semenov, S. Soprunov, and V. Uspensky, “The lattice of definability. Origins, recent developments, and further directions,” in Computer Science: Theory and Applications, Lecture Notes in Comput. Sci. (Springer, Cham, 2014), Vol. 8476, pp. 23–38.
4. P. J. Cameron, “Transitivity of permutation groups on unordered sets,” Math. Z. 148 (2), 127–139 (1976).
5. C. Frasnay, “Quelques problèmes combinatoires concernant les ordres totaux et les relations monomorphes,” Ann. Inst. Fourier (Grenoble) 15 (2), 415–524 (1965).