Preface |
Open Problems / 1: |
Note on the Existence of Most General Semi-unifiers / Matthias Baaz2: |
Kreisel's Conjecture for L31 (including a postscript by George Kreisel) / Pavel Pudlak3: |
Number of Symbols in Frege Proofs with and without the Deduction Rule / Maria Luisa Bonet4: |
Algorithm for Boolean Formula Evolution and for Tree Contraction / Samuel R. Buss5: |
Provably Total Functions in Bounded Arithmetic Theories Ri3, Ui2 and Vi2 / Jan Kraj"icek ; Gaisi Takeuti6: |
On Polynomial Size Frege Proofs of Certain Combinatorial Principles / Peter Clote7: |
Interpretability and Fragments of Arithmetic / Petr Hajek8: |
Abbreviating Proofs Using Metamathematical Rules / Franco Montagna9: |
Open Induction, Tennenbaum Phenomena, and Complexity Theory / Richard Kaye10: |
Using Herbrand-type Theorems to Separate Strong Fragments of Arithmetic / 11: |
An Equivalence between Second Order Bounded Domain Bounded Arithmetic and First Order Bounded Arithmetic / Alexander A. Razborov12: |
Integer Parts of Real Closed Exponential Fields (extended abstract) / Jean-Pierre Ressayre13: |
Making Infinite Structures Finite in Models of Second Order Bounded Arithmetic / Soren Riis14: |
Ordinal Arithmetic in I / Richard Sommer15: |
RSUV Isomorphism / 16: |
Feasible Interpretability / Rineke Verbrugge17: |
Preface |
Open Problems / 1: |
Note on the Existence of Most General Semi-unifiers / Matthias Baaz2: |