Complexity in simple rank one theories
Speaker:
M Malliaris, University of Chicago
Date and Time:
Thursday, December 2, 2021 - 11:00am to 11:50am
Location:
Fields Institute, Room 230
Abstract:
The talk will discuss some combinatorial aspects of the proof that Keisler's order has the maximum number of classes
(Malliaris and Shelah, "Keisler's order is not simple (and simple theories may not be either)." Adv. Math. 2021, arXiv:1906.10241).
