Complexity Bounds on Proofs. - William S. Hatcher; Bernard R. Hodgson (J. Symb. Log., 1981)

On Direct Products of Automaton Decidable Theories. - Bernard R. Hodgson (Theor. Comput. Sci., 1982)

An Arithmetical Characterization of NP. - Clement F. Kent; Bernard R. Hodgson (Theor. Comput. Sci., 1982)

A Normal Form for Arithmetical Representation of NP-Sets. - Bernard R. Hodgson; Clement F. Kent (J. Comput. Syst. Sci., 1983)

Uniform Normal Form for General Time-Bounded Complexity Classes. - Bernard R. Hodgson; Clement F. Kent (J. Comput. Syst. Sci., 1986)

Extensions of Arithmetic For Proving Termination of Computations. - Clement F. Kent; Bernard R. Hodgson (J. Symb. Log., 1989)

A Survey of Ordinal Interpretations of Type epsilon0for Termination of Rewriting Systems. - Bernard R. Hodgson; Clement F. Kent (CTRS, 1990)