On uniform definability of types over finite sets for NIP formulas
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- April 2019
- DOI:
- 10.48550/arXiv.1904.10336
- arXiv:
- arXiv:1904.10336
- Bibcode:
- 2019arXiv190410336E
- Keywords:
-
- Mathematics - Logic;
- 03C45;
- 03C40;
- 68R05