arXiv Analytics

Sign in

arXiv:1807.07102 [math.LO]AbstractReferencesReviewsResources

NIP omega-categorical structures: the rank 1 case

Pierre Simon

Published 2018-07-18Version 1

We classify primitive, rank 1, omega-categorical structures having polynomially many types over finite sets, or equivalently at most exponential growth of the number of finite substructures. For a fixed number of 4-types, we show that there are only finitely many such structures and that all are built out of finitely many linear orders interacting in a restricted number of ways. As an example of application, we deduce the classification of primitive structures homogeneous in a language consisting of n linear orders as well as all reducts of such structures.

Related articles: Most relevant | Search more
arXiv:1810.06531 [math.LO] (Published 2018-10-15)
On omega-categorical structures with few finite substructures
arXiv:1904.10336 [math.LO] (Published 2019-04-23)
On uniform definability of types over finite sets for NIP formulas
arXiv:math/9201248 [math.LO] (Published 1991-01-15)
A partition theorem for pairs of finite sets