BINARY CONVEXITY RANK IN ALMOST OMEGA-CATEGORICAL WEAKLY O-MINIMAL THEORIES
https://doi.org/10.55452/1998-6688-2022-19-1-23-29
Abstract
The present paper concerns the notion of weak o-minimality that was initially deeply studied by D. Macpherson, D. Marker and C. Steinhorn. A subset A of a linearly ordered structure M is convex if for all a, b Î A and c Î M whenever a < c < b we have c Î A. A weakly o-minimal structure is a linearly ordered structure M = áM, =, <, …ñ such that any definable (with parameters) subset of M is a union of finitely many convex sets in M. A criterion for equality of the binary convexity ranks for non-weakly orthogonal non-algebraic 1-types in almost omega-categorical weakly o-minimal theories in case of existing an element of the set of realizations of one of these types the definable closure of which has a non-empty intersection with the set of realizations of another type is found.
About the Authors
Gaukhar Samatkyzy AmirbekKazakhstan
Master Student, School of Mathematics and Cybernetics
Beibut Shaiykovich Kulpeshov
Kazakhstan
Doctor of Physical and Mathematical Sciences, Professor, School of Mathematics and Cybernetics
References
1. Macpherson H.D., Marker D. and Steinhorn C. Weakly o-minimal structures and real closed fields // Transactions of The American Mathematical Society, vol. 352, issue 12, 2000, pp. 5435–5483.
2. Dickmann M. Elimination of quantifiers for ordered valuation rings // The Journal of Symbolic Logic, vol. 52, 1987, pp. 116–128.
3. Van Den Dries L., Lewenberg A.H. T-convexity and tame extensions // The Journal of Symbolic Logic, vol. 60, issue 1, 1995, pp. 74-102.
4. Baizhanov B.S. Expansion of a model of a weakly o-minimal theory by a family of unary predicates // The Journal of Symbolic Logic, vol. 66, isuue 3, 2001, pp. 1382–1414.
5. Kulpeshov B.Sh. Weakly o-minimal structures and some of their properties // The Journal of Symbolic Logic, vol. 63, issue 4, 1998, pp. 1511–1528.
6. Ikeda K., Pillay A., Tsuboi A. On theories having three countable models // Mathematical Logic Quarterly, vol. 44, issue 2, 1998, pp. 161–166.
7. Sudoplatov S.V. Classification of countable models of complete theories, part 1. Novosibirsk: Novosibirsk State Technical University Publishing House, 2018, ISBN 978-5-7782-3527-4, 326 p.
8. Peretyat'kin M.G. A theory with three countable models // Algebra and Logic, vol. 19, issue 2, 1980, pp. 139–147.
9. Kulpeshov B.Sh., Sudoplatov S.V. Linearly ordered theories which are nearly countably categorical // Mathematical Notes, vol. 101, issue 3, 2017, pp. 475–483.
10. Altayeva A.B., Kulpeshov B.Sh. Binarity of almost w -categorical quite o-minimal theories // Siberian Mathematical Journal, vol. 61, issue 3, 2020, pp. 379–390.
11. Kulpeshov B.Sh., Mustafin T.S. Almost w -categorical weakly o-minimal theories of convexity rank 1 // Siberian Mathematical Journal, 2021, vol. 62, no. 1, pp. 52–65.
12. Kulpeshov B.Sh. A criterion for binarity of almost w categorical weakly o-minimal theories // Siberian Mathematical Journal, 2021, vol. 62, no. 6, pp. 1063–1075.
13. Kulpeshov B.Sh. Countably categorical quite o-minimal theories // Journal of Mathematical Sciences, vol. 188, issue 4 (2013), pp. 387–397.
14. Verbovskiy V.V. On depth of functions of weakly o-minimal structures and an example of a weakly o-minimal structure without a weakly o-minimal theory // Proceedings of Informatics and Control Problems Institute, 1996, pp. 207–216.
15. Verbovskiy V.V. On formula depth of weakly o-minimal structures // Algebra and Model Theory (A.G. Pinus and K.N. Ponomaryov, editors), Novosibirsk, 1997, pp. 209–223.
Review
For citations:
Amirbek G.S., Kulpeshov B.Sh. BINARY CONVEXITY RANK IN ALMOST OMEGA-CATEGORICAL WEAKLY O-MINIMAL THEORIES. Herald of the Kazakh-British technical university. 2022;19(1):23-29. https://doi.org/10.55452/1998-6688-2022-19-1-23-29