Caltech Logo

Logic Seminar

Monday, May 10, 2021
12:00pm to 1:00pm
Add to Cal
Online Event
Arcs, knots, and convex embeddability
Luca Motto Ros, Mathematics Department, University of Turin,

Working in the framework of Borel reducibility, we analyze the complexity of the natural counterparts in terms of quasi-orders of the well-known relations of equivalence for arcs and knots. It turns out that this problem is related to the study of convex embeddability between countable linear orders (and of its analogue for circular orders), which is a topic of independent interest. This is work in progress, joint with Iannella, Kulikov and Marcone.

For more information, please email A. Kechris at kechris@caltech.edu.