Eine Unableitbarkeitsbeweismethode für den Intuitionistischen Aussagenkalkül. - Georg Kreisel; Hilary Putnam (Arch. Math. Log., 1957)

Decidability and Essential Undecidability. - Hilary Putnam (J. Symb. Log., 1957)

Reductions of Hilbert's Tenth Problem. - Martin Davis; Hilary Putnam (J. Symb. Log., 1958)

A Computing Procedure for Quantification Theory. - Martin Davis; Hilary Putnam (J. ACM, 1960)

An Unsolvable Problem in Number Theory. - Hilary Putnam (J. Symb. Log., 1960)

A note on constructible sets of integers. - Hilary Putnam (Notre Dame J. Formal Log., 1963)

On the Notational Independence of Various Hierarchies of Degrees of Unsolvability. - Gustav Hensel; Hilary Putnam (J. Symb. Log., 1965)

Trial and Error Predicates and the Solution to a Problem of Mostowski. - Hilary Putnam (J. Symb. Log., 1965)

The Craig interpolation lemma. - Burton Dreben; Hilary Putnam (Notre Dame J. Formal Log., 1967)

Degrees of Unsolvability of Constructible Sets of Integers. - George Boolos; Hilary Putnam (J. Symb. Log., 1968)

A Note on the Hyperarithmetical Hierarchy. - Herbert B. Enderton; Hilary Putnam (J. Symb. Log., 1970)

Systems of Notations and the Ramified Analytical Hierarchy. - Joan D. Lukas; Hilary Putnam (J. Symb. Log., 1974)

Meeting of the Association for Symbolic Logic Washington, D.C., 1975. - James C. Owings; Hilary Putnam; Gerald E. Sacks (J. Symb. Log., 1976)

Models and Reality. - Hilary Putnam (J. Symb. Log., 1980)

Comment on J. A. Fodor's "Cognitive science and the twin-Earth problem". - Hilary Putnam (Notre Dame J. Formal Log., 1982)

Nonstandard Models and Kripke's Proof of the Gödel Theorem. - Hilary Putnam (Notre Dame J. Formal Log., 2000)

After Gödel. - Hilary Putnam (Log. J. IGPL, 2006)

On Davis's "Pragmatic Platonism". - Hilary Putnam (Martin Davis on Computability, Computational Logic, and Mathematical Foundations, 2016)