This article is cited in 1 paper

The lattice of definability. Origins and directions of research

A. L. Semenov^ab, S. F. Soprunov<sup>cb

a</sup> Lomonosov Moscow State University (Moscow)
^b Axel Berg Institute of Cybernetics and Educational Computing FRC SCS of the Russian Academy of Sciences (Moscow)
^c Center for pedagogical excellence (Moscow)

Abstract: The article presents results and open problems related to definability spaces (reducts) and sources of this field since the XIX century. Finiteness conditions and constraints are investigated, including the depth of quantifier alternation and the number of arguments. Results related to the description of lattices of definability spaces for numerical and other natural structures are described. Research methods include the study of automorphism groups of elementary extensions of the structures under consideration, application of the Svenonius theorem.

Keywords: definability, definability space, reducts, Svenonius theorem, quantifier elimination, decidability, automorphisms.

UDC: 517

Received: 20.12.2020
Accepted: 21.02.2021

DOI: 10.22405/2226-8383-2018-22-1-304-327

 English version: , 2022, 106:2, 288–298