1. and , Provable computable functions and the fast growing hierarchy. In: Contemporary Mathematics 65 (1987), American Mathematical Society, pp. 179–198.
2. An independence result for (II11-CA)+BI
3. A short proof of two recently discovered independence results using recursion theoretic methods
4. Bounds for derivation lengths from termination proofs. Technical report CSD-TR-622 (unpublished), Department of Computer Science, Surrey, London, England, 1990.
5. Termination orderings and complexity characterizations. In: Proof Theory ( et al., eds.), Cambridge University Press 1992, pp. 171–193.