| 2006 |
|---|
| 13 | EE | Hilary Putnam:
After Gödel.
Logic Journal of the IGPL 14(5): 745-754 (2006) |
| 2000 |
|---|
| 12 | | Hilary Putnam:
Nonstandard Models and Kripke's Proof of the Gödel Theorem.
Notre Dame Journal of Formal Logic 41(1): 53-58 (2000) |
| 1980 |
|---|
| 11 | | Hilary Putnam:
Models and Reality.
J. Symb. Log. 45(3): 464-482 (1980) |
| 1976 |
|---|
| 10 | | James C. Owings,
Hilary Putnam,
Gerald E. Sacks:
Meeting of the Association for Symbolic Logic Washington, D.C., 1975.
J. Symb. Log. 41(1): 279-288 (1976) |
| 1974 |
|---|
| 9 | | Joan D. Lukas,
Hilary Putnam:
Systems of Notations and the Ramified Analytical Hierarchy.
J. Symb. Log. 39(2): 243-253 (1974) |
| 1970 |
|---|
| 8 | | Herbert B. Enderton,
Hilary Putnam:
A Note on the Hyperarithmetical Hierarchy.
J. Symb. Log. 35(3): 429-430 (1970) |
| 1968 |
|---|
| 7 | | George Boolos,
Hilary Putnam:
Degrees of Unsolvability of Constructible Sets of Integers.
J. Symb. Log. 33(4): 497-513 (1968) |
| 1965 |
|---|
| 6 | | Hilary Putnam:
Trial and Error Predicates and the Solution to a Problem of Mostowski.
J. Symb. Log. 30(1): 49-57 (1965) |
| 5 | | Gustav Hensel,
Hilary Putnam:
On the Notational Independence of Various Hierarchies of Degrees of Unsolvability.
J. Symb. Log. 30(1): 69-86 (1965) |
| 1960 |
|---|
| 4 | EE | Martin Davis,
Hilary Putnam:
A Computing Procedure for Quantification Theory.
J. ACM 7(3): 201-215 (1960) |
| 3 | | Hilary Putnam:
An Unsolvable Problem in Number Theory.
J. Symb. Log. 25(3): 220-232 (1960) |
| 1958 |
|---|
| 2 | | Martin Davis,
Hilary Putnam:
Reductions of Hilbert's Tenth Problem.
J. Symb. Log. 23(2): 183-187 (1958) |
| 1957 |
|---|
| 1 | | Hilary Putnam:
Decidability and Essential Undecidability.
J. Symb. Log. 22(1): 39-54 (1957) |
