Caltech Logo

Logic Seminar

Wednesday, August 19, 2020
12:00pm to 1:00pm
Add to Cal
Online Event
Borel complexity of arbitrary relations
Dominique Lecomte, Université de Picardie, Sorbonne Université,

We study the descriptive complexity of Borel binary relations, compared with the notion of continuous reducibility. In a first part, we present some important tools interesting for themselves. The second part is devoted to Borel equivalence relations. The last part, more recent, is about the generalization of some of the previous results to relations which are not necessarily equivalence relations. The case of graphs is particularily nice. Also, there is a surprising exception with the classes of rank two, related to topological Ramsey theory on the space of rational numbers.

For more information, please contact Math Department by phone at 626-395-4335 or by email at mathinfo@caltech.edu.