Fall 2007
Seminar this term meets Tuesdays 2-3 pm in Kemeny 006. * indicates there will be logic seminar dinner on that date.
| Date | Speaker | Title |
|---|---|---|
| * Oct 2 |
Rebecca Weber
Dartmouth College
|
Hypersimple sets and completeness |
| Oct 9 |
Brooke Andersen
Dartmouth College
|
Weak truth-table completeness does not imply truth-table completeness [Lachlan, '75] |
| Oct 16 |
Marcia Groszek
Dartmouth College
|
Using nonstandard models of arithmetic to prove combinatorial theorems (abstract) |
| Oct 23 |
Marcia Groszek
Dartmouth College
|
Using nonstandard models of arithmetic to prove combinatorial theorems (abstract) |
| Oct 30 |
Joe Mileti
Dartmouth College
|
The complexity of ideals in computable rings (abstract) |
| Nov 6 |
John Bourke
Dartmouth College
|
Splitting numbers and stationary sets |
| Nov 13 |
Brooke Andersen
Dartmouth College
|
Some theorems about $D^+$-reducibility |
| Nov 27 |
Marcia Groszek
Dartmouth College
|
A proof that bounded search reducibility is equivalent to nondeterministic bounded search reducibility |