<?xml version="1.0" encoding="utf-8"?>
<article xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:noNamespaceSchemaLocation="JATS-journalpublishing1-mathml3.xsd" dtd-version="1.2" article-type="Article">
<front>
<journal-meta>
<journal-id journal-id-type="publisher">phimp</journal-id>
<journal-title-group>
<journal-title>Philosophers&#x2019; Imprint</journal-title>
</journal-title-group>
<issn pub-type="epub"></issn>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">2116</article-id>
<article-id pub-id-type="manuscript">main_corrected_2.pdf</article-id>
<article-id pub-id-type="doi">10.3998/phimp.2116</article-id>
<title-group>
<article-title>DESIRE</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes" equal-contrib="yes">
<name>
<surname>Blumberg</surname>
<given-names>Kyle</given-names>
</name>
<email>khb251@nyu.edu</email>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Hawthorne</surname>
<given-names>John</given-names>
</name>
</contrib>
<aff id="A1">Dianoia Institute of Philosophy, Australian Catholic University &amp; Institute for the Future of Knowledge, University of Johannesburg Dianoia Institute of Philosophy, Australian Catholic University &amp; Department of Philosophy, University of Southern California</aff>
</contrib-group>
<pub-date>
<day>6</day>
<month>7</month>
<year>2022</year>
</pub-date>
<volume>22</volume>
<history>
<date date-type="received">
<day></day>
<month></month>
<year></year>
</date>
<date date-type="rev-recd">
<day></day>
<month></month>
<year></year>
</date>
<date date-type="accepted">
<day></day>
<month></month>
<year></year>
</date>
</history>
<permissions>
<license><license-p>CC BY-NC-ND 4.0</license-p>
<license-p>This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License &#x003C;www.philosophersimprint.org/022008/&#x003E;</license-p>
</license>
</permissions>
<abstract id="ABS1">
<p id="P1A">In this paper, we present two puzzles involving desire reports concerning series of events. What does a person want to happen in the first event &#x2013; is it the event with the highest expected return, or the event that is the initial part of the best series? We show that existing approaches fail to resolve the puzzles around this question and develop a novel account of our own. Our semantics is built around three ideas. First, we propose that desire ascriptions are evaluated relative to a contextually supplied set of propositions, or alternatives. The semantic value of an ascription &#x2018;S wants p&#x2018; is determined by S&#x0027;s preference ordering over these alternatives. Second, we propose that desire reports carry a requirement to the effect that the prejacent of the ascription must be suitably related to the background set of alternatives. Finally, we suggest that desire reports carry a dominance condition concerning the subject's ranking of the alternatives. Overall, we argue that our theory provides us with an elegant resolution of our puzzles, and yields a promising approach to desire.</p>
</abstract>
<funding-group />
<counts>
<fig-count count="1"/>
</counts>
<custom-meta-group>
<custom-meta id="competing-interest">
<meta-name></meta-name>
<meta-value></meta-value>
</custom-meta>
</custom-meta-group>
</article-meta>
</front>
<body>
<sec id="S1">
<label>1.</label><title>Introduction</title>
<p id="P1">Our topic concerns two puzzles involving desire reports. They can be illustrated by considering the following case:
<disp-quote id="Q1">
<p id="P2"><italic>Coins</italic>: Three fair coins will be flipped, and Bill&#x2019;s reckless brother has bet the family fortune on the outcome. If the first coin lands heads, and the second or third coin lands tails, the entire fortune will be lost. If all three coins land heads, the fortune will be doubled. If the first coin lands tails, nothing happens, i.e., nothing is lost (or gained).</p>
</disp-quote></p>
<p id="P3">(1) is easily heard as true in this scenario:
<list list-type="simple" id="L1">
<list-item><p id="P4">(1) Bill wants all three coins to land heads.</p></list-item>
</list></p>
<p id="P5">After all, if all three coins land heads, Bill knows that the fortune will be doubled, and he would certainly like that. But by the same token, (2) is also easily heard as true:
<list list-type="simple" id="L2">
<list-item><p id="P6">(2) Bill wants the first coin to land tails.</p></list-item></list></p>
<p id="P7">After all, if the first coin lands heads, Bill knows there&#x2019;s a good chance that the fortune will be lost, and he certainly would not like that.</p>
<p id="P8">However, (1) and (2) cannot be felicitously conjoined (as indicated by the &#x2018;#&#x2019; preceding the example):
<list list-type="simple" id="L3">
<list-item><p id="P9">(3) # Bill wants all three coins to land heads, and he wants the first coin to land tails.</p></list-item></list></p>
<p id="P10">(3) sounds incoherent. But this is surprising: if both (1) and (2) are true, then why can&#x2019;t they be put together, as in (3)? Let us call this <italic>the three heads and tails puzzle</italic>, or <italic>the 3H-T puzzle</italic>.</p>
<p id="P11">The second puzzle begins with the observation that (4) is unacceptable in context:
<list list-type="simple" id="L4">
<list-item><p id="P12">(4) # Bill wants the first coin to land heads.</p></list-item></list></p>
<p id="P13">A natural response to (4) would be: &#x201C;but if the first coin lands heads, Bill knows that the fortune will likely be lost, and he definitely wouldn&#x2019;t like that&#x201D;. However, the negation of (4) cannot be felicitously conjoined with (1):
<list list-type="simple" id="L5">
<list-item><p id="P14">(5) # Bill wants all three coins to land heads, but he doesn&#x2019;t want the first coin to land heads.</p></list-item></list></p>
<p id="P15">(5) sounds incoherent. But this is unexpected: if (1) is true and (4) is false, why isn&#x2019;t the conjunction of the former along with the negation of the latter acceptable? Let us call this <italic>the three heads and not-first-heads puzzle</italic>, or <italic>the 3H-</italic><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M1"><mml:mrow><mml:mover accent='true'><mml:mi>H</mml:mi><mml:mo>&#x00AF;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula> <italic>puzzle</italic>.<sup><xref rid="fn1" ref-type="fn">1</xref></sup></p>
<p id="P16">In this paper, we try to solve both the 3H-T puzzle and the 3H-<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M2"><mml:mrow><mml:mover accent='true'><mml:mtext>H</mml:mtext><mml:mo>&#x00AF;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula> puzzle by developing a novel semantics for desire reports. This account is built around three ideas. First, we propose that desire ascriptions are evaluated relative to a contextually supplied set of propositions, or <italic>alternatives</italic>. <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M3"><mml:mrow><mml:mtext>S</mml:mtext></mml:mrow></mml:math></inline-formula>&#x2019;s preference ordering over these alternatives determines the semantic value of desire reports.<sup><xref rid="fn2" ref-type="fn">2</xref></sup> On our entry, there are no sets of alternatives relative to which the conjunctions (3) and (5) are true, which explains their unacceptability.</p>
<p id="P17">Second, we propose that desire reports carry a requirement to the effect that the prejacent of the ascription must be suitably related to the background set of alternatives. That is, we propose a <italic>representation condition</italic> on the prejacent. As we show, this constraint explains why the natural set of alternatives relative to which (1) is evaluated is one where the report comes out true.</p>
<p id="P18">Finally, we propose a <italic>dominance condition</italic> concerning the subject&#x2019;s ranking of the alternatives. If there is some top-ranked <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M4"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>-entailing alternative by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M4a"><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>&#x2019;s lights, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M5"><mml:mrow><mml:mtext>S</mml:mtext></mml:mrow></mml:math></inline-formula> must prefer every <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M6"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>-entailing alternative to every <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M7"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>-entailing alternative, i.e., the <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M8"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>-entailing alternatives must dominate the <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M9"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>-entailing alternatives. As we show, this explains why (4) is unacceptable. Overall, we argue that our theory provides us with an elegant resolution of our puzzles, and yields a promising approach to desire.</p>
<p id="P19">The paper is structured as follows. In <xref rid="S2" ref-type="sec">&#x00A7;2</xref>, we show that existing theories of desire ascriptions fail to provide solutions to our puzzles. Then, in <xref rid="S9" ref-type="sec">&#x00A7;3</xref>, we develop our theory in several stages. Finally, <xref rid="S20" ref-type="sec">&#x00A7;4</xref> concludes by discussing the relationship between desire verbs and deontic modals.</p>
</sec>
<sec id="S2">
<label>2.</label><title>Existing Accounts</title>
<p id="P20">In this section, we consider how some existing approaches to desire fare with respect to our puzzles. To this end, we consider two influential accounts: the monotonic analysis of <xref rid="R15" ref-type="bibr">von Fintel (1999)</xref> (<xref rid="S3" ref-type="sec">&#x00A7;2.1</xref>) and the decision-theoretic semantics of <xref rid="R31" ref-type="bibr">Levinson (2003)</xref> (<xref rid="S7" ref-type="sec">&#x00A7;2.2</xref>). We argue that although these accounts can explain some aspects of our puzzles, neither provides us with satisfying solutions to them.<sup><xref rid="fn3" ref-type="fn">3</xref></sup></p>
<sec id="S3">
<label>2.1</label><title><xref rid="R15" ref-type="bibr">Von Fintel&#x2019;s (1999)</xref> Account</title>
<p id="P21">In a tradition that begins with <xref rid="R22" ref-type="bibr">Hintikka (1962)</xref>, many attitude verbs are given a quantificational semantics involving a lexically-determined accessibility relation. For instance, relative to a world <italic>w</italic>, &#x2018;believe&#x2019; denotes a relation that holds between an agent <italic>S</italic> and a proposition <italic>p</italic> just in case every world compatible with <italic>S</italic>&#x2019;s beliefs in <italic>w</italic> is one in which <italic>p</italic> is true, i.e., every world in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M10"><mml:mrow><mml:mtext>S</mml:mtext></mml:mrow></mml:math></inline-formula>&#x2019;s <italic>belief set</italic>, denoted Dox<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M11"><mml:mrow><mml:msub><mml:mtext>Dox</mml:mtext><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, is a <italic>p</italic>-world. Von Fintel treats &#x2018;want&#x2019; similarly, i.e., as a function such that &#x2018;Bill wants Ann to leave&#x2019; is true at world <italic>w</italic> just in case every world that conforms to what Bill desires in <italic>w</italic>&#x2014;every world in Bill&#x2019;s <italic>desire set</italic> in <italic>w</italic>&#x2014;is one where Ann leaves.</p>
<p id="P22">Von Fintel puts constraints on which worlds can appear in a subject&#x2019;s desire set. He assumes that a subject&#x2019;s desires generate a preference ordering over possible worlds: for any subject <italic>S</italic>: <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M12"><mml:mrow><mml:mi>w</mml:mi><mml:mo>&#x0027;</mml:mo><mml:msub><mml:mo>&#x003E;</mml:mo><mml:mrow><mml:mi>S</mml:mi><mml:mo>,</mml:mo><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mi>w</mml:mi><mml:mo>&#x0027;</mml:mo><mml:mo>&#x0027;</mml:mo></mml:mrow></mml:math></inline-formula> iff <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M13"><mml:mrow><mml:mi>w</mml:mi><mml:mo>&#x0027;</mml:mo></mml:mrow></mml:math></inline-formula> is more desirable to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M14"><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula> than <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M15"><mml:mrow><mml:mi>w</mml:mi><mml:mo>&#x0027;&#x0027;</mml:mo></mml:mrow></mml:math></inline-formula> in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M16"><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:math></inline-formula>. <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M17"><mml:mrow><mml:mi>w</mml:mi><mml:mo>&#x0027;</mml:mo><mml:msub><mml:mo>&#x003E;</mml:mo><mml:mrow><mml:mi>S</mml:mi><mml:mo>,</mml:mo><mml:mi>w</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is a strict partial order. The idea is that the subject&#x2019;s desire set is constrained by their beliefs: the subject&#x2019;s desire set is comprised of all and only their top-ranked belief worlds, as ordered by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M18"><mml:mrow><mml:msub><mml:mo>&#x003E;</mml:mo><mml:mrow><mml:mi>S</mml:mi><mml:mo>,</mml:mo><mml:mi>w</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>.<sup><xref rid="fn4" ref-type="fn">4</xref></sup></p>
<disp-quote id="Q2">
<p id="P23a"><bold>Specification of Desire Set</bold></p>
<p id="P23">For any subject <italic>S</italic> and world <italic>w</italic>: <italic>S</italic>&#x2019;s desire set Bul<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M19"><mml:mrow><mml:msub><mml:mrow><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mo>,</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mo>&#x007B;</mml:mo><mml:mi>w</mml:mi><mml:mo>&#x0027;</mml:mo><mml:mtext>&#x2009;</mml:mtext><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mtext>Dox</mml:mtext><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:msub><mml:mo>&#x007C;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mo>&#x2203;</mml:mo><mml:mi>w</mml:mi><mml:mo>&#x0027;</mml:mo><mml:mo>&#x0027;</mml:mo><mml:mo>&#x2208;</mml:mo><mml:mtext>&#x2009;</mml:mtext><mml:msub><mml:mtext>Dox</mml:mtext><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:msub><mml:mtext>&#x2009;</mml:mtext><mml:mtext>such</mml:mtext><mml:mtext>&#x2009;</mml:mtext><mml:mtext>&#x2009;</mml:mtext><mml:mtext>that</mml:mtext><mml:mtext>&#x2009;</mml:mtext><mml:mi>w</mml:mi><mml:msub><mml:mtext>'&#x003E;</mml:mtext><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:msub><mml:mi>w</mml:mi><mml:mo>&#x0027;</mml:mo><mml:mo>&#x007D;</mml:mo></mml:mrow></mml:math></inline-formula></p>
</disp-quote>
<p id="P24">Von Fintel&#x2019;s account can be expressed as follows:<sup><xref rid="fn5" ref-type="fn">5</xref></sup>
<disp-quote id="Q3">
<p id="P24a"><bold>Von Fintel&#x2019;s semantics for <italic>want</italic></bold></p>
<p id="P25"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M20"><mml:mrow><mml:mo>&#x231C;</mml:mo><mml:mtext>S</mml:mtext></mml:mrow></mml:math></inline-formula> wants <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M21"><mml:mrow><mml:mtext>p</mml:mtext><mml:mo>&#x231D;</mml:mo></mml:mrow></mml:math></inline-formula> is true in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M22"><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:math></inline-formula> iff Bul<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M23"><mml:mrow><mml:msub><mml:mrow></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2286;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula></p>
</disp-quote></p>
<p id="P26">Now, let us consider our puzzles from <xref rid="S1" ref-type="sec">&#x00A7;1</xref>. The 3H-T puzzle concerned the fact that both (1) and (2) are acceptable in the <italic>Coins</italic> scenario, but (3) is not:
<list list-type="order" id="L6">
<list-item><p id="P27">Bill wants all three coins to land heads.</p></list-item>
<list-item><p id="P28">Bill wants the first coin to land tails.</p></list-item>
<list-item><p id="P29"># Bill wants all three coins to land heads, and he wants the first coin to land tails.</p></list-item>
</list></p>
<p id="P30">The acceptability of both (1) and (2) poses an immediate problem for this account. <italic>All three coins land heads</italic> and <italic>The first coin lands tails</italic> are incompatible propositions. So, if every world in Bill&#x2019;s desire set is one where all three coins land heads, it&#x2019;s not the case that every world in Bill&#x2019;s desire set is one where the first coin lands tails. Similarly, if every world in Bill&#x2019;s desire set is one where the first coin lands tails, it&#x2019;s not the case that every world in Bill&#x2019;s desire set is one where all three coins land heads. It follows that (1) and (2) can&#x2019;t be true together, so at least one of these reports is predicted to be false and thus infelicitous.</p>
<p id="P31">One possible response here is to maintain that (1) and (2) are evaluated relative to different preference orderings over worlds. The idea is that the ordering on which (1) comes out true ranks highly those worlds in which all three coins land heads. By contrast, the ordering on which (2) comes out true ranks highly those worlds in which the first coin lands tails. Moreover, it could be maintained that this ordering is determined by context, which would explain why (3) is unacceptable: given a fixed context, there is no single ordering relative to which the conjunction comes out true.<sup><xref rid="fn6" ref-type="fn">6</xref></sup></p>
<p id="P32">It should be noted that the appeal to shifting orderings has precedent in the literature on desire reports. It is plausible that virtually all theorists need to make use of something like this mechanism in order to explain so-called &#x201C;conflicting desires&#x201D; (<xref rid="R12" ref-type="bibr">Crni&#x010D;, 2011</xref>, 170&#x2013;172). For instance, suppose that all my friends are at a party, and that I&#x2019;d like to see them. But suppose also that I&#x2019;m eager to stay home and finish working on a paper. If someone asks me &#x2018;Would you like to go to the party?&#x2019;, I can felicitously respond by saying &#x2018;I do and I don&#x2019;t&#x2019;. It seems difficult to make sense of my response without availing oneself of some sort of preference shift: my positive reply is warranted relative to a preference ordering that takes seeing my friends into account, while my negative reply is warranted relative to a preference ordering that takes finishing my paper into account. Evidence that my replies are accessing different sorts of preferences comes from the fact that I can preface each with phrases such as &#x2018;in one way&#x2019;, &#x2018;part of me&#x2019;, and &#x2018;in some sense&#x2019;:
<table-wrap>
<table>
<tbody>
<tr>
<td valign="top" align="left">(6)</td>
<td valign="top">
<list list-type="simple">
<list-item><p id="P33">a. In one way I want to go to the party, but in another way I don&#x2019;t.</p></list-item>
<list-item><p id="P34">b. Part of me wants to go to the party, but part of me doesn&#x2019;t.</p></list-item></list>
</td></tr></tbody></table></table-wrap></p>
<p id="P35">Although the mechanism of preference shift might be needed to handle conflicting desires, we don&#x2019;t think that it provides a compelling response to the 3H-T puzzle. Our central concern is straightforward: it just doesn&#x2019;t seem plausible that Bill has two different sorts of preferences in the <italic>Coins</italic> scenario&#x2014;all he cares about is losing and gaining money. That is, there is only <italic>one</italic> thing he values here, not two. This makes the <italic>Coins</italic> scenario disanalogous to the party example above. Indeed, notice that one cannot felicitously preface (1) and (2) with &#x2018;in one way&#x2019; or &#x2018;part of Bill&#x2019;:
<table-wrap>
<table>
<tbody>
<tr>
<td valign="top" align="left">(7)</td>
<td valign="top">
<list list-type="simple">
<list-item><p id="P36">a. # In one way Bill wants all three coins to land heads, but in another way he wants the first coin to land tails.</p></list-item>
<list-item><p id="P37">b. # Part of Bill wants all three coins to land heads, but part of him wants the first coin to land tails.</p></list-item>
</list></td></tr></tbody></table></table-wrap></p>
<p id="P38">This is surprising if the acceptability of (1) and (2) is to be explained by variation in Bill&#x2019;s preference ordering. To be clear, the account that we develop in <xref rid="S9" ref-type="sec">&#x00A7;3</xref> also appeals to a context shift in order to solve the 3H-T puzzle. So, we are not against this general feature of the variable-preference response. Importantly, however, on our proposal what shifts is not the subject&#x2019;s preferences, but rather the objects that are being ordered.</p>
<p id="P39">We also want to register a broader concern with any response to the 3H-T puzzle that has (2) coming out true on von Fintel&#x2019;s semantics. On this account, desire reports are closed under logical consequence, i.e., they are <italic>upward monotonic</italic>:
<list list-type="simple" id="L1a">
<list-item><p id="P39a"><bold>Monotonicity</bold> <italic>If</italic> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M24"><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#x22A8;</mml:mo><mml:mi>q</mml:mi></mml:mrow></mml:math></inline-formula> then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M25"><mml:mrow><mml:mi>S</mml:mi><mml:mtext>&#x2009;</mml:mtext><mml:mi>w</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi><mml:mi>s</mml:mi><mml:mtext>&#x2009;</mml:mtext><mml:mi>p</mml:mi><mml:mo>&#x22A8;</mml:mo><mml:mi>q</mml:mi></mml:mrow></mml:math></inline-formula></p>
</list-item></list></p>
<p id="P40">Thus, in any context where (2) is predicted to be true, (8) is predicted to be true as well:
<list list-type="simple" id="L9">
<list-item><p id="P41">(8) # Bill wants the first coin to land tails, so he wants a result other than three heads.</p></list-item>
</list></p>
<p id="P42">But it is difficult to hear this sentence as anything but unacceptable.<sup><xref rid="fn7" ref-type="fn">7</xref></sup> Similarly, the ordering on which (2) comes out true ranks highly those worlds in which the first coin lands tails. So given a natural semantics for preference claims, in such contexts we would expect (9) to also be true:
<list list-type="simple" id="L10">
<list-item><p id="P43">(9) # Bill prefers the first coin landing tails to all three coins landing heads.</p></list-item>
</list></p>
<p id="P44">However, we find it very hard to hear this sentence as good.</p>
<p id="P45">As for the 3H-<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M26"><mml:mrow><mml:mover accent='true'><mml:mtext>H</mml:mtext><mml:mo>&#x00AF;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula> puzzle, it involves the fact that although (4) is unacceptable, the negation of this sentence cannot be felicitously conjoined with (1) (&#x2018;Bill wants all three coins to land heads&#x2019;):
<list list-type="simple" id="L11">
<list-item><p id="P46">(4) # Bill wants the first coin to land heads.</p></list-item>
<list-item><p id="P47">(5) # Bill wants all three coins to land heads, but he doesn&#x2019;t want the first coin to land heads.</p></list-item>
</list></p>
<p id="P48">Given Monotonicity, von Fintel has a straightforward explanation for why (5) is bad: it can never be true. But it is less obvious how the account can explain why (4) is unacceptable. Let us suppose that the 3H-T puzzle has been resolved, so that there are contexts where (1) comes out true. Then, given Monotonicity, there should be contexts where (4) is true as well. Why, then, does the report sound bad? One idea is that (4) is infelicitous because it generates a false implicature: since (4) is less informative than (1), an utterance of the former suggests that the latter is false. The model here could be the scalar implicature triggered by &#x2018;some&#x2019;: an utterance of &#x2018;Ben drank some of the whiskey&#x2019; suggests that the logically stronger &#x2018;Ben drank all of the whiskey&#x2019; is false. Thus, in contexts where &#x2018;Ben drank all of the whiskey&#x2019; is plausibly true, an utterance of &#x2018;Ben drank some of the whiskey&#x2019; will be infelicitous, but nevertheless true.</p>
<p id="P49">However, it is characteristic of these sorts of pragmatic effects that they disappear in certain environments. For instance, the implicature is canceled in (10a) and (10b):
<table-wrap>
<table>
<tbody>
<tr>
<td valign="top" align="left">(10)</td>
<td valign="top">
<list list-type="simple">
<list-item><p id="P50">a. Ben drank some of the whiskey. In fact, he drank all of it.</p></list-item>
<list-item><p id="P51">b. Given that Ben drank all of the whiskey, he drank some of it.</p>
</list-item></list>
</td></tr></tbody></table></table-wrap></p>
<p id="P52">By contrast, to our ears both (11a) and (11b) sound unacceptable:
<table-wrap>
<table>
<tbody>
<tr>
<td valign="top" align="left">(11)</td>
<td valign="top">
<list list-type="simple">
<list-item><p id="P53">a. # Bill wants the first coin to land heads. In fact, he wants all three coins to land heads.</p></list-item>
<list-item><p id="P54">b. # Given that Bill wants all three coins to land heads, he wants the first coin to land heads.</p></list-item></list>
</td></tr></tbody></table></table-wrap></p>
<p id="P55">This suggests to us that the infelicity of (4) is not due to a false implicature. Of course, we do not take this to be a decisive argument against an implicature-based analysis. But we do think that there are significant challenges to developing a successful response in this vein.</p>
<p id="P56">Before moving on to consider Levinson&#x2019;s semantics, it is worth pausing to contrast our puzzles with a different problem that has been raised for von Fintel&#x2019;s account. Several authors have observed that the (a)-examples below do not seem to imply the (b)-examples (<xref rid="R43" ref-type="bibr">Stalnaker, 1984</xref>; <xref rid="R21" ref-type="bibr">Heim, 1992</xref>):
<table-wrap>
<table>
<tbody>
<tr>
<td valign="top" align="left">(12)</td>
<td valign="top">
<list list-type="simple">
<list-item><p id="P57">a. I want to die peacefully. <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M27"><mml:menclose notation='updiagonalstrike'><mml:mo>&#x21D2;</mml:mo></mml:menclose></mml:math></inline-formula></p></list-item>
<list-item><p id="P58">b. I want to die.</p></list-item>
</list>
</td></tr></tbody></table></table-wrap>
<table-wrap>
<table>
<tbody>
<tr>
<td valign="top" align="left">(13)</td>
<td valign="top">
<list list-type="simple">
<list-item><p id="P59">a. Bill wants the murderer to be caught. <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M28"><mml:menclose notation='updiagonalstrike'><mml:mo>&#x21D2;</mml:mo></mml:menclose></mml:math></inline-formula></p></list-item>
<list-item><p id="P60">b. Bill wants there to have been a murder.</p></list-item></list>
</td></tr></tbody></table></table-wrap></p>
<p id="P61">These patterns seem to present a straightforward challenge for Monotonicity-validating views. Since <italic>I die peacefully</italic> entails <italic>I die</italic>, such views appear to predict that, e.g. (12a) should entail (12b). However, most existing accounts&#x2014;whether Monotonicity-validating or not&#x2014;maintain that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M29"><mml:mrow><mml:mo>&#x231C;</mml:mo><mml:mtext>S</mml:mtext></mml:mrow></mml:math></inline-formula> wants <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M30"><mml:mrow><mml:mtext>p</mml:mtext><mml:mo>&#x231D;</mml:mo></mml:mrow></mml:math></inline-formula> can be true only if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M31"><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula> neither believes <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M32"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula> nor <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M33"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula> (<xref rid="R21" ref-type="bibr">Heim, 1992</xref>). That is, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M34"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula> needs to be <italic>diverse</italic> with respect to the subject&#x2019;s beliefs. The (b)-examples above plausibly contravene this diversity condition: we all know that we will die one day, and presumably Bill believes that a murder was committed. Thus, if existing accounts are correct, these failures of entailment don&#x2019;t necessarily speak against Monotonicity-validating views.<sup><xref rid="fn8" ref-type="fn">8</xref></sup></p>
<p id="P62">We aren&#x2019;t moved by a belief constraint on desire reports. It has been recognized for some time (though it is often ignored) that subjects can want things they are certain won&#x2019;t obtain, as well as things they are certain do/will obtain:
<table-wrap>
<table>
<tbody>
<tr>
<td valign="top" align="left">(14)</td>
<td valign="top">
<list list-type="simple">
<list-item><p id="P63">a. I want this weekend to last forever (but of course I know it will be over in a few hours) (<xref rid="R21" ref-type="bibr">Heim, 1992</xref>, 199).</p></list-item>
<list-item><p id="P64">b. Wu wants to be promoted (but believes he won&#x2019;t be) [<xref rid="R19" ref-type="bibr">Grano and Phillips-Brown (2022)</xref> inspired by <xref rid="R36" ref-type="bibr">Portner and Rubinstein (2012)</xref>].</p></list-item>
</list>
</td></tr></tbody></table></table-wrap>
<table-wrap>
<table>
<tbody>
<tr>
<td valign="top" align="left">(15)</td>
<td valign="top">
<list list-type="simple">
<list-item><p id="P65">a. I live in Bolivia because I want to live in Bolivia (<xref rid="R23" ref-type="bibr">Iatridou, 2000</xref>).</p></list-item>
<list-item><p id="P66">b. I want it to rain tomorrow (and I believe it will) [<xref rid="R19" ref-type="bibr">Grano and Phillips-Brown (2022)</xref> inspired by <xref rid="R39" ref-type="bibr">Scheffler (2008)</xref>].</p></list-item>
</list></td></tr></tbody></table></table-wrap></p>
<p id="P67">These examples are perfectly felicitous, but they are difficult to account for given standard belief constraints on want ascriptions.<sup><xref rid="fn9" ref-type="fn">9</xref></sup> That said, we still don&#x2019;t think that the examples in (12) and (13) pose a significant challenge for von Fintel&#x2019;s account. For instance, one could maintain that the subject&#x2019;s desire set is a subset of a background modal base, which needn&#x2019;t be identical with their belief set (<xref rid="R38" ref-type="bibr">Rubinstein, 2012</xref>). Furthermore, one could say that when, e.g., (12b) is evaluated, the background modal base shifts so that worlds where I live forever become relevant. Relative to this expanded modal base, von Fintel&#x2019;s account predicts that the conjunction should be false (<xref rid="R19" ref-type="bibr">Grano and Phillips-Brown, 2022</xref>). We think that proponents of von Fintel&#x2019;s semantics would do well to appeal to a modal base shift in order to handle these examples, but we&#x2019;ll leave them to develop this response further. Our central point is that there are significant differences between our puzzles and the examples in (12) and (13). In the first place, all of the relevant prejacents in our puzzles <italic>are</italic> diverse with respect to the subject&#x2019;s beliefs. But even if one isn&#x2019;t inclined to endorse belief constraints on desire reports, we think that however one spells out the dynamics of modal base shift, our puzzles won&#x2019;t be resolved by appealing to such shifts.</p>
</sec>
<sec id="S7">
<label>2.2</label><title><xref rid="R31" ref-type="bibr">Levinson&#x2019;s (2003)</xref> Account</title>
<p id="P68">Now let us consider Levinson&#x2019;s decision-theoretic account of desire reports. On this proposal, the desirability of a proposition for a subject <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M35"><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula> is tied to the <italic>expected value</italic> of this proposition for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M36"><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>. The expected value of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M37"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula> for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M38"><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula> is the utility of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M39"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula> for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M40"><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula> weighted by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M41"><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>&#x2019;s subjective probabilities (<xref rid="R25" ref-type="bibr">Jeffrey, 1965</xref>). More precisely, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M42"><mml:mrow><mml:mo>&#x231C;</mml:mo><mml:mtext>S</mml:mtext></mml:mrow></mml:math></inline-formula> wants <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M43"><mml:mrow><mml:mtext>p</mml:mtext><mml:mo>&#x231D;</mml:mo></mml:mrow></mml:math></inline-formula> is true just in case the expected value of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M44"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>, for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M45"><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>, outweighs the expected value of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M46"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>:<sup><xref rid="fn10" ref-type="fn">10</xref></sup>
<disp-quote id="Q4">
<p id="P69"><bold>Levinson&#x2019;s semantics for <italic>want</italic></bold></p>
<p id="P69a"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M47"><mml:mrow><mml:mo>&#x231C;</mml:mo><mml:mtext>S</mml:mtext></mml:mrow></mml:math></inline-formula> wants <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M48"><mml:mrow><mml:mtext>p</mml:mtext><mml:mo>&#x231D;</mml:mo></mml:mrow></mml:math></inline-formula> is true in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M49"><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:math></inline-formula> iff <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M50"><mml:mrow><mml:mi>E</mml:mi><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x003E;</mml:mo><mml:mi>E</mml:mi><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula></p>
</disp-quote></p>
<p id="P70">Since we think that this account has few plausible responses available to our puzzles, we will be relatively brief here. First, let us suppose that Bill&#x2019;s credences/utilities in the <italic>Coins</italic> scenario are as follows (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M51"><mml:mrow><mml:mn>3</mml:mn><mml:mi>H</mml:mi></mml:mrow></mml:math></inline-formula> denotes the proposition that all three coins land heads, and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M52"><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:math></inline-formula> denotes the proposition that the first coin lands tails):</p>
<p id="P71"><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="phimp.2116-f0001.jpg"/></p>
<p id="P72">To repeat, the 3H-T puzzle concerns the fact that both (1) and (2) are acceptable in the <italic>Coins</italic> scenario, but (3) is not:
<list list-type="simple" id="L16">
<list-item><p id="P73">(1) Bill wants all three coins to land heads.</p></list-item>
<list-item><p id="P74">(2) Bill wants the first coin to land tails.</p></list-item>
<list-item><p id="P75">(3) # Bill wants all three coins to land heads, and he wants the first coin to land tails.</p></list-item>
</list></p>
<p id="P76">A routine calculation confirms that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M53"><mml:mrow><mml:mi>E</mml:mi><mml:mi>V</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>u</mml:mi><mml:mi>l</mml:mi><mml:mi>t</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>e</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>s</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:mo>&#x003E;</mml:mo><mml:mi>E</mml:mi><mml:mi>V</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>u</mml:mi><mml:mi>l</mml:mi><mml:mi>t</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>e</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi></mml:mrow></mml:math></inline-formula>, and that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M54"><mml:mrow><mml:mi>E</mml:mi><mml:mi>V</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:mi>r</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>s</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>i</mml:mi><mml:mi>l</mml:mi><mml:mi>s</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:mo>&#x003E;</mml:mo><mml:mi>E</mml:mi><mml:mi>V</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:mi>r</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>s</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>i</mml:mi><mml:mi>l</mml:mi><mml:mi>s</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>. Thus, this semantics predicts that both (1) and (2) should be true. So given a standard meaning for natural language conjunction, the account predicts that (3) should be true as well. But then it is unclear why this sentence should be unacceptable.</p>
<p id="P78">As for the 3H-<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M55"><mml:mrow><mml:mover accent='true'><mml:mtext>H</mml:mtext><mml:mo>&#x00AF;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula> puzzle, it involves the fact that both (4) and (5) are infelicitous:
<list list-type="simple" id="L17">
<list-item><p id="P79">(4) # Bill wants the first coin to land heads.</p></list-item>
<list-item><p id="P80">(5) # Bill wants all three coins to land heads, but he doesn&#x2019;t want the first coin to land heads.</p></list-item>
</list></p>
<p id="P81">It is easy to show that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M56"><mml:mrow><mml:mi>E</mml:mi><mml:mi>V</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>u</mml:mi><mml:mi>l</mml:mi><mml:mi>t</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>e</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>s</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:mo>&#x003E;</mml:mo><mml:mi>E</mml:mi><mml:mi>V</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>u</mml:mi><mml:mi>l</mml:mi><mml:mi>t</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>e</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>s</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>. So Levinson&#x2019;s account predicts that (4) should be false. Since (1) is predicted to be true, (5) is then predicted to be true as well. So we would expect this conjunction to be acceptable, contrary to observation.<sup><xref rid="fn11" ref-type="fn">11</xref>,<xref rid="fn12" ref-type="fn">12</xref></sup></p>
<p id="P82">It is worth noting that conjunctions that have the form of (5) have been used by proponents of von Fintel&#x2019;s semantics to argue against accounts that invalidate Monotonicity, e.g., Levinson&#x2019;s theory.<sup><xref rid="fn13" ref-type="fn">13</xref></sup> The idea is that if p entails q, then conjunctions of the form <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M57"><mml:mrow><mml:mo>&#x231C;</mml:mo><mml:mtext>S</mml:mtext></mml:mrow></mml:math></inline-formula> wants p, but S doesn&#x2019;t want <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M58"><mml:mrow><mml:mtext>q</mml:mtext><mml:mo>&#x231D;</mml:mo></mml:mrow></mml:math></inline-formula> are always unacceptable. However, such conjunctions can be true on views that reject Monotonicity. So, if Monotonicity-rejecting views are correct, it is unclear why these sentences should be infelicitous. By contrast, accounts that validate Monotonicity can offer a straightforward explanation: such conjunctions are simply false (<xref rid="R15" ref-type="bibr">von Fintel 1999</xref>; <xref rid="R12" ref-type="bibr">Crni&#x010D; 2011</xref>). As should be clear, we think the picture is more complicated than this argument suggests. The real challenge from conjunctions of the form <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M59"><mml:mrow><mml:mo>&#x231C;</mml:mo><mml:mtext>S</mml:mtext></mml:mrow></mml:math></inline-formula> wants p, but S doesn&#x2019;t want <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M60"><mml:mrow><mml:mtext>q</mml:mtext><mml:mo>&#x231D;</mml:mo></mml:mrow></mml:math></inline-formula> (where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M61"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula> entails <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M62"><mml:mrow><mml:mi>q</mml:mi></mml:mrow></mml:math></inline-formula>) arises from the 3H-<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M63"><mml:mrow><mml:mover accent='true'><mml:mtext>H</mml:mtext><mml:mo>&#x00AF;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula> puzzle: it involves cases where <italic>both</italic> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M64"><mml:mrow><mml:mo>&#x231C;</mml:mo><mml:mtext>S</mml:mtext></mml:mrow></mml:math></inline-formula> wants <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M65"><mml:mrow><mml:mtext>q</mml:mtext><mml:mo>&#x231D;</mml:mo></mml:mrow></mml:math></inline-formula> <italic>and</italic> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M66"><mml:mrow><mml:mo>&#x231C;</mml:mo><mml:mtext>S</mml:mtext></mml:mrow></mml:math></inline-formula> wants p, but S doesn&#x2019;t want <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M67"><mml:mrow><mml:mtext>q</mml:mtext><mml:mo>&#x231D;</mml:mo></mml:mrow></mml:math></inline-formula> are unacceptable. As we&#x2019;ve shown, this puzzle poses a problem for Monotonicity-accepters and Monotonicity-deniers alike.</p>
<p id="P83">In this section, we considered how existing accounts fare with respect to our puzzles. Although our survey hasn&#x2019;t been exhaustive, we hope to have provided at least some motivation for thinking that these puzzles are genuine, and are not easily solved by existing theories. In the next section, we will try to explain these phenomena by developing a novel approach to desire reports.</p>
</sec></sec>
<sec id="S9">
<label>3.</label><title>The Meaning of <italic>want</italic></title>
<p id="P84">In this section, we present our positive proposal in several stages. First, we provide a basic entry that captures some of the central features of our account (<xref rid="S10" ref-type="sec">&#x00A7;3.1</xref>). Then we propose a constraint that governs the relationship between the prejacent of want reports and the set of possibilities relevant for the evaluation of these reports (<xref rid="S12" ref-type="sec">&#x00A7;3.2</xref>). Finally, we posit a dominance condition on desire ascriptions (<xref rid="S14" ref-type="sec">&#x00A7;3.3</xref>).</p>
<sec id="S10">
<label>3.1</label><title>The Basic Proposal</title>
<p id="P85">Like von Fintel&#x2019;s account considered in <xref rid="S3" ref-type="sec">&#x00A7;2.1</xref>, we also propose that desire reports are evaluated relative to a subjective preference ordering over a domain of objects. However, one of the key features of our account is that we take this preference ordering to range over <italic>propositions</italic> rather than <italic>worlds</italic>. There are several ways of developing this idea, but we will implement it in a fairly simple way so as not to distract from our central arguments.</p>
<p id="P86">We will say that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M68"><mml:mi mathvariant='script'>A</mml:mi></mml:math></inline-formula> is a set of <italic>alternatives</italic> if it is a set of pairwise incompatible propositions. So, if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M69"><mml:mrow><mml:mi>A</mml:mi><mml:mo>,</mml:mo><mml:mi>B</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant='script'>A</mml:mi></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M70"><mml:mrow><mml:mi>A</mml:mi><mml:mo>&#x2229;</mml:mo><mml:mi>B</mml:mi><mml:mo>=</mml:mo><mml:mo>&#x2205;</mml:mo></mml:mrow></mml:math></inline-formula>. To illustrate, let <sc>ANN</sc>, <sc>MARY</sc>, <sc>PETE</sc>, and <sc>SUE</sc> represent the propositions that Ann wins the race, Mary wins the race, Pete wins the race, and Sue wins the race, respectively. Then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M71"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mfenced close="}" open="{"><mml:mrow><mml:mtext>ANN</mml:mtext><mml:mo>,</mml:mo><mml:mtext>MARY</mml:mtext><mml:mo>,</mml:mo><mml:mtext>PETE</mml:mtext><mml:mo>,</mml:mo><mml:mtext>SUE</mml:mtext></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> is a set of alternatives.</p>
<p id="P87">We propose that the set of objects that is relevant for the evaluation of a desire ascription <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M72"><mml:mrow><mml:mo>&#x231C;</mml:mo><mml:mtext>S</mml:mtext></mml:mrow></mml:math></inline-formula> wants <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M73"><mml:mrow><mml:mtext>p</mml:mtext><mml:mo>&#x231D;</mml:mo></mml:mrow></mml:math></inline-formula> is a set of contextually supplied alternatives.<sup><xref rid="fn14" ref-type="fn">14</xref></sup></p>
<p id="P88">Given a set of alternatives <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M74"><mml:mi mathvariant='script'>A</mml:mi></mml:math></inline-formula> and a world <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M75"><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M76"><mml:mrow><mml:msup><mml:mi mathvariant='script'>O</mml:mi><mml:mrow><mml:mi mathvariant='script'>A</mml:mi><mml:mo>,</mml:mo><mml:mi>w</mml:mi></mml:mrow></mml:msup><mml:mfenced><mml:mo>&#x22C5;</mml:mo></mml:mfenced></mml:mrow></mml:math></inline-formula> is an <italic>ordering function</italic> from individuals to orderings over <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M77"><mml:mi mathvariant='script'>A</mml:mi></mml:math></inline-formula>. It is assumed that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M78"><mml:mrow><mml:msup><mml:mi mathvariant='script'>O</mml:mi><mml:mrow><mml:mi mathvariant='script'>A</mml:mi><mml:mo>,</mml:mo><mml:mi>w</mml:mi></mml:mrow></mml:msup><mml:mfenced><mml:mi>S</mml:mi></mml:mfenced></mml:mrow></mml:math></inline-formula> is a strict partial order. Intuitively, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M79"><mml:mrow><mml:msup><mml:mi mathvariant='script'>O</mml:mi><mml:mrow><mml:mi mathvariant='script'>A</mml:mi><mml:mo>,</mml:mo><mml:mi>w</mml:mi></mml:mrow></mml:msup><mml:mfenced><mml:mi>S</mml:mi></mml:mfenced></mml:mrow></mml:math></inline-formula> represents <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M80"><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>&#x2019;s preference ordering over <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M81"><mml:mi mathvariant='script'>A</mml:mi></mml:math></inline-formula> in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M82"><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:math></inline-formula>, denoted <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M83"><mml:mrow><mml:msub><mml:mo>&#x227B;</mml:mo><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>.<sup><xref rid="fn15" ref-type="fn">15</xref></sup> For instance, Bill&#x2019;s preferences over <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M84"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> are represented below:
<disp-formula id="FD1"><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M19a"><mml:mrow><mml:mtext>ANN</mml:mtext><mml:msub><mml:mo>&#x227B;</mml:mo><mml:mrow><mml:mtext>Bill</mml:mtext></mml:mrow></mml:msub><mml:mtext>MARY</mml:mtext><mml:msub><mml:mo>&#x227B;</mml:mo><mml:mrow><mml:mtext>Bill</mml:mtext></mml:mrow></mml:msub><mml:mtext>PETE</mml:mtext><mml:msub><mml:mo>&#x227B;</mml:mo><mml:mrow><mml:mtext>Bill</mml:mtext></mml:mrow></mml:msub><mml:mtext>SUE</mml:mtext></mml:mrow></mml:math></disp-formula></p>
<p id="P89">We propose that desire reports are evaluated relative to a contextually determined ordering function. Given an ordering <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M85"><mml:mrow><mml:msup><mml:mi mathvariant='script'>O</mml:mi><mml:mrow><mml:mi mathvariant='script'>A</mml:mi><mml:mo>,</mml:mo><mml:mi>w</mml:mi></mml:mrow></mml:msup><mml:mfenced><mml:mi>S</mml:mi></mml:mfenced></mml:mrow></mml:math></inline-formula>, the function <sc>BEST</sc>(<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M86"><mml:mrow><mml:mo>&#x00B7;</mml:mo></mml:mrow></mml:math></inline-formula>) returns the maximal elements in the ordering.<sup><xref rid="fn16" ref-type="fn">16</xref></sup> For instance,<sc>best</sc><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M87"><mml:mrow><mml:mfenced><mml:mrow><mml:msup><mml:mi mathvariant='script'>O</mml:mi><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:msup><mml:mfenced><mml:mrow><mml:mtext>Bill</mml:mtext></mml:mrow></mml:mfenced></mml:mrow></mml:mfenced><mml:mo>=</mml:mo><mml:mtext>ANN</mml:mtext></mml:mrow></mml:math></inline-formula>.<sup><xref rid="fn17" ref-type="fn">17</xref></sup>
<disp-formula id="FD2">
Our first-run account can be expressed as follows:
</disp-formula>
<disp-quote id="Q5">
<p id="P90a"><bold>Account 1</bold></p>
<p id="P90"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M88"><mml:mrow><mml:mo>&#x231C;</mml:mo></mml:mrow></mml:math></inline-formula>S wants p<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M88d"><mml:mrow><mml:mo>&#x231D;</mml:mo></mml:mrow></mml:math> is true relative to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M88b"><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>A</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>O</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> iff for every <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M89"><mml:mrow><mml:mi>q</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mtext>BEST</mml:mtext><mml:mfenced><mml:mrow><mml:msup><mml:mi mathvariant='script'>O</mml:mi><mml:mrow><mml:mi mathvariant='script'>A</mml:mi><mml:mo>,</mml:mo><mml:mi>w</mml:mi></mml:mrow></mml:msup><mml:mfenced><mml:mi>S</mml:mi></mml:mfenced></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>: <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M88a"><mml:mrow><mml:mi>q</mml:mi><mml:mo>&#x2286;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula></inline-formula></p>
</disp-quote></p>
<p id="P91">In short, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M88e"><mml:mrow><mml:mo>&#x231C;</mml:mo></mml:mrow></mml:math></inline-formula>S wants p<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M88f"><mml:mrow><mml:mo>&#x231D;</mml:mo></mml:mrow></mml:math></inline-formula> is true just in case all of the top-ranked alternatives in <italic>S</italic>&#x2019;s preference ordering entail <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M88g"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>.</p>
<p id="P92">To get a feel for how this account works, consider the following example adapted from <xref rid="R31" ref-type="bibr">Levinson (2003)</xref>:
<disp-quote id="Q6">
<p id="P93"><italic>Insurance</italic>: Sue is deciding whether to take out house insurance. She estimates that the chances of her house burning down are <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M90b"><mml:mrow><mml:mstyle scriptlevel='+1'><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mn>1000</mml:mn></mml:mrow></mml:mfrac></mml:mstyle></mml:mrow></mml:math></inline-formula>. But the results would be calamitous: she&#x2019;d lose her home which is valued at <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M90a"><mml:mrow><mml:mi>&#x0024;</mml:mi><mml:mtext>1,&#x00A0;000,&#x00A0;000</mml:mtext></mml:mrow></mml:math></inline-formula>. Comprehensive home insurance would cost her <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M90"><mml:mrow><mml:mi>&#x0024;</mml:mi><mml:mtext>100</mml:mtext></mml:mrow></mml:math></inline-formula>. Sue has a meeting with her insurance broker this afternoon, so she needs to decide what she wants to do.</p>
</disp-quote>
<list list-type="simple" id="L18">
<list-item><p id="P94">(16) Sue wants to buy insurance.</p></list-item>
</list></p>
<p id="P95">If Sue is like most of us, (16) is true: even though she thinks it&#x2019;s likely that her house won&#x2019;t burn down, there is a small possibility that it does, and the badness of this possibility outweighs the cost of buying insurance.</p>
<p id="P96">Examples such as (16) are often taken to pose a problem for accounts that ground the semantic value of desire reports in preference orderings over worlds, e.g., von Fintel&#x2019;s account. Given such an ordering over worlds, the problem is that in order to make (16) come out true, it must be claimed that Sue&#x2019;s most preferred worlds are ones where she buys insurance. But intuitively this isn&#x2019;t the case; it&#x2019;s quite clear that Sue most prefers worlds where she spends no money on insurance (and there&#x2019;s no fire).<sup><xref rid="fn18" ref-type="fn">18</xref></sup> However, alternatives are relatively coarse-grained entities. So, even if there are some <italic>worlds</italic> in an alternative <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M91"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> that are bad by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M92"><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>&#x2019;s lights, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M93"><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula> can still rank <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M94"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> higher than the other alternatives. For instance, let us suppose that the relevant set of alternatives in the <italic>Insurance</italic> scenario is <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M95"><mml:mrow><mml:mi mathvariant='script'>A</mml:mi><mml:mo>=</mml:mo><mml:mfenced close="}" open="{"><mml:mrow><mml:mtext>INSURANCE</mml:mtext><mml:mo>,</mml:mo><mml:mover accent='true'><mml:mrow><mml:mtext>INSURANCE</mml:mtext></mml:mrow><mml:mo stretchy='true'>&#x00AF;</mml:mo></mml:mover></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>, where <sc>INSURANCE</sc> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M96"><mml:mrow><mml:mover accent='true'><mml:mrow><mml:mtext>INSURANCE</mml:mtext></mml:mrow><mml:mo stretchy='true'>&#x00AF;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula> are the propositions that Sue buys insurance, and that she doesn&#x2019;t buy insurance, respectively. Moreover, let us suppose that Sue&#x2019;s preferences over these alternatives look as follows:
<disp-formula id="FD3"><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M27b"><mml:mrow><mml:mtext>INSURANCE</mml:mtext><mml:msub><mml:mo>&#x227B;</mml:mo><mml:mrow><mml:mtext>Sue</mml:mtext></mml:mrow></mml:msub><mml:mover accent='true'><mml:mrow><mml:mtext>INSURANCE</mml:mtext></mml:mrow><mml:mo stretchy='true'>&#x00AF;</mml:mo></mml:mover></mml:mrow></mml:math>
</disp-formula></p>
<p id="P97">In this case, Account 1 predicts that (16) should be true.</p>
<p id="P98">At this point, two natural meta-semantic questions arise for Account 1: (i) how exactly the set of alternatives <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M97"><mml:mi mathvariant='script'>A</mml:mi></mml:math></inline-formula> gets determined in context, and (ii) how the subject&#x2019;s ordering over alternatives <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M98"><mml:mrow><mml:msub><mml:mo>&#x227B;</mml:mo><mml:mi>S</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is structured. We won&#x2019;t be able to provide a complete answer to the first question here. This is obviously an important matter, but it must be left for future work. That said, we will try to show that moving from orderings over worlds to orderings over propositions yields several explanatory benefits. Indeed, such benefits were already displayed by the ease with which Account 1 can handle &#x201C;insurance cases&#x201D; such as (16). So, even though we will leave some meta-semantic details to be filled in, we hope to make it plausible that alternative-sensitivity can do important work in capturing the patterns exhibited by desire reports.<sup><xref rid="fn19" ref-type="fn">19</xref></sup></p>
<p id="P99">As for the second issue concerning how the subject&#x2019;s preference ordering is structured, a useful model treats this ranking as determined by expected value.<sup><xref rid="fn20" ref-type="fn">20</xref></sup> That is, for alternatives <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M99"><mml:mrow><mml:mi>A</mml:mi><mml:mo>,</mml:mo><mml:mtext>&#x2009;</mml:mtext><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula>: <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M100"><mml:mrow><mml:mi>A</mml:mi><mml:msub><mml:mo>&#x227B;</mml:mo><mml:mi>S</mml:mi></mml:msub><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> when <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M90c"><mml:mrow><mml:mi>E</mml:mi><mml:msub><mml:mi>V</mml:mi><mml:mi>S</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>A</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x003E;</mml:mo><mml:mi>E</mml:mi><mml:msub><mml:mi>V</mml:mi><mml:mi>S</mml:mi></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>B</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>
. This would explain why, for example, Sue ranks <sc>INSURANCE</sc> above <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M101"><mml:mrow><mml:mover accent='true'><mml:mrow><mml:mtext>INSURANCE</mml:mtext></mml:mrow><mml:mo stretchy='true'>&#x00AF;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula> in the <italic>Insurance</italic> example. If something like this is correct, then it has interesting consequences for the nature of desire. Theories that analyze desire in terms of subjective preference orderings, and decision-theoretic analyses that tie the desirability of a proposition to its expected value, are often taken to be in competition with each other (<xref rid="R30" ref-type="bibr">Lassiter 2011</xref>; <xref rid="R17" ref-type="bibr">von Fintel 2012</xref>). However, if we opt for a framework in which the ranking over alternatives is determined by decision-theoretic considerations, then this isn&#x2019;t the case. The central elements of both accounts would be needed.</p>
<p id="P100">Now let us see how Account 1 does with our puzzles. To repeat, the 3H-T puzzle concerns the fact that both (1) and (2) are acceptable in the <italic>Coins</italic> scenario, but (3) is not:
<list list-type="simple" id="L19">
<list-item><p id="P101">(1) Bill wants all three coins to land heads.</p></list-item>
<list-item><p id="P102">(2) Bill wants the first coin to land tails.</p></list-item>
<list-item><p id="P103">(3) # Bill wants all three coins to land heads, and he wants the first coin to land tails.</p></list-item>
</list></p>
<p id="P104">We propose that the key to understanding what is going on here is that (1) and (2) are being evaluated relative to different sets of alternatives. More specifically, (1) is evaluated relative to a relatively fine-grained set of alternatives. For instance, one possibility is that this set is <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M102"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>fine</mml:mtext></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfenced close="}" open="{"><mml:mrow><mml:mn>3</mml:mn><mml:mtext>H</mml:mtext><mml:mo>,</mml:mo><mml:mtext>T</mml:mtext><mml:mo>,</mml:mo><mml:mtext>OTHER</mml:mtext></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>, where 3<sc>H</sc> is the proposition that all three coins land heads, <sc>T</sc> is the proposition that the first coin lands tails, and <sc>OTHER</sc> is the proposition that the coins land in any of the remaining configurations. Bill&#x2019;s preferences over <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M103"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>fine</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> are as follows:
<disp-formula id="FD4"><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M34c"><mml:mrow><mml:mn>3</mml:mn><mml:mtext>H</mml:mtext><mml:msub><mml:mo>&#x227B;</mml:mo><mml:mrow><mml:mtext>Bill</mml:mtext></mml:mrow></mml:msub><mml:mtext>T</mml:mtext><mml:msub><mml:mo>&#x227B;</mml:mo><mml:mrow><mml:mtext>Bill</mml:mtext></mml:mrow></mml:msub><mml:mtext>OTHER</mml:mtext></mml:mrow></mml:math>
</disp-formula></p>
<p id="P105">Relative to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M104"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>fine</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, (1) will be true, since 3<sc>H</sc> is preferred to any of the other alternatives.</p>
<p id="P106">By contrast, (2) is evaluated relative to a relatively coarse-grained set of alternatives, e.g., <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M105"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>coarse</mml:mtext></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfenced close="}" open="{"><mml:mrow><mml:mtext>T</mml:mtext><mml:mo>,</mml:mo><mml:mtext>H</mml:mtext></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>, where <sc>H</sc> is the proposition that the first coin lands heads. Bill&#x2019;s preferences over <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M106"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>coarse</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> are as follows:
<disp-formula id="FD5"><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M38d"><mml:mrow><mml:mtext>T</mml:mtext><mml:msub><mml:mo>&#x227B;</mml:mo><mml:mrow><mml:mtext>Bill</mml:mtext></mml:mrow></mml:msub><mml:mtext>H</mml:mtext></mml:mrow></mml:math>
</disp-formula></p>
<p id="P107">Relative to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M107"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>coarse</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, (2) will be true, since <sc>T</sc> is preferred to <sc>H</sc>.</p>
<p id="P108">However, observe that there is no set of alternatives relative to which <italic>both</italic> (1) and (2) are true. Relative to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M108"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>fine</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, (2) is false, since 3<sc>H</sc> doesn&#x2019;t entail <sc>T</sc>. And relative to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M109"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>coarse</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, (1) is false, since <sc>T</sc> doesn&#x2019;t entail 3<sc>H</sc>. So, assuming that both conjuncts in (3) are evaluated relative to the same set of alternatives, Account 1 predicts that this conjunction cannot be true.<sup><xref rid="fn21" ref-type="fn">21</xref></sup></p>
<p id="P109">As for the 3H-<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M110"><mml:mrow><mml:mover accent='true'><mml:mtext>H</mml:mtext><mml:mo>&#x00AF;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula> puzzle, recall that this involves the fact that both and (5) are infelicitous:
<list list-type="simple" id="L20">
<list-item><p id="P110">(4) # Bill wants the first coin to land heads.</p></list-item>
<list-item><p id="P111">(5) # Bill wants all three coins to land heads, but he doesn&#x2019;t want the first coin to land heads.</p></list-item>
</list></p>
<p id="P112">Just as for (2), we suggest that (4) is evaluated relative to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M111"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>coarse</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>. In that case, the report is predicted to be false. And observe that there is no set of alternatives relative to which both conjuncts of (5) are true. Relative to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M112"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>fine</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, (4) is true, since 3<sc>h</sc> entails <sc>h</sc>. And relative to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M113"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>coarse</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, (1) is false, since <sc>t</sc> doesn&#x2019;t entail 3<sc>h</sc>. So, assuming that both conjuncts in (5) are evaluated relative to the same set of alternatives, the conjunction is predicted to be false.</p>
<p id="P113">Account 1 goes a fair way to resolving our puzzles: it predicts that neither (3) nor (5) can be true, which accounts for their unacceptability. But it still leaves some questions unanswered. These are: (a) why should (1) be evaluated relative to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M114"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>fine</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, and (b) why should (2) and (4) be evaluated relative to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M115"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>coarse</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>? We will resolve these issues over the next two subsections.</p>
</sec>
</sec>
<sec id="S12">
<label>3.2</label><title>Representation</title>
<p id="P114">In <xref rid="S3" ref-type="sec">&#x00A7;2.1</xref>, we saw that even if von Fintel&#x2019;s account could somehow allow (2) (&#x2018;Bill wants the first coin to land tails&#x2019;) to be true, it would then predict that the clearly unacceptable (8) should be true:
<list list-type="simple" id="L21">
<list-item><p id="P115">(8) # Bill wants the first coin to land tails, so he wants a result other than three heads.</p></list-item>
</list></p>
<p id="P116">Unfortunately, the same problem arises for Account 1. (2) is true relative to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M116"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>coarse</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, so &#x2018;Bill wants a result other than three heads&#x2019; should also be true relative to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M117"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>coarse</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, since <sc>t</sc> entails that the coins land in a pattern other than three heads.</p>
<p id="P117">Intuitively, what goes wrong with (8) is that the proposition <italic>the result is other than three heads</italic> makes salient certain distinctions that are not in play when we are evaluating the first conjunct, i.e., (2). Put another way, when we hear (2) as true, we are &#x201C;backgrounding&#x201D; the outcome where all the coins land heads. We can make this more precise through the following definition. Given a set of alternatives <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M118"><mml:mi mathvariant='script'>A</mml:mi></mml:math></inline-formula> and proposition <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M119"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>, let us say that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M120"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula> is <italic>represented by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M121"><mml:mi mathvariant='script'>A</mml:mi></mml:math></inline-formula></italic> just in case every alternative in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M122"><mml:mi mathvariant='script'>A</mml:mi></mml:math></inline-formula> either entails <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M123"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula> or entails <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M124"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>.<sup><xref rid="fn22" ref-type="fn">22</xref></sup> For instance, the proposition that the first coin lands tails is represented by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M125"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>coarse</mml:mtext></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfenced close="}" open="{"><mml:mrow><mml:mtext>T</mml:mtext><mml:mo>,</mml:mo><mml:mtext>H</mml:mtext></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>, but the proposition that the outcome is other than three heads is not, since <sc>h</sc> neither entails this proposition nor its negation.</p>
<p id="P118">We propose adding a representation requirement to the semantics of desire reports. More precisely, we will include this as a definedness condition on desire ascriptions.<sup><xref rid="fn23" ref-type="fn">23</xref></sup> The account then looks as follows:
<disp-quote id="Q7">
<p id="S13"><bold>Account 2</bold></p>
<p id="P119"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M126"><mml:mrow><mml:mo>&#x231C;</mml:mo><mml:mtext>S</mml:mtext></mml:mrow></mml:math></inline-formula> wants <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M127"><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#x231D;</mml:mo></mml:mrow></mml:math></inline-formula> is defined relative to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M128"><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>A</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>O</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> only if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M129"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula> is represented by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M130"><mml:mi mathvariant='script'>A</mml:mi></mml:math></inline-formula> If defined, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M131"><mml:mrow><mml:mo>&#x231C;</mml:mo><mml:mtext>S</mml:mtext></mml:mrow></mml:math></inline-formula> wants <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M132"><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#x231D;</mml:mo></mml:mrow></mml:math></inline-formula> is true relative to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M133"><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>A</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>O</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> iff for every <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M134"><mml:mrow><mml:mi>q</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mtext>BEST</mml:mtext><mml:mfenced><mml:mrow><mml:msup><mml:mi mathvariant='script'>O</mml:mi><mml:mrow><mml:mi mathvariant='script'>A</mml:mi><mml:mo>,</mml:mo><mml:mi>w</mml:mi></mml:mrow></mml:msup><mml:mfenced><mml:mi>S</mml:mi></mml:mfenced></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>: <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M135"><mml:mrow><mml:mi>q</mml:mi><mml:mo>&#x2286;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula></p>
</disp-quote></p>
<p id="P120">Account 2 explains why (1) is evaluated relative to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M136"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>fine</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> so long as we take on board the following widely accepted principle: hearers tend to interpret sentences so as to avoid presupposition failure. That is, within reasonable limits, hearers will make the assumptions necessary to avoid undefinedness.<sup><xref rid="fn24" ref-type="fn">24</xref></sup> For instance, even if I suspect that you have no siblings, I will come to assume that you have a sister once I&#x2019;ve heard you utter (17):
<list list-type="simple" id="L22">
<list-item><p id="P121">(17) I have to fetch my sister from the airport tomorrow.</p></list-item>
</list></p>
<p id="P122">That is, the presupposition triggered by the possessive &#x2018;my sister&#x2019;, namely that I have a sister, is taken to hold when evaluating (17).</p>
<p id="P123">To repeat, we are supposing that there are two relevant sets of alternatives in the <italic>Coins</italic> scenario, namely <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M137"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>coarse</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M138"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>fine</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>. (1) fails to be defined relative to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M139"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>coarse</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, since the proposition <italic>All three coins land heads</italic> isn&#x2019;t represented by this set of alternatives. But (1) <italic>is</italic> defined relative to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M140"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>fine</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>. Assuming that hearers will try to avoid interpretations that result in presupposition failure, they will then be moved to evaluate (1) relative to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M141"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>fine</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> rather than <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M142"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>coarse</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>. This is exactly the result that we wanted.</p>
<p id="P124">We can also explain why (2) should sound true. Even though the proposition <italic>The first coin lands tails</italic> is represented by both <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M143"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>coarse</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M144"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>fine</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, there is an important difference between these two sets of alternatives. (2) is true relative to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M145"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>coarse</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, but false relative to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M146"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>fine</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>. So, assuming that hearers generally tend to interpret speakers in a way that makes their utterances come out true&#x2014;the so-called &#x201C;principle of charity&#x201D;&#x2014;we would expect there to be a tendency to evaluate context-sensitive expressions relative to parameters which make the speaker&#x2019;s assertions true.<sup><xref rid="fn25" ref-type="fn">25</xref></sup> In particular, then, by default we should expect (2) to be evaluated relative to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M147"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>coarse</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> rather than <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M148"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>fine</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>.</p>
<p id="P125">However, the representation requirement and the principle of charity still don&#x2019;t explain why (4) should be evaluated relative to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M149"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>coarse</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> rather than <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M150"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>fine</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>. After all, <italic>The first coin lands heads</italic> is represented by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M151"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>fine</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>. Moreover, (4) actually comes out true relative to this set of alternatives. So, a different sort of explanation is needed to explain why the report sounds bad. We turn to this next.</p>
</sec>
<sec id="S14">
<label>3.3</label><title>Dominance</title>
<p id="P126">What is crucial to providing a complete solution to our puzzles, we suggest, is recognizing that desire reports carry a <italic>dominance requirement</italic>. We introduce this idea in two stages. We begin by discussing a fairly simple condition but raise some problems for it. Then we present a more sophisticated notion of dominance.</p>
<p id="P127">On the semantics from <xref rid="S12" ref-type="sec">&#x00A7;3.2</xref>, if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M152"><mml:mrow><mml:mo>&#x231C;</mml:mo><mml:mtext>S</mml:mtext></mml:mrow></mml:math></inline-formula> wants <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M153"><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#x231D;</mml:mo></mml:mrow></mml:math></inline-formula> is defined, then all that matters for its semantic value is whether or not all of the top-ranked alternatives entail <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M154"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>. But we could require something stronger. We could require not just that every top-ranked alternative entails <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M155"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>, but that every <italic>p</italic>-entailing alternative outranks every <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M156"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>-entailing alternative. When this happens, let us say that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M157"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula><italic>dominates</italic> (with respect to the background parameters):
<disp-quote id="Q8">
<p id="P128"><bold>Dominance</bold></p>
<p id="P128a">Given a set of alternatives <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M158"><mml:mi mathvariant='script'>A</mml:mi></mml:math></inline-formula>, ordering <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M159"><mml:mrow><mml:mo>&#x227B;</mml:mo></mml:mrow></mml:math></inline-formula> over <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M160"><mml:mi mathvariant='script'>A</mml:mi></mml:math></inline-formula>, and proposition <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M160a"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M161"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula> dominates iff for every <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M162"><mml:mrow><mml:mi>q</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant='script'>A</mml:mi></mml:mrow></mml:math></inline-formula> such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M163"><mml:mrow><mml:mi>q</mml:mi></mml:mrow></mml:math></inline-formula> &#x2286; <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M164"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>, and every <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M165"><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant='script'>A</mml:mi></mml:mrow></mml:math></inline-formula> such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M166"><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x2286;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>: <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M167"><mml:mrow><mml:mi>q</mml:mi><mml:mo>&#x227B;</mml:mo><mml:mi>r</mml:mi></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote></p>
<p id="P129">One could add a dominance requirement to our semantics from <xref rid="S12" ref-type="sec">&#x00A7;3.2</xref>. More specifically, it could be imposed as an additional presupposition or definedness condition triggered by desire reports. This yields the following entry:
<disp-quote id="Q9">
<p id="S13a"><bold>Account 3</bold></p>
<p id="P130"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M168"><mml:mrow><mml:mo>&#x231C;</mml:mo><mml:mtext>S</mml:mtext></mml:mrow></mml:math></inline-formula> wants <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M169"><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#x231D;</mml:mo></mml:mrow></mml:math></inline-formula> is defined relative to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M170"><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>A</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>O</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> only if
<list list-type="roman-lower" id="L23">
<list-item><p id="P131"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M171"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula> is represented by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M172"><mml:mi mathvariant='script'>A</mml:mi></mml:math></inline-formula>; and</p></list-item>
<list-item><p id="P132"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M173"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula> dominates</p></list-item>
</list></p>
<p id="P133">If defined, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M174"><mml:mrow><mml:mo>&#x231C;</mml:mo><mml:mtext>S</mml:mtext></mml:mrow></mml:math></inline-formula> wants <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M175"><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#x231D;</mml:mo></mml:mrow></mml:math></inline-formula> is true relative to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M176"><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>A</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>O</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> iff for every <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M177"><mml:mrow><mml:mi>q</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mtext>BEST</mml:mtext><mml:mfenced><mml:mrow><mml:msup><mml:mi mathvariant='script'>O</mml:mi><mml:mrow><mml:mi mathvariant='script'>A</mml:mi><mml:mo>,</mml:mo><mml:mi>w</mml:mi></mml:mrow></mml:msup><mml:mfenced><mml:mi>S</mml:mi></mml:mfenced></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>: <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M178"><mml:mrow><mml:mi>q</mml:mi><mml:mo>&#x2286;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula></p>
</disp-quote></p>
<p id="P134">This semantics explains why (4) should be unacceptable. Recall that Bill&#x2019;s preference ordering over <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M179"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>coarse</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> looks as follows:
<disp-formula id="FD6"><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M83d"><mml:mrow><mml:mtext>T</mml:mtext><mml:msub><mml:mo>&#x227B;</mml:mo><mml:mrow><mml:mtext>Bill</mml:mtext></mml:mrow></mml:msub><mml:mtext>H</mml:mtext></mml:mrow></mml:math>
</disp-formula></p>
<p id="P135">While Bill&#x2019;s preferences over <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M180"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>fine</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> are:
<disp-formula id="FD7"><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M85f"><mml:mrow><mml:mn>3</mml:mn><mml:mtext>H</mml:mtext><mml:msub><mml:mo>&#x227B;</mml:mo><mml:mrow><mml:mtext>Bill</mml:mtext></mml:mrow></mml:msub><mml:mtext>T</mml:mtext><mml:msub><mml:mo>&#x227B;</mml:mo><mml:mrow><mml:mtext>Bill</mml:mtext></mml:mrow></mml:msub><mml:mtext>OTHER</mml:mtext></mml:mrow></mml:math>
</disp-formula></p>
<p id="P136">It is easy to see that the proposition <italic>The first coin lands heads</italic> dominates on neither <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M181"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>coarse</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> nor <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M182"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>fine</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>.<sup><xref rid="fn26" ref-type="fn">26</xref></sup> In particular, o<sc>ther</sc> entails that the first coin lands heads, but this alternative is ranked below <sc>t</sc> in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M183"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>fine</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>. Thus, Account 3 predicts that (4) should suffer from presupposition failure when evaluated relative to either <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M184"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>coarse</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> or <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M185"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>fine</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>.</p>
<p id="P137">Although Account 3 captures the infelicity of (4), this entry isn&#x2019;t quite right. One problem is that it generates problematic truth-conditions for negated desire reports. To bring this out, consider the following scenario:
<disp-quote id="Q9a">
<p id="P138"><italic>Dinner</italic>: I&#x2019;m meeting my friend for dinner. There are three items on the menu: spaghetti bolognese, lasagna, and chicken. I&#x2019;m going to be late, so my friend&#x2014;who has no idea about my preferences&#x2014;is going to order for me. Given my past experience, I like the spaghetti most, I find the chicken to be average, and I hate the lasagna.</p>
</disp-quote></p>
<list list-type="simple" id="L24">
<list-item><p id="P139">(18) I don&#x2019;t want my friend to order chicken for me.</p></list-item>
</list>
<p id="P140">18 is perfectly acceptable. However, Account 3 predicts that the report should suffer from presupposition failure on the most natural set of alternatives. The relevant set of alternatives is <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M186"><mml:mrow><mml:mi mathvariant='script'>A</mml:mi><mml:mo>=</mml:mo><mml:mfenced close="}" open="{"><mml:mrow><mml:mtext>SPAGHETTI</mml:mtext><mml:mo>,</mml:mo><mml:mtext>LASAGNA</mml:mtext><mml:mo>,</mml:mo><mml:mtext>CHICKEN</mml:mtext></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>, where SP<sc>AGHETTI</sc> is the proposition that my friend orders spaghetti for me, L<sc>A</sc>S<sc>AG</sc>N<sc>A</sc> is the proposition that my friend orders lasagna for me, etc. My preferences look as follows:
<disp-formula id="FD8"><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M92g"><mml:mrow><mml:mtext>SPAGHETTI</mml:mtext><mml:msub><mml:mo>&#x227B;</mml:mo><mml:mrow><mml:mtext>Me</mml:mtext></mml:mrow></mml:msub><mml:mtext>CHICKEN</mml:mtext><mml:msub><mml:mo>&#x227B;</mml:mo><mml:mrow><mml:mtext>Me</mml:mtext></mml:mrow></mml:msub><mml:mtext>LASAGNA</mml:mtext></mml:mrow></mml:math>
</disp-formula></p>
<p id="P141">Note that C<sc>HI</sc>CK<sc>E</sc>N fails to dominate on this set of alternatives. Now, one feature of presuppositions is that they project from certain embedded environments, namely negation.<sup><xref rid="fn27" ref-type="fn">27</xref></sup> Thus, on Account 3 the negated report (18) also presupposes that C<sc>HI</sc>CK<sc>E</sc>N dominates. So, given that this presupposition is not satisfied, and cannot be accommodated, (18) is predicted to be unacceptable.<sup><xref rid="fn28" ref-type="fn">28</xref></sup></p>
<p id="P142">Some might be tempted to respond by making the dominance condition a regular entailment of desire reports rather than a presupposition. But this would make it too easy for these ascriptions to be false. For instance, consider (19) in the <italic>Dinner</italic> scenario:
<list list-type="simple" id="L25">
<list-item><p id="P143">(19) I don&#x2019;t want my friend to order pasta for me.</p></list-item>
</list></p>
<p id="P144">The account we are considering predicts that regardless of the relative expected value of pasta and chicken, (19) should have a true reading. In particular, it incorrectly predicts that (19) should have a true reading in contexts where the expected value of pasta is greater than the expected value of chicken.<sup><xref rid="fn29" ref-type="fn">29</xref></sup> For if the dominance requirement was a regular entailment, then &#x2018;I want my friend to order pasta for me&#x2019; would simply be false on the natural set of alternatives, since both SP<sc>AGHETTI</sc> and L<sc>A</sc>S<sc>AG</sc>N<sc>A</sc> entail that my friend orders pasta for me, and C<sc>HI</sc>CK<sc>E</sc>N entails that my friend does not order pasta for me. But then would be true on the natural set of alternatives.</p>
<p id="P145">Instead, we suggest responding by weakening the dominance condition. Intuitively, we want dominance to take effect in a report such as (4), but not in a report such as (18). One way of achieving this is by appealing to a <italic>conditional</italic> version of dominance which only requires that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M90d"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula> dominates if there is some top-ranked <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M90e"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>-entailing alternative. More precisely (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M90f"><mml:mrow><mml:mo>&#x2018;</mml:mo><mml:mo>&#x21D2;</mml:mo><mml:mo>&#x2019;</mml:mo></mml:mrow></mml:math></inline-formula> denotes the material conditional):
<disp-quote id="Q10">
<p id="P146"><bold>Conditional dominance</bold></p>
<p id="P146a">Given a set of alternatives <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M187"><mml:mi mathvariant='script'>A</mml:mi></mml:math></inline-formula>, ordering &#x227B; over <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M188"><mml:mi mathvariant='script'>A</mml:mi></mml:math></inline-formula>, and proposition <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M90g"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M90h"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula> conditionally dominates iff there is some <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M90j"><mml:mrow><mml:mi>q</mml:mi></mml:mrow></mml:math></inline-formula> &#x2208; <sc>BE</sc>S<sc>T</sc>(&#x227B;) such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M90i"><mml:mrow><mml:mi>q</mml:mi></mml:mrow></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M90k"><mml:mrow><mml:mi>q</mml:mi><mml:mo>&#x2286;</mml:mo><mml:mi>p</mml:mi><mml:mo>&#x21D2;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula> dominates.</p>
</disp-quote></p>
<p id="P147">Our final entry is the following:<sup><xref rid="fn30" ref-type="fn">30</xref></sup>
<disp-quote id="Q11">
<title><bold>Meaning of <italic>want</italic></bold></title>
<p id="P148">&#x231C;S wants p&#x231D; is defined relative to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M189"><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>A</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>O</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> only if
<list list-type="roman-lower" id="L26">
<list-item><p id="P149"><italic>p</italic> is represented by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M190"><mml:mi mathvariant='script'>A</mml:mi></mml:math></inline-formula>; and</p></list-item>
<list-item><p id="P150"><italic>p</italic> conditionally dominates</p></list-item>
</list></p>
<p id="P151">If defined, &#x231C;S wants p&#x231D; is true relative to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M191"><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>A</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>O</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> iff for every <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M192"><mml:mrow><mml:mi>q</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mtext>BEST</mml:mtext><mml:mfenced><mml:mrow><mml:msup><mml:mi mathvariant='script'>O</mml:mi><mml:mrow><mml:mi mathvariant='script'>A</mml:mi><mml:mo>,</mml:mo><mml:mi>w</mml:mi></mml:mrow></mml:msup><mml:mfenced><mml:mi>S</mml:mi></mml:mfenced></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>: <italic>q</italic> &#x2286; <italic>p</italic></p>
</disp-quote></p>
<p id="P152">This semantics also explains why (4) (&#x2018;Bill wants the first coin to land heads&#x2019;) is unacceptable in the <italic>Coins</italic> scenario. The proposition <italic>The first coin lands heads</italic> (trivially) conditionally dominates on <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M193"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>coarse</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, since <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M194"><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:math></inline-formula> is top-ranked. But this means that the report is straightforwardly false on this set of alternatives. By contrast, the proposition <italic>The first coin lands heads</italic> does not conditionally dominate on <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M195"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>fine</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, since <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M196"><mml:mrow><mml:mn>3</mml:mn><mml:mtext>H</mml:mtext></mml:mrow></mml:math></inline-formula> is top-ranked and entails that the first coin lands heads. Thus, (4) is predicted to be infelicitous on either set of alternatives. Overall, this entry explains all of the key data points undergirding our central puzzles. Moreover, it correctly predicts that (18) should be true in the <italic>Dinner</italic> scenario, on the natural set of alternatives. For the proposition <italic>My friend orders chicken for me</italic> (trivially) conditionally dominates given that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M197"><mml:mrow><mml:mrow><mml:mtext>SPAGHETTI</mml:mtext></mml:mrow></mml:mrow></mml:math></inline-formula> is top-ranked.</p>
<p id="P153">Some might worry that imposing a conditional dominance constraint still yields a semantics that is too strict. For instance, consider (20) in the <italic>Dinner</italic> scenario:
<list list-type="simple" id="L27">
<list-item><p id="P154">(20) I want my friend to order a pasta dish for me.</p></list-item>
</list></p>
<p id="P155">(20) sounds true, but our view seems to predict that it should be unacceptable. The worry is that the proposition <italic>My friend orders a pasta dish for me</italic> doesn&#x2019;t conditionally dominate on <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M198"><mml:mrow><mml:mi mathvariant='script'>A</mml:mi><mml:mo>=</mml:mo><mml:mfenced close="}" open="{"><mml:mrow><mml:mtext>SPAGHETTI</mml:mtext><mml:mo>,</mml:mo><mml:mtext>LASAGNA</mml:mtext><mml:mo>,</mml:mo><mml:mtext>CHICKEN</mml:mtext></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>. Moreover, maintaining that the report is evaluated relative to the coarse-grained set of alternatives <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M199"><mml:mrow><mml:mi mathvariant='script'>B</mml:mi><mml:mo>=</mml:mo><mml:mfenced close="}" open="{"><mml:mrow><mml:mtext>PASTA</mml:mtext><mml:mo>,</mml:mo><mml:mtext>CHICKEN</mml:mtext></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> doesn&#x2019;t help. For we can suppose that the expected value of P<sc>A</sc>S<sc>TA</sc> is less than or equal to the expected value of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M200"><mml:mrow><mml:mrow><mml:mtext>CHICKEN</mml:mtext></mml:mrow></mml:mrow></mml:math></inline-formula>. In this case, we would predict that (20) should be false on <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M201"><mml:mi mathvariant='script'>B</mml:mi></mml:math></inline-formula>.</p>
<p id="P156">In response, we maintain that the felicity of (20) can be traced to an ambiguity in the interpretation of indefinite descriptions. Sometimes these expressions can be read &#x201C;specifically&#x201D;, and concern particular objects or individuals.<sup><xref rid="fn31" ref-type="fn">31</xref></sup> We think that this is exactly what&#x2019;s happening with &#x2018;a pasta dish&#x2019; in (20). One simple way to capture this is to assume that the indefinite in (20) takes wide-scope at the level of logical form:
<list list-type="simple" id="L28">
<list-item><p id="P157">(21) There is a particular pasta dish <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M202"><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:math></inline-formula> such that I want my friend to order <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M203"><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:math></inline-formula> for me.</p></list-item>
</list></p>
<p id="P158">Assuming that the particular dish here is spaghetti, the prejacent is verified by the proposition <italic>My friend orders spaghetti for me</italic>. And this proposition <italic>does</italic> conditionally dominate on <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M204"><mml:mi mathvariant='script'>A</mml:mi></mml:math></inline-formula>. So in this case (20) is predicted to be true. That this account of (20) is on the right track is suggested by the fact that minimal variants which do not feature indefinites are easily heard as unacceptable:<sup><xref rid="fn32" ref-type="fn">32</xref></sup>
<list list-type="simple" id="L29">
<list-item><p id="P159">(22) I want my friend to order pasta for me.</p></list-item>
</list></p>
<p id="P160">A natural response to (22) would be &#x2018;But what if your friend orders lasagna for you, which you hate?!&#x2019;. This contrast is quite striking, and further confirms the general shape of our account.<sup><xref rid="fn33" ref-type="fn">33</xref></sup></p>
<p id="P161">It is worth drawing out several further features of our entry. First, our semantics makes some interesting predictions in cases where two or more alternatives are tied best. For example, suppose that Paris and Rome are your two favorite holiday destinations. You&#x2019;d be thrilled to go to either, but don&#x2019;t prefer one over the other. In this context, both (23a) and (23b) are unacceptable:
<table-wrap>
<table>
<tbody>
<tr>
<td valign="top" align="left">(23)</td>
<td valign="top">
<list list-type="simple">
<list-item><p id="P162">a. # I don&#x2019;t want to go to Paris.</p></list-item>
<list-item><p id="P163">b. # I don&#x2019;t want to go to Rome.</p></list-item>
</list></td></tr></tbody></table></table-wrap></p>
<p id="P164">Let us suppose that the relevant set of alternatives is <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M205"><mml:mrow><mml:mi mathvariant='script'>A</mml:mi><mml:mo>=</mml:mo><mml:mfenced close="}" open="{"><mml:mrow><mml:mtext>PARIS</mml:mtext><mml:mo>,</mml:mo><mml:mtext>ROME</mml:mtext></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>, where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M206"><mml:mrow><mml:mrow><mml:mtext>PARIS</mml:mtext></mml:mrow></mml:mrow></mml:math></inline-formula> is the proposition that I holiday in Paris, and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M207"><mml:mrow><mml:mrow><mml:mtext>ROME</mml:mtext></mml:mrow></mml:mrow></mml:math></inline-formula> is the proposition that I holiday in Rome. Then neither alternative conditionally dominates on <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M208"><mml:mi mathvariant='script'>A</mml:mi></mml:math></inline-formula>, and we predict that both reports will be undefined.<sup><xref rid="fn34" ref-type="fn">34</xref></sup></p>
<p id="P165">Second, our account goes some way to explaining an observation by <xref rid="R12" ref-type="bibr">Crni&#x010D; (2011</xref>, 166) to the effect that disjunctions in the scope of desire reports give rise to an &#x201C;acceptability inference&#x201D; regarding both disjuncts. For instance, neither (24a) nor (24b) are felicitous:
<table-wrap>
<table>
<tbody>
<tr>
<td valign="top" align="left">(24)</td>
<td valign="top">
<list list-type="simple">
<list-item><p id="P166">a. # Bill wants Ann or Mary to win but he wants Ann to lose.</p></list-item>
<list-item><p id="P167">b. # Bill wants Ann or Mary to win but he wants Mary to lose.</p></list-item>
</list></td></tr></tbody></table></table-wrap></p>
<p id="P168">We can explain this so long as we assume that these reports are being evaluated relative to something like <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M209"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mfenced close="}" open="{"><mml:mrow><mml:mtext>ANN</mml:mtext><mml:mo>,</mml:mo><mml:mtext>MARY</mml:mtext><mml:mo>,</mml:mo><mml:mtext>PETE</mml:mtext><mml:mo>,</mml:mo><mml:mtext>SUE</mml:mtext></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>, where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M210"><mml:mrow><mml:mrow><mml:mtext>ANN</mml:mtext></mml:mrow></mml:mrow></mml:math></inline-formula> is the proposition that Ann wins, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M211"><mml:mrow><mml:mrow><mml:mtext>MARY</mml:mtext></mml:mrow></mml:mrow></mml:math></inline-formula> is the proposition that Mary wins, etc.<sup><xref rid="fn35" ref-type="fn">35</xref></sup> Then, if the first conjunct in (24a) is true, the conditional dominance condition will require (i) that both <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M212"><mml:mrow><mml:mrow><mml:mtext>ANN</mml:mtext></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M213"><mml:mrow><mml:mrow><mml:mtext>MARY</mml:mtext></mml:mrow></mml:mrow></mml:math></inline-formula> are the best alternatives, or (ii) that the relative ranking of the alternatives is <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M214"><mml:mrow><mml:mrow><mml:mtext>MARY</mml:mtext></mml:mrow></mml:mrow></mml:math></inline-formula> &#x227B; <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M215"><mml:mrow><mml:mrow><mml:mtext>ANN</mml:mtext></mml:mrow></mml:mrow></mml:math></inline-formula> &#x227B; <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M216"><mml:mrow><mml:mrow><mml:mtext>PETE</mml:mtext></mml:mrow></mml:mrow></mml:math></inline-formula>, or (iii) that the relative ranking of the alternatives is <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M217"><mml:mrow><mml:mrow><mml:mtext>ANN&#x00A0;</mml:mtext><mml:mo>&#x227B;</mml:mo><mml:mtext>MARY&#x00A0;</mml:mtext><mml:mo>&#x227B;</mml:mo><mml:mtext>PETE</mml:mtext></mml:mrow></mml:mrow></mml:math></inline-formula>. If (i) or (ii) hold, then the second conjunct in (24a) will be undefined, since the proposition <italic>Ann loses</italic> will fail to conditionally dominate. And if (iii) holds, then the second conjunct in (24a) will be false. A similar explanation can be given of the unacceptability of (24b).</p>
<p id="P169">Finally, it is helpful to compare our conditional dominance condition with a feature proposed by Gajewski (2007) and Kri&#x017E; (2015). These authors aim to explain why &#x2018;want&#x2019; is a so-called &#x201C;neg-raiser&#x201D;. This is the phenomenon whereby negated want reports are interpreted with negation taking narrow scope with respect to &#x2018;want&#x2019;, i.e., <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M218"><mml:mrow><mml:mo>&#x231C;</mml:mo></mml:mrow></mml:math></inline-formula>(S wants p)<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M219"><mml:mrow><mml:mo>&#x231D;</mml:mo></mml:mrow></mml:math></inline-formula> is interpreted as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M220"><mml:mrow><mml:mo>&#x231C;</mml:mo><mml:mtext>S</mml:mtext></mml:mrow></mml:math></inline-formula> wants <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M221"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>p</mml:mi><mml:mo>&#x231D;</mml:mo></mml:mrow></mml:math></inline-formula> (<xref rid="R11" ref-type="bibr">Collins and Postal, 2014</xref>). For instance, an utterance of (25a) is felt to be equivalent to (26b):
<table-wrap>
<table>
<tbody>
<tr>
<td valign="top" align="left">(25)</td>
<td valign="top">
<list list-type="simple">
<list-item><p id="P170">a. Bill doesn&#x2019;t want Pete to win.</p></list-item>
<list-item><p id="P171">b. Bill wants Pete to lose.</p></list-item>
</list></td></tr></tbody></table></table-wrap></p>
<p id="P172">To explain this, Gajewski and Kri&#x017E; propose a definedness condition on desire reports which, in our framework, can be stated as follows:<sup><xref rid="fn36" ref-type="fn">36</xref></sup>
<disp-quote id="Q12">
<p id="P173a"><bold>Gajewski and Kri&#x017E;&#x2019;s definedness condition for <italic>S</italic> wants <italic>p</italic></bold></p>
<p id="P173">&#x231C;S wants p&#x231D; is defined relative to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M222"><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>A</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>O</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> only if (i) every top-ranked alternative in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M223"><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>&#x2019;s preference ordering entails <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M224"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>, or (ii) every top-ranked alternative in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M225"><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>&#x2019;s preference ordering entails &#x00AC;<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M226"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote></p>
<p id="P174">To see how this works, suppose that (25a) is evaluated relative to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M227"><mml:mrow><mml:mi mathvariant='script'>A</mml:mi><mml:mo>=</mml:mo><mml:mfenced close="}" open="{"><mml:mrow><mml:mtext>WIN</mml:mtext><mml:mo>,</mml:mo><mml:mtext>LOSE</mml:mtext></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>, where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M228"><mml:mrow><mml:mrow><mml:mtext>WIN</mml:mtext></mml:mrow></mml:mrow></mml:math></inline-formula> is the proposition that Pete wins, and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M229"><mml:mrow><mml:mrow><mml:mtext>LOSE</mml:mtext></mml:mrow></mml:mrow></mml:math></inline-formula> is the proposition that Pete loses. Then if (25a) is true, it can&#x2019;t be that Bill ranks <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M230"><mml:mrow><mml:mrow><mml:mtext>WIN</mml:mtext></mml:mrow></mml:mrow></mml:math></inline-formula> above <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M231"><mml:mrow><mml:mrow><mml:mtext>LOSE</mml:mtext></mml:mrow></mml:mrow></mml:math></inline-formula>. Moreover, given Gajewski and Kri&#x017E;&#x2019;s condition, it can&#x2019;t be that Bill is indifferent between these two outcomes, i.e., that both <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M232"><mml:mrow><mml:mrow><mml:mtext>WIN</mml:mtext></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M233"><mml:mrow><mml:mrow><mml:mtext>LOSE</mml:mtext></mml:mrow></mml:mrow></mml:math></inline-formula> are equally top-ranked. Thus, it must be that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M234"><mml:mrow><mml:mrow><mml:mtext>LOSE</mml:mtext></mml:mrow></mml:mrow></mml:math></inline-formula> is ranked above <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M235"><mml:mrow><mml:mrow><mml:mtext>WIN</mml:mtext></mml:mrow></mml:mrow></mml:math></inline-formula>, and so (26b) is true.</p>
<p id="P175">Note that Gajewski and Kri&#x017E;&#x2019;s condition doesn&#x2019;t help to resolve our puzzles. For example, it doesn&#x2019;t predict that (4) (&#x2018;Bill wants the first coin to land heads&#x2019;) should be evaluated relative to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M236"><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mrow><mml:mtext>coarse</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>. On the other hand, we think that conditional dominance could provide some insight into the phenomenon of neg-raising. For one thing, our account also predicts that (25a) and (26b) should be equivalent relative to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M237"><mml:mrow><mml:mi mathvariant='script'>A</mml:mi><mml:mo>=</mml:mo><mml:mfenced close="}" open="{"><mml:mrow><mml:mtext>WIN</mml:mtext><mml:mo>,</mml:mo><mml:mtext>LOSE</mml:mtext></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>. For if (25a) is true, then the proposition <italic>Pete wins</italic> must conditionally dominate on <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M238"><mml:mi mathvariant='script'>A</mml:mi></mml:math></inline-formula>. But this means that Bill can&#x2019;t be indifferent between <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M239"><mml:mrow><mml:mrow><mml:mtext>WIN</mml:mtext></mml:mrow></mml:mrow></mml:math></inline-formula> and LOS<sc>E</sc>. So, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M240"><mml:mrow><mml:mrow><mml:mtext>LOSE</mml:mtext></mml:mrow></mml:mrow></mml:math></inline-formula> must be ranked above <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M241"><mml:mrow><mml:mrow><mml:mtext>WIN</mml:mtext></mml:mrow></mml:mrow></mml:math></inline-formula>, and (26b) must be true.</p>
<p id="P176">But our theory also predicts that the neg-raising inference should fail to go through in certain contexts, and that in these contexts <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M242"><mml:mrow><mml:mo>&#x231C;</mml:mo><mml:mo>&#x00AC;</mml:mo></mml:mrow></mml:math></inline-formula>(S wants p)<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M243"><mml:mrow><mml:mo>&#x231D;</mml:mo></mml:mrow></mml:math></inline-formula> should be distinguishable from <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M244"><mml:mrow><mml:mo>&#x231C;</mml:mo><mml:mtext>S</mml:mtext></mml:mrow></mml:math></inline-formula> wants <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M245"><mml:mrow><mml:mo>&#x00AC;</mml:mo></mml:mrow></mml:math></inline-formula>p<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M246"><mml:mrow><mml:mo>&#x231D;</mml:mo></mml:mrow></mml:math></inline-formula>. There is evidence that this is a good prediction:
<disp-quote id="Q13">
<p id="P177"><italic>Coins 2</italic>: Two fair coins will be flipped, and Bill&#x2019;s reckless brother has made the following bet on Bill&#x2019;s behalf: if both coins land heads (HH), Bill will gain <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M247"><mml:mrow><mml:mtext>$100</mml:mtext></mml:mrow></mml:math></inline-formula>; if the first coin lands heads and the second coin lands tails (HT), Bill will lose <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M248"><mml:mrow><mml:mtext>$100</mml:mtext></mml:mrow></mml:math></inline-formula>; and if the first coin lands tails (T), Bill will lose <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M249"><mml:mrow><mml:mtext>$1000</mml:mtext></mml:mrow></mml:math></inline-formula>. In short, the payoffs are HH = <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M250"><mml:mrow><mml:mtext>$100</mml:mtext></mml:mrow></mml:math></inline-formula>, HT = &#x2212;$<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M251"><mml:mrow><mml:mtext>$100</mml:mtext></mml:mrow></mml:math></inline-formula>, and T = <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M252"><mml:mrow><mml:mtext>-$1000</mml:mtext></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote>
<list list-type="simple" id="L33">
<list-item><p id="P178">(26) a. Bill doesn&#x2019;t want the coins to land HT.</p></list-item>
<list-item><p id="P179">b. ?? Bill wants the coins to not land HT.</p></list-item>
</list></p>
<p id="P180">We detect a difference in felicity between these reports: to our ears (26b) sounds worse than (26a). The former suggests that a tails-first outcome is preferred to the HT outcome, which isn&#x2019;t the case. This is what we&#x2019;d expect if we assume that the relevant set of alternatives is something like <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M253"><mml:mrow><mml:mi mathvariant='script'>A</mml:mi><mml:mo>=</mml:mo><mml:mfenced close="}" open="{"><mml:mrow><mml:mtext>HH</mml:mtext><mml:mo>,</mml:mo><mml:mtext>HT</mml:mtext><mml:mo>,</mml:mo><mml:mtext>T</mml:mtext></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>. Bill&#x2019;s preferences over these alternatives look as follows:
<disp-formula id="FD9"><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M114e"><mml:mrow><mml:mtext>HH</mml:mtext><mml:msub><mml:mo>&#x227B;</mml:mo><mml:mrow><mml:mtext>Bill</mml:mtext></mml:mrow></mml:msub><mml:mtext>HT</mml:mtext><mml:msub><mml:mo>&#x227B;</mml:mo><mml:mrow><mml:mtext>Bill</mml:mtext></mml:mrow></mml:msub><mml:mtext>T</mml:mtext></mml:mrow></mml:math>
</disp-formula></p>
<p id="P182">Then (26a) will be true, but (26b) will be undefined since the proposition <italic>The coins do not land HT</italic> does not conditionally dominate on <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M254"><mml:mi mathvariant='script'>A</mml:mi></mml:math></inline-formula>. Needless to say, much more would need to be done in order to turn these remarks into a complete theory of neg-raising, but we will leave the matter there for now. Although our treatment of neg-raising seems <italic>prima facie</italic> plausible, our central concern has been to illustrate that a fairly natural dominance condition, when coupled with our alternative-sensitive semantics, allows us to explain the puzzles from <xref rid="S1" ref-type="sec">&#x00A7;1</xref>.</p>
<p id="P183">To summarize, we have tried to explain our puzzles by developing a theory of desire reports on which these ascriptions are (i) alternative-sensitive, and (ii) carry representation and dominance conditions. We think that our theory provides us with an elegant account of our data, and more generally yields a promising approach to desire.<sup><xref rid="fn37" ref-type="fn">37</xref>,<xref rid="fn38" ref-type="fn">38</xref></sup></p>
</sec>
<sec id="S20">
<label>4.</label><title>Wants and Oughts</title>
<p id="P184">Several theorists have noted that &#x2018;want&#x2019; and &#x2018;ought&#x2019; pattern similarly (<xref rid="R12" ref-type="bibr">Crni&#x010D;, 2011</xref>; <xref rid="R30" ref-type="bibr">Lassiter, 2011</xref>; <xref rid="R26" ref-type="bibr">Jerzak, 2019</xref>). We add that analogues of our puzzles arise with this modal. For instance, consider a famous case adapted from <xref rid="R24" ref-type="bibr">Jackson and Pargetter (1986</xref>, 235):
<disp-quote id="Q14">
<p id="P185"><italic>Professor Procrastinate</italic>:</p>
<p id="P186">Professor Procrastinate receives an invitation to review a book. The best thing that can happen is that he says yes, and then writes the review. However, were Procrastinate to say yes, he would not in fact get around to writing the review. Thus, although the best that can happen is for Procrastinate to say yes and then write, and he can do exactly this, what would in fact happen were he to say yes is that he would not write the review. Moreover, we may suppose, this latter is the worst that can happen.</p>
</disp-quote>
<table-wrap>
<table>
<tbody>
<tr>
<td valign="top" align="left">(27)</td>
<td valign="top">
<list list-type="simple">
<list-item><p id="P187">a. Professor Procrastinate ought to accept the invitation and write the review.</p></list-item>
<list-item><p id="P188">b. Professor Procrastinate ought not accept the invitation.</p></list-item>
<list-item><p id="P189">c. # Professor Procrastinate ought to accept the invitation and write the review, and he ought not accept the invitation.</p></list-item>
</list>
</td></tr></tbody></table></table-wrap>

<table-wrap>
<table>
<tbody>
<tr>
<td valign="top" align="left">(28)</td>
<td valign="top">
<list list-type="simple">
<list-item><p id="P190">a. # Professor Procrastinate ought to accept the invitation.</p></list-item>
<list-item><p id="P191">b. # Professor Procrastinate ought to accept the invitation and write the review, but it&#x2019;s not the case that he ought to accept the invitation.</p></list-item>
</list></td></tr></tbody></table></table-wrap></p>
<p id="P192">These similarities make salient the following intriguing possibility: that both desire verbs and deontic modals share an underlying semantics.<sup><xref rid="fn39" ref-type="fn">39</xref></sup> We&#x2019;ll leave this as a topic for future research. But we&#x2019;ll end by noting that <xref rid="R9" ref-type="bibr">Cariani (2013)</xref> has put forward an account of deontic &#x2018;ought&#x2019; that is similar, in some respects, to the semantics for &#x2018;want&#x2019; that we have developed here. For instance, on Cariani&#x2019;s proposal, ought claims are evaluated relative to a set of alternatives, as well as an ordering over those alternatives.<sup><xref rid="fn40" ref-type="fn">40</xref></sup> This could suggest a convergence to a common semantic core.<sup><xref rid="fn41" ref-type="fn">41</xref></sup></p>
</sec>
</body>
<back>
<fn-group>
<fn id="fn1"><label>1</label><p id="P193">Note that the conjuncts in (3) and (5) do not become more acceptable when they are placed in separate sentences. For instance, &#x2018;Bill wants all three coins to land heads. Though he wants the first coin to land tails&#x2019; is just as unacceptable. So our puzzles really involve the fact that, e.g., (1) and (2) cannot be felicitously asserted within a single <italic>discourse</italic>. But, for convenience, we will continue to focus on conjunctions such as (3) and (5).</p></fn>
<fn id="fn2"><label>2</label><p id="P194">We let &#x2018;S&#x2019; range over the names of agents and let &#x2018;<italic>S</italic>&#x2019; range over the corresponding agents denoted by &#x2018;S&#x2019;. Similarly, we let &#x2018;p&#x2019; range over the logical forms of proposition-denoting strings and let &#x2018;<italic>p</italic>&#x2019; range over the corresponding propositions denoted by &#x2018;p&#x2019;.</p></fn>
<fn id="fn3"><label>3</label><p id="P195">A further influential theory of desire is the comparative desirability account of <xref rid="R21" ref-type="bibr">Heim (1992)</xref>. Although we don&#x2019;t discuss Heim&#x2019;s entry in the main text, it is fairly straightforward to show that her proposal explains neither of our puzzles.</p></fn>
<fn id="fn4"><label>4</label><p id="P196">For simplicity, we assume that Bul<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M255"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mo>,</mml:mo><mml:mi>w</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is non-empty so long as Dox<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M256"><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula> is non-empty (this essentially corresponds to the limit assumption from <xref rid="R32" ref-type="bibr">Lewis (1973)</xref>).</p></fn>
<fn id="fn5"><label>5</label><p id="P197">Von Fintel&#x2019;s theory is particularly influential among linguists. See, e.g., <xref rid="R12" ref-type="bibr">Crni&#x010D; (2011)</xref>; <xref rid="R38" ref-type="bibr">Rubinstein (2012)</xref>; <xref rid="R33" ref-type="bibr">Pasternak (2019)</xref>.</p></fn>
<fn id="fn6"><label>6</label><p id="P198">There is independent evidence that intrasentential context shifts are often difficult to achieve, but we won&#x2019;t rehearse the data supporting this claim here. See, for example, <xref rid="R14" ref-type="bibr">Dorr and Hawthorne (2013)</xref> for further discussion.</p></fn>
<fn id="fn7"><label>7</label><p id="P199">Also see Blumberg (forthcoming a) for a further objection to von Fintel&#x2019;s account involving upward monotonicity.</p></fn>
<fn id="fn8"><label>8</label><p id="P200">Note that if a diversity constraint is adopted, then Monotonicity cannot be spelled out in classical terms. Instead, defenders of Monotonicity maintain that it is Stawson valid, rather than classically valid (<xref rid="R15" ref-type="bibr">von Fintel, 1999</xref>).</p></fn>
<fn id="fn9"><label>9</label><p id="P201">See (<xref rid="R19" ref-type="bibr">Grano and Phillips-Brown, 2022</xref>) for extensive discussion of this point. However, in what follows we will be entertaining a condition on desire reports that broadly patterns with a diversity constraint, but is not spelled out in doxastic terms (see fnn.30, 35 for discussion). But we won&#x2019;t be foregrounding this condition because it won&#x2019;t play a central role in explaining our central puzzles.</p></fn>
<fn id="fn10"><label>10</label><p id="P202"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M257"><mml:mrow><mml:mi>E</mml:mi><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:msub><mml:mfenced><mml:mi>p</mml:mi></mml:mfenced><mml:mo>=</mml:mo><mml:mstyle displaystyle='true'><mml:msub><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2208;</mml:mo><mml:mi>W</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:msub><mml:mfenced><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mfenced><mml:mo>&#x22C5;</mml:mo><mml:mi>C</mml:mi><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:msub><mml:mfenced><mml:mrow><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mstyle></mml:mrow></mml:math></inline-formula>, where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M258"><mml:mrow><mml:mi>C</mml:mi><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> represents <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M259"><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>&#x2019;s credences over the live possibilities in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M260"><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M261"><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is an evaluation function, i.e., a function from <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M262"><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:math></inline-formula> (the set of all worlds) to the real numbers. Variants of this semantics are also endorsed by <xref rid="R30" ref-type="bibr">Lassiter (2011)</xref>; <xref rid="R26" ref-type="bibr">Jerzak (2019)</xref>; <xref rid="R35" ref-type="bibr">Phillips-Brown (2021)</xref>.</p></fn>
<fn id="fn11"><label>11</label><p id="P203">It is worth observing that neither of our puzzles are resolved on more sophisticated decision-theoretic analyses, such as the account of <xref rid="R35" ref-type="bibr">Phillips-Brown (2021)</xref>. On this proposal, the expected value of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M263"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula> is required to be above a contextually determined threshold value. This account still predicts that, e.g., (3) will be true in any context where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M264"><mml:mrow><mml:mi>E</mml:mi><mml:mi>V</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>u</mml:mi><mml:mi>l</mml:mi><mml:mi>t</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>e</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>s</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> is above the threshold.</p></fn>
<fn id="fn12"><label>12</label><p id="P204">Some might be tempted to respond to (5) by appealing to the so-called &#x201C;neg-raising properties&#x201D; of &#x2018;want&#x2019;, i.e., the phenomenon whereby negated want reports are interpreted with negation taking narrow scope with respect to &#x2018;want&#x2019; (<xref rid="R11" ref-type="bibr">Collins and Postal, 2014</xref>). However, the result of neg-raising (4) is equivalent to (2). So, at best this response collapses the 3H-<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M265"><mml:mrow><mml:mover accent='true'><mml:mtext>H</mml:mtext><mml:mo>&#x00AF;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula> puzzle into the 3H-T puzzle. Moreover, the relevant effect also arises if we use &#x2018;it&#x2019;s not that&#x2019;, but this form of negation resists neg-raising.</p></fn>
<fn id="fn13"><label>13</label><p id="P205">This is illustrated by the fact that although (1) is true on Levinson&#x2019;s account, (4) is false. More generally, it is an elementary property of expected value that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M266"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula> can entail <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M267"><mml:mrow><mml:mi>q</mml:mi></mml:mrow></mml:math></inline-formula> and yet the expected value of the latter can be lower than the former by an arbitrary degree.</p></fn>
<fn id="fn14"><label>14</label><p id="P206">One might want to allow the set of alternatives to vary from world to world, time to time, and agent to agent. One could capture this by maintaining that interpretation proceeds relative to a function from world, time, agent triples to sets of alternatives, rather than just a set of alternatives. But we&#x2019;ll ignore this complication in what follows. Thanks to an anonymous reviewer for helpful discussion here.</p></fn>
<fn id="fn15"><label>15</label><p id="P207">We will often drop the world subscript when no confusion will arise.</p></fn>
<fn id="fn16"><label>16</label><p id="P208">We assume that the set of alternatives always has finite cardinality.</p></fn>
<fn id="fn17"><label>17</label><p id="P209">As a shorthand, we will write <sc>best</sc><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M268"><mml:mrow><mml:mfenced><mml:mrow><mml:msup><mml:mi mathvariant='script'>O</mml:mi><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:msup><mml:mfenced><mml:mrow><mml:mtext>Bill</mml:mtext></mml:mrow></mml:mfenced></mml:mrow></mml:mfenced><mml:mo>=</mml:mo><mml:mtext>ANN</mml:mtext></mml:mrow></mml:math></inline-formula> when we mean <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M269"><mml:mrow><mml:mtext>BEST</mml:mtext><mml:mfenced><mml:mrow><mml:msup><mml:mi mathvariant='script'>O</mml:mi><mml:mrow><mml:msub><mml:mi mathvariant='script'>A</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:msup><mml:mfenced><mml:mrow><mml:mtext>Bill</mml:mtext></mml:mrow></mml:mfenced></mml:mrow></mml:mfenced><mml:mo>=</mml:mo><mml:mfenced close="}" open="{"><mml:mrow><mml:mtext>ANN</mml:mtext></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>.</p></fn>
<fn id="fn18"><label>18</label><p id="P210">As far as we&#x2019;re aware, this argument was first put forward by <xref rid="R31" ref-type="bibr">Levinson (2003)</xref>. It has been endorsed by <xref rid="R30" ref-type="bibr">Lassiter (2011)</xref>, <xref rid="R26" ref-type="bibr">Jerzak (2019)</xref>, and <xref rid="R35" ref-type="bibr">Phillips-Brown (2021)</xref>.</p></fn>
<fn id="fn19"><label>19</label><p id="P211">We find it plausible that alternatives are at least partly fixed by the subject&#x2019;s planning and decision-making, and are often tied to the outcomes that are within the subject&#x2019;s control (see Blumberg and Hawthorne (forthcoming b) for related discussion). Moreover, a reviewer suggests that focus structure could have a role to play in determining which alternatives are relevant (<xref rid="R1" ref-type="bibr">Beaver and Clark, 2008</xref>). We are open to this suggestion and plan to explore it in future work.</p></fn>
<fn id="fn20"><label>20</label><p id="P212">This is at best a helpful model. In reality, irrational agents may have preferences that depart in all sorts of ways from this idealisation (<xref rid="R27" ref-type="bibr">Kahneman and Tversky, 1979</xref>), and some rational agents may be out of sync with expected value as well (<xref rid="R7" ref-type="bibr">Buchak, 2013</xref>).</p></fn>
<fn id="fn21"><label>21</label><p id="P213">It is worth registering that we take cases such as <italic>Coins</italic> to provide stronger motivation for maintaining that the subject&#x2019;s preference ordering ranges over propositions than cases such as <italic>Insurance</italic>. This is because insurance cases come with potential confounds, e.g., the subject&#x2019;s peace of mind from purchasing insurance, that proponents of world-orderings could appeal to in defense of their account (B&#x00FC;ring 2003; <xref rid="R17" ref-type="bibr">von Fintel 2012</xref>). By contrast, no such moves are available in the <italic>Coins</italic> scenario.</p></fn>
<fn id="fn22"><label>22</label><p id="P214">Cf. <xref rid="R9" ref-type="bibr">Cariani&#x2019;s (2013)</xref> notion of a proposition being &#x201C;visible&#x201D; with respect to a background partition of logical space.</p></fn>
<fn id="fn23"><label>23</label><p id="P215">For convenience, we assume that undefinedness or presupposition failure has a semantic effect. But our general approach is compatible with pragmatic accounts of presupposition on which presupposition failure affects assertability rather than semantic value (<xref rid="R40" ref-type="bibr">Schlenker, 2009</xref>).</p></fn>
<fn id="fn24"><label>24</label><p id="P216">This process is usually discussed under the heading &#x201C;accommodation&#x201D;. The basic phenomenon goes back at least to <xref rid="R28" ref-type="bibr">Karttunen (1974)</xref>. See <xref rid="R16" ref-type="bibr">von Fintel (2004)</xref> for a more recent discussion.</p></fn>
<fn id="fn25"><label>25</label><p id="P217">See Quine (1960); <xref rid="R13" ref-type="bibr">Davidson (1984)</xref> for canonical discussion of the principle of charity.</p></fn>
<fn id="fn26"><label>26</label><p id="P218">We will often leave the background ordering over alternatives implicit when discussing dominance, since it is usually clear from context which ranking we mean.</p></fn>
<fn id="fn27"><label>27</label><p id="P219">See <xref rid="R10" ref-type="bibr">Chierchia and McConnell-Ginet (2000)</xref> for discussion. For instance, &#x2018;Mary stopped smoking&#x2019; presupposes that Mary smoked in the past, and indeed &#x2018;Mary has not stopped smoking&#x2019; carries the very same implication.</p></fn>
<fn id="fn28"><label>28</label><p id="P220">Note that the felicity of (18) isn&#x2019;t plausibly explained by appealing to a shift in which alternatives are in play, for example by saying that it is being evaluated relative to the relatively coarse-grained set of alternatives <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M270"><mml:mrow><mml:mi mathvariant='script'>B</mml:mi><mml:mo>=</mml:mo><mml:mfenced close="}" open="{"><mml:mrow><mml:mtext>PASTA</mml:mtext><mml:mo>,</mml:mo><mml:mtext>CHICKEN</mml:mtext></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>. For we may suppose that the expected value of P<sc>A</sc>S<sc>TA</sc> is less than or equal to the expected value of C<sc>HI</sc>CK<sc>E</sc>N. In that case, (18) would be predicted to be undefined/false relative to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M271"><mml:mi mathvariant='script'>B</mml:mi></mml:math></inline-formula>, but still the sentence has a salient true reading.</p></fn>
<fn id="fn29"><label>29</label><p id="P221">If the expected value of chicken is greater than the expected value of pasta, then (19) does indeed have a true reading. This can be explained by maintaining that that sentence is being evaluated relative to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M272"><mml:mrow><mml:mi mathvariant='script'>B</mml:mi><mml:mo>=</mml:mo><mml:mfenced close="}" open="{"><mml:mrow><mml:mtext>PASTA</mml:mtext><mml:mo>,</mml:mo><mml:mtext>CHICKEN</mml:mtext></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>.</p></fn>
<fn id="fn30"><label>30</label><p id="P222">A reviewer notes that on this account, &#x231C;S wants p&#x231D; can be vacuously true when <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M273"><mml:mi mathvariant='script'>A</mml:mi></mml:math></inline-formula> only contains <italic>p</italic>-entailing alternatives. However, reports such as &#x2018;Bill wants everyone to be self-identical&#x2019; are infelicitous. One could try to explain this by appealing to pragmatic principles on utterance felicity. Alternatively, one could try to capture this constraint semantically by requiring that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M274"><mml:mi mathvariant='script'>A</mml:mi></mml:math></inline-formula> contains at least one &#x00AC;<italic>p</italic>-entailing alternative (also see fn.35 for related discussion). We remain neutral between these options here.</p></fn>
<fn id="fn31"><label>31</label><p id="P223">There is a large literature on specific indefinites and how exactly they should be captured. See, e.g., <xref rid="R42" ref-type="bibr">Schwarzschild (2002)</xref>; <xref rid="R41" ref-type="bibr">Schwarz (2011)</xref>; <xref rid="R20" ref-type="bibr">Hawthorne and Manley (2012)</xref>.</p></fn>
<fn id="fn32"><label>32</label><p id="P224">Assuming that the expected value of getting pasta is less than or equal to the expected value of getting chicken. If this isn&#x2019;t the case, then a true reading of (22) can be accessed relative to the coarse-grained set of alternatives <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M275"><mml:mi mathvariant='script'>B</mml:mi></mml:math></inline-formula>.</p></fn>
<fn id="fn33"><label>33</label><p id="P225"><xref rid="R35" ref-type="bibr">Phillips-Brown (2021)</xref> has recently argued that subjects can want what isn&#x2019;t best by their lights. In other work, we discuss how to tweak an alternative-sensitive framework in order to accommodate this phenomenon (Blumberg and Hawthorne, forthcoming c).</p></fn>
<fn id="fn34"><label>34</label><p id="P226">Note that this prediction marks a significant divergence from existing Kratzerian theories of desire, e.g., the account of von Fintel considered in <xref rid="S2" ref-type="sec">&#x00A7;2</xref>.1. It is straightforward to check that on von Fintel&#x2019;s account both (23a) and (23b) are predicted to be true. The data in (23) also count against a variant of our proposal which maintains that conditional dominance is a regular entailment rather than a presupposition, as well as a variant which weakens conditional dominance to &#x2018;every <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M276"><mml:mrow><mml:mi>q</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mtext>BEST</mml:mtext><mml:mtext>&#x2009;</mml:mtext><mml:mtext>(</mml:mtext><mml:mo>&#x227B;</mml:mo><mml:mtext>)</mml:mtext></mml:mrow></mml:math></inline-formula> such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M277"><mml:mrow><mml:mi>q</mml:mi><mml:mo>&#x2286;</mml:mo><mml:mi>p</mml:mi><mml:mo>&#x21D2;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula> dominates&#x2019;. On these versions of the view, both (23a) and (23b) come out true.</p></fn>
<fn id="fn35"><label>35</label><p id="P227">One way of guaranteeing that alternative sets have the required form is by positing a strengthened representation condition which requires not only that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M278"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula> is represented by the background set of alternatives <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M279"><mml:mi mathvariant='script'>A</mml:mi></mml:math></inline-formula> but also that there is some <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M280"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>-entailing alternative in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M281"><mml:mi mathvariant='script'>A</mml:mi></mml:math></inline-formula>, and that there is some <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M282"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>-entailing alternative in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M283"><mml:mi mathvariant='script'>A</mml:mi></mml:math></inline-formula>.</p></fn>
<fn id="fn36"><label>36</label><p id="P228">Strictly speaking, Gajewski and Kri&#x017E; capture their condition as a homogeneity requirement rather than a presupposition (see Kri&#x017E; (2015, ch.1) for several ways of distinguishing these effects). Moreover, there are differences in how this condition gets spelled out in Gajewski and Kri&#x017E;&#x2019;s respective systems (see Kri&#x017E; (2015, ch.6) for a helpful comparison of the two approaches). However, these details aren&#x2019;t important for us here.</p></fn>
<fn id="fn37"><label>37</label><p id="P229">One area that requires careful investigation is the way our alternative-sensitive approach interacts with quantifiers. Consider a variant of <italic>Dinner</italic> involving ten people: five diners love spaghetti and hate lasagna; while the other five love lasagna and hate spaghetti. To our ears, &#x2018;Everyone wants spaghetti or lasagna&#x2019; improves over its non-quantificational analogue. On the other hand, &#x2018;Everyone wants their friend to order spaghetti or lasagna for them&#x2019; seems unacceptable here, which is what our account predicts. At this point, it is unclear what explains this puzzling pattern of judgments.</p></fn>
<fn id="fn38"><label>38</label><p id="P230"><xref rid="R34" ref-type="bibr">Phillips-Brown (2018)</xref> also offers an alternative-sensitive theory of desire reports, but with important differences from our own. First, he places belief constraints on wanting which in <xref rid="S3" ref-type="sec">&#x00A7;2.1</xref> we showed to be problematic. Second, his account predicts that (8) (&#x2018;Bill wants the first coin to land tails, so he wants a result other than three heads&#x2019;) should be true in <italic>Coins</italic>. Finally, his account doesn&#x2019;t explain why (4) (&#x2018;Bill wants the first coin to land heads&#x2019;) is unacceptable, and so doesn&#x2019;t resolve our puzzles. Also see Blumberg (forthcoming b) for an alternative-sensitive account of natural language preference claims.</p></fn>
<fn id="fn39"><label>39</label><p id="P231">Of course, the classical approach to deontic modals and desire verbs sees them as sharing an underlying semantics, since it sees both of them as having the force of a universal quantifier. But as we saw in <xref rid="S3" ref-type="sec">&#x00A7;2.1</xref>, that semantics solves neither the 3H-T puzzle nor the <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M284"><mml:mrow><mml:mn>3</mml:mn><mml:mtext>H-</mml:mtext><mml:mover accent='true'><mml:mtext>H</mml:mtext><mml:mo>&#x00AF;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula> puzzle.</p></fn>
<fn id="fn40"><label>40</label><p id="P232">Also see Blumberg and Hawthorne (forthcoming a).</p></fn>
<fn id="fn41"><label>41</label><p id="P233">Thanks to two anonymous reviewers at <italic>Philosophers&#x2019; Imprint</italic> and our editor Brian Weatherson for very helpful feedback and discussion.</p></fn>
</fn-group>
<ref-list>
<title>References</title>
<ref id="R1"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Beaver</surname> <given-names>David I.</given-names></string-name> and <string-name><surname>Clark</surname>. <given-names>Brady Z.</given-names></string-name></person-group> <source>Sense and Sensitivity: How Focus Determines Meaning.</source> <publisher-name>Blackwell</publisher-name>, <year>2008</year>.</mixed-citation></ref>
<ref id="R2"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Blumberg</surname>. <given-names>Kyle</given-names></string-name></person-group> <article-title>A problem for the ideal worlds account of desire.</article-title> <source>Analysis</source>, <comment>forthcoming a.</comment> doi: <comment><ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="10.1093/analys/anab036" xlink:type="simple">10.1093/analys/anab036</ext-link>.</comment></mixed-citation></ref>
<ref id="R3"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Blumberg</surname>. <given-names>Kyle</given-names></string-name></person-group> <article-title>On preferring.</article-title> <source>Linguistics and Philosophy</source>, <comment>forthcoming b.</comment></mixed-citation></ref>
<ref id="R4"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Blumberg</surname>. <given-names>Kyle</given-names></string-name> and <string-name><surname>Hawthorne</surname>. <given-names>John</given-names></string-name></person-group> <article-title>Inheritance: Professor procrastinate and the logic of obligation.</article-title> <source>Philosophy and Phenomenological Research</source>, <comment>forthcoming a.</comment> doi: <comment><ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="10.1111/phpr.12846" xlink:type="simple">10.1111/phpr.12846</ext-link>.</comment></mixed-citation></ref>
<ref id="R5"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Blumberg</surname> <given-names>Kyle</given-names></string-name> and <string-name><surname>Hawthorne</surname>. <given-names>John</given-names></string-name></person-group> <article-title>A new hope.</article-title> <source>Journal of Philosophy</source>, <comment>forthcoming b.</comment></mixed-citation></ref>
<ref id="R6"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Blumberg</surname> <given-names>Kyle</given-names></string-name> and <string-name><surname>Hawthorne</surname>. <given-names>John</given-names></string-name></person-group> <article-title>Wanting what&#x2019;s not best.</article-title> <source>Philosophical Studies</source>, <comment>forthcoming c.</comment></mixed-citation></ref>
<ref id="R7"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Buchak</surname>. <given-names>Lara</given-names></string-name></person-group> <source><italic>Risk and Rationality</italic>.</source> <publisher-name>Oxford University Press</publisher-name>, <year>2013</year>.</mixed-citation></ref>
<ref id="R8"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>B&#x00FC;ring</surname>. <given-names>Daniel</given-names></string-name></person-group> <chapter-title>To want is to want to be there: A note on Levinson (2003).</chapter-title> In <person-group person-group-type="editor"><string-name><surname>Schlenker</surname> <given-names>Philippe</given-names></string-name> and <string-name><surname>Sportiche</surname>, <given-names>Dominique</given-names></string-name></person-group> editors, <source>Division of Linguistic Labor: The la Bretesche Workshop</source>, <year>2003</year>.</mixed-citation></ref>
<ref id="R9"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Cariani</surname>. <given-names>Fabrizio</given-names></string-name></person-group> <article-title>&#x2018;Ought&#x2019; and resolution semantics.</article-title> <source>No&#x00FB;s</source>, <volume>47</volume>(<issue>3</issue>):<fpage>534</fpage>&#x2013;<lpage>558</lpage>, <year>2013</year>. doi: <comment><ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="10.1111/j.1468-0068.2011.00839.x" xlink:type="simple">10.1111/j.1468-0068.2011.00839.x</ext-link>.</comment></mixed-citation></ref>
<ref id="R10"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Chierchia</surname> <given-names>Gennaro</given-names></string-name> and <string-name><surname>McConnell-Ginet</surname>. <given-names>Sally</given-names></string-name></person-group> <source>Meaning and Grammar: An Introduction to Semantics.</source> <publisher-name>MIT Press</publisher-name>, <year>2000</year>.</mixed-citation></ref>
<ref id="R11"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Collins</surname> <given-names>Chris</given-names></string-name> and <string-name><surname>Postal</surname>. <given-names>Paul M.</given-names></string-name></person-group> <source><italic>Classical NEG Raising: An Essay on the Syntax of Negation</italic>.</source> <publisher-name>MIT Press</publisher-name>, <year>2014</year>.</mixed-citation></ref>
<ref id="R12"><mixed-citation publication-type="thesis"><person-group person-group-type="author"><string-name><surname>Crni&#x010D;</surname>. <given-names>Luka</given-names></string-name></person-group> <source>Getting even.</source> <comment>PhD thesis</comment>, <collab>MIT</collab>, <year>2011</year>.</mixed-citation></ref>
<ref id="R13"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Davidson</surname>. <given-names>Donald</given-names></string-name></person-group> <source><italic>Inquiries Into Truth And Interpretation</italic>.</source> <publisher-name>Oxford University Press</publisher-name>, <year>1984</year>.</mixed-citation></ref>
<ref id="R14"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Dorr</surname> <given-names>Cian</given-names></string-name> and <string-name><surname>Hawthorne</surname>. <given-names>John</given-names></string-name></person-group> <article-title>Embedding epistemic modals.</article-title> <source>Mind</source>, <volume>122</volume>(<issue>488</issue>):<fpage>867</fpage>&#x2013;<lpage>914</lpage>, <year>2013</year>. doi: <comment><ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="10.1093/mind/fzt091" xlink:type="simple">10.1093/mind/fzt091</ext-link>.</comment></mixed-citation></ref>
<ref id="R15"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>von Fintel</surname>. <given-names>Kai</given-names></string-name></person-group> <article-title>NPI Licensing, Strawson entailment, and context dependency.</article-title> <source>Journal of Semantics</source>, <volume>16</volume>(<issue>2</issue>):<fpage>97</fpage>&#x2013;<lpage>148</lpage>, <year>1999</year>. doi: <comment><ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="10.1093/jos/16.2.97" xlink:type="simple">10.1093/jos/16.2.97</ext-link>.</comment></mixed-citation></ref>
<ref id="R16"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>von Fintel</surname>. <given-names>Kai</given-names></string-name></person-group> <chapter-title>Would you believe it? The king of France is back! (Presuppositions and truth-value intuitions).</chapter-title> In <person-group person-group-type="editor"><string-name><surname>Reimer</surname> <given-names>Marga</given-names></string-name> and <string-name><surname>Bezuidenhout</surname>, <given-names>Anne</given-names></string-name></person-group> editors, <source>Descriptions and Beyond.</source> <publisher-name>Clarendon Press</publisher-name>, <year>2004</year>.</mixed-citation></ref>
<ref id="R17"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>von Fintel</surname>. <given-names>Kai</given-names></string-name></person-group> <source>The best we can (expect to) get? Challenges to the classic semantics for deontic modals.</source> <publisher-name>Central APA</publisher-name>, <year>2012</year>.</mixed-citation></ref>
<ref id="R18"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Robert Gajewski</surname>. <given-names>Jon</given-names></string-name></person-group> <article-title>Neg-raising and polarity.</article-title> <source>Linguistics and Philosophy</source>, <volume>30</volume>(<issue>3</issue>):<fpage>289</fpage>&#x2013;<lpage>328</lpage>, <year>2007</year>. doi: <comment><ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="10.1007/s10988-007-9020-z" xlink:type="simple">10.1007/s10988-007-9020-z</ext-link>.</comment></mixed-citation></ref>
<ref id="R19"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Grano</surname> <given-names>Thomas</given-names></string-name> and <string-name><surname>Phillips-Brown</surname>. <given-names>Milo</given-names></string-name></person-group> (<source>Counter)factual want ascriptions and conditional belief.</source> <publisher-name>MIT</publisher-name>, <year>2022</year>.</mixed-citation></ref>
<ref id="R20"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Hawthorne</surname> <given-names>John</given-names></string-name> and <string-name><surname>Manley</surname>. <given-names>David</given-names></string-name></person-group> <source><italic>The Reference Book</italic>.</source> <publisher-name>Oxford University Press</publisher-name>, <year>2012</year>.</mixed-citation></ref>
<ref id="R21"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Heim</surname>. <given-names>Irene</given-names></string-name></person-group> <article-title>Presupposition projection and the semantics of attitude verbs.</article-title> <source>Journal of Semantics</source>, <volume>9</volume>(<issue>3</issue>):<fpage>183</fpage>&#x2013;<lpage>221</lpage>, <year>1992</year>.</mixed-citation></ref>
<ref id="R22"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Hintikka</surname>. <given-names>Jaakko</given-names></string-name></person-group> <source><italic>Knowledge and Belief: An Introduction to the Logic of the Two Notions</italic>.</source> <publisher-name>Cornell University Press</publisher-name>, <year>1962</year>.</mixed-citation></ref>
<ref id="R23"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Iatridou</surname>. <given-names>Sabine</given-names></string-name></person-group> <article-title>The grammatical ingredients of counterfactuality.</article-title> <source>Linguistic Inquiry</source>, <volume>31</volume>(<issue>2</issue>):<fpage>231</fpage>&#x2013;<lpage>270</lpage>, <year>2000</year>. doi: <comment><ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="10.1162/002438900554352" xlink:type="simple">10.1162/002438900554352</ext-link>.</comment></mixed-citation></ref>
<ref id="R24"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Jackson</surname> <given-names>Frank</given-names></string-name> and <string-name><surname>Pargetter</surname>. <given-names>Robert</given-names></string-name></person-group> <article-title>Oughts, options, and actualism.</article-title> <source>Philosophical Review</source>, <volume>95</volume>(<issue>2</issue>):<fpage>233</fpage>&#x2013;<lpage>255</lpage>, <year>1986</year>. doi: <comment><ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="10.2307/2185591" xlink:type="simple">10.2307/2185591</ext-link>.</comment></mixed-citation></ref>
<ref id="R25"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Jeffrey</surname>. <given-names>Richard C.</given-names></string-name></person-group> <source><italic>The Logic of Decision</italic>.</source> <publisher-name>University of Chicago Press</publisher-name>, <year>1965</year>.</mixed-citation></ref>
<ref id="R26"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Jerzak</surname>. <given-names>Ethan</given-names></string-name></person-group> <article-title>Two ways to want?</article-title> <source>Journal of Philosophy</source>, <volume>116</volume>(<issue>2</issue>):<fpage>65</fpage>&#x2013;<lpage>98</lpage>, <year>2019</year>. doi: <comment><ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="10.5840/jphil201911624" xlink:type="simple">10.5840/jphil201911624</ext-link>.</comment></mixed-citation></ref>
<ref id="R27"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kahneman</surname> <given-names>Daniel</given-names></string-name> and <string-name><surname>Tversky</surname>. <given-names>Amos</given-names></string-name></person-group> <article-title>Prospect theory: An analysis of decision under risk.</article-title> <source>Econometrica</source>, <volume>47</volume>(<issue>2</issue>):<fpage>263</fpage>&#x2013;<lpage>291</lpage>, <year>1979</year>.</mixed-citation></ref>
<ref id="R28"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Karttunen</surname>. <given-names>Lauri</given-names></string-name></person-group> <article-title>Presupposition and linguistic context.</article-title> <source>Theoretical Linguistics</source>, <volume>34</volume>(<issue>1</issue>):<fpage>181</fpage>&#x2013;<lpage>194</lpage>, <year>1974</year>.</mixed-citation></ref>
<ref id="R29"><mixed-citation publication-type="thesis"><source>Manuel Kri&#x017E;. <italic>Aspects of Homogeneity in the Semantics of Natural Language</italic>.</source> <comment>PhD thesis</comment>, <collab>University of Vienna</collab>, <year>2015</year>.</mixed-citation></ref>
<ref id="R30"><mixed-citation publication-type="thesis"><person-group person-group-type="author"><string-name><surname>Lassiter</surname>. <given-names>Daniel</given-names></string-name></person-group> <source><italic>Measurement and Modality: The Scalar Basis of Modal Semantics</italic>.</source> <comment>PhD thesis</comment>, <collab>New York University</collab>, <year>2011</year>.</mixed-citation></ref>
<ref id="R31"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Levinson</surname>. <given-names>Dmitry</given-names></string-name></person-group> <article-title>Probabilistic model-theoretic semantics for &#x2018;want&#x2019;.</article-title> <source>Semantics and Linguistic Theory</source>, <volume>13</volume>:<fpage>222</fpage>&#x2013;<lpage>239</lpage>, <year>2003</year>. doi: <comment><ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="10.3765/salt.v13i0.2888" xlink:type="simple">10.3765/salt.v13i0.2888</ext-link>.</comment></mixed-citation></ref>
<ref id="R32"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Lewis</surname>. <given-names>David K.</given-names></string-name></person-group> <source><italic>Counterfactuals</italic>.</source> <publisher-name>Blackwell</publisher-name>, <year>1973</year>.</mixed-citation></ref>
<ref id="R33"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Pasternak</surname>. <given-names>Robert</given-names></string-name></person-group> <article-title>A lot of hatred and a ton of desire: Intensity in the mereology of mental states.</article-title> <source>Linguistics and Philosophy</source>, <volume>42</volume>(<issue>3</issue>):<fpage>267</fpage>&#x2013;<lpage>316</lpage>, <year>2019</year>. doi: <comment><ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="10.1007/s10988-018-9247-x" xlink:type="simple">10.1007/s10988-018-9247-x</ext-link>.</comment></mixed-citation></ref>
<ref id="R34"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Phillips-Brown</surname>. <given-names>Milo</given-names></string-name></person-group> <article-title>I want to, but...</article-title> <source>Proceedings of Sinn und Bedeutung</source>, <volume>21</volume>:<fpage>951</fpage>&#x2013;<lpage>968</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="R35"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Phillips-Brown</surname>. <given-names>Milo</given-names></string-name></person-group> <article-title>What does decision theory have to do with wanting?</article-title> <source>Mind</source>, <volume>130</volume>(<issue>518</issue>):<fpage>413</fpage>&#x2013;<lpage>437</lpage>, <year>2021</year>. doi: <comment><ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="10.1093/mind/fzaa057" xlink:type="simple">10.1093/mind/fzaa057</ext-link>.</comment></mixed-citation></ref>
<ref id="R36"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Portner</surname> <given-names>Paul</given-names></string-name> and <string-name><surname>Rubinstein</surname>. <given-names>Aynat</given-names></string-name></person-group> <article-title>Mood and contextual commitment.</article-title> In <person-group person-group-type="editor"><string-name><surname>Chereches</surname>, <given-names>Anca</given-names></string-name></person-group> editor, <source>Semantics and Linguistic Theory</source>, volume <volume>22</volume>, <year>2012</year>. doi: doi:<comment><ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="10.3765/salt.v22i0.2642" xlink:type="simple">10.3765/salt.v22i0.2642</ext-link>.</comment></mixed-citation></ref>
<ref id="R37"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Van Orman Quine</surname>. <given-names>Willard</given-names></string-name></person-group> <source>Word and Object.</source> <publisher-name>MIT Press</publisher-name>, <year>1960</year>.</mixed-citation></ref>
<ref id="R38"><mixed-citation publication-type="thesis"><person-group person-group-type="author"><string-name><surname>Rubinstein</surname>. <given-names>Aynat</given-names></string-name></person-group> <source><italic>Roots of Modality</italic>.</source> <comment>PhD thesis</comment>, <collab>University of Massachusetts Amherst</collab>, <year>2012</year>.</mixed-citation></ref>
<ref id="R39"><mixed-citation publication-type="thesis"><person-group person-group-type="author"><string-name><surname>Scheffler</surname>. <given-names>Tatjana</given-names></string-name></person-group> <source><italic>Semantic Operators in Different Dimensions</italic>.</source> <comment>PhD thesis</comment>, <collab>University of Pennsylvania</collab>, <year>2008</year>.</mixed-citation></ref>
<ref id="R40"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Schlenker</surname>. <given-names>Philippe</given-names></string-name></person-group> <article-title>Local contexts.</article-title> <source>Semantics and Pragmatics</source>, <volume>2</volume>(<issue>3</issue>):<fpage>1</fpage>&#x2013;<lpage>78</lpage>, <year>2009</year>. doi: <comment><ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="10.3765/sp.2.3" xlink:type="simple">10.3765/sp.2.3</ext-link>.</comment></mixed-citation></ref>
<ref id="R41"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Schwarz</surname>. <given-names>Bernhard</given-names></string-name></person-group> <article-title>Long distance indefinites and choice functions.</article-title> <source>Language and Linguistics Compass</source>, <volume>5</volume>(<issue>12</issue>):<fpage>880</fpage>&#x2013;<lpage>897</lpage>, <year>2011</year>. doi: <comment><ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="10.1111/j.1749-818X.2011.00315.x" xlink:type="simple">10.1111/j.1749-818X.2011.00315.x</ext-link>.</comment></mixed-citation></ref>
<ref id="R42"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Schwarzschild</surname>. <given-names>Roger</given-names></string-name></person-group> <article-title>Singleton indefinites.</article-title> <source>Journal of Semantics</source>, <volume>19</volume>(<issue>3</issue>): <fpage>289</fpage>&#x2013;<lpage>314</lpage>, <year>2002</year>. doi: <comment><ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="10.1093/jos/19.3.289" xlink:type="simple">10.1093/jos/19.3.289</ext-link>.</comment></mixed-citation></ref>
<ref id="R43"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Stalnaker</surname>. <given-names>Robert</given-names></string-name></person-group> <source><italic>Inquiry</italic>.</source> <publisher-name>Cambridge University Press</publisher-name>, <year>1984</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>
