Online research in philosophy

There are two main approaches to the problem of donkey anaphora (e.g. If John owns a donkey , he beats it ). Proponents of dynamic approaches take the pronoun to be a logical variable, but they revise the semantics of quantifiers so as to allow them to bind variables that are not within their syntactic scope. Older dynamic approaches took this measure to apply solely to existential quantifiers; recent dynamic approaches have extended it to all quantifiers. By contrast, proponents of E-type analyses take the pronoun to have the semantics of a definite description (with it ≈ the donkey, or the donkey that John owns ). While competing accounts make very different claims about the patterns of coindexation that are found in the syntax, these are not morphologically realized in spoken languages. But they are in sign language, namely through locus assignment and pointing. We make two main claims on the basis of ASL and LSF data. First, sign language data favor dynamic over E-type theories: in those cases in which the two approaches make conflicting predictions about possible patterns of coindexation, dynamic analyses are at an advantage. Second, among dynamic theories, sign language data favor recent ones because the very same formal mechanism is used irrespective of the indefinite or non-indefinite nature of the antecedent. Going beyond this debate, we argue that dynamic theories should allow pronouns to be bound across negative expressions, as long as the pronoun is presupposed to have a non-empty denotation. Finally, an appendix displays and explains subtle differences between overt sign language pronouns and all other pronouns in examples involving ‘disjunctive antecedents’, and suggests that counterparts of sign language loci might be found in spoken language.

The Donkey Problem (as I am calling it) concerns the relationship between more and less fundamental ontologies. I will claim that the moral to draw from the Donkey Problem is that the less fundamental objects are merely conventional. This conventionalism has consequences for the 3D/4D debate. Four-dimensionalism is motivated by a desire to avoid coinciding objects, but once we accept that the non-fundamental ontology is conventional there is no longer any reason to reject coincidence. I therefore encourage 4Dists to become even more radical—embrace the Donkey Problem’s conventionalism and deflate the debate between 3Dists and 4Dists.

This paper arose from an attempt to determine how the very late medieval1 supposition theorists treated anaphoric pronouns, pronouns whose significance is derivative from their antecedents. Modern researches into pronouns were stimulated in part by the problem of "donkey sentences" discussed by Geach 1962 in a section explaining what is wrong with medieval supposition theory. So there is some interest in seeing exactly what the medieval account comes to, especially if it turns out, as I suspect, to work as well as contemporary ones. Besides, finding a good analysis of pronouns has proved to be very difficult, and so we might possibly find some insight in a historically different kind of approach. I discuss a version of supposition theory that aims at producing analyses of sentences containing quantified terms,2 as articulated around 1400 by Paul of Venice, and as further developed by certain logicians such as de Soto and Celaya in the 1400's and early 1500's.3 Much of what I will say also applies indirectly to earlier versions of supposition theory (before 1400).

In this paper, I show that the availability of what some authors have called the weak reading and the strong reading of donkey sentences with relative clauses is systematically related to monotonicity properties of the determiner. The correlation is different from what has been observed in the literature in that it concerns not only right monotonicity, but also left monotonicity (persistence/antipersistence). I claim that the reading selected by a donkey sentence with a double monotone determiner is in fact the one that validates inference based on the left monotonicity of the determiner. This accounts for the lack of strong reading in donkey sentences with MON determiners, which have been neglected in the literature. I consider the relevance of other natural forms of inference as well, but also suggest how monotonicity inference might play a central role in the actual process of interpretation. The formal theory is couched in dynamic predicate logic with generalized quantifiers.

(1) Mostx menx who own ay donkey beat ity. e.g. |≠M, g (1) if man = {m0, …, m9} & m0 owns & beats donkey d0, …, d9 & m1 owns & beats donkeys d10, …, d19 & m2 owns donkey d20 (only) but doesn’t beat d20..

In this paper we present a dynamic assignment language which extends the dynamic predicate logic of Groenendijk and Stokhof [1991: 39–100] with assignment and with generalized quantifiers. The use of this dynamic assignment language for natural language analysis, along the lines of o.c. and [Barwise, 1987: 1–29], is demonstrated by examples. We show that our representation language permits us to treat a wide variety of donkey sentences: conditionals with a donkey pronoun in their consequent and quantified sentences with donkey pronouns anywhere in the scope of the quantifier. It is also demonstrated that our account does not suffer from the so-called proportion problem.Discussions about the correctness or incorrectness of proposals for dynamic interpretation of language have been hampered in the past by the difficulty of seeing through the ramifications of the dynamic semantic clauses (phrased in terms of input-output behaviour) in non-trivial cases. To remedy this, we supplement the dynamic semantics of our representation language with an axiom system in the style of Hoare. While the representation languages of barwise and Groenendijk and Stokhof were not axiomatized, the rules we propose form a deduction system for the dynamic assignment language which is proved correct and complete with respect to the semantics.

In this paper I present experimental data showing that the interpretation of donkey sentences is influenced by certain aspects of world knowledge that seem to elude introspective observation, which I try to explain by reference to a scale ranging from prototypical individuals (like children) to quite marginal ones (such as railway lines). This ontological cline interacts with the semantics of donkey sentences: as suggested already by the anecdotal data on which much of the literature is based, the effect of world knowledge is by and large restricted to donkey sentences with non-intersective determiners. I outline a psychological model which incorporates both ontological and logical factors, and suggest that there may be something wrong with the standard assumption that a statement's receiving a truth value requires that it have a definite reading.

The classical analysis of donkey sentences like (1.a,b) in Kamp (1981) and Heim (1982) assigns them truth conditions as given in (2.a). That is, they are treated as quantifications over farmer-donkey pairs. Partee (1984) and Kadmon (1987) have pointed out that the proper reading of (1.b), and a preferred reading of (1.a), is rather a quantification over farmers, as illustrated in (2.b).