Assume T has NIP and that every formula \phi(x;y) with \ell(x)=1 satisfies \operatorname{vc}^{*}(\phi)\le k.
Statement
Assume T has NIP and that every formula \phi(x;y) with \ell(x)=1 satisfies \operatorname{vc}^{}(\phi)\le k. Does there exist, for every n, a bound k(n) such that \operatorname{vc}^{}(\phi(x;y))\le k(\ell(x)) for all formulas?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.