|
|
|
List of Talks
given in 2005-06
| Tuesday, September 6 |
|
Bakhadyr Khoussainov, University of Auckland and Cornell University
Some topics in computable model theory and algebra |
| Wednesday, September 7 |
|
Pavel Semukhin, University of Auckland and Cornell University
On Pi_1 presentations of algebras |
| Tuesday, September 13 |
|
Michael O'Connor, Cornell University
Effective completeness theorem |
| Wednesday, September 14 |
|
Pavel Semukhin, Cornell University
On Pi_1 presentations of algebras (part 2) |
| Tuesday, September 20 |
|
Michael O'Connor, Cornell University
Effective omitting types theorems |
| Wednesday, September 21 |
|
Mia Minnes, Cornell University
Weighted finite-state transducers and applications to speech recognition |
| Tuesday, September 27 |
|
Pavel Semukhin, Cornell University
Decidable prime models |
| Wednesday, September 28 |
|
Sasha Rubin, Auckland University
Automata-theoretic approach to verification: introduction |
| Wednesday, October 5 |
|
Sasha Rubin, Auckland University
S1S with extended predicates |
| Wednesday, October 12 |
|
Sasha Rubin, Auckland University
Alternating automata |
| Tuesday, October 25 |
|
Pavel Semukhin, Cornell University
Decidable prime models, part 2 |
| Wednesday, October 26 |
|
Jiamou Liu, University of Auckland and Cornell University
Parity games |
| Tuesday, November 1 |
|
Pavel Semukhin, Cornell University
Decidable saturated models |
| Wednesday, November 2 |
|
Walker White, Cornell University
What's next? Models of time event systems |
| Tuesday, November 8 |
|
Mia Minnes, Cornell University
Ash-Nerode theorem |
| Wednesday, November 9 |
|
Walker White, Cornell University
What's next? Models of time event systems, part 2 |
| Tuesday, November 15 |
|
Mia Minnes, Cornell University
Intrinsically computable sets and forcing |
| Wednesday, November 16 |
|
Michael O'Connor, Cornell University
Completeness results for properties of computable models |
| Tuesday, November 22 |
|
James Worthington, Cornell University
Computable isomorphism types of linear orders and Boolean algebras |
| Tuesday, November 29 |
|
James Worthington, Cornell University
Computable isomorphism types of linear orders and Boolean algebras, part 2 |
| Wednesday, November 30 |
|
Michael O'Connor, Cornell University
Completeness results for properties of computable models, part 2 |
| Tuesday, January 24 |
|
Richard Shore, Cornell University
Hyperarithmetic theory: an introduction |
| Tuesday, January 31 |
|
Wojtek Moczydlowski, Cornell University
Normalization of IZF I |
| Wednesday, February 1 |
|
Wojtek Moczydlowski, Cornell University
Normalization of IZF II |
| Tuesday, February 7 |
|
Marat Arslanov, Kazan State University and Cornell University
N-c.e. degrees structures |
| Wednesday, February 8 |
|
Wojtek Moczydlowski, Cornell University
Ordinal notations and effective transfinite recursion |
| Tuesday, February 14 |
|
Barbara Csima, University of Waterloo
Effectiveness properties of Fraisse limits |
| Wednesday, February 15 |
|
James Worthington, Cornell University
Recursive ordinals and Pi-1-1 sets |
| Tuesday, February 21 |
|
Bryant Adams, Cornell University
Basic logic of quantum computation |
| Wednesday, February 22 |
|
James Worthington, Cornell University
Recursive ordinals and Pi-1-1 sets II |
| Tuesday, February 28 |
|
William Calhoun, Bloomsburg University
Degrees of monotone complexity |
| Wednesday, March 1 |
|
Mia Minnes, Cornell University
Hyperarithmetic = Delta-1-1 |
| Tuesday, March 7 |
|
Marat Arslanov, Kazan State University and Cornell University
Completeness criteria for strong reducibilities |
| Wednesday, March 8 |
|
Mia Minnes, Cornell University
Selection, separation and reduction |
| Tuesday, March 14 |
|
Bryant Adams, Cornell University
Gurevich's abstract state machine thesis |
| Wednesday, March 15 |
|
Michael O'Connor, Cornell University
Pi-0-2 singletons; hyperarithmetic reducibility |
| Tuesday, March 28 |
|
Andre Nies, University of Auckland
Automata presentable groups |
| Wednesday, March 29 |
|
James Worthington, Cornell University
Incomparable hyperdegrees via measure theoretic arguments |
| Tuesday, April 4 |
|
Andre Nies, University of Auckland
Computability and randomness I |
| Wednesday, April 5 |
|
Andre Nies, University of Auckland
Computability and randomness II |
| Tuesday, April 11 |
|
Michael O'Connor, Cornell University
The hyperjump |
| Tuesday, April 18 |
|
Vivian Morley, Ithaca, New York
Basis theorems |
| Wednesday, April 19 |
|
Vivian Morley, Ithaca, New York
Hyperarithmetic quantifiers |
| Tuesday, April 25 |
|
Joseph Mileti, University of Chicago
Effective ring theory |
| Wednesday, April 26 |
|
Joseph Mileti, University of Chicago
The strength of the Rainbow Ramsey Theorem |
| Tuesday, May 2 |
|
Michael O'Connor, Cornell University
Applications of strong normalization of Heyting arithmetic |
| Wednesday, May 3 |
|
Mia Minnes, Cornell University
Automata and automatic structures |
Last modified:
June 2, 2006
|
