University of Cambridge > > Combinatorics Seminar > Keisler's order is not simple

Keisler's order is not simple

Add to your list(s) Download to your calendar using vCal

  • UserMaryanthe Malliaris (Chicago)
  • ClockThursday 26 May 2022, 14:30-15:30
  • HouseCMS MR5.

If you have a question about this talk, please contact ibl10.

The ultraproduct construction gives a way of averaging an infinite sequence of mathematical structures, such as fields, graphs, or linear orders. The talk will be about the strength of such a construction, aiming to motivate and explain a theorem of Malliaris and Shelah which says that Keisler’s order, long thought to have finitely many classes (perhaps five or six), in fact has continuum many.

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity