01.02.2015 Views

Presuppositions and Pronouns - Nijmegen Centre for Semantics

Presuppositions and Pronouns - Nijmegen Centre for Semantics

Presuppositions and Pronouns - Nijmegen Centre for Semantics

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

80 <strong>Presuppositions</strong> <strong>and</strong> <strong>Pronouns</strong><br />

park, showing sundry signs of grief (moaning, tears, wringing of h<strong>and</strong>s). Fred<br />

<strong>and</strong> Barney pass her by, <strong>and</strong> it is mutually clear to them that neither knows<br />

the woman. Then Fred might say (79) to Barney, in an attempt to explain the<br />

woman's obviously deplorable state. In this scenario, the intended reading of<br />

(79) would require intermediate accommodation.<br />

Another variety of intermediate accommodation occurs when a<br />

presupposition X % is is triggered in in the scope of a quantifying expression a <strong>and</strong><br />

X contains a reference marker bound by a. The binding theory predicts that<br />

in such an event global accommodation is excluded (because the resulting<br />

DRS would not be a proper one), <strong>and</strong> on the next-preferred reading % X<br />

restricts a's oc's domain. The following is a case in point:<br />

(80) Everyone of my friends has sold his copy of 'Lolita'.<br />

This will ordinarily interpreted as saying that everyone of my friends who<br />

had a copy of 'Lolita' sold it. On this reading, an occasional friend who didn't<br />

have a copy of 'Lolita', <strong>and</strong> there<strong>for</strong>e couldn't sell it either, does not falsify<br />

(80).16 To show in some detail how the binding theory accounts <strong>for</strong> this<br />

reading, I will employ Kamp <strong>and</strong> Reyle's (1993) 'duplex conditions'. This is<br />

not because I want to advocate this proposal, but because this is as good an<br />

opportunity as any <strong>for</strong> explaining why I will not adopt it later on.<br />

(81) a. [: [x: friend x](every x)[!!, x)[u, y: v: Lolita v, u owned v, v. x sold v]]<br />

b. [: [x, u: u = x, friend x](every x> x)<br />

[u, y: v: Lolita v, v. u owned v, x sold v]]<br />

c. [: [x: friend x](every x)[y: Lolita v, v. x owned v, v. x sold v]]<br />

d. [: [x, v: friend x, Lolita v, x owned v](every x)[: x sold v]]<br />

(81a) is the semantic representation of (80) in which only the two<br />

presuppositions triggered by his copy of 'Lolita' remain to be processed.<br />

(81a) contains a single duplex condition of the <strong>for</strong>m '

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!