On uniform definability of types over finite sets

DOI10.2178/jsl/1333566634zbMath1255.03039arXiv1005.4924OpenAlexW2592546086MaRDI QIDQ2892672

Vincent Guingona

Publication date: 19 June 2012

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

NIPUDTFSdependent theorydp-minimalitydefinability of types

Mathematics Subject Classification ID

Classification theory, stability, and related concepts in model theory (03C45) Interpolation, preservation, definability (03C40) Model theory of ordered structures; o-minimality (03C64)

Related Items (11)

Vapnik-Chervonenkis density in some theories without the independence property. II ⋮ On VC-minimal theories and variants ⋮ dp-rank and forbidden configurations ⋮ A definable \((p,q)\)-theorem for NIP theories ⋮ Hypergraph sequences as a tool for saturation of ultrapowers ⋮ RAMSEY GROWTH IN SOME NIP STRUCTURES ⋮ On Vapnik‐Chervonenkis density over indiscernible sequences ⋮ On uniform definability of types over finite sets for NIP formulas ⋮ Definability of types and VC density in differential topological fields ⋮ Vapnik-Chervonenkis density in some theories without the independence property, I ⋮ Externally definable sets and dependent pairs II

Cites Work

• Compression schemes, stable definable families, and o-minimal structures
• On dp-minimality, strong dependence and weight
• A monotonicity theorem for dp-minimal densely ordered groups

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