Variations of rigidity

Sergey V. Sudoplatov

The Bulletin of Irkutsk State University. Series Mathematics, Tome 47 (2024), pp. 119-136

Résumé

One of the main derived objects of a given structure is its automorphism group, which shows how freely elements of the structure can be related to each other by automorphisms. Two extremes are observed here: the automorphism group can be transitive and allow any two elements to be connected to each other, or can be one-element, when no two different elements are connected by automorphisms, i.e., the structure is rigid. The rigidity given by a one-element group of automorphisms is called semantic. It is of interest to study and describe structures that do not differ much from semantically rigid structures, i.e., become semantically rigid after selecting some finite set of elements in the form of constants. Another, syntactic form of rigidity is based on the possibility of getting all elements of the structure into a definable closure of the empty set. It is also of interest here to describe “almost” syntactically rigid structures, i.e., structures covered by the definable closure of some finite set. The paper explores the possibilities of semantic and syntactic rigidity. The concepts of the degrees of semantic and syntactic rigidity are defined, both with respect to existence and with respect to the universality of finite sets of elements of a given cardinality. The notion of a rigidity index is defined, which shows an upper bound for the cardinalities of algebraic types, and its possible values are described. Rigidity variations and their degrees are studied both in the general case, for special languages, including the one-place predicate signature, and for some natural operations with structures, including disjunctive unions and compositions of structures. The possible values of the degrees for a number of natural examples are shown, as well as the dynamics of the degrees when taking the considered operations.

Détail

Keywords: definable closure, semantic rigidity, syntactic rigidity, degree of rigidity.

Bibliographie

[1] Emelyanov D.Yu., Kulpeshov B.Sh., Sudoplatov S.V., “Algebras of binary formulas for compositions of theories”, Algebra and Logic, 59:4 (2020), 295–312 | DOI | MR | Zbl

[2] Ershov Yu.L., Palyutin E.A., Mathematical Logic, Fizmatlit Publ, M., 2011, 356 pp. (in Russian) | MR

[3] Hodges W., Model Theory, Cambridge University Press, Cambridge, 1993, 772 pp. | MR | Zbl

[4] Marker D., Model Theory: An Introduction, Graduate texts in Mathematics, 217, Springer-Verlag, New York, 2002, 342 pp. | MR | Zbl

[5] Pillay A., Geometric Stability Theory, Clarendon Press, Oxford, 1996, 361 pp. | MR | Zbl

[6] Shelah S., Classification theory and the number of non-isomorphic models, North-Holland, Amsterdam, 1990, 705 pp. | MR | Zbl

[7] Sudoplatov S.V., Group Polygonometries, NSTU Publ, Novosibirsk, 2013, 302 pp.

[8] Sudoplatov S.V., “Models of cubic theories”, Bulletin of the Section of Logic, 43:1–2 (2014), 19–34 | MR | Zbl

[9] Sudoplatov S.V., “Formulas and Properties, Their Links and Characteristics”, Mathematics, 9:12 (2021), 1391 | DOI

[10] Sudoplatov S.V., Algebraic closures and their variations, 2023, 16 pp., arXiv: 2307.12536 [math.LO]

[11] Tent K., Ziegler M., A Course in Model Theory, Cambridge University Press, Cambridge, 2012, 248 pp. | MR | Zbl

[12] Woodrow R.E., Theories with a finite number of countable models and a small language, Ph. D. Thesis, Simon Fraser University, 1976, 99 pp. | MR