Proof theory in computer science. International seminar, PTCS 2001, Dagstuhl Castle, Germany, October 7--12, 2001. Proceedings (Q5951861)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Aehlig, Klaus; Johannsen, Jan; Schwichtenberg, Helmut; Terwijn, Sebastiaan A.}, Linear ramified higher type recursion and parallel complexity, 1-21 [Zbl 1024.68041] \textit{Alt, Jesse; Artemov, Sergei}, Reflective \(\lambda\)-calculus, 22-37 [Zbl 1024.03015] \textit{Baaz, Matthias; Fermüller, Christian G.}, A note on the proof-theoretic strength of a single application of the schema of identity, 38-48 [Zbl 1024.03060] \textit{Baaz, Matthias; Leitsch, Alexander}, Comparing the complexity of cut-elimination methods, 49-67 [Zbl 1024.03058] \textit{Berger, Ulrich}, Program extraction from Gentzen's proof of transfinite induction up to \(\epsilon_0\), 68-77 [Zbl 1024.03059] \textit{Došen, Kosta; Petrić, Zoran}, Coherent bicartesian and sesquicartesian categories, 78-92 [Zbl 1024.03066] \textit{Dybjer, Peter; Setzer, Anton}, Indexed induction-recursion, 93-113 [Zbl 1024.03062] \textit{Elbl, Birgit}, Modeling meta-logical features in a calculus with frozen variables, 114-129 [Zbl 1024.68013] \textit{Gordeew, Lew}, Proof theory and Post-Turing analysis, 130-152 [Zbl 1024.03038] \textit{Matthes, Ralph}, Interpolation for natural deduction with generalized eliminations, 153-169 [Zbl 1024.03016] \textit{Oitavem, Isabel}, Implicit characterizations of Pspace, 170-190 [Zbl 1024.68042] \textit{Schmitt, Peter H.}, Iterate logic, 191-201 [Zbl 1024.03028] \textit{Studer, Thomas}, Constructive foundations for Featherweight Java, 202-238 [Zbl 1024.68014]