Bernard R. Hodgson

According to our database, Bernard R. Hodgson authored at least 7 papers between 1981 and 1990.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of four.

1990

A Survey of Ordinal Interpretations of Type epsilon₀for Termination of Rewriting Systems.

Bernard R. Hodgson, Clement F. Kent

Proceedings of the Conditional and Typed Rewriting Systems, 1990

1989

Extensions of Arithmetic For Proving Termination of Computations.

Clement F. Kent, Bernard R. Hodgson

J. Symb. Log., 1989

1986

Uniform Normal Form for General Time-Bounded Complexity Classes.

Bernard R. Hodgson, Clement F. Kent

J. Comput. Syst. Sci., 1986

1983

A Normal Form for Arithmetical Representation of NP-Sets.

Bernard R. Hodgson, Clement F. Kent

J. Comput. Syst. Sci., 1983

1982

An Arithmetical Characterization of NP.

Clement F. Kent, Bernard R. Hodgson

Theor. Comput. Sci., 1982

On Direct Products of Automaton Decidable Theories.

Bernard R. Hodgson

Theor. Comput. Sci., 1982

1981

Complexity Bounds on Proofs.

William S. Hatcher, Bernard R. Hodgson

J. Symb. Log., 1981