7 citations · 7 across the 4 of their papers we have counts for
4 papers · 1 filter
On a lattice of relational spaces (reducts) for the order of integers
A. L. Semenov, S. F. Soprunov
We investigate the definability (reducts) lattice of the order of integers and describe a sublattice generated by relations 'between', 'cycle', 'separation', 'neighbor', '1-codirec…
Definability lattice for addition of rationals
A. L. Semenov, S. F. Soprunov
In the present paper we discuss the lattice of reducts of +
A Combinatorial Version of the Svenonius Theorem on Definability
A. L. Semenov, S. F. Soprunov
The Svenonius theorem describes the (first-order) definability in a structure in terms of permutations preserving the relations of elementary extensions of the structure. In the pr…
Lattice of relational algebras definable in integers with successor
A. L. Semenov, S. F. Soprunov
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 descri…