Proof Theory in Computer Science: International Seminar, Ptcs 2001, Dagstuhl Castle, Germany, October 7-12, 2001, Proceedings

by Ptcs 200 (2001 Dahgstuhl Castle); Schroeder-Heister, Peter Joseph; Stark, Robert F.

• ISBN13: 9783540427520
• ISBN10: 354042752X
• Format: Paperback
• Copyright: 2001-11-01
• Publisher: Springer Verlag

Summary

The volume contains the proceedings of the 6th Workshop on Model-Oriented Design and Analysis, within a series of workshops that initially had the purpose of bringing together leading scientists from Eastern and Western Europe for the exchange of ideas in theoretical and applied statistics, with special emphasis on experimental design. The participants of these workshops have developed into a community with a range of common interests that are centred around the theory and applications of optimum design of experiments. In addition to this, the volume contains a series of special papers on topics from medical and pharmaceutical statistics.

Table of Contents

Linear Ramified Higher Type Recursion and Parallel Complexity	p. 2
Reflective ¿-Calculus	p. 22
A Note on the Proof-Theoretic Strength of a Single Application of the Schema of Identity	p. 38
Comparing the Complexity of Cut-Elimination Methods	p. 49
Program Extraction from Gentzen's Proof of Transfinite Induction up to ε0	p. 68
Coherent Bicartesian and Sesquicartesian Categories	p. 78
Indexed Induction-Recursion	p. 93
Modeling Meta-logical Features in a Calculus with Frozen Variables	p. 114
Proof Theory and Post-turing Analysis	p. 130
Interpolation for Natural Deduction with Generalized Eliminations	p. 153
Implicit Characterizations of Pspace	p. 170
Iterate Logic	p. 191
Constructive Foundations for Featherweight Java	p. 202
Author Index	p. 239
Table of Contents provided by Publisher. All Rights Reserved.