17 June 2024 in Journal of Algebra and Its Applications
21 June 2025 in Journal of Mathematics, Mechanics and Computer Science
This paper aims to define the notion of o-minimality for partially ordered sets. Originally, the notion of o-minimality was introduced for linearly ordered sets in the following way: A linearly ordered structure is said to be o-minimal if any definable subset is a finite union of intervals and points. For partially ordered sets, this definition does not work. One of the main reasons for this is that the complement of an interval need not be a finite union of intervals, as happens in linearly ordered sets. Here we suggest a notion of a generalized interval which makes possible defining o-minimality for such a partial case of partially ordered sets as a dense meet-tree in a classical way: an expansion of a dense meet-tree is said to be o-minimal if any definable subset is a finite union of generalized interval and points. We think that this approach allows us to transferthe machinery for investigating o-minimality for linearly ordered structures to partially ordered structures.
23 December 2022 in Herald of the Kazakh-British technical university
We study all possible constant expansions of the structure of the dense meet-tree ⟨М; <, П⟩ [3]. Here, a dense meet-tree is a lower semilattice without the least and greatest elements. An example of this structure with the constant expansion is a theory that has exactly three pairwise non-isomorphic countable models [6], which is a good example in the context of Ehrenfeucht theories. We study all possible constant expansions of the structure of the dense meet-tree by using a general theory of classification of countable models of complete theories [7], as well as the description of the specificity for the theory of a dense-meet tree, namely, some distributions of countable models of these theories in terms of Rudin– Keisler preorders and distribution functions of numbers of limit models. In this paper, we give a new proof of the theorem that the dense meet-tree theory is countable categorical and complete, which was originally proved by Peretyat’kin. Also, this theory admits quantifier elimination since complete types are forced by a set of quantifier-free formulas, and this leads to the fact that it is decidable
6 July 2025 in Herald of the Kazakh-British technical university
The notion of o-minimality is highly productive for linearly ordered structures, but a direct transfer of this concept to partially ordered sets encounters certain difficulties. Indeed, there is a striking scarcity of works on o-minimal partially ordered structures. The standard definition of o-minimality for partially ordered structures states that every definable subset is a Boolean combination of intervals and points. However, since Boolean combinations involve the operation of taking set complements, and in partially ordered sets the complement of an interval can be extremely complex, this approach presents certain challenges for studying the resulting class of structures. We propose using an alternative definition of o-minimality: a partially ordered structure is o-minimal if every definable subset is a finite union of generalized intervals and points. In the paper, we provide a number of examples demonstrating that this definition is nontrivial and that there exist structures which are o-minimal in this new sense.