RUS  ENG
Full version
JOURNALS // Bulletin of Irkutsk State University. Series Mathematics // Archive

Bulletin of Irkutsk State University. Series Mathematics, 2024 Volume 48, Pages 129–144 (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

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.

UDC: 510.67

MSC: 03C50, 03C30, 03C64

Received: 28.07.2023
Revised: 22.02.2024
Accepted: 27.02.2024

Language: English

DOI: 10.26516/1997-7670.2024.48.129



© Steklov Math. Inst. of RAS, 2026