Sergey Vladimirovich Sudoplatov
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Sergey Vladimirovich Sudoplatov has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Beibut Shaiykovich Kulpeshov
Institute of Mathematics and Mathematical Modeling, Almaty, Kazakhstan
24 shared publications Novosibirsk State Technical University
9 shared publications- Nurlan D. Markhabatov
L. N. Gumilyov Eurasian National University
7 shared publications - Dmitry Yu. Emel’yanov
Novosibirsk State Technical University
5 shared publications - Beibut Sh. Kulpeshov
International Information Technology University
4 shared publications - In.I. Pavlyuk
Novosibirsk State Technical University, Novosibirsk, Russia
4 shared publications
Latest Publications
- 1 April 2026
- Published by Pleiades Publishing Ltd in Lobachevskii Journal of Mathematics
- Vol. 47 (4) , 1668-1682
Pseudo-Uncountably-Categorical Structures and Theories
We describe some possibilities of approximations by \(\omega_{1}\)-categorical structures and theories. The obtained results of approximations are called pseudo-\(\omega_{1}\)-categorical. Possibilities for expansions and restrictions of theories with respect to the \(\omega_{1}\)-categoricity and pseudo-\(\omega_{1}\)-categoricity are studied. We describe properties and possibilities for pseudo-\(\omega_{1}\)-categorical theories of partial orderings, whose connected components form chains. Theories of pseudo-\(\omega_{1}\)-categorical abelian groups are described, too.- 1 April 2026
- Published by Pleiades Publishing Ltd in Lobachevskii Journal of Mathematics
- Vol. 47 (4) , 1668-1682
Pseudo-Uncountably-Categorical Structures and Theories
We describe some possibilities of approximations by \(\omega_{1}\)-categorical structures and theories. The obtained results of approximations are called pseudo-\(\omega_{1}\)-categorical. Possibilities for expansions and restrictions of theories with respect to the \(\omega_{1}\)-categoricity and pseudo-\(\omega_{1}\)-categoricity are studied. We describe properties and possibilities for pseudo-\(\omega_{1}\)-categorical theories of partial orderings, whose connected components form chains. Theories of pseudo-\(\omega_{1}\)-categorical abelian groups are described, too.- 30 March 2026
- Published by Karagandy University of the name of academician E.A. Buketov in BULLETIN OF THE KARAGANDA UNIVERSITY-MATHEMATICS
- Vol. 121 (1)
Heritability of types of a pregeometry relative to a family of relational structures
A series of geometrical and topological properties induced by structures, including degeneration, modularity, local modularity, projectivity, local finiteness, etc., play an important role in clarifying structural relationships and in classifying basic and derivative semantical and syntactical objects related to a given class of structures and their valuable characteristics. It is natural to turn to the family of all structures on a given finite or infinite universe, which allows us to represent all possible structures of a given cardinality up to the definability and to describe relationships, possibilities of preserving and violating structural properties during enrichments and restrictions of structures within the framework of the chosen family. This paper studies the behavior of pregeometry types (degenerate, locally finite, modular) within the Boolean algebra B(M) of regular expansions and reducts of a relational structure M. We establish criteria for the inheritance of pregeometry properties under Boolean operations, proving that degeneracy and local finiteness are preserved under intersections. In contrast, we show through counterexamples that modularity generally fails to be preserved, as does local finiteness under unions. We formulate a sufficient condition of linear growth of the closure operator under which the union of locally finite structures remains locally finite. These results reveal a fundamental asymmetry between intersection and union operations, contributing to geometric stability theory by delineating the preservation boundaries of pregeometries in Boolean families of structures.
- 30 March 2026
- Published by Karagandy University of the name of academician E.A. Buketov in BULLETIN OF THE KARAGANDA UNIVERSITY-MATHEMATICS
- Vol. 121 (1)
Heritability of types of a pregeometry relative to a family of relational structures
A series of geometrical and topological properties induced by structures, including degeneration, modularity, local modularity, projectivity, local finiteness, etc., play an important role in clarifying structural relationships and in classifying basic and derivative semantical and syntactical objects related to a given class of structures and their valuable characteristics. It is natural to turn to the family of all structures on a given finite or infinite universe, which allows us to represent all possible structures of a given cardinality up to the definability and to describe relationships, possibilities of preserving and violating structural properties during enrichments and restrictions of structures within the framework of the chosen family. This paper studies the behavior of pregeometry types (degenerate, locally finite, modular) within the Boolean algebra B(M) of regular expansions and reducts of a relational structure M. We establish criteria for the inheritance of pregeometry properties under Boolean operations, proving that degeneracy and local finiteness are preserved under intersections. In contrast, we show through counterexamples that modularity generally fails to be preserved, as does local finiteness under unions. We formulate a sufficient condition of linear growth of the closure operator under which the union of locally finite structures remains locally finite. These results reveal a fundamental asymmetry between intersection and union operations, contributing to geometric stability theory by delineating the preservation boundaries of pregeometries in Boolean families of structures.
- Open Access
- 1 January 2026
- Published by Irkutsk State University in The Bulletin of Irkutsk State University. Series Mathematics
- Vol. 57 (57) , 96-112
Concatenations of Linear Orderings and Their Rigidity Characteristics
Among algebraic operations the operation of concatenation for families of words and for orderings is broadly used in various fields of theoretical and applied mathematics, and informatics. It allows to structure to group and to modify information relative required sequences. Degrees of rigidity are considered as a measures of the mobility of a structure with respect to both the automorphism group and definable closures. Classifying structures with respect to rigidity characteristics allows us to determine the dynamic capabilities of the structure when certain elements are fixed. By examining and describing the degrees of rigidity of concatenations of linear orders, we can both classify these concatenations and establish their diversity. We introduce a series of notions relative degrees of rigidity varying their possibilities from absolute rigidity till nowhere almost rigidity, somewhere non-almost rigidity, and absolute finite non-rigidity. These variations of rigidity characteristics are both described and classified for concatenations of linear orderings. We represent a classification of absolutely rigid linear orderings, describe all linear orderings whose all rigidity characteristics equal 1, and describe possibilities of rigidity characteristics for arbitrary concatenations of countable linear orderings.
- 1 January 2026
- Published by Irkutsk State University in The Bulletin of Irkutsk State University. Series Mathematics
- Vol. 57 (57) , 96-112
Open AccessConcatenations of Linear Orderings and Their Rigidity Characteristics
Among algebraic operations the operation of concatenation for families of words and for orderings is broadly used in various fields of theoretical and applied mathematics, and informatics. It allows to structure to group and to modify information relative required sequences. Degrees of rigidity are considered as a measures of the mobility of a structure with respect to both the automorphism group and definable closures. Classifying structures with respect to rigidity characteristics allows us to determine the dynamic capabilities of the structure when certain elements are fixed. By examining and describing the degrees of rigidity of concatenations of linear orders, we can both classify these concatenations and establish their diversity. We introduce a series of notions relative degrees of rigidity varying their possibilities from absolute rigidity till nowhere almost rigidity, somewhere non-almost rigidity, and absolute finite non-rigidity. These variations of rigidity characteristics are both described and classified for concatenations of linear orderings. We represent a classification of absolutely rigid linear orderings, describe all linear orderings whose all rigidity characteristics equal 1, and describe possibilities of rigidity characteristics for arbitrary concatenations of countable linear orderings.
- 1 January 2026
- Published by Irkutsk State University in The Bulletin of Irkutsk State University. Series Mathematics
- Vol. 55 (55) , 63-79
Algebras of Binary Formulas for Weakly Circularly Minimal Theories with Trivial Definable Closure: Monotonic-to-right Case
This article concerns the notion of weak circular minimality being a variant of o-minimality for circularly ordered structures. We consider the binary level of these structures forming algebras of binary isolating formulas, which are based on families of labels and compositions of related formulas. These algebras are studied for ℵ0-categorical 1-transitive non-primitive weakly circularly minimal theories of convexity rank greater than 1 with a trivial definable closure having a non-trivial monotonic-to-right function to the definable completion of a structure. On the basis of the study, the authors present a description of these algebras. It is shown that for this case there exist only commutative algebras. A strict 𝑠-deterministicity of such algebras for some natural number 𝑠 is also established.
- 1 January 2026
- Published by Irkutsk State University in The Bulletin of Irkutsk State University. Series Mathematics
- Vol. 55 (55) , 63-79
Algebras of Binary Formulas for Weakly Circularly Minimal Theories with Trivial Definable Closure: Monotonic-to-right Case
This article concerns the notion of weak circular minimality being a variant of o-minimality for circularly ordered structures. We consider the binary level of these structures forming algebras of binary isolating formulas, which are based on families of labels and compositions of related formulas. These algebras are studied for ℵ0-categorical 1-transitive non-primitive weakly circularly minimal theories of convexity rank greater than 1 with a trivial definable closure having a non-trivial monotonic-to-right function to the definable completion of a structure. On the basis of the study, the authors present a description of these algebras. It is shown that for this case there exist only commutative algebras. A strict 𝑠-deterministicity of such algebras for some natural number 𝑠 is also established.
- 4 June 2025
- Published by Steklov Mathematical Institute
- Vol. 117 (3) , 422-442
Псевдо-счетно-категоричные формулы и теории
Введено понятие псевдо-счетно-категоричной формулы, исследованы синтаксические и семантические возможности таких формул. Изучены аппроксимации теорий с помощью таких формул, включая псевдо-счетно-категоричные упорядоченные теории, теории абелевых групп и модулей, эренфойхтовы теории. Получено описание канонических представителей псевдо-счетно-категоричных упорядоченных теорий. Изучены возможности сохранения и нарушения псевдо-счетной категоричности при обогащениях и обеднениях теорий. Описаны счетные спектры псевдо-счетно-категоричных теорий. Библиография: 22 названия.
- 4 June 2025
- Published by Steklov Mathematical Institute
- Vol. 117 (3) , 422-442
Псевдо-счетно-категоричные формулы и теории
Введено понятие псевдо-счетно-категоричной формулы, исследованы синтаксические и семантические возможности таких формул. Изучены аппроксимации теорий с помощью таких формул, включая псевдо-счетно-категоричные упорядоченные теории, теории абелевых групп и модулей, эренфойхтовы теории. Получено описание канонических представителей псевдо-счетно-категоричных упорядоченных теорий. Изучены возможности сохранения и нарушения псевдо-счетной категоричности при обогащениях и обеднениях теорий. Описаны счетные спектры псевдо-счетно-категоричных теорий. Библиография: 22 названия.
- 1 April 2025
- Published by Pleiades Publishing Ltd in Mathematical Notes
- Vol. 117 (3-4) , 442-457
Pseudo-Countably-Categorical Formulas and Theories
The concept of a pseudo-countably-categorical formula is introduced, and the syntactic and semantic possibilities of such formulas are investigated. Approximations of theories using such formulas, including pseudo-countably-categorical ordered theories, theories of Abelian groups and modules, and Ehrenfeucht theories, are studied. A description of canonical representatives of pseudo-countably-categorical ordered theories is given. The preservation and violation of pseudo-countable categoricity under expansions and restrictions of theories are considered. Countable spectra of pseudo-countably-categorical theories are described.
- 1 April 2025
- Published by Pleiades Publishing Ltd in Mathematical Notes
- Vol. 117 (3-4) , 442-457
Pseudo-Countably-Categorical Formulas and Theories
The concept of a pseudo-countably-categorical formula is introduced, and the syntactic and semantic possibilities of such formulas are investigated. Approximations of theories using such formulas, including pseudo-countably-categorical ordered theories, theories of Abelian groups and modules, and Ehrenfeucht theories, are studied. A description of canonical representatives of pseudo-countably-categorical ordered theories is given. The preservation and violation of pseudo-countable categoricity under expansions and restrictions of theories are considered. Countable spectra of pseudo-countably-categorical theories are described.
- Open Access
- 29 March 2025
- Published by Karagandy University of the name of academician E.A. Buketov in BULLETIN OF THE KARAGANDA UNIVERSITY-MATHEMATICS
- Vol. 117 (1) , 104-117
Almost quasi-Urbanik structures and theories
The notions of almost quasi-Urbanik structures and theories, and studied possibilities for the degrees of quasi-Urbanikness, both for existential and universal cases were introduced. Links of these characteristics and their possible values are described. These values for structures of unary predicates, equivalence relations, linearly ordered, preordered and spherically ordered structures and theories as well as for strongly minimal ones, and for some natural operations including disjoint unions and compositions of structures and theories were studied. A series of examples illustrates possibilities of these characteristics.
- 29 March 2025
- Published by Karagandy University of the name of academician E.A. Buketov in BULLETIN OF THE KARAGANDA UNIVERSITY-MATHEMATICS
- Vol. 117 (1) , 104-117
Open AccessAlmost quasi-Urbanik structures and theories
The notions of almost quasi-Urbanik structures and theories, and studied possibilities for the degrees of quasi-Urbanikness, both for existential and universal cases were introduced. Links of these characteristics and their possible values are described. These values for structures of unary predicates, equivalence relations, linearly ordered, preordered and spherically ordered structures and theories as well as for strongly minimal ones, and for some natural operations including disjoint unions and compositions of structures and theories were studied. A series of examples illustrates possibilities of these characteristics.
- 1 January 2025
- Published by Irkutsk State University in The Bulletin of Irkutsk State University. Series Mathematics
- Vol. 54 (54) , 143-159
Expansions and Restrictions of Structures and Theories, Their Hierarchies
The study and description of possibilities of expansions and restrictions of structures and their theories is used to obtain a structural information both in general and for various natural algebraic, geometric, ordered theories and models. The origins for the description are based on known model-theoretic operations of Morleyzation, or Atomization, and Skolemization, allowing to preserve or naturally extend formulaically definable sets of a given structure, and obtain a level of quantifier elimination, where formulaically definable sets are represented as Boolean combinations of definable sets specified by quantifier-free formulae. The operations of Shelahizations, or Namizations, produce both extensions and expansions of a structure giving names or labels for definable sets. In the paper, we introduce and study some general principles and hierarchical properties of expansions and restrictions of structures and their theories. These principles are based on upper and lower cones, lattices, and permutations. The general approach is applied to describe these properties for classes of 𝜔-categorical theories and structures, Ehrenfeucht theories and their models, strongly minimal, 𝜔1-categorical, and stable ones. Here all these classes are closed under permutations. It is proved that any fusions of strongly minimal structures are strongly minimal, too, whereas the properties of 𝜔-categoricity, Ehrenfeuchtness, 𝜔1-categoricity, and stability can fail under fusions. It is also shown that the classes of 𝜔-categorical, strongly minimal and stable regular structures are closed under lower cones of all their elements, whereas the classes of Ehrenfeucht and 𝜔1-categorical structures do not have that property, with some infinite chains of expansions alternating Ehrenfeuchtness and non-Ehrenfeuchtness, and other infinite chains alternating 𝜔1-categoricity and non-𝜔1-categoricity.
- 1 January 2025
- Published by Irkutsk State University in The Bulletin of Irkutsk State University. Series Mathematics
- Vol. 54 (54) , 143-159
Expansions and Restrictions of Structures and Theories, Their Hierarchies
The study and description of possibilities of expansions and restrictions of structures and their theories is used to obtain a structural information both in general and for various natural algebraic, geometric, ordered theories and models. The origins for the description are based on known model-theoretic operations of Morleyzation, or Atomization, and Skolemization, allowing to preserve or naturally extend formulaically definable sets of a given structure, and obtain a level of quantifier elimination, where formulaically definable sets are represented as Boolean combinations of definable sets specified by quantifier-free formulae. The operations of Shelahizations, or Namizations, produce both extensions and expansions of a structure giving names or labels for definable sets. In the paper, we introduce and study some general principles and hierarchical properties of expansions and restrictions of structures and their theories. These principles are based on upper and lower cones, lattices, and permutations. The general approach is applied to describe these properties for classes of 𝜔-categorical theories and structures, Ehrenfeucht theories and their models, strongly minimal, 𝜔1-categorical, and stable ones. Here all these classes are closed under permutations. It is proved that any fusions of strongly minimal structures are strongly minimal, too, whereas the properties of 𝜔-categoricity, Ehrenfeuchtness, 𝜔1-categoricity, and stability can fail under fusions. It is also shown that the classes of 𝜔-categorical, strongly minimal and stable regular structures are closed under lower cones of all their elements, whereas the classes of Ehrenfeucht and 𝜔1-categorical structures do not have that property, with some infinite chains of expansions alternating Ehrenfeuchtness and non-Ehrenfeuchtness, and other infinite chains alternating 𝜔1-categoricity and non-𝜔1-categoricity.
- Open Access
- 30 December 2024
- Published by Institute of Mathematics and Mathematical Modeling in Kazakh Mathematical Journal
- Vol. 24 (4) , 6-21
On algebras of binary isolating formulas for weakly circularly minimal theoriesof convexity rank 2
This paper is devoted to the study of weakly circularly minimal circularly ordered structures. The simplest example of a circular order is a linear order with endpoints, in which the largest element is identified with the smallest. Another example is the order that arises when going around a circle. A circularly ordered structure is called weakly circularly minimal if any of its definable subsets is a finite union of convex sets and points. A theory is called weakly circularly minimal if all its models are weakly circularly minimal. Algebras of binary isolating formulas are described for ℵ0-categorical 1-transitive non-primitive weakly circularly minimal theories of convexity rank 2 with a trivial definable closure having a monotonic-to-right function to the definable completion of a structure and non-having a non-trivial equivalence relation partitioning the universe of a structure into finitely many convex classes.
- 30 December 2024
- Published by Institute of Mathematics and Mathematical Modeling in Kazakh Mathematical Journal
- Vol. 24 (4) , 6-21
Open AccessOn algebras of binary isolating formulas for weakly circularly minimal theoriesof convexity rank 2
This paper is devoted to the study of weakly circularly minimal circularly ordered structures. The simplest example of a circular order is a linear order with endpoints, in which the largest element is identified with the smallest. Another example is the order that arises when going around a circle. A circularly ordered structure is called weakly circularly minimal if any of its definable subsets is a finite union of convex sets and points. A theory is called weakly circularly minimal if all its models are weakly circularly minimal. Algebras of binary isolating formulas are described for ℵ0-categorical 1-transitive non-primitive weakly circularly minimal theories of convexity rank 2 with a trivial definable closure having a monotonic-to-right function to the definable completion of a structure and non-having a non-trivial equivalence relation partitioning the universe of a structure into finitely many convex classes.
- 1 December 2024
- Published by Pleiades Publishing Ltd in Lobachevskii Journal of Mathematics
- Vol. 45 (12) , 6515-6525
Pseudo-strongly-minimal Structures and Theories
We describe some possibilities of approximations by strongly minimal structures and theories. The obtained objects of approximations are called pseudo-strongly-minimal. Possibilities for expansions and restrictions of theories with respect to the strong minimality and pseudo-strong-minimality are described. We describe properties and possibilities for pseudo-strongly-minimal partial orderings, in particular, pseudo-strongly-minimal theories of partial orderings, whose connected components form chains. Theories of pseudo-strongly-minimal groups are described, too.
- 1 December 2024
- Published by Pleiades Publishing Ltd in Lobachevskii Journal of Mathematics
- Vol. 45 (12) , 6515-6525
Pseudo-strongly-minimal Structures and Theories
We describe some possibilities of approximations by strongly minimal structures and theories. The obtained objects of approximations are called pseudo-strongly-minimal. Possibilities for expansions and restrictions of theories with respect to the strong minimality and pseudo-strong-minimality are described. We describe properties and possibilities for pseudo-strongly-minimal partial orderings, in particular, pseudo-strongly-minimal theories of partial orderings, whose connected components form chains. Theories of pseudo-strongly-minimal groups are described, too.