Logic Seminar (MATH 781-782)
Logic Seminar (MATH 781-782)
List of Talks given in 1995-96
| Mon., September 11 | Sergei Artemov, Cornell visitor Provability operators |
|
| Wed., September 13 | Reed Solomon, Cornell University Recursive comprehension |
|
| Mon., September 18 | Sergei Artemov, Cornell visitor Provability operators II |
|
| Wed., September 20 | Reed Solomon, Cornell University Recursive comprehension |
|
| Wed., September 27 | Ashvin Dsouza, Cornell University Arithmetic comprehension |
|
| Mon., October 2 | Rod Downey, Cornell visitor There is no fat orbit |
|
| Wed., October 11 | Ashvin Dsouza, Cornell University Arithmetic comprehension |
|
| Wed., October 18 | Bob Milnikel, Cornell University Weak Konig�s lemma, part I |
|
| Mon., October 23 | John Rosenthal, Ithaca College Some undecidable lattices, part I |
|
| Wed., October 25 | Bob Milnikel, Cornell University Weak Konig�s lemma, part II |
|
| Mon., October 30 | John Rosenthal, Ithaca College Some undecidable lattices, part II |
|
| Wed., November 1 | Denis Hirschfeldt, Cornell University Arithmetic transfinite recursion (ATR), part I |
|
| Mon., November 6 | Sergei Artemov, Cornell visitor Propositional operations over proofs |
|
| Wed., November 8 | Denis Hirschfeldt, Cornell University Arithmetic transfinite recursion (ATR), part II |
|
| Mon., November 13 | Stephen Simpson, Penn State University Separable Banach space theory needs strong existence axioms |
|
| Wed., November 15 | Stephen Simpson, Penn State University Separable Banach space theory needs strong existence axioms |
|
| Mon., November 20 | Neil Immerman, University of Massachusetts Descriptive complexity and ordering |
|
| Mon., November 27 | Neil Immerman, University of Massachusetts Descriptive complexity and dynamic complexity |
|
| Mon., December 4 | Sergei Artemov, Cornell visitor Provability operators and quantifiers |
|
| Mon., December 11 | Michael Moses, George Washington University N-recursive linear orders: between recursive and decidable |
|
| Thu., January 25 | Walker White, Cornell University Beta-models of arithmetic, part I |
|
| Tue., January 30 | Bakhadyr Khoussainov, Cornell University Computable categoricity and expansions by constants, part I |
|
| Tue., February 6 | Bakhadyr Khoussainov, Cornell University Computable categoricity and expansions by constants, part II |
|
| Thu., February 8 | Walker White, Cornell University Beta-models of arithmetic, part II |
|
| Tue., February 13 | Richard Shore, Cornell University Degree invariant solutions to Post�s problem |
|
| Thu., February 15 | Denis Hirschfeldt and Reed Solomon, Cornell University Omega-models of arithmetic, part I |
|
| Tue., February 20 | Richard Shore, Cornell University Degree invariant solutions to Post�s problem II |
|
| Thu., February 22 | Denis Hirschfeldt and Reed Solomon, Cornell University Omega-models of arithmetic, part II |
|
| Tue., February 27 | Bakhadyr Khoussainov, Cornell University Effective structures (a survey talk) |
|
| Thu., February 29 | Reed Solomon, Cornell University Omega models and WKL |
|
| Tue., March 5 | Robert Milnikel, Cornell University Complexity issues in nonmonotonic logic |
|
| Thu., March 7 | Denis Hirschfeldt, Cornell University Omega models and ATR |
|
| Tue., March 12 | Leon Harkleroad, Cornell University Difference sets |
|
| Thu., March 14 | Denis Hirschfeldt, Cornell University Omega models and ATR, part II |
|
| Tue., March 26 | Reed Solomon, Cornell University Minimal hyperdegrees |
|
| Thu., March 28 | Ashvin Dsouza, Cornell University Non-omega-models |
|
| Tue., April 2 | Alberto Marcone, University of Turin Lebesgue numbers and Atsuji spaces |
|
| Tue., April 9 | Denis Hirschfeldt, Cornell University Ramsey�s theorem revisited: some conservation results |
|
| Tue., April 16 | Denis Hirschfeldt, Cornell University Ramsey�s theorem revisited: some conservation results II |
|
| Thu., April 18 | Robert Milnikel, Cornell University Non-omega models and conservation results |
|
| Tue., April 23 | Gerald Sacks, Harvard University & MIT Model theoretic methods in recursion theory: minimal upper bounds for sets of hyperdegrees |
|
| Tue., April 30 | Neil Immerman, University of Massachusetts Dynamic complexity |