Logic Seminar

Logic Seminar

List of Talks given in 2008-09

Tuesday, August 26   Noam Greenberg, Victoria University of Wellington
Strong jump-traceability
Tuesday, September 2   James Worthington, Cornell University
Bialgebraic approach to automata and formal language theory, part I
Thursday, September 4   James Worthington, Cornell University
Bialgebraic approach to automata and formal language theory, part II
Tuesday, September 9   Justin Moore, Cornell University
A crash course in descriptive set theory
Wednesday, September 10   Richard Shore, Cornell University
The atomic model theorem and type omitting, part I
Thursday, September 11   Justin Moore, Cornell University
Fraisse theory and structural Ramsey theory
Tuesday, September 16   Justin Moore, Cornell University
Some basics from ergodic theory
Wednesday, September 17   Richard Shore, Cornell University
The atomic model theorem and type omitting, part II
Thursday, September 18   Justin Moore, Cornell University
Characterizing extreme amenability of automorphism groups
Tuesday, September 23   Harold Hodes, Cornell University
Ramified-type logic and axioms of reducibility
Thursday, September 25   Mia Minnes, MIT
An automatic perspective on linear orders
Tuesday, September 30   Justin Moore, Cornell University
Equivalence relations arising in ergodic theory and analysis
Wednesday, October 1   Jiamou Liu, University of Auckland and Cornell University
Computable categoricity of graphs with finite component
Thursday, October 2   Justin Moore, Cornell University
Establishing extreme amenability via Ramsey theory
Tuesday, October 7   Justin Moore, Cornell University
Comparing the complexity of equivalence relations
Wednesday, October 8   Paul Shafer, Cornell University
Proving Ramsey theorems via extreme amenability
Thursday, October 9   Christian Rosendal, University of Illinois at Chicago
A new proof of Gowers’ block Ramsey Theorem
Wednesday, October 15   Barbara Csima, University of Waterloo
Degree spectra of almost computable structures
Thursday, October 16   Justin Moore, Cornell University
Calculating universal minimal flows
Tuesday, October 21   Justin Moore, Cornell University
Tsirelson submeasures and the basis problem for turbulent problems
Wednesday, October 22   David Guaspari, Cornell University
An easy proof of the FLP impossibility theorem
Thursday, October 23   James Worthington, Cornell University
Ramsey degrees
Tuesday, October 28   Sheila Miller, United States Military Academy, West Point
Free left distributive algebras and well-ordering
Wednesday, October 29   Mingzhong Cai, Cornell University
The dichotomy theorems for Borel equivalence relations, part I
Thursday, October 30   Justin Moore, Cornell University
Open problems and concluding remarks from [KPT]
Tuesday, November 4   Justin Moore, Cornell University
Cost, group actions, and equivalence relations
Wednesday, November 5   Mingzhong Cai, Cornell University
The dichotomy theorems for Borel equivalence relations, part II
Thursday, November 6   Mingzhong Cai, Cornell University
The dichotomy theorems for Borel equivalence relations, part II
Tuesday, November 11   Martin Kassabov, Cornell University
An application of the cost conjecture, part I
Wednesday, November 12   Paul Shafer, Cornell University
The Medvedev lattice, part I
Thursday, November 13   Martin Kassabov, Cornell University
An application of the cost conjecture, part II
Tuesday, November 18   Justin Moore, Cornell University
An anti-classification theorem for ergodic measure preserving transformations, part I
Wednesday, November 19   Paul Shafer, Cornell University
The Medvedev lattice, part II
Tuesday, November 25   Simon Dauguet, Cornell University
An anti-classification theorem for ergodic measure preserving transformations, part II
Tuesday, December 2   Simon Dauguet, Cornell University
An anti-classification theorem for ergodic measure preserving transformations, part III
Thursday, December 4   Greg Hjorth, University of Melbourne
A dichotomy theorem due to Ben Miller
Tuesday, January 27   James Worthington, Cornell University
Determinization and forgetful functors
Thursday, January 29   Paul Shafer, Cornell University
Fragments of MAaleph_1 and consequences
Tuesday, February 3   James Worthington, Cornell University
Higher-order categorical logics
Thursday, February 5   Paul Shafer, Cornell University
Fragments of MAaleph_1 and consequences II
Tuesday, February 10   James Worthington, Cornell University
Higher-order categorical logics II
Thursday, February 12   Mingzhong Cai, Cornell University
Non GL2 and ANR forcing I
Tuesday, February 17   Sasha Rubin, Cornell University
Automata and decidability
Thursday, February 19   Mingzhong Cai, Cornell University
Non GL2 and ANR forcing II
Tuesday, February 24   Adam Bjorndahl, Cornell University
Decidability of S1D
Thursday, February 26   Sasha Rubin, Cornell University
Decidability of S2S
Tuesday, March 3   Mingzhong Cai, Cornell University
ANR, relatively re, and 1 genericity
Thursday, March 5   Sasha Rubin, Cornell University
Decidability of S2S, continued
Tuesday, March 10   Mingzhong Cai, Cornell University
ANR, relatively re, and 1 genericity II
Thursday, March 12   Sasha Rubin, Cornell University
Decidability of S2S, continued
Tuesday, March 24   Sasha Rubin, Cornell University
Introduction to automatic structures
Thursday, March 26   Paul Shafer, Cornell University
The first-order theory of the Medvedev lattice is third-order arithmetic
Tuesday, March 31   Sasha Rubin, Cornell University
(Q, +) is not an automatic structure
Thursday, April 2   Sasha Rubin, Cornell University
Effectively composing types + Ramsey → decidability
Tuesday, April 7   Justin Moore, Cornell University
Fast growth in Folner sets for Thompson’s group, part II
Thursday, April 9   James Worthington, Cornell University
Bialgebras arising naturally
Tuesday, April 14   Stevo Todorcevic, CNRS, University of Toronto
Borel chromatic numbers
Tuesday, April 28   Alexander Landraitis, Cornell University
Embedding and coding below a 1-generic degree I
Thursday, April 30   Alexander Landraitis, Cornell University
Embedding and coding below a 1-generic degree II