2002 Clifford Lectures 

Mathematical Logic for Computer Science

Program

Wednesday, March 20 Thursday, March 21 Friday, March 22 Saturday, March 23
  Morning Morning Morning
  9:00 Henk Barendregt
Generation and definability
in
λ

10:30 Joshua Guttman
Authentication Tests: Analyzing and Designing Cryptographic Protocols

Noon Lunch

9:00 Rohit Parikh
Logic and Games

10:30 Dexter Kozen
Publication/Citation: A Proof-Theoretic Approach

Noon Lunch

8:30 Yuri Gurevich
The Abstract State Machine Paradigm

9:45 Gordon Plotkin
An Algebraic View of Computational Effects

11:00 Sergei Artemov
Explicit logic for computer science, III

Noon Lunch

Afternoon Afternoon Afternoon Afternoon
3:15 Welcome

3:30  Sergei Artemov
Explicit logic for computer science, I

4:45 Samson Abramsky
Predicative Copying and Polynomial Time

6:00 Reception

 

 

1:30 Nachum Dershowitz
Abstract Canonical Inference

2:45 Sam Buss
Taylor Series Methods for Rigid Body Motion and Extensions to Lie Groups

4:00 Sergei Artemov
Explicit logic for computer science, II

7:00 Conference Dinner

 

1:30 Juris Hartmanis
P versus NP, Revisited

2:45 Helmut Schwichtenberg
An arithmetic for polynomial-time computation

4:00 Moshe Vardi
Automated Verification = Graphs, Automata, and Logic

 

MFPS 18 Meeting

Click here to register

Back to Clifford Lectures page