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