|

|
|
List of Talks
given in 1994-95
| Thu., September 1 |
|
Anil Nerode, Cornell Nonmonotonic logic |
| Thu., September 8 |
|
Anil Nerode, Cornell Nonmonotonic logic, continued |
| Thu., September 22 |
|
Bakhadyr Khoussainov, MSI On automatic representations
of structures |
| Thu., September 29 |
|
Chris Leary, Geneseo Games and filters on omega |
| Tue., October 4 |
|
Jennifer Davoren, Cornell Extensions |
| Thu., October 6 |
|
Dexter Kozen, Cornell Logical aspects of set constraints |
| Thu., October 13 |
|
Reed Solomon, Cornell Cut elimination |
| Tue., October 18 |
|
Reed Solomon, Cornell Characterizations of extensions |
| Thu., October 20 |
|
Xiaolin Ge, MSI Computable semicontinuous real functions |
| Tue., October 25 |
|
Denis Hirschfeldt, Cornell Well orderings and priorities |
| Tue., November 1 |
|
Ashvin Dsouza, Cornell Computing extensions |
| Thu., November 3 |
|
Sergei Goncharov, Novosibirsk University Computable
classes of recursive models |
| Tue., November 8 |
|
Robert Milnikel, Cornell Normal default theories |
| Thu., November 10 |
|
Sergei Goncharov, Novosibirsk University Families
of r.e. sets with unique computable enumerations |
| Thu., November 17 |
|
Wiktor Marek, Univ. of Kentucky Revision programming |
| Tue., January 31 |
|
Howard Blair, Syracuse University Logic programming |
| Tue., February 7 |
|
Richard Shore, Cornell Modal logic |
| Thu., February 9 |
|
Qi Chen, Cornell Recursive chattering lemma |
| Tue., February 14 |
|
Reed Solomon, Cornell Circumscription |
| Thu., February 16 |
|
Jennifer Davoren, Cornell Extracting finite automata
for hybrid systems |
| Tue., February 21 |
|
Robert Milnikel, Cornell Modal nonmonotonic logic |
| Thu., February 23 |
|
Denis Hirschfeldt, Cornell Ramsey’s theorem and reverse
mathematics |
| Tue., February 28 |
|
Robert Milnikel, Cornell Modal nonmonotonic logic |
| Thu., March 2 |
|
Andre Nies, Cornell visitor Application of coding
methods to structures from computability theory, I |
| Tue., March 7 |
|
Robert Milnikel, Cornell Nonmonotonic modal logics |
| Thu., March 9 |
|
Andre Nies, Cornell visitor Application of coding
methods to structures from computability theory, II |
| Tue., March 14 |
|
Robert Milnikel, Cornell Nonmonotonic modal logic |
| Thu., March 16 |
|
Bakhadyr Khoussainov, MSI Presentations, reducibilities,
and dimensions of recursive models |
| Tue., March 28 |
|
Denis Hirschfeldt, Cornell Complexity results for
nonmonotonic logics |
| Thu., March 30 |
|
Dexter Kozen, Cornell Rational spaces and set constraints |
| Tue., April 4 |
|
Denis Hirschfeldt, Cornell Complexity of nonmonotonic
logic |
| Thu., April 6 |
|
Reed Solomon, Cornell Embeddings into the r.e. degrees
with one an ordering on the first jumps |
| Tue., April 11 |
|
Ashvin Dsouza, Cornell Well founded semantics for
general logic programs |
| Thu., April 13 |
|
Leon Harkleroad, Cornell visitor Effectivizing combinatorics:
variations on Szpilrajn and Dilworth |
| Tue., April 18 |
|
Jennifer Davoren, Cornell Three valued nonmonotonic
logic |
| Thu., April 27 |
|
John Rosenthal, Ithaca College On the geometry of
algebraically closed subfields of an algebraically closed field (in
memory of Chris Ash) |
| Thu., May 4 |
|
Andre Nies, Cornell visitor Coding in the lattice
of R.E. sets |
Last modified:
April 15, 2004
|