Countably categorical quite o-minimal theories

Abstract

UDC 510.67 We present a complete description of ℵ0-categorical quite o-minimal theories introduced earlier as an extension of the class of o-minimal theories but “quite” inherited various their properties. Bibliography :6 titles. Let L be a countable first order language. Throughout the paper, we consider L-structures and assume that L contains a binary relation symbol < interpreted as a linear ordering in these structures. For arbitrary subsets A and B of a structure M we write A<B if a<b for a ∈ A and b ∈ B. For an arbitrary complete type p we denote by p(M ) the set of realizations of p in M . (∗)