Abstract

D O N A L D D AV I D S O N’S “ Meaning and Truth,” re vo l u t i o n i zed our conception of how truth and meaning are related (Davidson    ). In that famous art i c l e , Davidson put forw a rd the bold conjecture that meanings are satisfaction conditions, and that a Tarskian theory of truth for a language is a theory of meaning for that language. In “Meaning and Truth,” Davidson proposed only that a Tarskian truth theory is a theory of meaning. But in “Theories of Me a n i n g and Learnable Languages,” he argued that the finite base of a Tarskian theory, together with the now familiar combinatorics, would explain how a language with unbounded expre s s i ve capacity could be learned with finite means ( Davidson    ). This certainly seems to imply that learning a language is, in p a rt at least, learning a Tarskian truth theory for it, or, at least, learning what is specified by such a theory. Davisdon was cagey about committing to the view that meanings actually a re satisfaction conditions, but subsequent followers had no such scru p l e s . We can sum this up in a trio of claims: Davidson’s Conjecture () A theory of meaning for L is a truth-conditional semantics for L. () To know the meaning of an expression in L is to know a satisfaction condition for that expression. () Meanings are satisfaction conditions. For the most part, it will not matter in what follows which of these claims is at stake. I will simply take the three to be different ways of formulating what I will call Davidson’s Conjecture (or sometimes just The Conjecture). Davidson’s Conjecture was a very bold conjecture. I think we are now in a..