26 citations · 33 across the 5 of their papers we have counts for
Showing math.LOShow all
3 papers · 1 filter
math.LO2015
Definability lattice for addition of rationals
A. L. Semenov, S. F. Soprunov
In the present paper we discuss the lattice of reducts of +
math.LO2013
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…
math.LO2012★ 7 cited
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…