Douglas Ulrich : Borel Complexity and the Schroder-Bernstein Property

Posted by James Freitag , part of the Logic Seminar.

At

Oct. 10, 2017, 4 p.m.

In

SEO 427

Abstract

Borel Complexity and the Schroder-Bernstein Property I describe some new techniques for proving non-Borel reducibility results, and give some applications, including: suppose the collection of countable models of a sentence sigma of L_{omega_1 omega} satisfies the Schroder-Bernstein property, that is, if two countable models are bi-embeddable then they are isomorphic. Then, assuming a mild large cardinal, sigma is not Borel complete.

We meet for lunch at noon on the first floor of SEO.