On uniform definability of types over finite sets for NIP formulas
Logic
2020-11-30 v2
Abstract
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.
Cite
@article{arxiv.1904.10336,
title = {On uniform definability of types over finite sets for NIP formulas},
author = {Shlomo Eshel and Itay Kaplan},
journal= {arXiv preprint arXiv:1904.10336},
year = {2020}
}