Yuki Takahashi : Dependent dividing and sub-additivity of burden

Posted by Scott Mutchnik , part of the Logic Seminar.

At

March 10, 2026, 3 p.m.

In

636 SEO

Abstract

We discuss Chernikov’s conjecture that the burden is sub-additive. As partial progress toward this conjecture, we show that if T has a stronger version of dependent dividing (where dividing is witnessed by a formula in an existentially NIP reduct T_0 of T), then the burden agrees with the dp-rank witnessed by NIP formulas in T_0 and is thus sub-additive.