Thursday, May 16, 2019
3:00 PM - 4:00 PM
Linde Hall 255

Logic Seminar

A characterization of \Sigma^0_{n+2}-hardness
Andrew Marks, Department of Mathematics, UCLA,

We give a Baire category characterization of when a subset
of a Polish space is \Sigma^0_{n+2}-hard for n > 0. Our proof uses a
priority argument, and Antonio Montalban's true stages machinery. We
apply this characterization to the decomposability conjecture; the
problem of describing when a function is a union of countably many
continuous functions defined on \Pi^0_n sets.

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