Speaker: Danielle Ulrich
University of Maryland
Will give a Model Theory Seminar entitled:
Borel complexity of families of finite equivalence relations via large cardinals
Abstract: The analysis of the strong type structure among countable models of a stable theory is a fundamental hurdle in determining the Borel complexity of the class. To illustrate this, we focus on theories of equivalence relations, each with finitely many classes, and analyze their Borel complexity. We prove that even in this highly restrictive case, the situation is very involved. Indeed, we give a family of theories of this type for which the only known proof of non-Borel completeness uses the existence of a large cardinal. This is joint work with Chris Laskowski.
Date: 10-15-2024
Time: 10:30 am
Location: 125 Hayes-Healy Bldg
Originally published at math.nd.edu.