Lattice of definability (of reducts) for integers with successor
Abstract
In this paper the lattice of definability for integers with a successor (the relation $y = x + 1$ ) is described. The lattice, whose elements are also knows as reducts, consists of three (naturally described) infinite series of relations. The proof uses a version of the Svenonius theorem for structures of special form.
- Publication:
-
Izvestiya: Mathematics
- Pub Date:
- December 2021
- DOI:
- 10.1070/IM9107
- Bibcode:
- 2021IzMat..85.1257S
- Keywords:
-
- definability;
- reducts;
- Svenonius theorem