Logic Seminar (MATH 781-782)

List of Talks given in 1998-99

Thursday, September 3   John Rosenthal, Ithaca College
Finite dimensional Steinitz exchange systems with undecidable theories
Tuesday, September 8   Joe Miller, Cornell University
Forgetful determinacy
Thursday, September 10   Richard Platek, Cornell University
Nonstandard analysis, an introduction
Tuesday, September 15   Joe Miller, Cornell University
The decidability of S2S via determinacy
Thursday, September 17   Richard Platek, Cornell University
Nonstandard analysis II
Tuesday, September 22   Suman Ganguli, Cornell University
The decidability of S2S via determinacy
Thursday, September 24   Richard Platek, Cornell University
Nonstandard analysis III
Tuesday, September 29   Suman Ganguli & Joe Miller, Cornell University
The decidability of S2S via determinacy, continued
Thursday, October 1   Bob Milnikel, Cornell University
Reduction of nonstandard mathematics to standard
Thursday, October 8   Moshe Vardi, Rice University
Church's problem revisited: synthesis with incomplete information and alternating tree automata
Thursday, October 15   Robert Milnikel, Cornell University
Reducing nonstandard proofs to standard (conclusion)
Thursday, October 15   Walker White, Cornell University
Radically finite probability theory
Thursday, October 22   Robert K. Meyer, Australian National University
Introduction to relevant logics
Tuesday, October 27   Sergei Artemov, Cornell University
On the Brouwer-Heyting-Kolmogorov semantics for intuitionistic logic
Thursday, October 29   Walker White, Cornell University
Radically finite probability theory (part I)
Tuesday, November 3   Suman Ganguli, Cornell University
Automata and modal logics
Thursday, November 5   Walker White, Cornell University
Radically finite probability theory, part II: culminating in the law of large numbers
Tuesday, November 10   Suman Ganguli, Cornell University
Construction of automata for temporal logics
Tuesday, November 10   Joe Miller, Cornell University
Computational complexity issues related to decidability
Tuesday, November 17   Joe Miller, Cornell University
A few complexity results for decidable structures
Tuesday, November 17   Jennifer Davoren, Cornell University
A very brief introduction to the modal mu-calculus
Thursday, November 19   Anil Nerode, Cornell University
An introduction to the calculus of variations
Tuesday, November 24   Jennifer Davoren, Cornell University
Formal analysis and verification of hybrid systems using extensions of the modal mu-calculus
Tuesday, December 1   Anil Nerode, Cornell University
The nonstandard calculus of variations
Thursday, December 3   Anil Nerode, Cornell University
The nonstandard calculus of variations
Thursday, January 28   Nat Miller, Cornell University
A diagrammatic formal system for Euclidean geometry
Tuesday, February 2   Jeffrey Roland, Cornell University
Large cardinals I (inaccessibility, Mahloness and measurability)
Thursday, February 4   Walker White, Cornell University
Robinson forcing
Tuesday, February 9   Jeffrey W. Roland, Cornell University
Large cardinals II (measurability)
Thursday, February 11   Walker White, Cornell University
Effective Robinson forcing
Tuesday, February 16   Suman Ganguli, Cornell University
Large cardinals III: compactness; elementary embeddings
Thursday, February 18   Robert Milnikel, Cornell University
A Gentzen system for nonmonotonic logics
Tuesday, February 23   Suman Ganguli, Cornell University
Large cardinals IV: elementary embeddings
Thursday, February 25   Noam Greenberg, Cornell University
Easy PCF I
Tuesday, March 2   Suman Ganguli, Cornell University
Large cardinals V: elementary embeddings; indescribability
Thursday, March 4   Noam Greenberg, Cornell University
Easy PCF II
Tuesday, March 9   Noam Greenberg, Cornell University
Large cardinals VI: partition properties
Thursday, March 11   Noam Greenberg, Cornell University
Easy PCF II
Tuesday, March 16   Noam Greenberg, Cornell University
Large cardinals VII: partition properties (continued)
Thursday, March 18   Noam Greenberg, Cornell University
Easy PCF III
Tuesday, March 30   Noam Greenberg, Cornell University
Easy PCF (conclusion)
Tuesday, April 6   Cris Carlude, University of Aukland, New Zealand
Recent progress on the complexity of computable enumerable random reals
Tuesday, April 13   Noam Greenberg, Cornell University
Large cardinals: partition properties (continued)
Thursday, April 15   Denis Hirschfeldt, Cornell University
Degree spectra of relations on algebraic structures
Tuesday, April 20   Noam Greenberg, Cornell University
Large cardinals (continued)
Thursday, April 22   Jennifer Davoren, Cornell University
Using the modal mu-calculus: synthesis of feedback controllers for hybrid systems
Tuesday, April 27   David W. Kueker, University of Maryland
Constructing models from smooth families of finite structures
Thursday, April 29   Sergei Artemov, Cornell University
On the metamathematics of formal verification
Tuesday, May 4   Noam Greenberg, Cornell University
Large cardinals (0#, conclusion)
Tuesday, May 4   Walker White, Cornell University
Large cardinals (Solovay's theorem)
Thursday, May 6   Walker White, Cornell University
Solovay's Theorem (conclusion)

Last modified: March 30, 2004