On uniform definability of types over finite sets for NIP formulas

Authors:

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.
Funding Information
  • THE ISRAEL SCIENCE FOUNDATION (1533/14, 1254/18)

This publication has 8 references indexed in Scilit: