Department of

February 2018March 2018April 2018 Su Mo Tu We Th Fr Sa Su Mo TuWeTh Fr Sa Su Mo Tu We Th Fr Sa 1 2 3 1 2 3 1 2 3 4 5 6 7 4 5 6 7 8 9 10 4 5 6 7 8 9 10 8 9 10 11 12 13 14 11 12 13 14 15 16 17 11 12 13 14 15 16 17 15 16 17 18 19 20 21 18 19 20 21 22 23 24 18 19 202122 23 24 22 23 24 25 26 27 28 25 26 27 28 25 26 27 28 29 30 31 29 30

Friday, January 26, 2018

**Abstract:** This is a (hopefully self-contained) continuation of Erik's talk from Tuesday. I will discuss in more detail expansions of the ordered real additive group that are of type B (ie expansions of $(\mathbb{R},<,+)$ that define an order $(D,\prec)$ of order-type $\omega$ whose underlying set $D$ is somewhere dense in $\mathbb R$). In many (all?) type B structures 0-definability is equivalent to recognizablility by a Buechi automaton. Therefore results about the definable sets in type B structures imply results about sets recognizable by such automata. In this talk I will focus on our current research on continuous definable functions in type B structures, and I will discuss how it connects to results in computer science by Chaudhuri, Sankaranarayanan and Vardi.

Friday, February 2, 2018

Friday, February 9, 2018

Friday, February 16, 2018

Friday, February 23, 2018

Friday, March 2, 2018

Friday, March 9, 2018

Friday, March 16, 2018

Friday, April 20, 2018

Friday, May 4, 2018