Publications
Article · Izvestiya Mathematics · September 20, 2019
Vaught’s conjecture for weakly -minimal theories of finite convexity rank
Abstract
Abstract We prove that weakly -minimal theories of finite convexity rank having less than countable models are binary. Our main result is the confirmation of Vaught’s conjecture for weakly -minimal theories of finite convexity rank.
Advanced Topology and Set TheoryRings, Modules, and AlgebrasLimits and Structures in Graph TheoryVaught's conjecturecountable modelsmodel theory of fields
More by Beibut Kulpeshov
- Strongly Minimal Partial Orderings Having an Infinite Non-trivial WidthLobachevskii Journal of Mathematics · 2026
- Pseudo-Uncountably-Categorical Structures and TheoriesLobachevskii Journal of Mathematics · 2026
- Algebras of Binary Formulas for Weakly Circularly Minimal Theories with Trivial Definable Closure: Monotonic-to-right CaseThe Bulletin of Irkutsk State University Series Mathematics · 2026
- E -combinations and closures of quite o-minimal theories2025
