
Search the dblp DataBase
Bernard R. Hodgson:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Bernard R. Hodgson, Clement F. Kent
A Survey of Ordinal Interpretations of Type epsilon_{0}for Termination of Rewriting Systems. [Citation Graph (0, 0)][DBLP] CTRS, 1990, pp:137142 [Conf]
 Bernard R. Hodgson, Clement F. Kent
A Normal Form for Arithmetical Representation of NPSets. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1983, v:27, n:3, pp:378388 [Journal]
 Bernard R. Hodgson, Clement F. Kent
Uniform Normal Form for General TimeBounded Complexity Classes. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1986, v:32, n:3, pp:363369 [Journal]
 William S. Hatcher, Bernard R. Hodgson
Complexity Bounds on Proofs. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1981, v:46, n:2, pp:255258 [Journal]
 Clement F. Kent, Bernard R. Hodgson
Extensions of Arithmetic For Proving Termination of Computations. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1989, v:54, n:3, pp:779794 [Journal]
 Bernard R. Hodgson
On Direct Products of Automaton Decidable Theories. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1982, v:19, n:, pp:331335 [Journal]
 Clement F. Kent, Bernard R. Hodgson
An Arithmetical Characterization of NP. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1982, v:21, n:, pp:255267 [Journal]
Search in 0.003secs, Finished in 0.003secs
