Logic Seminar (MATH 781-782)

List of Talks given in 2006-07

Tuesday, September 5   Michael O’Connor, Cornell University
The structure of the free Heyting algebras
Wednesday, September 6   Bjørn Kjos-Hanssen, University of Connecticut and Cornell University
Complex oscillations and the law of the iterated logarithm
Tuesday, September 12   Denis Hirschfeldt, University of Chicago
Interactions between initial segment Kolmogorov complexity of sets and computability theory I
Wednesday, September 13   Denis Hirschfeldt, University of Chicago
Interactions between initial segment Kolmogorov complexity of sets and computability theory II
Tuesday, September 19   Mia Minnes, Cornell University
The ramified analytic hierarchy
Wednesday, September 20   Denis Hirschfeldt, University of Chicago
Interactions between initial segment Kolmogorov complexity of sets and computability theory III
Tuesday, September 26   Mia Minnes, Cornell University
Kreisel compactness
Wednesday, September 27   Paul Shafer, Cornell University
Splitting Medvedev and Muchnik degrees I
Tuesday, October 3   James Worthington, Cornell University
Perfect subsets of Sigma-1-1 sets and the Kreisel basis theorem
Wednesday, October 4   Wojtek Moczydlowski, Cornell University
Constructive set theories
Wednesday, October 11   Paul Shafer, Cornell University
Splitting Medvedev and Muchnik degrees II
Tuesday, October 17   James Worthington, Cornell University
Inductive definitions
Thursday, October 19   Justin Moore, Boise State University
A solution to the L space problem
Tuesday, October 24   Michael O’Connor, Cornell University
Pi-1-1 singletons
Wednesday, October 25   Vivian Morley, Ithaca, New York
DNC degrees and an injury free solution of Post's problem
Tuesday, October 31   Michael O’Connor, Cornell University
Measure theoretic uniformity and basis theorems
Wednesday, November 1   Vivian Morley, Ithaca, New York
Kucera's injury free construction of incomparable r.e. degrees and the Kucera-Gacs theorem
Tuesday, November 7   Bryant Adams, Cornell University
Cohen forcing in the hyperarithmetic setting
Wednesday, November 8   Michael O’Connor, Cornell University
Measure theoretic uniformity and basis theorems II
Tuesday, November 14   Matthias Aschenbrenner, University of Illinois at Chicago
Asymptotic differential algebra
Wednesday, November 15   Mia Minnes, Cornell University
Automatic sequences: characterizations via logic, combinatorics, and algebra
Tuesday, November 28   Bjørn Kjos-Hanssen, Cornell University
Perfect forcing
Wednesday, November 29   Bjørn Kjos-Hanssen, Cornell University
Minimal hyperdegrees
Wednesday, January 24   Richard Shore, Cornell University
Rigidity and biinterpretability in the hyperdegrees I
Tuesday, January 30   Richard Shore, Cornell University
Rigidity and biinterpretability in the hyperdegrees II
Wednesday, January 31   Paul Shafer, Cornell University
Proof theory of propositional logic I
Tuesday, February 6   David Martin, Cornell University
Worst case background knowledge for privacy preserving data publishing
Wednesday, February 7   Paul Shafer, Cornell University
Proof theory of propositional logic II
Tuesday, February 13   Michael O’Connor, Cornell University
Game semantics
Tuesday, February 20   Michael O’Connor, Cornell University
Game semantics II
Wednesday, February 21   James Worthington, Cornell University
Proof systems for first order logic
Tuesday, February 27   James Worthington, Cornell University
Minimal honest polynomial-time degrees and P=NP
Wednesday, February 28   Michael O’Connor, Cornell University
Cut elimination
Tuesday, March 6   James Worthington, Cornell University
Minimal honest polynomial-time degrees and P=NP (II)
Wednesday, March 7   Michael O’Connor, Cornell University
Herbrand’s theorem
Tuesday, March 13   James Worthington, Cornell University
The intractability of resolution
Wednesday, March 14   David Martin, Cornell University
Intuitionistic and linear logic
Tuesday, March 27   Bryant Adams, Cornell University
A model of knowledge: What do muddy children know?
Wednesday, March 28   David Martin, Cornell University
Fragments of arithmetic
Tuesday, April 3   Harold Hodes, Cornell University
Universal proof theory I
Wednesday, April 4   Vivienne Morley, Cornell University
Fragments of bounded arithmetic
Tuesday, April 10   Harold Hodes, Cornell University
Universal proof theory II
Wednesday, April 11   Paul Shafer, Cornell University
Incompleteness theorems
Tuesday, April 17   Wojtek Moczydlowski, Cornell University
A dependent set theory
Wednesday, April 18   James Worthington, Cornell University
The Sigma_1 and Sigma_1^b definable functions of ISigma_1 and S^1_2
Tuesday, April 24   James Worthington, Cornell University
ISigma_1 and S^1_2
Tuesday, April 24   Michael O’Connor, Cornell University
BSigma_n and ISigma_n
Wednesday, April 25   Michael O’Connor, Cornell University
The relation between BSigma_n and ISigma_n
Tuesday, May 1   Andre Scedrov, University of Pennsylvania
Symbolic analysis of computer network security protocols I
Wednesday, May 2   Andre Scedrov, University of Pennsylvania
Symbolic analysis of computer network security protocols II
Tuesday, May 8   Michael O’Connor, Cornell University
Translations of intuitionistic propositional logic and The order-theoretic structure of free finitely generated Heyting algebras

Last modified:June 19, 2007