On uniform definability of types over finite sets for NIP formulas

Shlomo Eshel, Itay Kaplan*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

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.

Original languageAmerican English
Article number2150015
Pages (from-to)2150015:1-2150015:13
Number of pages13
JournalJournal of Mathematical Logic
Volume21
Issue number3
DOIs
StatePublished - 1 Dec 2021

Bibliographical note

Publisher Copyright:
© 2021 World Scientific Publishing Company.

Keywords

  • Local UDTFS
  • local NIP
  • recursive teaching dimension
  • sample compression schemes

Fingerprint

Dive into the research topics of 'On uniform definability of types over finite sets for NIP formulas'. Together they form a unique fingerprint.

Cite this