Abstract
We show that in the theory of infinite trees the VC-function is optimal. This generalizes a result of Simon showing that trees are dp-minimal.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aschenbrenner, M., Dolich, A., Haskell, D., Macpherson, D., Starchenko, S.: Vapnik–chervonenkis density in some theories without the independence property, I. Trans. Am. Math. Soc. 368(8), 5889–5949 (2016)
Assouad, P.: Densité et dimension. Ann. l’inst. Fourier 33(3), 233–282 (1983)
Patrick, A.: Observations sur les classes de vapnik-cervonenkis et la dimension combinatoire de blei. In: Seminaire d’Analyse Harmonique, 1983–1984, volume 85-2 of Publications Mathématiques d’Orsay, pp. 92–112. Université de Paris-Sud, Département de Mathématiques, Orsay (1985)
Parigot, M.: Théories d’arbres. J. Symb. Logic 47(4), 841–853 (1982)
Podewski, K.-P., Ziegler, M.: Stable graphs. Fundam. Math. 100(2), 101–107 (1978)
Sauer, N.: On the density of families of sets. J. Comb. Theory Ser. A 13(1), 145–147 (1972)
Shelah, S.: A combinatorial problem; stability and order for models and theories in infinitary languages. Pac. J. Math. 41(1), 247–261 (1972)
Simon, P.: On dp-minimal ordered structures. J. Symb. Logic 76(2), 448–460 (2011)
Acknowledgements
This work was done at UCLA as a part of a doctoral thesis, supported financially by NSF Grant DMS-1044604 and 2016 Girsky Fellowship Award.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Bobkov, A. VC-density for trees. Arch. Math. Logic 58, 587–603 (2019). https://doi.org/10.1007/s00153-018-0652-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153-018-0652-1