The definable -theorem for distal theories
Let be NIP -structures. Let be an -formula and let . Assume does not divide over . Chernikov–Simon conjecture. There is an -formula such that
This is a definable analogue of the combinatorial -theorem and was posed by Chernikov and Simon as a question before becoming a conjecture. The paper answers this special case affirmatively for distal NIP theories, so the conjecture is solved in the stated setting.
References
Primary source
Gareth Boxall and Charlotte Kestner, “The definable (p,q)-theorem for distal theories”, arXiv:1602.01253 (2017).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.