Harrington's game and measurability of regular tree languages

Prelegent(ci)

Michał Skrzypczak

Afiliacja

Uniwersytet Warszawski

Termin

11 grudnia 2013 14:15

Pokój

p. 5870

Tytuł w języku angielskim

joint work with Tomasz Gogacz, Henryk Michalewski and Matteo Mio

Seminarium

Seminarium „Teoria automatów”

---

I will present some investigations on measure properties of regular tree languages. The motivation for this research comes from the dissertation of Matteo Mio. I plan to focus on two aims: the first aim is to show how to derive certain set theoretic properties from the assumption of determinacy of an appropriate game. The second aim is to present an intriguing interplay between measurability and basic concepts of mu-calculus.

---