On omega-categorical simple theories (Q1938394): Difference between revisions

The notion of lowness in the context of simple theories was introduced by \textit{S. Buechler} [J. Symb. Log. 64, No. 2, 817--824 (1999; Zbl 0930.03035)] and \textit{Z. Shami} [J. Symb. Log. 65, No. 4, 1481--1490 (2000; Zbl 0973.03047)]: a formula \(\varphi(x,y)\) is low if it does not divide \(n\) times for some \(n\) and a simple theory is low if all formulas are low. Stable theories and supersimple theories of finite \(D\)-rank are known to be low, while an example of a supersimple, non-low theory was found by \textit{E.Casanovas} and \textit{B. Kim} [Notre Dame J. Formal Log. 39, No. 4, 507--518 (1998; Zbl 0973.03048)]. The author proves that a countable, simple theory \(T\) is low if it satisfies at least one of the following conditions: \ (1) \(T\) is \(\omega\)-categorical and CM-trivial. \ (2) \(T\) is \(\omega\)-categorical and has strong stable forking. \ (3) \(T\) has bounded finite weight.