Preliminary Timetable

TimeMonday Tuesday Wednesday Thursday Friday
0900 Frank Wagner: Théorie des Modèles et la Propriété d'Indépendance Michael Rathjen: Proof Theory and Constructive Set Theory C.-H. Luke Ong: Game Semantics Michael Rathjen: Proof Theory and Constructive Set Theory
0915
0930
0945
1000 Dana Scott: Sets, Topologies, Categories, and Computability Frank Wagner: Théorie des Modèles et la Propriété d'Indépendance Michael Rathjen: Proof Theory and Constructive Set Theory Dana Scott: Sets, Topologies, Categories, and Computability
1015
1030
1045
1100 Participants are asked to arrive by the end of lunch on Monday
Coffee break
Coffee break
Coffee break
1115
Hiking

We will do some easy hiking in the nearby mountains. The tour will be planed easy enough for every one to participate. This is meant to be more a social than a sportive event.

1130 C.-H. Luke Ong: Game Semantics Frank Wagner: Théorie des Modèles et la Propriété d'Indépendance C.-H. Luke Ong: Game Semantics
1145
1200
1215
1230
Lunch
Lunch
Lunch
Lunch
1245
1300
1315
1330 free time to unpack and get to know the area
informal discussions
informal discussions
Participants can leave after the last lecture. However, lunch is provided for those who wish.
1345
1400
1415
Opening
1430 Dana Scott: Sets, Topologies, Categories, and Computability
1445
1500
1515
1530 Michael Rathjen: Proof Theory and Constructive Set Theory Andrej Bauer: Synthetic Computability Dana Scott: Sets, Topologies, Categories, and Computability
1545
1600
1615
1630
Coffee break
Coffee break
Coffee break
1645
1700 Frank Wagner: Théorie des Modèles et la Propriété d'Indépendance Diana Ratiu: From Classical Proofs to Programs Pietro Dello Stritto: Measurable theories of groups and geometries
1715
1730 Elliott Spoors: Elementary Arithmetic Sonia L'Innocente: Rings of definable scalars of Verma
1745
1800 C.-H. Luke Ong: Game Semantics Stan Wainer: The Paris-Harrington Independence Result via Fast Growing Functions Andrej Bauer: Synthetic Computability
1815
1830
1845
1900
Dinner
Dinner
Dinner
Conference Dinner
1915
1930
1945
2000
2015
2030 Luca Chiarabini: Generation of an Efficient Algorithm for the ``Generalized Maximal Scoring Subsequence'' (GMSS) Problem
2045
2100
Welcome Party

We plan some social event at the first evening of the workshop. The details are yet to be determined.

Mircea Dan Hernest: Light Functional Interpretation
Farewell Party
2115
2130 Basil Karadais: Elaborating on Ishihara's ``WKL implies FAN'' proof
2145