On uniform definability of types over finite sets for NIP formulas

DOI10.1142/S021906132150015XOpenAlexW3115651041MaRDI QIDQ5163166

Itay Kaplan, Shlomo Eshel

Publication date: 3 November 2021

Published in: Journal of Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.10336

zbMATH Keywords

sample compression schemesrecursive teaching dimensionlocal NIPlocal UDTFS

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Classification theory, stability, and related concepts in model theory (03C45) Interpolation, preservation, definability (03C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Compression schemes, stable definable families, and o-minimal structures
• Classification theory and the number of non-isomorphic models.
• On uniform definability of types over finite sets
• Sample Compression Schemes for VC Classes
• Externally definable sets and dependent pairs II
• A Guide to NIP Theories

This page was built for publication: On uniform definability of types over finite sets for NIP formulas