Theorem Proving with Lemmas. - Gerald E. Peterson (J. ACM, 1976)

Complete Sets of Reductions for Some Equational Theories. - Gerald E. Peterson; Mark E. Stickel (J. ACM, 1981)

Using generalized programs in the teaching of computer science. - Gerald E. Peterson (SIGCSE, 1983)

A Technique for Establishing Completeness Results in Theorem Proving with Equality. - Gerald E. Peterson (SIAM J. Comput., 1983)

Automated Circuit Diagnosis Using First Order Logic Tools. - Barbara A. Smith; Ralph W. Wilkerson; Gerald E. Peterson (IEA/AIE (Vol. 1), 1988)

Complete Sets of Reductions Modulo Associativity, Commutativity and Identity. - Timothy B. Baird; Gerald E. Peterson; Ralph W. Wilkerson (RTA, 1989)

Solving Term Inequalities. - Gerald E. Peterson (AAAI, 1990)

Complete Sets of Reductions with Constraints. - Gerald E. Peterson (CADE, 1990)

Using Forcing to Prove Completeness of Resolution and Paramodulation. - John Pais; Gerald E. Peterson (J. Symb. Comput., 1991)

Constrained term-rewriting induction with applications. - Gerald E. Peterson (Methods Log. Comput. Sci., 1994)

Using Taguchi's method of experimental design to control errors in layered perceptrons. - Gerald E. Peterson; Daniel C. St. Clair; Stephen R. Aylward; William E. Bond (IEEE Trans. Neural Networks, 1995)