Monday, September 18
Sergei Artemov, Cornell visitor
Provability operators II
Monday, October 2
Rod Downey, Cornell visitor
There is no fat orbit
Monday, October 23
John Rosenthal, Ithaca College
Some undecidable lattices, part I
Monday, October 30
John Rosenthal, Ithaca College
Some undecidable lattices, part II
Monday, November 6
Sergei Artemov, Cornell visitor
Propositional operations over proofs
Monday, November 13
Stephen Simpson
Penn State University
Separable Banach space theory needs strong existence axioms
Monday, November 20
Neil Immerman
University of Massachusetts
Descriptive complexity and ordering
Monday, November 27
Neil Immerman, University of Massachusetts
Descriptive complexity and dynamic complexity
Monday, December 4
Sergei Artemov, Cornell visitor
Provability operators and quantifiers
Monday, December 11
Michael Moses, George Washington University
N-recursive linear orders: between recursive and decidable
Tuesday, January 30
Bakhadyr Khoussainov, Cornell University
Computable categoricity and expansions by constants, part I
Tuesday, February 6
Bakhadyr Khoussainov, Cornell University
Computable categoricity and expansions by constants, part II
Tuesday, February 13
Richard Shore, Cornell University
Degree invariant solutions to Post's problem
Tuesday, February 20
Richard Shore, Cornell University
Degree invariant solutions to Post's problem II
Tuesday, February 27
Bakhadyr Khoussainov, Cornell University
Effective structures (a survey talk)
Tuesday, March 5
Robert Milnikel, Cornell University
Complexity issues in nonmonotonic logic
Tuesday, March 12
Leon Harkleroad, Cornell University
Difference sets
Tuesday, March 26
Reed Solomon, Cornell University
Minimal hyperdegrees
Tuesday, April 2
Alberto Marcone, University of Turin
Lebesgue numbers and Atsuji spaces
Tuesday, April 9
Denis Hirschfeldt, Cornell University
Ramsey's theorem revisited: some conservation results
Tuesday, April 16
Denis Hirschfeldt, Cornell University
Ramsey's theorem revisited: some conservation results II
Tuesday, April 23
Gerald Sacks, Harvard University & MIT
Model theoretic methods in recursion theory: minimal upper bounds for sets
of hyperdegrees
Tuesday, April 30
Neil Immerman, University of Massachusetts
Dynamic complexity