Standard formalizations of donkey sentences contain logical and semantic errors
the verdict
INSUFFICIENT LEANING
refutedsupported
the weight of evidence
5 sources for · 0 against
Linguistic literature documents various formal mismatches, free-variable issues, and limitations in standard logical representations of donkey sentences, though sources address specific technical shortcomings rather than a sweeping formal error across all frameworks.
We explore a distinction between ‘high’ and ‘low’ readings in counterfactual donkey sentences and observe three open issues in the current literature on these sentences: (i) van Rooij (2006) and Wang (2009) make different empirical predictions with respect to the availability of ‘high’ donkey readings. We settle this question in favour of van Rooij’s (2006) analysis. (ii) This analysis overgenerates with respect to weak readings in so-called ‘identificational’ donkey sentences. We argue that pronouns in these sentences should not be analysed as donkey pronouns, but as concealed questions or as part of a cleft. (iii) The analysis also undergenerates with respect to NPI licensing in counterfactual antecedents. We propose a strict conditional semantics for counterfactual donkey sentences that derives the correct licensing facts.
Counterfactual donkey sentences
introduce these two ingredients separately. The issue is how the restriction to
maximally similar worlds used in the interpretation of counterfactuals should be
intertwined with the apparatus needed for donkey quantification.
1.1 Counterfactuals: Variably strict analysis
In the classical variably strict approach developed by Stalnaker (1968) and Lewis
(1973), the truth conditions of a plain counterfactual conditional like (2) are rela-
tivized to an accessibility function f , mapping each world w in its domain to the set
of worlds which make the antecedent clause φ true and are otherwise maximally
similar to w according to a given ordering relation≤, as defined in (4).1 A counter-
factual sentence φ > ψ then asserts that all φ-worlds that are maximally similar to
the actual world are also ψ-worlds; see (5).
(4) fw(Jφ K f ,≤) ={v∈ Jφ K f ,≤|¬∃ u∈ Jφ K f ,≤ : u <w v}
(5) Jφ > ψK f ,≤(w) = 1 iff ∀w′∈ fw(Jφ K f ,≤): w′∈ JψK f ,≤
1.2 Donkey sentences: Dynamic predicate logic
We limit our discussion of indicative donkey sentences to a standard dynamic seman-
tics for quantification and pronouns: Dynamic Predicate Logic (DPL, Groenendijk
& Stokhof 1991)2. The main problem of donkey sentences as perceived from this
perspective is the mismatch between the compositionally derived formula in (6) and
the reading that donkey sentences are usually taken to have in (7):
(6) ∃xPx→ Qx
(7) ∀x[Px→ Qx]
The solution advocated by Groenendijk & Stokhof is a logic that derives the
equivalence of those two formulas. That is, in their system there is no difference in
the interpretation of (6) and (7):
(8) ∃xPx→ Qx ⇔ ∀x[Px→ Qx]
The way that DPL derives this equivalence is by moving from a static semantics
where the semantic value of an expression is a set of assignments to a dynamic
semantics where the semantic value of an expression is a set of pairs of assignments,
one ‘input’ pair and one ‘output’ pair. That is, we explicitely record and pass on
changes to the assignment functions in moving from static (9) to (10).
1 For simplicity, we make the limit assumption (Lewis
={⟨g,h⟩| h = g∧∀ k : (k[x]h∧ k(x)∈ F(P))→ k(x)∈ F(Q)}
Later developments notwithstanding, this proposal provides a solid foundation
for the investigation of donkey sentences and other quantificational phenomena.
1.3 Goal and roadmap
The existing analyses of counterfactual donkey sentences in the literature (van Rooij
2006, Wang 2009) have combined a variably strict semantics for counterfactual
conditionals with a standard dynamic semantics like DPL. In this paper, we reveal
three shortcomings of the current state-of-the-art:
i) We vindicate van Rooij’s (2006) account with respect to Wang’s (2009) criticism
by showing that Wang (2009) cannot generate all the attested readings of the
indefinite NP in counterfactual sentences,
ii) We show that van Rooij (2006) overgenerates weak readings in identificational
sentences, and
290
Walker & Romero
Büring, Daniel. 2004. Crossover situations. Natural Language Semantics 12(1).
23–62.
Büring, Daniel. 2011. Conditional exhaustivity presuppositions in clefts (and defi-
nites). Ms. ZAS/Vienna .
Elbourne, Paul. 2005. Situations and Individuals. MIT Press.
von Fintel, Kai. 1999. NPI licensing, Strawson entailment, and context dependency.
Journal of semantics 16(2). 97–148.
von Fintel, Kai. 2001. Counterfactuals in a dynamic context. Current Studies in
Linguistics Series 36. 123–152.
Geach, P. T. 1962. Reference and Generality. Cornell University Press.
Gillies, Anthony S. 2007. Counterfactual scorekeeping. Linguistics and Philosophy
30(3). 329–360.
Groenendijk, Jeroen & Martin Stokhof. 1991. Dynamic predicate logic. Linguistics
and Philosophy 14(1). 39–100.
Heim, Irene. 1990. E-type pronouns and donkey anaphora. Linguistics and Philoso-
phy 13(2). 137–177.
Kadmon, Nirit & Fred Landman. 1993. Any. Linguistics and philosophy 16(4).
353–422.
Lewis, David K. 1973. Counterfactuals. Blackwell.
Mikkelsen, Line. 2005. Copular Clauses. Specification, Predication and Equation.
John Benjamins.
Romero, Maribel. 2004. Intensional noun phrases with know and be. Catalan
Journal of Linguistics 3(1). 147–178.
Romero, Maribel. 2005. Concealed questions and specificational subjects. Linguis-
tics and Philosophy 28(6). 687–737.
van Rooij, Robert. 2006. Free choice counterfactual donkeys. Journal of Semantics
23(4). 383–402.
Root, Rebecca Louise. 1986. The semantics of anaphora in discourse. University of
Texas Press.
Schubert, Lenhart K & Francis Jeffry Pelletier. 1987. Problems in the representation
of the logical form of generics, plurals, and mass nouns. In Ernest Lepore (ed.),
New directions in semantics, 385–451. Academic Press.
Stalnaker, Robert C. 1968. A theory of conditionals. Americal Philosophical
Quarterly Monograph Series, 2. 98–112.
Velleman, Dan, David Beaver, Emilie Destruel, Dylan Bumford, Edgar Onea & Liz
Coppock. 2013. It-clefts are IT (inquiry terminating) constructions. In Anca
Chereches (ed.), Semantics and Linguistic Theory (SALT) 22, 441–460.
Wang, Y . 2009. Counterfactual donkey sentences: A response to Robert van Rooij.
Journal of Semantics 26(3). 317–328.
306
# On donkey sentences: why is this formalization incorrect?
Tags: english, semantics, logic
- Score: 2
- Views: 996
- Answers: 3
- Answered: yes
- Asked by: RECURSIVE FARTS (1574 rep)
- Asked: 2015-01-03
- Edited: 2015-01-03
- Site: linguistics
## Question
Part of the difficulty surrounding donkey sentences, to my understanding, is about how hard they are to translate to FOL in a matter that is consistent with other translations to FOL in english.
Take "every man who owns a donkey beats it".
The knee-jerk translation would look something like this:
∀x[(MAN(x) ∧ ∃y[DONKEY(y) ∧ OWNS(y,x)]) -> BEATS(y,x)]
This is problematic because y is free in the consequent. But now say that we extend the scope of the existential quantifier so it reads as follows:
∀x(MAN(x) - ∃y[ ([DONKEY(y) ∧ OWNS(y,x)] ∧ BEATS(y,x)) ∧ DONKEY(y) ])
∀x(MAN(x) ∧ ∃y[ ([DONKEY(y) ∧ OWNS(y,x)] ∧ BEATS(y,x)) ∧ DONKEY(y) ])
What I did here is extend the scope of the existential to encapsulate the BEATS predicate. Next, I included a conjunction that included another instance of the predicate DONKEY to make the formula more rigorous (because it would evaluate as true if we interpreted y as a pig/non-donkey objec
# Truth-conditions of predicate-logic formulas for donkey sentences
Tags: semantics, logic, formal-semantics
- Score: 3
- Views: 473
- Answers: 1
- Answered: yes
- Asked by: LizJu (31 rep)
- Asked: 2017-07-24
- Edited: 2017-07-25
- Site: linguistics
## Question
I'm current learning about compositional semantics, quantifier raising and scope ambiguity in my semantics class and I'm having trouble answering some questions. I've attempted to answer the questions below, but i'm not sure if i'm answering the questions in the correct way.
(1) If Jake owns a donkey, he beats it
(a) The following predicate logic formula does not correctly represent the truth-conditional meaning of (1). Why not? Explain your answer.
(2) ∃x[donkey(x) ∧ own(j, x)] → beat(j, x)
(b) The following predicate logic formula does not correctly represent the truth-conditional meaning of (1) either. Why not? Explain your answer.
(3) ∃x[[donkey(x) ∧ own(j, x)] → beat(j, x)]
(c) Provide a predicate logic formula that most closely represents the truth-conditional meaning
of (1). Explain your answer.
a) The formula does not represent the truth conditional meaning because the existential quantifier does not scop
# Predicate Gradual Logic and Linguistics
arXiv (Cornell University). Published: 2016-03-17. Preprint. 0 citations.
## Abstract
There are several major proposals for treating donkey anaphora such as discourse representation theory and the likes, or E-Type theories and the likes. Every one of them works well for a set of specific examples that they use to demonstrate validity of their approaches. As I show in this paper, however, they are not very generalisable and do not account for essentially the same problem that they remedy when it manifests in other examples. I propose another logical approach. I develoop logic that extends a recent, propositional gradual logic, and show that it can treat donkey anaphora generally. I also identify and address a problem around the modern convention on existential import. Furthermore, I show that Aristotle's syllogisms and conversion are realisable in this logic.
## Authors
- Ryuta Arisaka: h-index 7; 119 citations; corresponding author
## Topics
- Classical Philosophy and Thought
- Logic, Reasoning, and Knowledge
- Philosophy and Theoretical Science
## References
- Makoto Kanazawa. Singular Donkey Pronouns Are Semantically Singular. Li
Everything we examined (5) — 4 independent sources
This check searched the claim as stated. It did not run a separate search for evidence against it.