On \omega-categorical simple theories
Daniel Palacin
TL;DR
This paper investigates properties of certain countable -categorical simple theories, establishing conditions under which they are low, and explores related concepts like CM-triviality and stable forking.
Contribution
It proves that countable -categorical simple CM-trivial theories and theories with stable forking are low, and discusses the implications for theories with bounded finite weight.
Findings
Countable -categorical simple CM-trivial theories are low.
Countable -categorical simple theories with stable forking are low.
Simple theories of bounded finite weight are low.
Abstract
In the present paper we shall prove that countable \omega-categorical simple CM-trivial theories and countable \omega-categorical simple theories with strong stable forking are low. In addition, we observe that simple theories of bounded finite weight are low.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms · Advanced Algebra and Logic