Warren D. Goldfarb
Affiliations: | 1975- | Philosophy | Harvard University, Cambridge, MA, United States |
Area:
mathematical logic, development of analytic philosophy, philosophical logic, and metaphysicsWebsite:
http://philosophy.fas.harvard.edu/people/warren-goldfarbGoogle:
"Warren David Goldfarb"Parents
Sign in to add mentorBurton S. Dreben | grad student | 1975 | Harvard | |
(On decision problems for quantification theory) |
Children
Sign in to add traineeMichael Rescorla | grad student | Harvard | |
Miriam Solomon | grad student | 1986 | Harvard |
David Macarthur | grad student | 1991-1999 | GSAS |
Adam Joaquim Leite | grad student | 2000 | Harvard |
Jinho Kang | grad student | 2005 | Harvard |
James R. Shaw | grad student | 2009 | Harvard |
Jon Litland | grad student | 2012 | Harvard |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Ebbs G, Goldfarb W. (2018) First‐Order Logical Validity And The Hilbert‐Bernays Theorem Philosophical Issues. 28: 159-175 |
Goldfarb WD. (2005) On Godel's Way In: The Influence of Rudolf Carnap The Bulletin of Symbolic Logic. 11: 185-193 |
Goldfarb WD. (2001) First-order frege theory is undecidable Journal of Philosophical Logic. 30: 613-616 |
Goldfarb WD. (1993) Random Models and Solvable Skolem Classes Journal of Symbolic Logic. 58: 908-914 |
Goldfarb WD. (1989) Random Models and the Maslov Class Journal of Symbolic Logic. 54: 460-466 |
Goldfarb W. (1985) Kripke on Wittgenstein on Rules The Journal of Philosophy. 82: 471-488 |
Goldfarb WD, Gurevich Y, Shelah S. (1984) A Decidable Subclass of the Minimal Godel Class with Identity Journal of Symbolic Logic. 49: 1253-1261 |
Goldfarb WD. (1984) The Unsolvability of the Gödel Class with Identity Journal of Symbolic Logic. 49: 1237-1252 |
Goldfarb WD. (1981) On the Godel Class with Identity Journal of Symbolic Logic. 46: 354-364 |
Goldfarb WD. (1981) The undecidability of the second-order unification problem Theoretical Computer Science. 13: 225-230 |