Date:
Wed, 27/03/201911:00-13:00
Location:
Ross 63
Uniform definability of types over finite sets
Uniform definability of types over finite sets (UDTFS) is a property of formulas which implies NIP and characterizes NIP in the level of theories (by Chernikov and Simon).
In this talk we will prove that if T is any theory with definable Skolem functions, then every dependent formula phi has UDTFS. This result can be seen as a translation of a result of Shay Moran and Amir Yehudayof in machine learning theory to the logical framework.
Uniform definability of types over finite sets (UDTFS) is a property of formulas which implies NIP and characterizes NIP in the level of theories (by Chernikov and Simon).
In this talk we will prove that if T is any theory with definable Skolem functions, then every dependent formula phi has UDTFS. This result can be seen as a translation of a result of Shay Moran and Amir Yehudayof in machine learning theory to the logical framework.