Logo

Mathematical Sciences Research Institute

Home » DDC Online Seminar: (Z,+) has a Borel complete reduct

Seminar

DDC Online Seminar: (Z,+) has a Borel complete reduct October 01, 2020 (09:00 AM PDT - 10:00 AM PDT)
Parent Program:
Location: MSRI: Online/Virtual
Speaker(s) Michael Laskowski (University of Maryland)
Description

To participate in this seminar, please register here: https://www.msri.org/seminars/25206

The seminar will feature research talks by distinguished researchers in a range of areas related to the program. The lectures will be delivered in the colloquium style and accessible to broad audience.

 

Video
No Video Uploaded
Abstract/Media

To participate in this seminar, please register here: https://www.msri.org/seminars/25206

Abstract:

For many (but not all) properties, a reduct of a structure M is no more complicated than M itself.  For example, if M is decidable, so are each of its reducts (in a reasonable language).  However, Borel completeness, which is a measure of ‘maximal complexity’ is not like this.  We recently showed that if M has uncountably many 1-types (with respect to its theory) then M has a Borel complete reduct.  No background is assumed -- at least the first half of the talk will be spent on defining reducts and Borel completeness, and giving algebraic examples.   This is joint work with Douglas Ulrich.

No Notes/Supplements Uploaded No Video Files Uploaded