Proof and Computation

LONDON MATHEMATICAL SOCIETY

PROOF AND COMPUTATION.
12th - 13th February 1999.
Fairbairn House, University of Leeds.

RESEARCH WORKSHOP ON PROOF THEORY
11th - 13th February 1999.
Fairbairn House, University of Leeds.


PROGRAMME

Thursday 11 (Afternoon) Workshop on Proof Theory
15.00 Tea
15.30
H. Simmons (Manchester): "Algebraic properties of rates of growth"
16.30

A. Weiermann (Münster): "Recent results on slow versus fast growing"

Friday 12: (Morning) Workshop on Proof Theory
09.00 E. Palmgren (Uppsala): "Predicative toposes as models of CZF" (joint work with Ieke Moerdijk)
10.00 A. Setzer (Uppsala): "A well-ordering proof for $\alpha$-Ordinal Systems using $\Pi^1_2$-logic" (joint work with Herman Jervell)
11.00 Coffee
11.30 T. Carlson (Columbus, OH): "Patterns of Resemblance"

Friday 12: (Afternoon) Meeting on Proof and Computation
14.00 Opening Proof and Computation Meeting
14.10 G. Plotkin (Edinburgh): "Abstract syntax and variable-binding"
15.20 M. Hyland (Cambridge): "Herbrand's theorem"
16.30 Tea
17.00 W. Pohlers (Münster): "How does proof theory help us to understand the mathematical universe?"
19.00

Dinner

Saturday 13: (Morning) Meeting on Proof and Computation
09.00 H. Schwichtenberg (Munich): "Programming with proofs"
10.00 Coffee
10.30 P. Martin-Löf (Stockholm): "The semantic significance of computing"
11.40 P. Aczel (Manchester): "The logic of Lego"
12.45 Lunch
13.30 D. Normann (Oslo): "Computable objects in typed structures"
14.30

Tea - End Proof and Computation Meeting

Saturday 13: (Afternoon) Workshop on Proof Theory
15.30 A. Cantini (Florence): "Feasible operations and applicative theories based on $\lambda \eta$"
16.30 T. Strahm (Bern): "Bar induction and \omega model reflection" (joint work with G.Jaeger)
17.30

Possibly one more talk.


Back


[Mathematical Logic] [Pure Maths] [ Mathematics] [London Mathematical Society]

This page is maintained by: M. Laura Crosilla
Last changed 1-2-99.