Lattice of relational algebras definable in integers with successor
  Svenonius theorem reduces the problem of first-order definability to the problem of relationship between groups of permutations. In the present paper we use this approach to describe the lattice of definable relations for the structure of integer numbers with the successor relation. 
A.L. Semenov, S.F. Soprunov
math.LO