Bulletin of Irkutsk State University. Series Mathematics
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Bulletin of Irkutsk State University. Series Mathematics:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Bulletin of Irkutsk State University. Series Mathematics, 2024, Volume 48, Pages 129–144
DOI: https://doi.org/10.26516/1997-7670.2024.48.129
(Mi iigum569)
 

Algebraic and logical methods in computer science and artificial intelligence

Variations of rigidity for ordered theories

Beibut Sh. Kulpeshovabc, Sergey V. Sudoplatovcd

a Kazakh British Technical University, Almaty, Kazakhstan
b Institute of Mathematics and Mathematical Modeling, Almaty, Kazakhstan
c Novosibirsk State Technical University, Novosibirsk, Russian Federation
d Sobolev Institute of Mathematics, Novosibirsk, Russian Federation
References:
Abstract: One of the important characteristics of structures is degrees of semantic and syntactic rigidity, as well as indices of rigidity, showing how much the given structure differs from semantically rigid structures, i.e., structures with one-element automorphism groups, as well as syntactically rigid structures, i.e., structures covered by definable closure of the empty set. Issues of describing the degrees and indices of rigidity represents interest both in a general context and in relation to ordering theories and their models. In the given paper, we study possibilities for semantic and syntactic rigidity for ordered theories, i.e., the rigidity with respect to automorphism group and with respect to definable closure. We describe values for indices and degrees of semantic and syntactic rigidity for well-ordered sets, for discrete, dense, and mixed orders and for countable models of $\aleph_0$-categorical weakly o-minimal theories. All possibilities for degrees of rigidity for countable linear orderings are described.
Keywords: definable closure, semantic rigidity, syntactic rigidity, degree of rigidity, ordered theory.
Funding agency Grant number
Ministry of Education and Science of the Republic of Kazakhstan AP19674850
Ministry of Science and Higher Education of the Russian Federation FWNF-2022-0012
This research has been funded by Science Committee of Ministry of Science and Higher Education of the Republic of Kazakhstan (Grant No. AP19674850), and it was carried out in the framework of the State Contract of Sobolev Institute of Mathematics, Project No. FWNF-2022-0012.
Received: 28.07.2023
Revised: 22.02.2024
Accepted: 27.02.2024
Document Type: Article
UDC: 510.67
MSC: 03C50, 03C30, 03C64
Language: English
Citation: Beibut Sh. Kulpeshov, Sergey V. Sudoplatov, “Variations of rigidity for ordered theories”, Bulletin of Irkutsk State University. Series Mathematics, 48 (2024), 129–144
Citation in format AMSBIB
\Bibitem{KulSud24}
\by Beibut~Sh.~Kulpeshov, Sergey~V.~Sudoplatov
\paper Variations of rigidity for ordered theories
\jour Bulletin of Irkutsk State University. Series Mathematics
\yr 2024
\vol 48
\pages 129--144
\mathnet{http://mi.mathnet.ru/iigum569}
\crossref{https://doi.org/10.26516/1997-7670.2024.48.129}
Linking options:
  • https://www.mathnet.ru/eng/iigum569
  • https://www.mathnet.ru/eng/iigum/v48/p129
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:123
    Full-text PDF :106
    References:43
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025