|
Publications > Preprint server > Preprint Number 1602
Preprint Number 1602
1602. Shlomo Eshel and Itay Kaplan On uniform definability of types over finite sets for NIP formulas E-mail: Submission date: 23 April 2019 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. Mathematics Subject Classification: 03C45, 03C40, 68R05 Keywords and phrases: |
| Last updated: March 23 2021 09:21 | Please send your corrections to: |