Skip to main content
Log in

Fostering Liars

  • Published:
Topoi Aims and scope Submit manuscript

Abstract

Davidson conjectured that suitably formulated Tarski-style theories of truth can “do duty” as theories of meaning for the spoken languages that humans naturally acquire. But this conjecture faces a pair of old objections that are, in my view, fatal when combined. Foster noted that given any theory of the sort Davidson envisioned, for a language L, there will be many equally true theories whose theorems pair endlessly many sentences of L with very different specifications of whether or not those sentences are true. And if L includes words ‘true’, then for reasons stressed by Tarski, it’s hard to see how any truth theory for L could be correct. Moreover, each of these concerns amplifies the other. Appealing to possible worlds will not help with Foster’s Problem, for reasons that Chomsky discussed in the 1950s, and appealing to trivalent models of truth will not avoid concerns illustrated with Liar Sentences.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Notes

  1. This is the written version of an intentionally polemical talk presented at the Topoi conference in Torino. My thanks to the participants, and especially the organizers, for helpful comments and patience. I am also grateful to the anonymous referees, who provided valuable constructive remarks on the penultimate draft. Chapter four of Pietroski (2018) sets these issues in a somewhat different context, with still inadequate discussion of Lepore and Ludwig (2007). A fuller discussion would need to engage with Glanzberg (2004, 2015), along with other relevant literature on truth and the possibility of psychologized truth theories.

  2. Drawing on many authors, Pietroski (2018) also stresses (i) the sundry ways that truth can depend on context, (ii) some implausible implications of combining empirically justified event analyses, inspired by Davidson (1967b), with truth-theoretic conceptions of meaning, and (iii) the relative ease of recasting, in internalist terms, many proposals framed in truth-theoretic terms.

  3. The word ‘claim’ is polysemous, along with ‘assertion’, ‘thought’, etc. And even if we allow for the logical possibility of contradictory propositions—see Priest (1979, 2006)—this doesn’t warrant the radical hypothesis that (1) is true and not true, relative to the imagined context, as opposed to simply not true (because it fails to be truth-evaluable). If a theory of meaning implies that (1) is true given that it isn’t true, that tells against the theory. Moreover, if Davidson’s conjecture is combined with the idea that a Slang sentence can be true and not true relative to the same context, this heightens Foster’s concern. It’s hard enough to see how a theory can specify what a sentence Σ means by implying that Σ has a certain truth-theoretic property, even without adding the assumption that Σ can have this property if and only if it doesn’t.

  4. Other utterances of (3) may have been true. But if a theory predicts that the chosen utterance of (3) was true, that tells against the theory, whatever logic one adopts; see note 3.

  5. Even if the speaker is not “acquainted” with Neptune in Russell’s sense; see Evans (1982).

  6. Correlatively, being explicit about notions of derivation—as Tarski and Chomsky were—reveals difficulties for Davidsonians. I read Foster in this light. Chomsky (1957, 1977, 1995) urged a conception of meaning like Strawson’s, in an overtly mentalistic idiom, while granting that internalistic meanings can provide “truth indications,” see Pietroski (2005, 2017b, 2017c).

  7. I can’t prove that my favorite hammer doesn’t have a truth condition. But if sentences are tools that can be used to make claims, it isn’t surprising that a claim made by using a sentence Σ can be true in part because Σ has no truth condition. Suppose I put a hammer in a box after stating that if I ever put a hammer in a box, I will thereby be claiming that once the hammer is in there, three things in the box fail to be true. Then my odd claim, oddly made, is true if the box also contains a wrench and a screwdriver—or a wrench and a false sentence, or a wrench and (1). But the hammer isn’t true or false, not even if putting it in the box is a way of making a true claim.

  8. See note 3. An anonymous referee suggested that perhaps relative to some contexts, (1) has a truth condition that cannot be realized. But if we allow for unrealized truth conditions, which would presumably differ from the realized truth conditions of boringly contradictory sentences like ‘A dog barked, and no dog barked’, the question is whether a theory that specifies (perhaps unrealized) truth conditions for Slang sentences would be a plausible theory of meaning for a Slang. To answer, we would need to know under what conditions distinct sentences are unrealizedly truth-conditionally equivalent.

  9. It’s probably better to replace ‘Identical(x, Ernie)’ with something like ‘IsAnErnie(x) & c:Ernie(x)’, in which a predicate that applies to the many Ernies is contextually restricted by (uses of) an index associated with the noun; cp. Chomsky (1973). But this detail won’t matter.

  10. The more interesting cases include [S [NP a [N cat]][VP [V ate [NP a [N fish]]]]] and [S [NP sm [N cats]][VP [V ate [NP sm [N fish]]]]]; where ‘sm’ indicates the (phonologically reduced) form of ‘some’ that is like the indefinite article for nouns that are not singular count nouns. The verb phrase [VP [V ate [NP a [N fish]]]] invites axioms like (C4) and (C5).

    1. (C4)

      TrueOf([VP [V …][NP ]], x, c) ≡ ∃x'{TrueOf([V …], < x, x' > , c) & TrueOf([NP …], x', c)}

    2. (C5)

      TrueOf([NP a [N ]], x', c) ≡ TrueOf([N …], x', c)

    But plural nouns and “mass nouns” reveal familiar complexities.

  11. One can adopt a special rule for instances of ‘True([S …], c) ≡ P’ or rewrite them, perhaps as instances of ‘∀x[TrueOf([S …], x, c)] ≡ P, treating sentences as predicates true of everything or nothing. One can also adopt Lewis-Montague style theories with “function application” as the main combinatorial principle and correspondingly categorized lexical axioms that pair expressions with entities or functions that exhibit types from the now familiar Frege-Church hierarchy: basic things of type < e>, truth values of type < t>, and functions of type < X, Y > —i.e., functions from things of type < X > to things of type < Y>, where < X > and < Y > are themselves types of the hierarchy. Then axioms like those below

    • (L1') ||Ernie<e>||c) = Ernie

      (L3') ||snores<e, t>||c) ≡ λx.Snores(x)

      (C1') ||[<Y> […<X>][…<X, Y>]]||c = ||[…<X, Y>]||c(||[…<X>]||c)

      (C2') ||[<X> [<X> …]]||c = ||[<X> …]||c

    yield parallel derivations like the one below.

    1. 1.

      ||[<t> [<e> [Ernie<e>]][<e, t> [snores<e, t>]]]||c = ||[<e, t> [snores<e, t>]]||c(||[<e> [Ernie<e>]]||c) [C1']

    2. 2.

      ||[<e> [Ernie<e>]]||c = ||[Ernie<e>]||c [C2']

    3. 3.

      ||Ernie||c = Ernie [L1']

    4. 4.

      ||[<e> [Ernie<e>]]||c = Ernie [2, 3]

    5. 5.

      ||[<e, t> [snores<e, t>]]||c = ||[snores<e, t>]||c [C3]

    6. 6.

      ||[snores<e, t>]||c = λx.Snores(x) [L3]

    7. 7.

      ||[<e, t> [snores<e, t>]]||c = λx.Snores(x) [5, 6]

    8. 8.

      ||[<t> [<e> [Ernie<e>]][<e, t> [snores<e, t>]]]||c = ||[<e, t> [snores<e, t>]]||c(Ernie) [1, 4]

    9. 9.

      ||[<t> [<e> [Ernie<e>]][<e, t> [snores<e, t>]]]||c = λx.Snores(x)(Ernie) [8, 6]

    But one still needs a rule that licenses replacement of α with γ given instances of α = β and β = γ. One can also add a rule of lambda-calculation that licenses an additional step.

    10. ||[<t> [<e> [Ernie<e>]][<e, t> [snores<e, t>]]]||c = Snores(Ernie) [9, λ]

    But this rule of inference, which has nothing to do with the object language, is different in kind.

  12. See Chomsky (1964). Here, ‘#’ indicates that the string cannot be understood as having the indicated meaning. Note that ‘eager’ and ‘easy’ can be replaced with ‘reluctant’ and ‘hard’. The implausibility of (18b) is irrelevant.

  13. Theorists can profess to be unconcerned about overdetermination. But if the task is merely to provide an algorithm that pairs each pronunciation with its attested meanings, without concern about whether the algorithm also pairs pronunciations with unattested meanings, then the task is easily accomplished. Specify some class of possible interpretations that include all attested meanings, and then offer the “universal” procedure that pairs each pronunciation with each of the possible interpretations—or each of the possible interpretations that could be constructed from the relevant lexical items; cp. Chomsky (1957).

  14. A complication: deriving an instance of True([S…], c) ≡ ∃x{Φx} will involve deriving intermediate theorems in which TrueOf’, along with a description of some constituent of [S…], appear in Φ. But the intermediate theorems are not specifications of subtly different meanings. So let’s grant that such theorems—still partly metalinguistic on the right, and in this sense, not “fully discharged” specifications of truth conditions—don’t count for purposes of evaluating how many meanings the theory assigns to an expression of the object language.

  15. See note 13. Davidson (1967a) thought it wouldn’t be a problem if a theory of the sort he imagined had theorems like (14T*) in addition to (14T); cp. the discussion of Tarski in section three below. In later work, Davidson proposed additional restrictions on using truth theories as theories of meaning, sometimes in the form of stipulations about the kinds of theories and evidence that “radical interpreters” would consider; see note 18. Along with much of the literature, I don’t think these further restrictions help; see Pietroski (2005), and for extended discussion, Lepore and Ludwig (2007). So I focus here on Davidson’s idea that given the right notion of derivation, derivable T-theorems will be suitably translational.

  16. Tarski’s idea was not that (24T) is more “semantically legitimate” than (24T*). If being true is a matter of being satisfied by all sequences, then (24T) and (24T*) are truth-theoretically alike. Imagine a supplemented theory whose theorems include ‘(c = b + a) ≡ (0 = ei + 1)’ and ‘True(‘c = b + a’) ≡ Identical[3, Plus(2, 1)]’ and ‘True(‘c = b + a’) ≡ Identical[0, Plus(ei, 1)]’. Someone who saw only the third theorem, after it was derived from the first two, might think that ‘b’ has a meaning akin to that of ‘the result of raising the number whose natural logarithm is one to the power of the square root of negative one times the ratio of a circle’s circumference to its diameter’. But this would be a mistake. In my view, it’s bizarre to segregate theories of truth from theories of the entities that verify sentences that have truth conditions. But in any case, one can’t do this and then say—as Davidson (1986, p. 446) does—that “[T]here is no boundary between knowing a language and knowing our way around in the world.” If uninterpretive T-sentences can be distinguished from theorems of meaning theories, then pace Quine (1951), there is a theoretically interesting analytic/synthetic distinction.

  17. Likewise for any proposed truth+ theory for L.

  18. According to Davidson (1973, p. 134, his quote marks)

    an acceptable theory of truth must entail, for every sentence s of the object language, a sentence of the form: s is true if and only if p, where “p” is replaced by any sentence that is true if and only if s is. Given this formulation, the theory is tested by the evidence that T-sentences are simply true; we have given up the idea that we must also tell whether what replaces ‘p’ translates s.

    But even if we can get evidence that T-sentences are “simply true,” without ignoring the possibility that Slang sentences don’t have truth conditions, the proposed necessary condition doesn’t exclude Fosterized theories. So the issues about translation remain.

  19. The derivation below parallels, line by line, the earlier one for [S [NP [N Ernie]][VP [V snores]]].

    1. 1.

      True([S [NP [N Kermit]][VP isn’t [A blue]]], c) ≡ ∃x{TrueOf([NP [N Kermit]], x, c) & TrueOf([VP isn’t [A blue]], x, c)} [C1]

    2. 2.

      TrueOf([NP [N Kermit]], x, c) ≡ TrueOf([N Kermit], x, c) [C2]

    3. 3.

      TrueOf([N Kermit], x, c) ≡ Identical(x, Kermit) [L6]

    4. 4.

      TrueOf([NP [N Kermit]], x, c) ≡ Identical(x, Kermit) [2, 3]

    5. 5.

      TrueOf([VP isn’t [A blue]], x, c) ≡ ~ TrueOf([A blue], x, c) [C4]

    6. 6.

      TrueOf([A blue], x, c) ≡ Blue(x) [L7]

    7. 7.

      TrueOf([VP isn’t [A blue]], x, c) ≡ ~ Blue(x) [5, 6]

    8. 8.

      True([S [NP [N Kermit]][VP isn’t [A blue]]], c) ≡ ∃x{Identical(x, Kermit) & TrueOf([VP isn’t [A blue]], x, c)} [1, 4]

    9. 9.

      True([S [NP [N Kermit]][VP isn’t [A blue]]], c) ≡ ∃x{Identical(x, Kermit) & ~ Blue(x)} [8, 7]

  20. If we represent the three model-values for sentences with the numbers 1, ½, and 0, then given a Strong Kleene model: the values of P & Q and P v Q are, respectively, the minimum and maximum values of the conjuncts or disjuncts; ∀xΦx and ∃xΦx are treated similarly as conjunctions/disjunctions of their instances; and the value of ‘~P is 1 minus the value of ‘~P; so if ‘P has the value ½, so does ‘~P. Classical bivalent models can be viewed as special cases, with no sentences having the value ½.

  21. See Beall et al. (2018) for a helpful accessible discussion and guide to the more technical literature.

  22. If there is a truth-evaluable proposition that Linus isn’t true, maybe this proposition is klee, and the principle of excluded middle (for propositions) is false. That still leaves difficulties, including Curry’s paradox regarding conditionals and “revenge” puzzles concerning interpretations; see note 21. But these difficulties for certain proposals about truth do not justify implausible claims about Slangs.

  23. Indeed, I suspect that pronunciation is evolutionarily more recent than the core system that generates meaningful combinations of lexical items that correspond to families of concepts; see Chomsky and Berwick (2017).

  24. And even if one stipulates that (37) has the meaning of (36), this doesn’t guarantee that the Slang meaning determines the Tarskian satisfaction condition, much less that this meaning is compositionally determined by the components and syntax of (37).

  25. For purposes of a class in elementary logic, I can evaluate some regimentations of a Slang sentence as better than others. Though for these purposes, I find myself assuming that words like ‘some’ and ‘all’ have meanings that are not mere extensions, while forgetting that Tarskian squiggles like ‘∃’ and ‘∀’ are syncategorematic.

  26. Cp. Evans (1981), Peacocke (1986), Davies (1987), Higginbotham (1991).

  27. Indeed, if Slang expressions have their meanings because of how their (alleged) truth-theoretic properties are mentally specified, then it seems unlikely that the mental specifications also have meanings; though perhaps they have contents that go beyond Tarskian satisfaction conditions.

  28. Larson and Segal (1995) assume that such biconditionals are true, and that psychologized theories of meaning should help explain this.

  29. Chomsky (1957) noted that everyone in the room speaks two languages can be understood in two ways: (a) everyone in the room is bilingual; or (b) two languages are such that everyone in the room speaks them. This invites the hypothesis, developed and defended by May (1985), that the string is structurally homophonous. Given a room, there may be worlds in which (a) or (b) obtains, but not both. Though both sentence meanings can be used to make correct reports, even if as a matter of necessity, every in the relevant room speaks the same two languages.

  30. This was one reason for hoping that Slangs could be characterized in terms of a “base” component (analogous to a context-free grammar) and transformations, at least some of which preserve meaning, with recursion restricted to the base component—as opposed to more powerful (context-sensitive) grammars whose rewrite rules can license inversions, say from ‘BA’ to ‘AB’, and hence from ‘ABABABCCC’ to ‘AAABBBCCC’.

  31. By contrast, King’s (2007) notion of structured contents is designed to mirror meaningful aspects of grammatical structure. See also King, Soames, and Speaks (2014).

  32. That seems right to me. The study of Slangs can lead one to posit various linguistic entities. But if it leads one to posit universes that physicists can do without—or abstracta that only certain semanticists want—something has gone wrong.

References

  • Beall J, Glanzberg M, Ripley D (2018) Formal theories of truth. Oxford University Press, Oxford

    Google Scholar 

  • Boolos G (1998) Logic, logic, and logic. Harvard University Press, Cambridge, MA

    Google Scholar 

  • Burge T (1974) Demonstrative constructions, reference, and truth. J Phil 71:205–223

  • Chomsky N (1957) Syntactic structures. Mouton, The Hague

    Google Scholar 

  • Chomsky N (1959) On certain formal properties of grammars. Inf Control 9:137–167

    Google Scholar 

  • Chomsky N (1964) Current issues in linguistic theory. Mouton, The Hague

    Google Scholar 

  • Chomsky N (1965) Aspects of the theory of syntax. MIT Press, Cambridge, MA

    Google Scholar 

  • Chomsky N (1973) Reference and proper names. J Philos 70:425–439

    Google Scholar 

  • Chomsky N (1974) Demonstrative constructions, reference, and truth. J Philos 71:205–223

    Google Scholar 

  • Chomsky N (1977) Essays on form and interpretation. North Holland, New York

    Google Scholar 

  • Chomsky N (1986) Knowledge of language. Praeger, New York

    Google Scholar 

  • Chomsky N (1995) Language and nature. Mind 104:1–61

    Google Scholar 

  • Chomsky N, Berwick R (2017) Why only us: language and evolution. MIT Press, Cambridge, MA

    Google Scholar 

  • Collins J (2015) Truth and language, natural and formal. In: Achourioti T et al (eds) Unifying the philosophy of truth. Springer, Dordrecht

    Google Scholar 

  • Davidson D (1967a) Truth and meaning. Reprinted in Davidson 1984

  • Davidson D (1967b) The Logical Form of Action Sentences. Reprinted in Davidson 1980

  • Davidson D (1973) Radical Interpretation. reprinted in Davidson 1984

  • Davidson D (1980) Essays on actions and events. Oxford University Press, Oxford

    Google Scholar 

  • Davidson D (1986) A nice derangement of epitaphs. Lepore, West Boylston

    Google Scholar 

  • Davies M (1987) Tacit knowledge and semantic theory: can a five per cent difference matter? Mind 96:441–462

    Google Scholar 

  • Eklund M (2002) Inconsistent languages. Philos Phenomenol Res 64:251–275

    Google Scholar 

  • Evans G (1981) Semantic theory and tacit knowledge. In: Holtzman S, Leich C (eds) Wittgenstein: to follow a rule. Routledge and Kegan Paul, London

    Google Scholar 

  • Evans G (1982) Varieties of reference. Oxford University Press, Oxford

    Google Scholar 

  • Foster J (1976) In Evans and McDowell (1976)

  • Glanzberg M (2004) A contextual-hierarchical approach to truth and the liar paradox. J Philos Logic 33:27–88

    Google Scholar 

  • Glanzberg M (2015) Logical consequence and natural language. In: Caret C, Hjortland O (eds) Foundations of logical consequence. Oxford University Press, Oxford, pp 71–120

    Google Scholar 

  • Heck R (2004) Truth and disquotation. Synthese 142:317–352

    Google Scholar 

  • Heck R (2007) Meaning and truth-conditions. In: Greimann D, Siegwart G (eds) Truth and speech acts: studies in the philosophy of language. Routledge, New York

    Google Scholar 

  • Higginbotham J (1991) Truth and understanding. Iyyun 40:271–288

    Google Scholar 

  • Kaplan D (1989) Demonstratives. In: Almog J, Perry J, Wettstein H (eds) Themes from Kaplan. Oxford University Press, New York

    Google Scholar 

  • Katz and Fodor (1963) The structure of a semantic theory. Language 39:170–210

    Google Scholar 

  • King J (2007) The nature and structure of content. Oxford University Press, Oxford

    Google Scholar 

  • King J, Soames S, Speaks J (2014) New thinking about propositions. Oxford University Press, Oxford

    Google Scholar 

  • Kleene S (1950) Introduction to metamathematics. D. Van Nostrand, Princeton

    Google Scholar 

  • Kripke S (1975) Outline of a theory of truth. J Philos 72:690–716

    Google Scholar 

  • Kripke S (1980) Naming and necessity. Harvard University Press, Cambridge, MA

    Google Scholar 

  • Larson R, Segal G (1995) Knowledge of meaning. MIT Press, Cambridge, MA

    Google Scholar 

  • Lepore E, Ludwig K (2007) Donald Davidson’s truth-theoretic semantics. Oxford University Press, Oxford

    Google Scholar 

  • Lewis D (1975) Languages and language. In: Gunderson K (ed) Minnesota studies in the philosophy of science, vol 7. University of Minnesota Press, Minneapolis

    Google Scholar 

  • Lewis D (1986) On the plurality of worlds. Blackwell, Oxford

    Google Scholar 

  • Lycan W (2012) A truth predicate in the object language. In: Preyer G (ed) Donald Davidson on truth, meaning and the mental. Oxford University Press, Oxford

    Google Scholar 

  • May R (1985) Logical form: its structure and derivation. MIT Press, Cambridge, MA

    Google Scholar 

  • Parsons C (1974) The Liar paradox. J Philos Logic 3:381–412

    Google Scholar 

  • Peacocke C (1986) Explanation in computational psychology: language, perception and level 1.5. Mind Lang 1:101–123

    Google Scholar 

  • Pietroski P (2005) Meaning before truth. In: Preyer G, Peters G (eds) Contextualism in philosophy. Oxford University Press, Oxford

    Google Scholar 

  • Pietroski P (2017a) I-languages and T-sentences. In: Armour-Garb B (ed) Reflections on the Liar. Oxford University Press, Oxford

    Google Scholar 

  • Pietroski P (2017b) Semantic internalism. In: McGilvray J (ed) The Cambridge companion to chomsky. Cambridge University Press, Cambridge

    Google Scholar 

  • Pietroski P (2017c) Meanings via syntactic structures. In: Hornstein N et al (eds) Syntactic structures after 60 years. De Gruyter, Mouton

    Google Scholar 

  • Pietroski P (2018) Conjoining meanings: semantics without truth values. Oxford University Press, Oxford

    Google Scholar 

  • Post E (1943) Formal reductions of the general combinatorial decision problem. Am J Math 65:197–215

    Google Scholar 

  • Priest G (1979) Logic of Paradox. J Philos Logic 8:219–241

    Google Scholar 

  • Priest G (2006) In contradiction: a study of the transconsistent, 2nd edn. Oxford University Press, Oxford

    Google Scholar 

  • Russell B (1905) On denoting. Mind 14:479–493

    Google Scholar 

  • Stalnaker R (1978) Assertion. In: Cole P (ed) Pragmatics, vol 9. New York Academic Press, New York

    Google Scholar 

  • Stalnaker R (1984) Inquiry. MIT Press, Cambridge, MA

    Google Scholar 

  • Strawson P (1950) On referring. Mind 59:320–344

    Google Scholar 

  • Tarski A (1944) The semantic conception of truth. Philos Phenomenol Res 4:341–375

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Paul M. Pietroski.

Ethics declarations

Conflict of interest

Fostering Liars declares that he has no conflict of interest.

Ethical Approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Pietroski, P.M. Fostering Liars. Topoi 40, 5–25 (2021). https://doi.org/10.1007/s11245-020-09696-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11245-020-09696-0

Keywords

Navigation