|
|
List of Talks
given in 2007-08
Tuesday, August 28 |
|
Antonio Montalban, University of Chicago On the n-back-and-forth types of boolean algebras |
Wednesday, September 5 |
|
Justin Moore, Cornell University The club filter, stationary sets, and countable elementary submodels |
Tuesday, September 11 |
|
Russell Miller, Queens College Locally computable structures |
Wednesday, September 12 |
|
Mia Minnes, Cornell University Using automata to prove tractability |
Tuesday, September 18 |
|
Richard Shore, Cornell University Reverse mathematics: an introduction |
Wednesday, September 19 |
|
Richard Shore, Cornell University
Complexity in countable combinatorics |
Tuesday, September 25 |
|
Jiamou Liu, University of Auckland and Cornell University RCA_0 |
Wednesday, September 26 |
|
Justin Moore, Cornell University Linear orders and the club filter I |
Tuesday, October 2 |
|
Pavel Semukhin, Cornell University ACA_0 |
Wednesday, October 3 |
|
Justin Moore, Cornell University Linear orders and the club filter II |
Wednesday, October 10 |
|
Sasha Rubin, University of Auckland Decidable extensions of the Monadic second-order theory of (Nat, <) by unary predicates |
Tuesday, October 16 |
|
Pavel Semukhin, Cornell University ACA_0 |
Wednesday, October 17 |
|
Sasha Rubin, University of Auckland A survey of automatic structures |
Tuesday, October 23 |
|
Pavel Semukhin, Cornell University
ACA_0 |
Wednesday, October 24 |
|
Iman Poernomo, King's College London Improving model driven architecture through formal methods |
Tuesday, October 30 |
|
Paul Larson, Miami University Coherence principles for clubs and elementary submodels |
Wednesday, October 31 |
|
Pavel Semukhin, Cornell University Applications of Kolmogorov complexity to computable model theory |
Tuesday, November 6 |
|
James Worthington, Cornell University WKL_0 |
Wednesday, November 7 |
|
Nicholas Hay, Cornell University A mathematical definition of artificial intelligence |
Tuesday, November 13 |
|
James Worthington, Cornell University WKL_0, part II |
Wednesday, November 14 |
|
Slawomir Solecki, University of Illinois at Urbana G_delta ideals of compact sets |
Tuesday, November 20 |
|
Paul Shafer, Cornell University ATR_0 |
Tuesday, November 27 |
|
Paul Shafer, Cornell University ATR_0 |
Wednesday, November 28 |
|
Guram Bezhanishvili, New Mexico State University Topological completeness of modal and superintuitionistic logics |
Tuesday, January 22 |
|
Allen Mann, Colgate University Independence-friendly logic |
Thursday, January 24 |
|
Justin Moore, Cornell University The construction of a Countryman line: an introduction to minimal walks |
Tuesday, January 29 |
|
Michael O'Connor, Cornell University Axiomatizing superintuitionistic logics |
Thursday, January 31 |
|
Justin Moore, Cornell University The construction of a Countryman line: an introduction to minimal walks II |
Tuesday, February 5 |
|
Michael O'Connor, Cornell University Heyting algebras 2 |
Thursday, February 7 |
|
Justin Moore, Cornell University What is the proper forcing axiom? (part 1 of 2) |
Tuesday, February 12 |
|
Michael O'Connor, Cornell University Heyting algebras |
Thursday, February 14 |
|
James Worthington, Cornell University Disimulation |
Tuesday, February 19 |
|
Howard Blair, Syracuse University Set-based answer set logic programming |
Thursday, February 21 |
|
James Worthington, Cornell University Schlumberger's theorem |
Tuesday, February 26 |
|
James Worthington, Cornell University The bialgebra approach to automata/quantum automata |
Thursday, February 28 |
|
François Dorais, Cornell University Third-order arithmetic and the Baumgartner-Hajnal theorem |
Tuesday, March 4 |
|
James Worthington, Cornell University Quantum automata, continued |
Thursday, March 6 |
|
Paul Shafer, Cornell University Menger's theorem for countable graphs in Pi_1^1-CA_0 |
Tuesday, March 11 |
|
Paul Shafer, Cornell University Menger's theorem for countable graphs in Pi_1^1-CA_0 |
Thursday, March 13 |
|
James Worthington, Cornell University Quantum pushdown automata |
Tuesday, March 25 |
|
Paul Shafer, Cornell University Menger's theorem for countable graphs in Pi_1^1-CA_0 (continued) |
Thursday, March 27 |
|
Justin Moore, Cornell University Open coloring axiom, the continuum, and \aleph_2 (part I) |
Tuesday, April 1 |
|
Justin Moore, Cornell University Open coloring axiom, the continuum, and \aleph_2 (part II) |
Thursday, April 3 |
|
Menachem Kojman, Ben Gurion University of the Negev Extensions of Ramsey's theorem |
Tuesday, April 8 |
|
Mingzhong Cai, Cornell University Strong minimal covers and Yates' question |
Thursday, April 10 |
|
Michael O'Connor, Cornell University Diego's theorem |
Tuesday, April 15 |
|
Mingzhong Cai, Cornell University Strong minimal covers and Yates' question (continued) |
Thursday, April 17 |
|
Michael O'Connor, Cornell University A solution to the L-space problem I |
Tuesday, April 22 |
|
Mingzhong Cai, Cornell University Strong minimal covers and Yates' problem III |
Thursday, April 24 |
|
Paul Shafer, Cornell University A solution to the L-space problem II |
Tuesday, April 29 |
|
James Worthington, Cornell University A solution to the L-space problem III |
Thursday, May 1 |
|
Michael O'Connor, Cornell University The logic of toposes and smooth infinitesimal analysis |
Last modified:July 21, 2008
|