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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Keisler's order is not simple

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 .

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Bullard Labs tearoom, Department of Earth Sciences, Madingley Rise One Day Meeting - Third Annual Symposium of the Cambridge Computational Biology Institute Lecture Room 3, Department of Chemical Engineering and Biotechnology, West Cambridge Site

Other talks

Title to be confirmed Using Light for Cancer Detection Am I a Member? Auditing Private Machine Learning title and abstract tba (joint seminar with Spectral Geometry in the Clouds) Title to be confirmed Summer Cactus & Succulent Show
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity