2016/02/03 by Gareth Boxall, Boxall, Gareth, Charlotte Kestner +1
Computer Science · Mathematics · #03C45 #Advanced Topology and Set Theory #Computability, Logic, AI Algorithms #FOS: Mathematics #Homotopy and Cohomology in Algebraic Topology #Logic (math.LO)
paper · doi:10.48550/arxiv.1602.01253
openalex publication_date 2016/02/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Answering a special case of a question of Chernikov and Simon, we show that any non-dividing formula over a model M in a distal NIP theory is a member of a consistent definable family, definable over M.