| |
Schedule
|
 |
|
|
|
|
Tuesday
18 July 2006 |
|
|
|
|
|
|
|
Tutorials |
Morning
|
|
| |
09:00
- 11:00 |
New
Insights into Probabilistically Checkable
Proofs (PCPs) by Eli Ben-Sasson (Comput
Sci Dept, Technion Inst of Technology, Israel) |
|
| |
11:00
- 11:15 |
Coffee/tea
break |
|
| |
11:15
- 13:15
|
Operational
theories of sets by Solomon Feferman
(Depts of Mathematics and Philosophy, Stanford
University, USA) |
|
| |
13:15
- 16:30 |
Lunch
break |
|
|
|
|
|
|
|
|
Tutorials |
Afternoon
|
|
| |
14:30
- 16:30 |
Behavioral
Computation Theory by Yuri Gurevich
(Microsoft Research, USA) |
|
| |
16:30
- 16:45 |
Coffee/tea
break |
|
| |
16:45
- 18:45 |
Symbolic
Analysis of Computer Network Security Protocols
by Andre Scedrov (Department of Mathematics,
University of Pennsylvania, USA) |
|
|
|
|
|
|
|
Wednesday
19 July 2006 |
|
|
|
|
|
|
|
Proof
Theory |
Morning
|
|
| |
08:30
- 10:30 |
Proof
Mining: Applications of Proof Theory to
Analysis by Ulrich Kohlenbach (Department
of Mathematics, Darmstadt University of
Technology, Germany) |
|
| |
10:30
- 10:45 |
Coffee/tea
break |
|
| |
10:45
- 11:20
|
The
Axiom System I$Sigma_0$ Manages to Simultaneously
Obey and Evade the Herbrandized Version
of the Second Incompleteness Theorem
by Dan Willard |
|
| |
11:20
- 11:55
|
Propositional
games with explicit strategies by Bryan
Renne |
|
| |
11:55
- 12:30
|
Combinatorial
Proofs and Garbage Collection by
Dominic Hughes |
|
| |
12:30
- 14:00 |
Lunch
break |
|
|
|
|
|
|
|
|
Formal
Methods |
Afternoon
|
|
| |
14:00
- 15:15 |
Symbolic
Analysis of Computer Network Security Protocols
by Andre Scedrov (Department of Mathematics,
University of Pennsylvania, USA) |
|
| |
15:15
- 15:30 |
Coffee/tea
break |
|
| |
15:30
- 16:05 |
Reasoning
with Graphs by Jorge Petrúcio
Viana, Renata P. de Freitas, Sheila R. M.
Veloso and Paulo A. S. Veloso |
|
| |
16:05
- 16:40 |
Situations
as strings by Tim Fernando |
|
| |
16:40
- 17:15 |
Abstract
Families of Abstract Categorial Languages
by Makoto Kanazawa |
|
|
|
|
|
|
©2006 Stanford
University
|
|
|
Thursday
20 July 2006 |
|
|
|
|
|
|
|
Logic
and Model Theory |
Morning
|
|
| |
09:00
- 11:00 |
Infinitesimals
in Model Theory by Thomas Scanlon
(Mathematics Department, University of California
at Berkeley, USA) |
|
| |
11:00
- 11:15 |
Coffee/tea
break |
|
| |
11:15
- 11:50
|
Monadic
Second-Order Logic over Trees and Deterministic
Transitive Closure Logics by Hans-Jörg
Tiede and Stephan Kepser |
|
| |
11:55
- 14:00 |
Lunch
break |
|
|
|
|
|
|
|
|
Logic
and Computation |
Afternoon
|
|
| |
14:00
- 15:15 |
New
insights into Probabilistically Checkable
Proofs (PCPs) by Eli Ben-Sasson (Comput
Sci Dept, Technion Inst of Technology, Israel) |
|
| |
15:15
- 15:30 |
Coffee/tea
break |
|
| |
15:30
- 16:05 |
Formalizing
Type Operations Using the "Image"
Type Constructor by Aleksey Nogin and
Alexei Kopylov |
|
| |
16:05
- 16:20 |
Coffee/tea
break |
|
| |
16:20
- 17:35 |
The
expanding notion of algorithm by Yuri
Gurevich (Microsoft Research, USA) |
|
| |
20:00
- |
Conference
Dinner |
|
|
|
|
|
|
|
Friday
21 July 2006 |
|
|
|
|
|
|
|
Logic
and Foundations |
Morning
|
|
| |
09:00
- 10:15 |
A
logical uniform boundedness principle for
abstract metric and hyperbolic spaces
by Ulrich Kohlenbach (Dept of Mathematics,
Darmstadt Univ of Tech, Germany) |
|
| |
10:15
- 10:30 |
Coffee/tea
break |
|
| |
10:30
- 11:45
|
Operational
theories of sets by Solomon Feferman
(Depts of Mathematics and Philosophy, Stanford
University, USA) |
|
| |
11:45
- 12:00 |
Coffee/tea
break |
|
| |
12:00
- 12:35 |
Proof
mining in R-trees and hyperbolic spaces by
Laurentiu Leustean |
|
| |
12:35
- 13:10 |
On
interpolation problem in paraconsistent
extensions of minimal logic by Larisa
Maksimova |
|
| |
13:10
- 14:00 |
Lunch
break |
|
|
|
|
|
|
|
|
Logic,
Model Theory and Definability |
Afternoon
|
|
| |
14:00
- 15:15 |
Groups
in Nonstandard Complex Manifolds by
Thomas Scanlon (Mathematics Department,
University of California at Berkeley, USA) |
|
| |
15:15
- 15:30 |
Coffee/tea
break |
|
| |
15:30
- 16:05 |
Conditional
Doxastic Models: a qualitative approach
to dynamic belief revision by Alexandru
Baltag and Sonja Smets |
|
| |
16:05
- 16:40 |
Additive
Consolidation with Maximal Change by
Yoshitaka Suzuki. |
|
|
|
|
|
|
©2006 Stanford
University
|