Vapnik-Chervonenkis density on indiscernible sequences, stability, and the maximum property

From MaRDI portal
Publication:894257

DOI10.1215/00294527-3153597zbMATH Open1372.03064arXiv1302.5446OpenAlexW2113187842MaRDI QIDQ894257FDOQ894257


Authors: Hunter Johnson Edit this on Wikidata


Publication date: 30 November 2015

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Abstract: This paper presents some finite combinatorics of set systems with applications to model theory, particularly the study of dependent theories. There are two main results. First, we give a way of producing lower bounds on VC_ind-density, and use it to compute the exact VC_ind- density of polynomial inequalities, and a variety of geometric set families. The main technical tool used is the notion of a maximum set system, which we juxtapose to indiscernibles. In the second part of the paper we give a maximum set system analogue to Shelah's characterization of stability using indiscernible sequences.


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




Recommendations




Cites Work


Cited In (5)





This page was built for publication: Vapnik-Chervonenkis density on indiscernible sequences, stability, and the maximum property

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q894257)