A combinatorial version of the Svenonius theorem on definability

DOI10.1093/jigpal/jzv038zbMath1405.03076arXiv1301.2412OpenAlexW2254906201MaRDI QIDQ4644608

S. F. Soprunov, A. L. Semenov

Publication date: 8 January 2019

Published in: Logic Journal of IGPL (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1301.2412

zbMATH Keywords

automorphismsdefinabilityreductsdefinability spacesSvenonius theorem

Mathematics Subject Classification ID

Model-theoretic algebra (03C60) General theory for infinite permutation groups (20B07) Interpolation, preservation, definability (03C40)

Related Items (2)

Lattice of definability (of reducts) for integers with successor ⋮ The lattice of definability: origins, recent developments, and further directions

This page was built for publication: A combinatorial version of the Svenonius theorem on definability