A Note on Finite Axiomatization of Partial Propositional Calculi. - Wilson E. Singletary (J. Symb. Log., 1967)

Degrees of Unsolvability in Formal Grammars. - Dennis F. Cudia; Wilson E. Singletary (J. ACM, 1968)

The Post Correspondence Problem. - Dennis F. Cudia; Wilson E. Singletary (J. Symb. Log., 1968)

Results regarding the axiomatization of partial propositional calculi. - Wilson E. Singletary (Notre Dame J. Formal Log., 1968)

Tutor - A Turing machine simulator. - John C. Pierce; Wilson E. Singletary; J. E. Vander Mey (Inf. Sci., 1973)

Combinatorial systems with axiom. - Charles E. Hughes; Wilson E. Singletary (Notre Dame J. Formal Log., 1973)

Many-one degrees associated with partial propositional calculi. - Wilson E. Singletary (Notre Dame J. Formal Log., 1974)

Combinatorial systems defined over one- and two-letter alphabets. - Charles E. Hughes; Wilson E. Singletary (Arch. Math. Log., 1975)

The one-one equivalence of some general combinatorial decision problems. - Charles E. Hughes; Wilson E. Singletary (Notre Dame J. Formal Log., 1977)