M. Beeson, Some theories conservative over intuitionistic arithmetic; G. Bellin, Ramsey interpreted: A parametric version of Ramsey's theorem; D. K. Brown, Notions of closed subsets of a complete separable metric space in weak subsystems of second order arithmetic; W. Buchholz and W. Sieg, A note on polynomial time computable arithmetic; S. R.

Buss, Axiomatizations and conservation results for fragments of bounded arithmetic; P. G. Clote, A smash-based hierarchy between PTIME and PSPACE; S. Feferman, Polymorphic typed lambda-calculi in a type-free axiomatic framework; F. Ferreira, Polynomial time computable arithmetic; C. Goad, Metaprogramming in SIL; K. Hatzikiriakou and S. G.

Simpson, $WKL_0$ and orderings of countable Abelian groups; J. L. Hirst, Marriage theorems and reverse mathematics; D. Leivant, Computationally based set existence principles; K. McAloon, Hierarchy results for MIXED-TIME; A. Nerode and J. B. Remmel, Polynomial time equivalence types; F.

Pfenning, Program development through proof transformation; R. Statman, Some models of Scott's theory $LCF$ based on a notion of rate of convergence; G. Takeuti, Sharply bounded arithmetic and the function $a\dot-1$; X. Yu, Radon-Nikodym Theorem is equivalent to arithmetical comprehension.