Hazal Aydogdu : The (Un)Stable Formula Theorem

Posted by Ryan Carpenter , part of the Louise Hay Logic Seminar.

At

March 3, 2025, 3 p.m.

In

612 SEO

Abstract

Fix an L-theory T and a formula. We will define what it means for a formula to be stable and explore equivalent reformulations, following Shelah’s Unstable Formula Theorem. In particular, we will study the connections between the cardinality of type spaces, n-ladders, n-trees, and the definability of types.