1. Characterizing the elementary recursive functions by a fragment of Gödel's T

   • Arnold Beckmann
   • Andreas Weiermann

   Pages: 475 - 491

2. Fixed point theories and dependent choice

   • Gerhard Jäger
   • Thomas Strahm

   Pages: 493 - 508

3. Elementary extensions of models of set theory

   • James H. Schmerl

   Pages: 509 - 514

4. The $\mu$-measure as a tool for classifying computational complexity

   • Karl-Heinz Niggl

   Pages: 515 - 539

5. The size of $\tilde{T}$

   • Paul Larson

   Pages: 541 - 568