10 citations · 41 across the 29 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
math.LO2022
A definable -theorem for NIP theories
Itay Kaplan
We prove a definable version of Matoušek's -theorem in NIP theories. This answers a question of Chernikov and Simon. We also prove a uniform version. The proof builds on a p…
math.LO2022★ 1 cited
On large externally definable sets in NIP
Martin Bays, Omer Ben-Neria, Itay Kaplan +1
We study cofinal systems of finite subsets of . We show that while such systems can be NIP, they cannot be defined in an NIP structure. We deduce a positive answer to a questi…