IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i20p3748-d939794.html
   My bibliography  Save this article

Automorphisms and Definability (of Reducts) for Upward Complete Structures

Author

Listed:
  • Alexei Semenov

    (Faculty of Mechanics and Mathematics, Lomonosov Moscow State University, 119991 Moscow, Russia
    Moscow Institute of Physics and Technology, 117303 Moscow, Russia
    These authors contributed equally to this work.)

  • Sergei Soprunov

    (Center for Pedagogical Mastery, 119270 Moscow, Russia
    These authors contributed equally to this work.)

Abstract

The Svenonius theorem establishes the correspondence between definability of relations in a countable structure and automorphism groups of these relations in extensions of the structure. This may help in finding a description of the lattice constituted by all definability spaces (reducts) of the original structure. Results on definability lattices were previously obtained only for ω -categorical structures with finite signature. In our work, we introduce the concept of an upward complete structure and define the upward completion of a structure. For upward complete structures, the Galois correspondence between definability lattice and the lattice of closed supergroups of the automorphism group of the structure is an anti-isomorphism. We describe the natural class of structures which have upward completion, we call them discretely homogeneous graphs, present the explicit construction of their completion and automorphism groups of completions. We establish the general localness property of discretely homogeneous graphs and present examples of completable structures and their completions.

Suggested Citation

  • Alexei Semenov & Sergei Soprunov, 2022. "Automorphisms and Definability (of Reducts) for Upward Complete Structures," Mathematics, MDPI, vol. 10(20), pages 1-7, October.
  • Handle: RePEc:gam:jmathe:v:10:y:2022:i:20:p:3748-:d:939794
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/20/3748/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/10/20/3748/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:10:y:2022:i:20:p:3748-:d:939794. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.