| |
| 1990 | ||
|---|---|---|
| 7 | Bernard R. Hodgson, Clement F. Kent: A Survey of Ordinal Interpretations of Type epsilon0for Termination of Rewriting Systems. CTRS 1990: 137-142 | |
| 1989 | ||
| 6 | Clement F. Kent, Bernard R. Hodgson: Extensions of Arithmetic For Proving Termination of Computations. J. Symb. Log. 54(3): 779-794 (1989) | |
| 1986 | ||
| 5 | Bernard R. Hodgson, Clement F. Kent: Uniform Normal Form for General Time-Bounded Complexity Classes. J. Comput. Syst. Sci. 32(3): 363-369 (1986) | |
| 1983 | ||
| 4 | Bernard R. Hodgson, Clement F. Kent: A Normal Form for Arithmetical Representation of NP-Sets. J. Comput. Syst. Sci. 27(3): 378-388 (1983) | |
| 1982 | ||
| 3 | Bernard R. Hodgson: On Direct Products of Automaton Decidable Theories. Theor. Comput. Sci. 19: 331-335 (1982) | |
| 2 | Clement F. Kent, Bernard R. Hodgson: An Arithmetical Characterization of NP. Theor. Comput. Sci. 21: 255-267 (1982) | |
| 1981 | ||
| 1 | William S. Hatcher, Bernard R. Hodgson: Complexity Bounds on Proofs. J. Symb. Log. 46(2): 255-258 (1981) | |
| 1 | William S. Hatcher | [1] |
| 2 | Clement F. Kent | [2] [4] [5] [6] [7] |