Logic Seminar (MATH 781-782)
Logic Seminar (MATH 781-782)
List of Talks given in 2000-01
Tuesday, August 29 | Jennifer Davoren, Australian National University (Australia) Logic-based design and synthesis of controllers for hybrid systems |
|
Thursday, August 31 | Noam Greenberg, Cornell University Admissibility and regularity I |
|
Tuesday, September 5 | Alex Usvyatsov, Hebrew University (Israel) Simple theories |
|
Thursday, September 7 | Noam Greenberg, Cornell University Admissibility and regularity II: Sigma_1 projecta |
|
Tuesday, September 12 | Russell Miller, Cornell University Computable categoricity and trees |
|
Thursday, September 14 | Noam Greenberg, Cornell University Regularity and hyperregularity |
|
Tuesday, September 19 | Noam Greenberg, Cornell University Post problem for alpha recursion theory |
|
Thursday, September 21 | Vladimir Uspensky, Lomonosov State University of Moscow (Russia) Kolmogorov's information theory versus Shannon's one |
|
Tuesday, September 26 | Roman Tymkiv, Cornell University Elementary invariants for Boolean algebras I |
|
Thursday, September 28 | Noam Greenberg, Cornell University Post's problem for alpha recursion theory II |
|
Tuesday, October 3 | Roman Tymkiv, Cornell University Elementary invariants for Boolean algebras II |
|
Thursday, October 5 | Yuval Gabay, Cornell University Finite injury priority arguments in alpha recursion theory I |
|
Thursday, October 12 | Itai Ben-Yaacov, Ecole Normale Superieure (France) Hyperimaginaries and simple theories I |
|
Tuesday, October 17 | Itai Ben-Yaacov, Ecole Normale Superieure (France) Hyperimaginaries and simple theories II |
|
Thursday, October 19 | Yuval Gabay, Cornell University Finite injury priority arguments in alpha recursion theory II |
|
Tuesday, October 24 | Russell Miller, Cornell University Definability of incompleteness for Friedberg splittings |
|
Thursday, October 26 | Yuval Gabay, Cornell University Dynamic methods and blocking |
|
Tuesday, October 31 | Nat Miller, Cornell University Diagrams in Euclidean geometry: diagram satisfaction is NP-hard and a new hierarchy of diagrammatic Euclidean geometries |
|
Thursday, November 2 | Yuval Gabay, Cornell University The splitting theorem in alpha-recursion theory |
|
Tuesday, November 7 | Mohan Rajagopalan, Cornell University Density of the alpha-r.e. degree I |
|
Thursday, November 9 | Charles Steinhorn, Vassar College An approach to model theory for finite structures |
|
Tuesday, November 14 | Mohan Rajagopalan, Cornell University Density of the alpha-r.e. degree II |
|
Tuesday, November 21 | Rajmohan Rajagopalan, Cornell University Density of the alpha-r.e. degrees III |
|
Tuesday, November 28 | Rajmohan Rajagopalan, Cornell University Density of the alpha-r.e. degrees IV |
|
Thursday, January 25 | Christopher Hardin, Cornell University Reverse mathematics and the mean value theorem I |
|
Tuesday, January 30 | Joseph Miller, Cornell University Effective completeness theorem |
|
Thursday, February 1 | Christopher Hardin, Cornell University Reverse mathematics and the mean value theorem II |
|
Tuesday, February 6 | Joseph Miller, Cornell University Model completeness and decidability |
|
Thursday, February 8 | Christopher Hardin, Cornell University Reverse mathematics and the mean value theorem III |
|
Thursday, February 8 | Yuval Gabay, Cornell University Forcing and hyperdegrees I |
|
Tuesday, February 13 | Mohan Rajagopalan, Cornell University Omitting types and decidability |
|
Thursday, February 15 | Yuval Gabay, Cornell University Forcing and hyperdegrees II |
|
Tuesday, February 20 | Mohan Rajagopalan, Cornell University Effective omitting types theorem |
|
Thursday, February 22 | Yuval Gabay, Cornell University Forcing and hyperdegrees III |
|
Tuesday, February 27 | Richard Shore, Cornell University Decidable prime models |
|
Thursday, March 1 | Yuval Gabay, Cornell University Minimal hyperdegrees |
|
Tuesday, March 6 | Mohan Rajagopalan, Cornell University Effective omiting types theorem |
|
Thursday, March 8 | Suman Ganguli, Cornell University Decidable models for modal logics with infinitary modalities: dynamic logic, temporal logic, epistemic logic |
|
Tuesday, March 13 | Christopher Hardin, Cornell University Decidable saturated models |
|
Thursday, March 15 | Denis Hirschfeldt, University of Chicago Measures of relative randomness |
|
Tuesday, March 27 | Christopher Hardin, Cornell University Decidable saturated models |
|
Tuesday, April 3 | Christopher Hardin, Cornell University Decidable saturated models II |
|
Thursday, April 5 | Joseph Miller, Cornell University Characterizing fixed point sets for effective functions |
|
Tuesday, April 10 | Christopher Hardin, Cornell University Decidable homogeneous models |
|
Thursday, April 12 | Michael Morley, Cornell University Finitely axiomatizable theories I |
|
Tuesday, April 17 | Noam Greenberg, Cornell University Vaught's theorem fails for decidable models |
|
Thursday, April 19 | Michael Morley, Cornell University Finitely axiomatizable theories II |
|
Tuesday, April 24 | Noam Greenberg, Cornell University Decidable Aleph_1 categorical theories |
|
Thursday, April 26 | Jesse Alt, Cornell University Strong normalization and confluence in reflective lambda-calculus |
|
Tuesday, May 1 | Vivian Morley, Ithaca, New York Indescernibles and decidability |
|
Thursday, May 3 | Vivian Morley, Ithaca, New York Indescernibles and decidability II |