2011/02/17 by Daniel Palacín, Palacin, Daniel
Computer Science · Mathematics · #Advanced Algebra and Logic #Advanced Topology and Set Theory #Computability, Logic, AI Algorithms #FOS: Mathematics #Logic (math.LO) #Rings, Modules, and Algebras
paper · pdf · doi:10.48550/arxiv.1102.3631
openalex publication_date 2011/02/17 · openalex created_date 2022/10/02 · openalex updated_date 2026/07/28
In the present paper we shall prove that countable ω-categorical simple CM-trivial theories and countable ω-categorical simple theories with strong stable forking are low. In addition, we observe that simple theories of bounded finite weight are low.