ULCFS and strong ULCFS conjectures for NTP and resilient formulas
ULCFS and strong ULCFS conjectures for NTP and resilient formulas
Let be a partitioned formula. A formula is NTP when it does not have the tree property of the second kind, and it is resilient in the sense used in the paper. ULCFS and strong ULCFS conjecture. If is NTP, or if the theory is NTP, then satisfies ULCFS. If is resilient, or if is resilient, then satisfies strong ULCFS. The paper establishes related implications, including that strong ULCFS implies resilience and that ULCFS implies NTP; the converses proposed here remain open.
Sources & referencesView supporting material
Primary source
Artem Chernikov and Chuyin Jiang, “Fractional Helly property and combinatorics of forking in NTP_2 theories”, arXiv:2605.18123 (2026).
Progress summary
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.