
|
|
List of Talks
given in 1999-2000
Tuesday, August 31 |
|
Walker White, Cornell University Algorithmic complexity
of some model theoretic properties |
Thursday, September 2 |
|
Roman Tymkiv, Cornell University Intuitionistic arithmetic |
Tuesday, September 7 |
|
Walker White, Cornell University Algorithmic complexity
of some model theoretic properties II |
Thursday, September 9 |
|
Joe Miller, Cornell University Realizability and recursive
mathematics I: intuitionistic set theory |
Tuesday, September 14 |
|
Richard Shore, Cornell University Defining the Turing
jump I |
Thursday, September 16 |
|
Joe Miller, Cornell University Realizability and recursive
mathematics II: the general realizability structure |
Tuesday, September 21 |
|
Sergei Artemov, Cornell University Proof realizability |
Thursday, September 23 |
|
Joe Miller, Cornell University Realizability and recursive
mathematics III |
Tuesday, September 28 |
|
Harold Hodes, Cornell University Generalizing natural
deduction (at least slightly) |
Thursday, September 30 |
|
Joe Miller, Cornell University Realizability and recursive
mathematics IV |
Tuesday, October 5 |
|
Alexandre Evfimievski, Cornell University A probabilistic
algorithm for updating files over a communication link |
Thursday, October 7 |
|
Joe Miller, Cornell University Realizability and recursive
mathematics V |
Tuesday, October 12 |
|
Philip Scowcroft, Wesleyan University Intuitionistic
analysis |
Thursday, October 14 |
|
Philip Scowcroft, Wesleyan University Intuitionistic
analysis II |
Tuesday, October 19 |
|
Alexei Kopylov, Cornell University Linear logic |
Tuesday, October 26 |
|
Alexei Kopylov, Cornell University Linear logic, part
II: decidability of linear affine logic |
Thursday, October 28 |
|
Walker White, Cornell University Realizability and
recursive mathematics |
Thursday, November 4 |
|
Walker White, Cornell University Realizability and
recursive mathematics II |
Tuesday, November 9 |
|
Suman Ganguli, Cornell University Realizability and
recursive set theory |
Thursday, November 11 |
|
Harvey Friedman, Ohio State University Approximate
fixed points, disjoint covers and optimized posets |
Tuesday, November 16 |
|
Suman Ganguli, Cornell University Realizability and
recursive set theory II |
Thursday, November 18 |
|
Steve Zdancewic, Cornell University Computational
interpretation of classical proofs |
Tuesday, November 23 |
|
Suman Ganguli, Cornell University Realizability and
recursive set theory III |
Thursday, January 27 |
|
Vitezxlav Svejdar, Karlovy University PSPACE-completeness
in some non-classical logics |
Tuesday, February 1 |
|
Richard Shore, Cornell University Defining the Turing
jump I |
Thursday, February 3 |
|
Roman Tymkiv, Cornell University Constructive ordinals
and Pi-1-1 sets I |
Tuesday, February 8 |
|
Richard Shore, Cornell University Defining the Turing
jump II |
Thursday, February 10 |
|
Roman Tymkiv, Cornell University Constructive ordinals
and Pi-1-1 sets II |
Tuesday, February 15 |
|
Joseph Miller, Cornell University Variations on timed
automata |
Thursday, February 17 |
|
Roman Tymkiv, Cornell University Constructive ordinals
and Pi-1-1 sets III |
Tuesday, February 22 |
|
Yuval Gabay, Cornell University The hyperarithmetic
hierarchy |
Tuesday, February 29 |
|
Suman Ganguli, Cornell University Decidable Kripke
models for modal logic I |
Thursday, March 2 |
|
Yuval Gabay, Cornell University The hyperarithmetic
hierarchy II |
Tuesday, March 7 |
|
Suman Ganguli, Cornell University Decidable Kripke
models for modal logic II |
Thursday, March 9 |
|
Yuval Gabay, Cornell University The hyperarithmetic
hierarchy III |
Tuesday, March 14 |
|
Suman Ganguli, Cornell University Decidable Kripke
models for modal logic III |
Thursday, March 16 |
|
Noam Greenberg, Cornell University Sigma-1-1 predicates
of reals I |
Tuesday, March 28 |
|
Richard Shore, Cornell University Another splitting
theorem |
Thursday, March 30 |
|
Noam Greenberg, Cornell University Sigma-1-1 predicates
of reals II |
Tuesday, April 4 |
|
Noam Greenberg, Cornell University Sigma-1-1 predicates
of reals III |
Thursday, April 6 |
|
Noam Greenberg, Cornell University Sigma-1-1 predicates
of reals IV |
Tuesday, April 11 |
|
Roman Tymkiv, Cornell University Finite computable
dimension does not relativize |
Wednesday, April 12 |
|
Gerald Sacks, Harvard University and MIT E-recursion
I |
Thursday, April 13 |
|
Gerald Sacks, Harvard University and MIT E-recursion
II |
Tuesday, April 18 |
|
Walker White, Cornell University Metarecursion: enumerability
I |
Tuesday, April 25 |
|
Walker White, Cornell University Metarecursion: enumerability
II |
Tuesday, May 2 |
|
Walker White, Cornell University Metarecursion: priority
arguments |
Thursday, May 4 |
|
Walker White, Cornell University Metarecursion: priority
arguments |
Last modified:
March 25, 2004
|