Talk given at the University of Michigan Mathematics Colloquium on October 18, 2019. Slides.
A theorem of Erdős and Rado generalizes Ramsey's theorem to infinite cardinals: for each cardinal n, there exists a cardinal N so that each graph with N vertices contains either a clique or an independent set of size n. In the infinite case, one can take n = N if n is countable but in most other uncountable cases N must be much bigger than n. Stability theory is a branch of model theory studying certain definability conditions allowing us to take n = N for a large number of infinite cardinals. Historically, stability theory was first developped by Shelah for classes axiomatized by a first-order theory. In this talk, I describe a generalization to a large class of categories, accessible categories. I will also talk about recent progresses on the eventual categoricity conjecture, resolved by Morley and Shelah for first-order but still open for accessible categories.
Sebastien Vasey, Accessible categories, set theory, and model theory: an invitation, Preprint: pdf arXiv, 67 pages.
Michael Lieberman, Jiří Rosický, and Sebastien Vasey, Forking independence from the categorical point of view, Advances in Mathematics 346 (2019), 719–772. Publisher version pdf arXiv.
Sebastien Vasey, The categoricity spectrum of large abstract elementary classes, Selecta Mathematica 23 (2019), no. 5, 65 (51 pages). Publisher version pdf arXiv.
Saharon Shelah and Sebastien Vasey, Categoricity and multidimensional diagrams, preprint: pdf arXiv, 63 pages.