default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHilary Putnam
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[p1]Hilary Putnam:
On Davis's "Pragmatic Platonism". Martin Davis on Computability, Computational Logic, and Mathematical Foundations 2016: 337-347
2000 – 2009
- 2006
- [j17]Hilary Putnam:
After Gödel. Log. J. IGPL 14(5): 745-754 (2006) - 2000
- [j16]Hilary Putnam:
Nonstandard Models and Kripke's Proof of the Gödel Theorem. Notre Dame J. Formal Log. 41(1): 53-58 (2000)
1980 – 1989
- 1982
- [j15]Hilary Putnam:
Comment on J. A. Fodor's "Cognitive science and the twin-Earth problem". Notre Dame J. Formal Log. 23(3): 294-295 (1982) - 1980
- [j14]Hilary Putnam:
Models and Reality. J. Symb. Log. 45(3): 464-482 (1980)
1970 – 1979
- 1976
- [j13]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
- [j12]Joan D. Lukas, Hilary Putnam:
Systems of Notations and the Ramified Analytical Hierarchy. J. Symb. Log. 39(2): 243-253 (1974) - 1970
- [j11]Herbert B. Enderton, Hilary Putnam:
A Note on the Hyperarithmetical Hierarchy. J. Symb. Log. 35(3): 429-430 (1970)
1960 – 1969
- 1968
- [j10]George Boolos, Hilary Putnam:
Degrees of Unsolvability of Constructible Sets of Integers. J. Symb. Log. 33(4): 497-513 (1968) - 1967
- [j9]Burton Dreben, Hilary Putnam:
The Craig interpolation lemma. Notre Dame J. Formal Log. 8(3): 229-233 (1967) - 1965
- [j8]Hilary Putnam:
Trial and Error Predicates and the Solution to a Problem of Mostowski. J. Symb. Log. 30(1): 49-57 (1965) - [j7]Gustav Hensel, Hilary Putnam:
On the Notational Independence of Various Hierarchies of Degrees of Unsolvability. J. Symb. Log. 30(1): 69-86 (1965) - 1963
- [j6]Hilary Putnam:
A note on constructible sets of integers. Notre Dame J. Formal Log. 4(4): 270-273 (1963) - 1960
- [j5]Martin Davis, Hilary Putnam:
A Computing Procedure for Quantification Theory. J. ACM 7(3): 201-215 (1960) - [j4]Hilary Putnam:
An Unsolvable Problem in Number Theory. J. Symb. Log. 25(3): 220-232 (1960)
1950 – 1959
- 1958
- [j3]Martin Davis, Hilary Putnam:
Reductions of Hilbert's Tenth Problem. J. Symb. Log. 23(2): 183-187 (1958) - 1957
- [j2]Georg Kreisel, Hilary Putnam:
Eine Unableitbarkeitsbeweismethode für den Intuitionistischen Aussagenkalkül. Arch. Math. Log. 3(3-4): 74-78 (1957) - [j1]Hilary Putnam:
Decidability and Essential Undecidability. J. Symb. Log. 22(1): 39-54 (1957)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
