Tuesday, August 28 Uri Andrews, University of Wisconsin at Madison
Recursive presentations of trichotomous strongly minimal models
Wednesday, August 29 Uri Andrews, University of Wisconsin at Madison
Spectra of theories
Tuesday, September 4 Asher Kach, University of Chicago
Computable structure theory and uncountable linear orders
Wednesday, September 5 Asher Kach, University of Chicago
It's all relative, except when it's not: categoricity versus relative categoricity
Tuesday, September 11 Li Wei, National University of Singapore and Cornell University
Reverse recursion theory and d-r.e. degrees
Wednesday, September 12 Richard Shore, Cornell University
Recursive model theory: an introduction
Tuesday, September 18 Justin Moore, Cornell University
Idempotent measures on binary systems
Wednesday, September 19 Iian Smythe, Cornell University
Omitting types (sec. 6)
Tuesday, September 25 Thomas Kern, Cornell University
Parametrized complexity: an introduction
Wednesday, September 26 ,
Tuesday, October 2 Thomas Kern, Cornell University
Courcelle's theorem
Wednesday, October 3 Iian Smythe, Cornell University
Prime models (sec. 7)
Wednesday, October 10 David Belanger, Cornell University
Model completeness (sec. 5)
Tuesday, October 16 Scott Messick, Cornell University
Parameterized complexity and logic programming I
Wednesday, October 17 David Belanger, Cornell University
Vaught's theorem (sec. 10)
Tuesday, October 23 Scott Messick, Cornell University
Parameterized complexity and logic programming II
Wednesday, October 24 David Belanger, Cornell University
Theories with countably many models
Tuesday, October 30 Maryanthe Malliaris, University of Chicago
Comparing the complexity of unstable theories
Wednesday, October 31 Marcin Sabok, Instytut Matematyczny Uniwersytetu Wroc and Instytut Matematyczny Polskiej Akademii Nauk
Canonization of Borel equivalence relations
Tuesday, November 6 Rod Downey, Victoria University of Wellington
Recent progress in parameterized upper and lower bounds
Wednesday, November 7 Rod Downey, Victoria University of Wellington
The computability theory of the finite intersection principle
Tuesday, November 13 Richard Shore, Cornell University
The Turing degrees below generics and randoms
Wednesday, November 14 Li Wei, National University of Singapore and Cornell University
Saturated models (sec. 8)
Tuesday, November 20 Clinton Conley, Cornell University
Stationary probability measures and sigma-compact realizations of Borel group actions
Tuesday, November 27 Scott Messick, Cornell University
Homogeneous models (sec. 9) I
Wednesday, November 28 Scott Messick, Cornell University
Homogeneous models (sec. 9) II
Tuesday, January 22 ,
Organizational meeting
Wednesday, January 23 Justin Moore, Cornell University
Monod's example of a nonamenable group which does not contain \mathbb{F}_2
Tuesday, January 29 Justin Moore, Cornell University
Isomorphism types of $\aleph_2$-dense subsets of $\Rbb$, part I
Wednesday, January 30 Clinton Conley, Cornell University
Introduction to countable Borel equivalence relations, part I
Tuesday, February 5 Justin Moore, Cornell University
Isomorphism types of $\aleph_2$-dense subsets of $\Rbb$, part II
Wednesday, February 6 Iian Smythe, Cornell University
Countable Borel equivalence relations, part II
Tuesday, February 12 Adam Bjorndahl, Cornell University
Epistemic game theory
Wednesday, February 13 Iian Smythe, Cornell University
Countable Borel equivalence relations, part II
Tuesday, February 19 Adam Bjorndahl, Cornell University
Language-based games
Wednesday, February 20 Hossein Lamei Ramandi, Cornell University
Countable abelian group actions and hyperfinite equivalence relations, part I
Tuesday, February 26 Diana Ojeda Aristizabal, Cornell University
A norm for Tsirelson space
Wednesday, February 27 Hossein Lamei Ramandi, Cornell University
Countable abelian group actions and hyperfinite equivalence relations, part II
Tuesday, March 5 Andrew Marks, CalTech
Universal locally countable partial orders from recursion theory, and countable Borel equivalence relations
Wednesday, March 6 Jeffrey Bergfalk, Cornell University
Countable abelian group actions and hyperfinite equivalence relations, part III
Tuesday, March 12 Diana Ojeda Aristizabal, Cornell University
A norm for Tsirelson space, part II
Wednesday, March 13 Jeffrey Bergfalk, Cornell University
Group colorings and Bernoulli subflows
Tuesday, March 26 David Belanger, Cornell University
Model theory within a subsystem of second-order arithmetic
Wednesday, March 27 Diana Ojeda, Cornell University
Introduction to the theory of cost
Tuesday, April 2 David Belanger, Cornell University
Model theory within a subsystem of second-order arithmetic, part II
Wednesday, April 3 Adam Bjorndahl, Cornell University
Cost and treeable equivalence relations
Tuesday, April 9 Brandon Seward, University of Michigan
Countable locally nilpotent group actions and hyperfinite equivalence relations
Wednesday, April 10 Clinton Conley, Cornell University
Local complexity among treeable equivalence relations
Tuesday, April 16 Mark Sapir, Vanderbilt University
Complicated residually finite groups
Wednesday, April 17 David Belanger, Cornell University
Cost and treeable equivalence relations, part II
Tuesday, April 23 Su Gao, University of North Texas
Borel complete sections on Bernoulli shifts
Wednesday, April 24 David Belanger, Cornell University
Cost and I2 Betti numbers
Tuesday, April 30 Antonio Montalban, University of California at Berkeley
A computability theoretic equivalent to Vaught's conjecture
Wednesday, May 1 Scott Messick, Cornell University
The Gaboriau-Lyons dynamic version of the von Neumann conjecture, part II