Calendar

Oct
5
Thu
Logic Seminar: Borel Determinacy I (Umar Gaffar) @ Keller 402
Oct 5 @ 2:55 pm – 3:55 pm

Title: Borel Determinacy I
Speaker: Umar Gaffar

We’re going through Ross Bryant’s presentation of Martin’s theorem (in ZFC) that Borel games are determined.

Oct
12
Thu
Logic Seminar: Borel Determinacy II (Khan) @ Keller 402
Oct 12 @ 2:55 pm – 3:55 pm
Oct
19
Thu
Logic Seminar: Borel Determinacy III (Yoon) @ Keller 402
Oct 19 @ 2:55 pm – 3:55 pm
Oct
26
Thu
Logic seminar: Borel determinacy IV (David Webb)
Oct 26 @ 2:55 pm – 3:55 pm
Nov
2
Thu
Logic Seminar: Borel Determinacy V
Nov 2 @ 2:55 pm – 3:55 pm
Nov
9
Thu
Logic seminar: Boreal Determinacy VI (Khan)
Nov 9 @ 2:55 pm – 3:55 pm
Nov
30
Thu
David Webb’s specialty exam: A new notion of effective dimension @ Keller Hall 402
Nov 30 @ 2:50 pm – 3:40 pm

David Webb will present a new notion of effective dimension, inescapable dimension, which is in a sense dual to complex packing dimension.

The latter was introduced by Freer and Kjos-Hanssen in 2013 in the context of trying to show that the reals of effective Hausdorff dimension 1 are not Medvedev above the bi-immune sets.

Webb will show that the two notions are incomparable, among other results.

Dec
7
Thu
Joint Analysis/Logic Seminar @ Keller 402
Dec 7 @ 2:55 pm – 3:45 pm

Speaker : Michael Yampolsky (University of Toronto)

Title : Computability of Julia sets.

Abstract : Informally speaking, a compact set in the plane is computable if there exists an algorithm to draw it on a computer screen with an arbitrary resolution. Julia sets are some of the best-known mathematical images, however, the questions of their computability and computational complexity are surprisingly subtle. I will survey joint results with M. Braverman and others on computability and complexity of Julia sets.