Sub-additivity of burden in NTP2 theories
Sub-additivity of burden in NTP2 theories
In a first-order theory , let denote the burden of a tuple , and say that is NTP when it has no inp-pattern of depth in a single variable. Sub-additivity conjecture. Burden is sub-additive in NTP theories; in particular, for tuples and , one should have
Sub-additivity is known for NIP theories and for simple theories, while the conjecture asks whether it holds for all NTP theories.
Sources & referencesView supporting material
Primary source
Artem Chernikov, “Theories without the tree property of the second kind”, arXiv:1204.0832 (2013).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.