Linearly ordered theories which are nearly countably categorical
DOI10.1134/S0001434617030099zbMath1420.03067OpenAlexW2609024788MaRDI QIDQ2364548
Sergeĭ Vladimirovich Sudoplatov, B. Sh. Kulpeshov
Publication date: 21 July 2017
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0001434617030099
linear orderbinary theoryweak o-minimalityconvexity rankEhrenfeucht theoryquite o-minimality1-local \(\omega\)-categoricityalmost \(\omega\)-categoricity
Classification theory, stability, and related concepts in model theory (03C45) Model theory of denumerable and separable structures (03C15) Categoricity and completeness of theories (03C35)
Related Items (10)
Cites Work
- Expansion of a model of a weakly o-minimal theory by a family of unary predicates
- Syntactic approach to constructions of generic models
- Weakly o-minimal structures and some of their properties
- On Theories Having Three Countable Models
- Weakly o-minimal structures and real closed fields
- Remarks on countable models
- Complete Theories with Finitely Many Countable Models. I
- Complete theories with finitely many countable models. II
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Linearly ordered theories which are nearly countably categorical