Workshop on Proof Theory and Rewriting

5 – 9 September, 2006, Obergurgl

The workshop takes place in the Obergurgl University Centre: http://www2.uibk.ac.at/obergurgl/ (click “Brochure english”)

The workshop aims at bringing together researchers in proof theory and rewriting to facilitate the exchange of ideas between these tightly connected fields. The workshop is an informal one and has the following format:

• presentations in English about recent work or work in progress
• no proceedings
• lots of time for discussions and social activities

Program

Wednesday, September 6

• Helmut Schwichtenberg (LMU Muenchen)
  • Proofs with feasible computational content
• Matthias Baaz (Technische Universitaet Wien, Austria)
  • Proof Theory of Skolem Functions
• Lars Kristiansen (University of Oslo, Norway)
  • Fragments of Goedel’s T, Complexity Classes and Rewriting Systems
• Mathias Barra (University of Oslo, Norway)
  • On some small sub-recursive classes

Thursday, September 7

• Wilfried Buchholz (LMU Muenchen, Germany)
  • Proof-theoretic analysis of termination proofs
• Johannes Waldmann (HTWK Leipzig, Germany)
  • Automatic Certification of Polynomial Derivation Lengths in String Rewriting
• Dieter Hofbauer (Germany)
  • Complexity bounds from relative termination proofs
• Joost Joosten (University of Utrecht, Netherlands)
  • Semantics for Sub-Intuitionistic Logics

Friday, September 8

• Georg Moser (University of Innsbruck, Austria)
  • The Hydra Battle revisited
• Lev Beklemishev (Russian Academy of Sciences in Moscow, Russia)
  • Representing worms as a term rewrite system
• Aart Middeldorp (University of Innsbruck, Austria)
  • KBO as a Satisfiability Problem
• Vincent van Oostrom (University of Utrecht, Netherlands)
  • Constructive confluence

Saturday, September 9

• Clemens Grabmayer (VU Amsterdam, Netherlands)
  • Regular Expressions Under the Process Interpretation
• Stefan Blom (University of Innsbruck, Austria)
  • Proof Systems for First and Second Order Term Graphs