Arithmetic, proof theory, and computational complexity

Preface 1. Open Problems 2. Note on the Existence of Most General Semi-unifiers 3. Kreisel's Conjecture for L31 (including a postscript by George Kreisel) 4. Number of Symbols in Frege Proofs with and without the Deduction Rule 5. Algorithm for Boolean Formula Evolution and for Tree Contraction 6. Provably Total Functions in Bounded Arithmetic Theories Ri3, Ui2 and Vi2 7. On Polynomial Size Frege Proofs of Certain Combinatorial Principles 8. Interpretability and Fragments of arithmetic 9. Abbreviating Proofs Using Metamathematical Rules 10. Open Induction, Tennenbaum Phenomena, and Complexity Theory 11. Using Herbrand-type Theorems to Separate Strong Fragments of Arithmetic 12. An Equivalence between Second Order Bounded Domain Bounded Arithmetic and First Order Bounded Arithmetic 13. Integer Parts of Real Closed Exponential Fields (extended abstract) 14. Making Infinite Structures Finite in Models of Second Order Bounded Arithmetic 15. Ordinal Arithmetic in I 16. RSUV Isomorphism 17. Feasible Interpretability