Sep 28 Eckehart Koehler (Inst. Vienna Circle)
Why von Neumann Rejected Carnap's Concept of Information
Oct 5 G. Mints (Stanford)
What's needed to start a computer-checked proof?
Oct 12 David Wake (Stanford)
Review of Godel's incompleteness theorems
Oct 26 David Barker-Plummer (Stanford)
Logical Frameworks
Nov 2 N. Shankar (SRI International Computer Science Laboratory)
Goedel's First Incompleteness Theorem: A Mechanical Verification
Nov 9 N. Shankar (SRI International Computer Science Laboratory)
Goedel's First Incompleteness Theorem: A Mechanical
Verification Part II
Nov 16 Sol Feferman (Stanford)
A theory of finitary inductive definitions as a logical
framework
Nov 30 Sol Feferman (Stanford)
A theory of finitary inductive definitions as a logical
framework (conclusion)
Seminars take place on Tuesdays at 4:15 PM in room 381-T,
Mathematics Department (building 380).
Oct 15 Hiroshi Nakano (Ryukoku University, visiting Stanford)
Recursive types with a modality
Oct 29 Valeria de Paiva (University of Birmingham UK)
Dialectica Categories: a survey
Nov 12 G. Mints (Stanford)
On cut elimination for monotone cuts
Nov 19 Gianluigi Bellin (University of Verona)
Chu's construction; a proof-theoretic approach
Dec 3 Kai Hauser (Humboldt Universitat zu Berlin, Germany)
Godel's Program Revisited
Logic lunch takes place on Fridays at 12:00 PM in room 383-N,
Mathematics Department (building 380).
Department of Mathematics Colloquium takes place on Thursdays at 4:15 PM in the room 380-W, Mathematics Department (building 380).