A term rewriting characterization of the polytime functions and related complexity classes Arnold BeckmannAndreas Weiermann Pages: 11 - 30
Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals Ulrich Kohlenbach Pages: 31 - 71
On two questions concerning the automorphism groups of countable recursively saturated models of PA Roman KossakNicholas Bamber Pages: 73 - 79
