preprints.org > computer science and mathematics > computational mathematics > doi: 10.20944/preprints202208.0526.v1

Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Version 1 : Received: 29 August 2022 / Approved: 30 August 2022 / Online: 30 August 2022 (14:39:19 CEST)

The Svenonius theorem establishes the correspondence between definability of relations in a countable structure and automorphism groups of these relations in the extension of the structure. This correspondence may help in finding the description of the definability lattice constituted by all definability spaces (reducts) of the original structure. However, the major difficulty here is the necessity to consider the extensions which generally are obscure and hardly amenable to classification. Because of that results on definability lattices were obtained only for $\omega$-categorical structures (i.\,e. those in which all elementary extensions are isomorphic to the structure itself). All known definability lattices for such structures proved to be finite. In this work we introduce the concept of upwards complete structure as such in which all its extensions are isomorphic. Further we define upwards completions structures. For such structures Galois correspondence between definability lattice and the lattice of closed supergroups of automorphism group of the structure is an anti-automorphism. These lattices could be infinite in general. We describe the natural class of structures which have upwards completion, that is discretely homogeneous graphs, present the explicit constrcution of their completion and automorphism groups of completions. We establish the general \emph{localness} property of discretely homogeneous graphs and present the examples of completable structures and their completions.

definability; definability lattice; automorphism group; reduct; Svenonius theorem

Computer Science and Mathematics, Computational Mathematics

* All users must log in before leaving a comment