Lattice of relational algebras definable in integers with successor
Aleksei L Semenov, Sergei Fedorovich Soprunov · arXiv (Cornell University) · 2012
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.