|
This article is cited in 5 scientific papers (total in 5 papers)
Vaught's conjecture for weakly $o$-minimal theories of finite convexity rank
B. Sh. Kulpeshovabc a Kazakh-British Technical University
b Institute of Mathematics and Mathematical Modeling, Ministry of Education and Science, Republic of Kazakhstan
c Novosibirsk State Technical University
Abstract:
We prove that weakly $o$-minimal theories of finite convexity rank having less
than $2^{\omega}$ countable models are binary. Our main result is the
confirmation of Vaught's conjecture for weakly $o$-minimal theories of finite
convexity rank.
Keywords:
weak $o$-minimality, Vaught's conjecture, countable model, convexity rank, binarity.
Received: 13.01.2019
Citation:
B. Sh. Kulpeshov, “Vaught's conjecture for weakly $o$-minimal theories of finite convexity rank”, Izv. Math., 84:2 (2020), 324–347
Linking options:
https://www.mathnet.ru/eng/im8894https://doi.org/10.1070/IM8894 https://www.mathnet.ru/eng/im/v84/i2/p126
|
Statistics & downloads: |
Abstract page: | 335 | Russian version PDF: | 41 | English version PDF: | 28 | References: | 31 | First page: | 8 |
|