arXiv Analytics

Sign in

arXiv:1904.10336 [math.LO]AbstractReferencesReviewsResources

On uniform definability of types over finite sets for NIP formulas

Shlomo Eshel, Itay Kaplan

Published 2019-04-23Version 1

Combining two results from machine learning theory we prove that a formula is NIP if and only if it satisfies uniform definability of types over finite sets (UDTFS). This settles a conjecture of Laskowski.

Categories: math.LO
Subjects: 03C45, 03C40, 68R05
Related articles: Most relevant | Search more
arXiv:2103.10788 [math.LO] (Published 2021-03-19)
Glivenko-Cantelli classes and NIP formulas
arXiv:1005.4924 [math.LO] (Published 2010-05-26)
On uniform definability of types over finite sets
arXiv:2107.05197 [math.LO] (Published 2021-07-12)
Density of compressible types and some consequences

Links

Toolbox