<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.2 20120330//EN" "http://jats.nlm.nih.gov/publishing/1.2/JATS-journalpublishing1.dtd">
<!--<?xml-stylesheet type="text/xsl" href="article.xsl"?>-->
<article article-type="research-article" dtd-version="1.2" xml:lang="en" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id journal-id-type="issn">1533-628X</journal-id>
<journal-title-group>
<journal-title>Philosophers&#8217; Imprint</journal-title>
</journal-title-group>
<issn pub-type="epub">1533-628X</issn>
<publisher>
<publisher-name>Michigan Journal of Community Service Learning</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3998/phimp.2683</article-id>
<article-categories>
<subj-group>
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>An Expressivist Theory of Taste Predicates</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname>Ninan</surname>
<given-names>Dilip</given-names>
</name>
<email>dilip.ninan@tufts.edu</email>
<xref ref-type="aff" rid="aff-1">1</xref>
</contrib>
</contrib-group>
<aff id="aff-1"><label>1</label>Tufts University</aff>
<pub-date publication-format="electronic" date-type="pub" iso-8601-date="2024-08-21">
<day>21</day>
<month>08</month>
<year>2024</year>
</pub-date>
<pub-date pub-type="collection">
<year>2024</year>
</pub-date>
<volume>24</volume>
<issue>1</issue>
<elocation-id>11</elocation-id>
<history>
<date date-type="received" iso-8601-date="2022-04-28">
<day>28</day>
<month>04</month>
<year>2022</year>
</date>
<date date-type="accepted" iso-8601-date="2023-02-08">
<day>08</day>
<month>02</month>
<year>2023</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright: &#x00A9; 2024 Dilip Ninan</copyright-statement>
<copyright-year>2024</copyright-year>
<license license-type="open-access" xlink:href="https://creativecommons.org/licenses/by-nc-nd/4.0/">
<license-p>This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License. <uri xlink:href="https://creativecommons.org/licenses/by-nc-nd/4.0/">https://creativecommons.org/licenses/by-nc-nd/4.0/</uri>.</license-p>
</license>
</permissions>
<self-uri xlink:href="https://www.philosophersimprint.org/024004/phimp/article/10.3998/phimp.2683/"/>
<abstract>
<p>Simple taste predications come with an <italic>acquaintance requirement</italic>: they require the speaker to have had a certain kind of first-hand experience with the object of predication. For example, if I tell you that the creme caramel is delicious, you would ordinarily assume that I have actually tasted the creme caramel and am not simply relying on the testimony of others. The present essay argues in favor of a &#8216;lightweight&#8217; expressivist account of the acquaintance requirement. This account consists of a recursive semantics and an account of assertion; it is compatible with a number of different accounts of truth and content, including contextualism, relativism, and purer forms of expressivism. The principal argument in favor of this account is that it correctly predicts a wide range of data concerning how the acquaintance requirement interacts with Boolean connectives, generalized quantifiers, epistemic modals, and attitude verbs.</p>
</abstract>
<kwd-group>
<kwd>taste predicates</kwd>
<kwd>expressivism</kwd>
<kwd>quantifiers</kwd>
<kwd>presupposition</kwd>
<kwd>acquaintance inference</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec>
<title>1. Introduction</title>
<p>Imagine that we&#8217;re at a dessert party and you&#8217;re wondering what to eat. If I tell you that the cr&#232;me caramel is really delicious, you would ordinarily assume that I had actually tasted it, and am not just basing my judgment on the say-so of others. If I were instead simply relying on testimony, it would be better for me to hedge in some way, to say, for example, that I&#8217;d <italic>heard</italic> that the cr&#232;me caramel is delicious. Claims about deliciousness contrast here with more straightforwardly factual ones: if, for example, I tell you the cr&#232;me caramel contains cardamom, you need not reach any very specific conclusion about the basis for my assertion.</p>
<p>This observation has appeared in both the aesthetics literature and the literature on predicates of taste,<xref ref-type="fn" rid="n1">1</xref> and appears to have its roots in some remarks of Kant&#8217;s:</p>
<disp-quote>
<p>For someone may list all of the ingredients of a dish for me, and remark about each one that it is otherwise agreeable to me&#160;.&#160;.&#160;. yet I am deaf to all these grounds, I try the dish with <italic>my</italic> tongue and my palate, and on that basis&#160;.&#160;.&#160;. do I make my judgment.<xref ref-type="fn" rid="n2">2</xref></p>
</disp-quote>
<p>The phenomenon at issue here is not restricted to gustatory taste. Consider other so-called &#8216;predicates of personal taste.&#8217; If I tell you that <italic>Monsieur Hulot&#8217;s Holiday</italic> is <underline>hilarious</underline>, you will normally assume I&#8217;ve seen it, and am not just basing my judgment on having read the reviews. If I tell you that spelunking with Sue is <underline>fun</underline>, you will again normally infer that I myself have spelunked with Sue. A similar phenomenon arguably arises in connection with aesthetic predicates (e.g., <italic>beautiful, dainty, dumpy</italic>), and indeed the present linguistic observation seems to have first arisen in discussions of aesthetic testimony.<xref ref-type="fn" rid="n3">3</xref> But the phenomenon doesn&#8217;t seem to be restricted to predicates that are in some sense evaluative; note, for example, that if I tell you that the soup tastes like it contains saffron, you will again infer that I&#8217;ve actually tasted it, even though <italic>tastes like it contains saffron</italic> would not seem to be an evaluative predicate in the relevant sense.<xref ref-type="fn" rid="n4">4</xref> To simplify matters, we will focus on predicates of gustatory taste (<italic>tasty, delicious</italic>); but I believe that most of what we say in what follows can be extended to a wider class of predicates.</p>
<p>In earlier work, I called the inference hearers are apt to draw from an utterance of a simple taste sentence an <italic>acquaintance inference</italic> (<xref ref-type="bibr" rid="B27">Ninan, <italic>op. cit.</italic></xref>); here, I shall speak interchangeably of an <italic>acquaintance requirement</italic>. Note that in my discussion of this inference/requirement I have been hedging: I&#8217;ve been saying that utterances of simple taste sentences <italic>typically</italic> give rise to an acquaintance inference, which suggests that they don&#8217;t always do so. But under what conditions does this inference fail to arise? As a number of authors have observed, &#8216;exocentric&#8217; readings of taste predicates provide one class of exceptions (<xref ref-type="bibr" rid="B27">Ninan, <italic>op. cit.</italic>, 291&#8211;292</xref>). Ordinarily, when I call something delicious, I am guided by my own tastes and sensibilities; this is an <italic>autocentric</italic> use. But sometimes I may call something delicious in order to say (roughly) that some salient person or group finds it delicious; this is an <italic>exocentric use</italic>.<xref ref-type="fn" rid="n5">5</xref> Consider, for example, the following exchange:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(1)</p></list-item>
</list>
<list list-type="wordfirst">
<list-item><p><italic>A:</italic></p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>How is Sue&#8217;s vacation in Sardinia going?</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>&#160;</p></list-item>
</list>
<list list-type="wordfirst">
<list-item><p><italic>B:</italic></p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>It&#8217;s going well. <underline>The seafood is delicious</underline>, she loves the beaches, and she&#8217;s staying in a nice hotel.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>&#160;</p></list-item>
</list>
<list list-type="wordfirst">
<list-item><p><inline-formula><mml:math id="Eq001"><mml:mo stretchy='false'>&#8618;&#824;</mml:mo></mml:math></inline-formula></p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p><italic>B has tasted the seafood in Sardinia</italic></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>&#160;</p></list-item>
</list>
<list list-type="wordfirst">
<list-item><p><inline-formula><mml:math id="Eq002"><mml:mo stretchy='false'>&#8618;</mml:mo></mml:math></inline-formula></p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p><italic>Sue has tasted the seafood in Sardinia</italic></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p><italic>B</italic>&#8217;s utterance here would not suggest that <italic>B</italic> has tasted the seafood in Sardinia. But while <italic>B</italic>&#8217;s utterance doesn&#8217;t give rise to a <italic>speaker</italic> acquaintance inference, it may give rise to some other sort of acquaintance inference, since it does seem to suggest that <italic>Sue</italic> has tasted the seafood in Sardinia.<xref ref-type="fn" rid="n6">6</xref></p>
<p>Why do taste predicates give rise to the acquaintance inference? One attractive idea is that the inference arises because simple taste sentences are vehicles not simply for stating facts but for <italic>expressing our reactions</italic> to experiences we&#8217;ve had.<xref ref-type="fn" rid="n7">7</xref> When you taste the cr&#232;me caramel and you like it, you are in a certain psychological state, a state you can report by saying <italic>I like the taste of the cr&#232;me caramel</italic>. Thus, perhaps when you sincerely say <italic>The cr&#232;me caramel is delicious</italic>, you are expressing this psychological state, expressing your &#8216;liking&#8217; of the taste of the cr&#232;me caramel. If that thought is correct, then it would seem to explain why the acquaintance inference arises, for it would seem that you can only be said to <italic>like</italic> the taste of something if you have actually tasted it.</p>
<p>This idea is a form of <italic>expressivism</italic> about taste predicates, for it maintains that in saying <italic>The cr&#232;me caramel is delicious</italic>, one is expressing a certain kind of psychological state, one that is not a belief. Moreover, the psychological state one is expressing does not seem to be one that can be assessed for truth or falsity. (What is it for &#8216;my liking&#8217; of the cr&#232;me caramel to be true? What is it for it be false?) But expressivism has a troubled history, and can seem to raise more problems than it solves. For just how is it that an utterance of <italic>The cr&#232;me caramel is delicious</italic> comes to be associated with a psychological state of this sort? Note also that when that sentence is embedded in certain complex sentences, utterances of those complex sentences need not express the psychological state in question. For example, I can say (2) even if I have not tasted the cr&#232;me caramel before and so cannot truly be said to like it:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(2)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>If the cr&#232;me caramel was delicious, Bina will be pleased.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>How is this observation to be made compatible with the claim that, when unembedded, <italic>The cr&#232;me caramel is delicious</italic> expresses my liking of the cr&#232;me caramel? Doesn&#8217;t that sentence mean the same thing whether embedded or not?<xref ref-type="fn" rid="n8">8</xref></p>
<p>While much has been said about these problems in the literature on metaethical expressivism, a sober-minded semanticist might wonder if a more conservative solution is available. In what follows, I have two principal aims. The first is to show that at least two &#8216;more conservative&#8217; approaches face a number of problems, problems that motivate re-considering the expressivist approach (Sections 2&#8211;3). The second is to argue that there is a form of expressivism&#8212;a &#8216;lightweight&#8217; expressivism&#8212;that actually <italic>is</italic> quite conservative. For as we shall see, there is a way of taking a fairly standard semantics for taste predicates and overlaying it with a <italic>supervaluational</italic> account of assertion that implements the above expressivist idea (Section 4). The resulting view is compatible with a variety of approaches to truth and content (e.g., contextualism, relativism, and &#8216;pure&#8217; expressivism) and also extends our understanding of the relevant empirical terrain. Indeed, the principal argument in favor of this account is that it correctly predicts a wide range of data concerning how the acquaintance requirement interacts with Boolean connectives, generalized quantifiers, epistemic modals, and attitude verbs.<xref ref-type="fn" rid="n9">9</xref></p>
</sec>
<sec id="S2">
<title>2. The epistemic view</title>
<p>In this and the next section, we discuss two of the main approaches to the acquaintance requirement found in the literature: the <italic>epistemic view</italic> (Section 2) and the <italic>presupposition view</italic> (Section 3). In earlier work (<xref ref-type="bibr" rid="B27">Ninan, <italic>op. cit.</italic> 2014</xref>), I discussed the epistemic view sympathetically, but here I want to raise some problems for that approach.</p>
<p>The epistemic view consists of two principal claims. The first is the following &#8216;norm of assertion&#8217;:</p>
<disp-quote>
<p><sc>knowledge norm</sc></p>
<p>For any context <italic>c, s<sub>c</sub></italic> may assert <inline-formula><mml:math id="Eq003"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> in <italic>c</italic> only if <italic>s<sub>c</sub></italic> knows <inline-formula><mml:math id="Eq004"><mml:msup><mml:mrow><mml:mo stretchy='false'>&#10216;</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>&#10217;</mml:mo></mml:mrow><mml:mi>c</mml:mi></mml:msup></mml:math></inline-formula> in <italic>c</italic>.<xref ref-type="fn" rid="n10">10</xref></p>
</disp-quote>
<p>Here <italic>s<sub>c</sub></italic> is the speaker of context <italic>c</italic> and <inline-formula><mml:math id="Eq005"><mml:msup><mml:mrow><mml:mo stretchy='false'>&#10216;</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>&#10217;</mml:mo></mml:mrow><mml:mi>c</mml:mi></mml:msup></mml:math></inline-formula> is the proposition expressed by sentence <inline-formula><mml:math id="Eq006"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> in <italic>c</italic>. We may think of this as a particular way of formulating Grice&#8217;s Maxim of Quality.<xref ref-type="fn" rid="n11">11</xref> The second claim is a principle in the epistemology of taste:</p>
<disp-quote>
<p><sc>acquaintance principle</sc></p>
<p>Normally, if <italic>c</italic> is an autocentric context, then <italic>s<sub>c</sub></italic> knows in <italic>c</italic> whether <inline-formula><mml:math id="Eq007"><mml:mo stretchy='false'>&#10216;</mml:mo></mml:math></inline-formula><italic>o is delicious</italic><inline-formula><mml:math id="Eq008"><mml:mrow><mml:mo stretchy='false'>&#10217;</mml:mo><mml:msup><mml:mi/><mml:mi>c</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> is true only if <italic>s<sub>c</sub></italic> has tasted <italic>o</italic> prior to <italic>t<sub>c</sub></italic> in <italic>w<sub>c</sub></italic>.<xref ref-type="fn" rid="n12">12</xref></p>
</disp-quote>
<p>We restrict ourselves to autocentric contexts for the moment. Suppose a speaker asserts <italic>o is delicious</italic>. Then, by the Knowledge Norm, this will likely implicate that the speaker knows that <italic>o</italic> is delicious, since the speaker will normally be assumed to be attempting to comply with that norm. But if the speaker knows that <italic>o</italic> is delicious, then the Acquaintance Principle will imply that the speaker has tasted <italic>o</italic>. Thus, the acquaintance inference emerges as a Quality implicature.</p>
<p>The epistemic view correctly predicts a number of facts about how the acquaintance requirement projects out of various linguistic environments (<xref ref-type="bibr" rid="B27">Ninan, <italic>op. cit.</italic> 2014</xref>). Given a sentential operator <italic>O</italic>, a sentence <inline-formula><mml:math id="Eq009"><mml:mo>&#981;</mml:mo></mml:math></inline-formula>, a context <italic>c</italic>, and a property <italic>F</italic> that <inline-formula><mml:math id="Eq010"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> has in <italic>c</italic>, we say that <italic>F projects over O in c</italic> just in case <inline-formula><mml:math id="Eq011"><mml:mrow><mml:mi>O</mml:mi><mml:mo>&#8290;</mml:mo><mml:mo>&#981;</mml:mo></mml:mrow></mml:math></inline-formula> also has <italic>F</italic> in <italic>c</italic>. And we can say, more simply, that <italic>F</italic> projects over <italic>O</italic> just in case for most normal contexts <italic>c, F</italic> projects over <italic>O</italic> in <italic>c</italic>. Note that the acquaintance requirement appears to project over negation:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(3)</p></list-item>
</list>
<list list-type="wordfirst">
<list-item><p>(a)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>The cr&#232;me caramel is delicious.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>&#160;</p></list-item>
</list>
<list list-type="wordfirst">
<list-item><p>(b)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>The cr&#232;me caramel is not delicious&#8212;it&#8217;s too sweet.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>&#160;</p></list-item>
</list>
<list list-type="wordfirst">
<list-item><p><inline-formula><mml:math id="Eq012"><mml:mo stretchy='false'>&#8618;</mml:mo></mml:math></inline-formula></p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p><italic>the speaker has tasted the cr&#232;me caramel</italic></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>The epistemic view predicts this because the Acquaintance Principle is a constraint on knowing <italic>whether o</italic> is delicious. So it implies that if one knows that <italic>o</italic> is not delicious, one must have tasted <italic>o</italic>. Given the Knowledge Norm, this means that an assertion of (3b), for example, will also typically implicate that the speaker has tasted the cr&#232;me caramel.</p>
<p>Note that the acquaintance inference <italic>disappears</italic> under epistemic modals and in the antecedents of indicative conditionals:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(4)</p></list-item>
</list>
<list list-type="wordfirst">
<list-item><p>(a)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>The cr&#232;me caramel must have been delicious.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>&#160;</p></list-item>
</list>
<list list-type="wordfirst">
<list-item><p>(b)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>The cr&#232;me caramel might have been delicious.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>&#160;</p></list-item>
</list>
<list list-type="wordfirst">
<list-item><p>(c)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>If the cr&#232;me caramel was delicious, Bina will be pleased.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>&#160;</p></list-item>
</list>
<list list-type="wordfirst">
<list-item><p><inline-formula><mml:math id="Eq013"><mml:mo stretchy='false'>&#8618;&#824;</mml:mo></mml:math></inline-formula></p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p><italic>the speaker has tasted the cr&#232;me caramel</italic></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>The epistemic view seems to predict this as well, since Quality implicatures likewise disappear in these environments:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(5)</p></list-item>
</list>
<list list-type="wordfirst">
<list-item><p>(a)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>It must have rained last night.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>&#160;</p></list-item>
</list>
<list list-type="wordfirst">
<list-item><p>(b)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>It might have rained last night</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>&#160;</p></list-item>
</list>
<list list-type="wordfirst">
<list-item><p>(c)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>If it rained last night, the streets will be wet</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>&#160;</p></list-item>
</list>
<list list-type="wordfirst">
<list-item><p><inline-formula><mml:math id="Eq014"><mml:mo stretchy='false'>&#8618;&#824;</mml:mo></mml:math></inline-formula></p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p><italic>the speaker knows it rained last night</italic><xref ref-type="fn" rid="n13">13</xref></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>Despite these attractions, the epistemic view also has its share of problems. <xref ref-type="bibr" rid="B43">Willer and Kennedy, <italic>op. cit.</italic>, 848</xref> argue on lingusitic grounds that that the Acquaintance Principle is false,<xref ref-type="fn" rid="n14">14</xref> while <xref ref-type="bibr" rid="B1">Anand and Korotkova, <italic>op. cit.</italic>, 63</xref> point out that the foregoing account does nothing to explain why exocentric uses of taste predicates give rise to exocentric acquaintance inferences.<xref ref-type="fn" rid="n15">15</xref> These are important objections, but I want to set them aside here in order to focus on some challenges that arise when we consider how the acquaintance requirement interacts with disjunction and with quantification, since these observations will guide our later discussion.</p>
<p>To see the problem concerning disjunction, start with an observation due to Fabrizio Cariani.<xref ref-type="fn" rid="n16">16</xref> Cariani points out that a disjunction of simple taste sentences tends to give rise to a disjunction of acquaintance requirements:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(6)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p><italic>A</italic> has just arrived at the party. She and <italic>B</italic> are looking at the dessert table.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>&#160;</p></list-item>
</list>
<list list-type="wordfirst">
<list-item><p>(a)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p><inline-formula><mml:math id="Eq015"><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>A</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:math></inline-formula>: What&#8217;s good here?</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>&#160;</p></list-item>
</list>
<list list-type="wordfirst">
<list-item><p>(b)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p><inline-formula><mml:math id="Eq016"><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>B</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:math></inline-formula>: <underline>Either the cr&#232;me caramel is delicious or the panna cotta is</underline>&#8212;I couldn&#8217;t tell which was which.</p></list-item>
<list-item><p><inline-formula><mml:math id="Eq017"><mml:mo stretchy='false'>&#8618;</mml:mo></mml:math></inline-formula> <italic>B has tasted the cr&#232;me caramel or B has tasted the panna cotta</italic></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>In (6b), the acquaintance requirements do not <italic>project</italic> over the disjunction operator, but they do not disappear either. The fact that each disjunct carries an acquaintance requirement when it occurs as a standalone sentence appears to affect the interpretation of the disjunction.</p>
<p>What does the epistemic view tell us about <italic>B</italic>&#8217;s utterance of (6b)? Assuming <italic>B</italic> is in a position to assert (6b), the Knowledge Norm tells us that <italic>B</italic> knows that either the cr&#232;me caramel is delicious or the panna cotta is delicious, i.e., <inline-formula><mml:math id="Eq018"><mml:mrow><mml:mi class="MJX-tex-caligraphic" mathvariant="script">K</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo>&#8744;</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>b</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.<xref ref-type="fn" rid="n17">17</xref> But&#160;.&#160;.&#160;. now we&#8217;re stuck. For the Acquaintance Principle only tells us that acquaintance is a requirement for knowing <italic>atomic</italic> taste sentences or their negations, sentences of the form <inline-formula><mml:math id="Eq463"><mml:mi>T</mml:mi><mml:mi>a</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math id="Eq019"><mml:mrow><mml:mo rspace="0.167em">&#172;</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow></mml:mrow></mml:math></inline-formula>. It simply says nothing about what is required to know a <italic>disjunction</italic> of atomic taste sentences, sentences of the form <inline-formula><mml:math id="Eq020"><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo>&#8744;</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>b</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>.</p>
<p>Note that this doesn&#8217;t show that the epistemic view is false&#8212;it merely shows that the view fails to predict an aspect of the phenomenon. So, perhaps if we supplement the epistemic view with some further principles, the resulting view would yield the desired prediction. One possibility would be to add the following claim to the epistemic view:</p>
<disp-quote>
<p><sc>general disjunction principle</sc></p>
<p>Normally, one knows <inline-formula><mml:math id="Eq021"><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mo>&#981;</mml:mo><mml:mo>&#8744;</mml:mo><mml:mo>&#968;</mml:mo></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> only if one knows <inline-formula><mml:math id="Eq022"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> or one knows <inline-formula><mml:math id="Eq023"><mml:mo>&#968;</mml:mo></mml:math></inline-formula>.</p>
<p><inline-formula><mml:math id="Eq024"><mml:mrow><mml:mrow><mml:mi class="MJX-tex-caligraphic" mathvariant="script">K</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mo>&#981;</mml:mo><mml:mo>&#8744;</mml:mo><mml:mo>&#968;</mml:mo></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy='false'>&#8618;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mrow><mml:mi class="MJX-tex-caligraphic" mathvariant="script">K</mml:mi><mml:mo>&#8290;</mml:mo><mml:mo>&#981;</mml:mo></mml:mrow><mml:mo>&#8744;</mml:mo><mml:mrow><mml:mi class="MJX-tex-caligraphic" mathvariant="script">K</mml:mi><mml:mo>&#8290;</mml:mo><mml:mo>&#968;</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula></p>
</disp-quote>
<p>But this principle is quite clearly false: I may know that either the Celtics will win the Championship or the Warriors will (they&#8217;re the only two teams left) without knowing which of them will win.</p>
<p>But perhaps the General Disjunction Principle only fails because it is too general. Perhaps we should have adopted a disjunction principle more narrowly tailored to the present case, one that only concerns disjunctions of atomic taste sentence and their negations. Let&#8217;s say that a sentence <inline-formula><mml:math id="Eq025"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> is a <italic>taste literal</italic> iff it is either an atomic taste sentence or the negation thereof. Then we might propose adding the following claim to the epistemic view:</p>
<disp-quote>
<p><sc>disjunction principle</sc></p>
<p>If <inline-formula><mml:math id="Eq026"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> and <inline-formula><mml:math id="Eq027"><mml:mo>&#968;</mml:mo></mml:math></inline-formula> are taste literals, then normally one knows <inline-formula><mml:math id="Eq028"><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mo>&#981;</mml:mo><mml:mo>&#8744;</mml:mo><mml:mo>&#968;</mml:mo></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> only if one knows <inline-formula><mml:math id="Eq029"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> or one knows <inline-formula><mml:math id="Eq030"><mml:mo>&#968;</mml:mo></mml:math></inline-formula>.</p>
<p><inline-formula><mml:math id="Eq031"><mml:mrow><mml:mrow><mml:mi class="MJX-tex-caligraphic" mathvariant="script">K</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mo>&#981;</mml:mo><mml:mo>&#8744;</mml:mo><mml:mo>&#968;</mml:mo></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy='false'>&#8618;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mrow><mml:mi class="MJX-tex-caligraphic" mathvariant="script">K</mml:mi><mml:mo>&#8290;</mml:mo><mml:mo>&#981;</mml:mo></mml:mrow><mml:mo>&#8744;</mml:mo><mml:mrow><mml:mi class="MJX-tex-caligraphic" mathvariant="script">K</mml:mi><mml:mo>&#8290;</mml:mo><mml:mo>&#968;</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, for taste literals <inline-formula><mml:math id="Eq032"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> and <inline-formula><mml:math id="Eq033"><mml:mo>&#968;</mml:mo></mml:math></inline-formula></p>
</disp-quote>
<p>If the Disjunction Principle were accepted, then the resulting epistemic view would predict that <italic>B</italic>&#8217;s utterance of (6b) implies that either <italic>B</italic> had tasted the cr&#232;me caramel or <italic>B</italic> had tasted the panna cotta.</p>
<p>But there are at least three problems with the resulting view. First, unless more is said, it is <italic>ad hoc</italic>. As we saw above, it is not true in general that if one knows a disjunction then one knows one of its disjuncts, so why would that be true in this special case? Second, it doesn&#8217;t even seem true in this special case. The Disjunction Principle implies that, in the scenario described above, either <italic>B</italic> knows that the cr&#232;me caramel is delicious or <italic>B</italic> knows that the panna cotta is. But it appears that <italic>B</italic> knows neither of these things. What <italic>B</italic> knows is that <italic>one</italic> of them is delicious, but he doesn&#8217;t know which one it is. After all, if he did know, e.g., that the cr&#232;me caramel is delicious, wouldn&#8217;t the Maxim of Quantity enjoin him to say this instead of the disjunction that he in fact utters?</p>
<p>The third problem arises in connection with another of Cariani&#8217;s observations. For Cariani also points out that certain disjunctions of taste literals&#8212;namely, instances of excluded middle&#8212;do <italic>not</italic> imply a disjunction of acquaintance requirements:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(7)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>Either the cr&#232;me caramel is delicious or it isn&#8217;t.</p></list-item>
<list-item><p><inline-formula><mml:math id="Eq034"><mml:mo stretchy='false'>&#8618;&#824;</mml:mo></mml:math></inline-formula> <italic>the speaker has tasted the cr&#232;me caramel</italic></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>But if the epistemic view is combined with the Disjunction Principle, the resulting view predicts that an assertion of (7) (in an autocentric context) should implicate that the speaker had tasted the cr&#232;me caramel. That seems wrong. Whether a disjunction of taste literals gives rise to a disjunction of acquaintance requirements appears to depend on the logical relations between the disjuncts.</p>
<p>Quantifiers raise related problems for the epistemic view. Suppose, for example, that I say to you <italic>Something on the dessert table is delicious</italic>. This would typically imply that I had tasted something on the dessert table. But, again, this is not predicted by the epistemic view. My utterance of the existentially quantified claim <inline-formula><mml:math id="Eq035"><mml:mrow><mml:mi>s</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>o</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>m</mml:mi><mml:mo>&#8290;</mml:mo><mml:msub><mml:mi>e</mml:mi><mml:mi>x</mml:mi></mml:msub><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mi>D</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>x</mml:mi></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>x</mml:mi></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> will, by the Knowledge Norm, imply that I know that claim, i.e., <inline-formula><mml:math id="Eq036"><mml:mrow><mml:mi class="MJX-tex-caligraphic" mathvariant="script">K</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mi>s</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>o</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>m</mml:mi><mml:mo>&#8290;</mml:mo><mml:msub><mml:mi>e</mml:mi><mml:mi>x</mml:mi></mml:msub><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mi>D</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>x</mml:mi></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>x</mml:mi></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.<xref ref-type="fn" rid="n18">18</xref> But, once again, we are stuck, since the Acquaintance Principle is simply silent about what is required for knowing an existentially quantified claim. Other quantifiers also seem to imply quantified acquaintance requirements:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(8)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>Everything on the dessert table is delicious.</p></list-item>
<list-item><p><inline-formula><mml:math id="Eq037"><mml:mo stretchy='false'>&#8618;</mml:mo></mml:math></inline-formula> <italic>the speaker has tasted everything on the dessert table</italic></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>We might try to explain these facts by adopting yet another principle:</p>
<disp-quote>
<p><sc>quantifier principle</sc></p>
<p>Normally, one knows that <italic>Q F</italic>&#8217;s are delicious only if <italic>Q F</italic>&#8217;s are known by one to be delicious.</p>
<p><inline-formula><mml:math id="Eq038"><mml:mrow><mml:mrow><mml:mi class="MJX-tex-caligraphic" mathvariant="script">K</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:msub><mml:mi>Q</mml:mi><mml:mi>x</mml:mi></mml:msub><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mi>F</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>x</mml:mi></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>x</mml:mi></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy='false'>&#8618;</mml:mo><mml:mrow><mml:msub><mml:mi>Q</mml:mi><mml:mi>x</mml:mi></mml:msub><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mi>F</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>x</mml:mi></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mi class="MJX-tex-caligraphic" mathvariant="script">K</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>x</mml:mi></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula></p>
</disp-quote>
<p>Here <italic>Q</italic> is being used as a schematic letter whose substituends are quantificational determiners (<italic>every, some, no</italic>, etc.). While this might suffice to handle the observations we&#8217;ve discussed so far, the generalization embodied in the Quantifier Principle turns out to fail when we consider certain other quantifiers. Consider <italic>nothing</italic>, for example:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(9)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>Nothing on the dessert table is delicious.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>This seems to imply that the speaker has tasted everything on the table. But when supplemented by the Quantifier Principle, the epistemic view only tells us that nothing on the table is known by the speaker to be delicious, i.e., <italic>no</italic><inline-formula><mml:math id="Eq039"><mml:mrow><mml:mmultiscripts><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>D</mml:mi><mml:mi>x</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mprescripts/><mml:mi>x</mml:mi><mml:mrow/></mml:mmultiscripts><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi class="MJX-tex-caligraphic" mathvariant="script">K</mml:mi><mml:mi>T</mml:mi><mml:mi>x</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. But given the logic of the epistemic view, that appears to be compatible with the speaker&#8217;s not having tasted anything on the dessert table.</p>
<p>Unlike <italic>some</italic> and <italic>every</italic>, the quantificational determiner <italic>no</italic> fails to be &#8216;right upward monotonic&#8217; (<sc>rum</sc>): while <italic>Every girl runs quickly</italic> entails <italic>Every girl runs, No girl runs quickly</italic> does not entail <italic>No girl runs</italic>.<xref ref-type="fn" rid="n19">19</xref> Other non-rum determiners create trouble for the Quantifier Principle as well. For example:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(10)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>Exactly two things on the dessert table are delicious.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>This again seems to imply that the speaker has tasted everything on the dessert table. The Quantifier Principle seems instead to predict that exactly two things on the dessert table are known by the speaker to be delicious. But given the logic of the epistemic view, this is compatible with the speaker not having tasted everything on the dessert table.</p>
</sec>
<sec id="S3">
<title>3. The presupposition view</title>
<p>Perhaps the epistemic view can be rescued by supplementing it with principles other than the ones canvassed above. But rather than investigate that possibility here, we move on to consider an alternative hypothesis.</p>
<p>As we saw earlier, the acquaintance inference projects over negation&#8212;recall (3). And note that this is also a characteristic feature of <italic>presuppositions</italic>:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(11)</p></list-item>
</list>
<list list-type="wordfirst">
<list-item><p>(a)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>Sue stopped smoking.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>&#160;</p></list-item>
</list>
<list list-type="wordfirst">
<list-item><p>(b)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>Sue didn&#8217;t stop smoking.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>&#160;</p></list-item>
</list>
<list list-type="wordfirst">
<list-item><p><inline-formula><mml:math id="Eq040"><mml:mo stretchy='false'>&#8618;</mml:mo></mml:math></inline-formula></p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p><italic>Sue smoked in the past</italic></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>Now, there are various ways of characterizing the relevant notion of presupposition, but it will suffice for the moment to simply say that the <italic>presupposition view</italic> is the hypothesis that the relationship between <italic>The cr&#232;me caramel is delicious</italic> and <italic>I have tasted the cr&#232;me caramel</italic> is essentially like the relationship between <italic>Sue stopped smoking</italic> and <italic>Sue smoked in the past</italic>. Furthermore, advocates of the presupposition view typically adopt the (fairly standard) assumption that a sentence with a false presupposition lacks a truth value, and so this is the version of the presuppostional view that we consider here.<xref ref-type="fn" rid="n20">20</xref></p>
<p>Some of the other observations discussed above also support the presupposition view. For example, we saw earlier that a disjunction of (logically unrelated) taste literals typically gives rise to a disjunction of acquaintance requirements&#8212;recall (6b). Similarly, a disjunction of atomic sentences containing presupposition triggers typically gives rise a disjunctive presupposition:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(12)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>Sue stopped smoking or Mary stopped smoking&#8212;I can&#8217;t remember which.</p></list-item>
<list-item><p><inline-formula><mml:math id="Eq041"><mml:mo stretchy='false'>&#8618;</mml:mo></mml:math></inline-formula> <italic>Sue smoked in the past or Mary smoked in the past</italic></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>We also saw earlier that when we place an atomic taste sentence in the scope of a universal quantifier, we get a universally quantified acquaintance requirement&#8212;recall (8). Again, something similar happens with presuppositions:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(13)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>Every student in my logic class stopped smoking</p></list-item>
<list-item><p><inline-formula><mml:math id="Eq042"><mml:mo stretchy='false'>&#8618;</mml:mo></mml:math></inline-formula> <italic>every student in my logic class smoked in the past</italic></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>This is encouraging for advocates of the presupposition view, but there are disanologies as well. Recall our earlier observation that the acquaintance requirement disappears when we place an atomic taste sentence in the scope of an epistemic modal or in the antecedent of an indicative conditional (see the examples in (4)). This poses a <italic>prima facie</italic> problem for the presupposition view, since presuppositions typically project out of these environments:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(14)</p></list-item>
</list>
<list list-type="wordfirst">
<list-item><p>(a)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="word">
<list-item><p>Sue must have stopped smoking.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>&#160;</p></list-item>
</list>
<list list-type="wordfirst">
<list-item><p>(b)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>Sue might have stopped smoking.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>&#160;</p></list-item>
</list>
<list list-type="wordfirst">
<list-item><p>(c)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>If Sue stopped smoking, her kids will be pleased.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>&#160;</p></list-item>
</list>
<list list-type="wordfirst">
<list-item><p><inline-formula><mml:math id="Eq043"><mml:mo stretchy='false'>&#8618;</mml:mo></mml:math></inline-formula></p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p><italic>Sue smoked in the past</italic></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>Unless more is said, the presupposition view will predict, falsely, that the acquaintance requirement projects out of these environments as well (<xref ref-type="bibr" rid="B27">Ninan, <italic>op. cit.</italic>, 298 (2014)</xref>).</p>
<p><xref ref-type="bibr" rid="B1">Anand and Korotkova, <italic>op. cit.</italic></xref> offer a solution to this last problem. Their idea is that the acquaintance requirement is essentially a presupposition, but one that can be <italic>obviated</italic> by certain markers of indirectness, such as epistemic modals. The basic strategy of their approach is that while <italic>o is delicious</italic> is defined in an autocentric context only if the speaker has tasted <italic>o</italic> before, <italic>o might be delicious</italic> is defined in every context, even those autocentric contexts in which the speaker has not tasted <italic>o</italic>. Thus, simple taste sentences carry the acquaintance requirement, while sentences of the form <italic>o might be delicious</italic> do not.</p>
<p>Anand and Korotkova formulate their semantics using the notion of a <italic>kernel</italic>, a set of propositions that constitutes an agent&#8217;s direct evidence on a given occasion (<xref ref-type="bibr" rid="B41">von Fintel and Gillies, <italic>op. cit.</italic></xref>). They hypothesize that <italic>o is delicious</italic> presupposes that the relevant kernel directly settles whether <italic>o</italic> is delicious to the relevant individual (the &#8216;judge&#8217;). More precisely, let a point of evaluation consist of a world <italic>w</italic>, a judge <italic>j</italic>, and a kernel <italic>K</italic>, where <italic>K</italic> is a set of propositions (i.e., a set of partial functions from worlds to truth values). I assume that <inline-formula><mml:math id="Eq044"><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>K</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> corresponds to a context only if for all <inline-formula><mml:math id="Eq045"><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#8712;</mml:mo><mml:mi>K</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="Eq046"><mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>. Then Anand and Korotkova propose the following semantics for taste predicates:</p>
<disp-quote>
<p><inline-formula><mml:math id="Eq047"><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>o</mml:mi><mml:mo lspace="0.500em">&#8290;</mml:mo><mml:mo>&#119894;&#119904;</mml:mo><mml:mo lspace="0.500em">&#8290;</mml:mo><mml:mi>&#119889;&#119890;&#119897;&#119894;&#119888;&#119894;&#119900;&#119906;&#119904;</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>K</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is defined iff <italic>K</italic> directly settles <inline-formula><mml:math id="Eq048"><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#955;</mml:mi><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup><mml:mo lspace="0em" rspace="0.667em">.</mml:mo><mml:mi>o</mml:mi></mml:mrow></mml:math></inline-formula> is delicious to <italic>j</italic> in <italic>w</italic>&#8242;].</p>
<p>Where defined, <inline-formula><mml:math id="Eq049"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>o</mml:mi><mml:mo lspace="0.500em">&#8290;</mml:mo><mml:mi>&#119894;&#119904;</mml:mi><mml:mo lspace="0.500em">&#8290;</mml:mo><mml:mi>&#119889;&#119890;&#119897;&#119894;&#119888;&#119894;&#119900;&#119906;&#119904;</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>K</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> iff <italic>o</italic> is delicious to <italic>j</italic> in <italic>w</italic>.</p>
</disp-quote>
<p>A kernel <italic>K directly settles</italic> a proposition <italic>q</italic> just in case <italic>K</italic> contains a proposition <italic>p</italic> such that <italic>p</italic> entails <italic>q</italic> or <italic>p</italic> entails the negation of <italic>q</italic>. Anand and Korotkova assume that a kernel directly settles <inline-formula><mml:math id="Eq050"><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#955;</mml:mi><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup><mml:mo lspace="0em" rspace="0.667em">.</mml:mo><mml:mi>o</mml:mi></mml:mrow></mml:math></inline-formula> is delicious to <italic>j</italic> in <italic>w</italic>&#8242;] only if it contains a proposition that entails <inline-formula><mml:math id="Eq051"><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#955;</mml:mi><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup><mml:mo lspace="0em" rspace="0.667em">.</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:math></inline-formula> has tasted <italic>o</italic> in <italic>w</italic>&#8242;] (67). Thus, if an autocentric context is one in which the speaker is the judge, then <italic>o is delicious</italic> will be defined in such a context only if the speaker has tasted <italic>o</italic> before. To see this, suppose <inline-formula><mml:math id="Eq052"><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>o</mml:mi><mml:mo lspace="0.500em">&#8290;</mml:mo><mml:mi>&#119894;&#119904;</mml:mi><mml:mo lspace="0.500em">&#8290;</mml:mo><mml:mi>&#119889;&#119890;&#119897;&#119894;&#119888;&#119894;&#119900;&#119906;&#119904;</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>K</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup></mml:math></inline-formula> is defined, where <italic>c</italic> is an autocentric context. Then <italic>K<sub>c</sub></italic> directly settles <inline-formula><mml:math id="Eq053"><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#955;</mml:mi><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup><mml:mo lspace="0em" rspace="0.667em">.</mml:mo><mml:mi>o</mml:mi></mml:mrow></mml:math></inline-formula> is delicious to <italic>j<sub>c</sub></italic> in <inline-formula><mml:math id="Eq054"><mml:mrow><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:math></inline-formula>. So <italic>K<sub>c</sub></italic> contains a proposition <italic>p</italic> such that for all <italic>w</italic>, if <inline-formula><mml:math id="Eq055"><mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>, then <italic>j<sub>c</sub></italic> has tasted <italic>o</italic> in <italic>w</italic>. Since <inline-formula><mml:math id="Eq056"><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>K</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> corresponds to a context and <inline-formula><mml:math id="Eq057"><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#8712;</mml:mo><mml:msub><mml:mi>K</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="Eq058"><mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>. So <italic>j<sub>c</sub></italic> has tasted <italic>o</italic> in <italic>w<sub>c</sub></italic>. Since <italic>c</italic> is autocentric, <italic>j<sub>c</sub></italic> is the speaker of <italic>c</italic>. Given an appropriate lexical entry for negation, <italic>o is not delicious</italic> will likewise be defined in an autocentric context only if the speaker has tasted <italic>o</italic> before. So Anand and Korotkova predict the acquaintance requirement for atomic taste sentences and their negations.</p>
<p>Anand and Korotkova then hypothesize that epistemic modals obviate this presupposition by over-writing the kernel parameter (68). This has the effect of altering the presupposition so that it becomes trivial, which is essentially equivalent to saying that the sentence has no presupposition at all. Here, for example, is an entry for epistemic <italic>might</italic> that does the job:</p>
<disp-quote>
<p><inline-formula><mml:math id="Eq059"><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>&#119898;&#119894;&#119892;&#8462;&#119905;</mml:mi><mml:mo lspace="0.500em">&#8290;</mml:mo><mml:mo>&#981;</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>K</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is defined iff <inline-formula><mml:math id="Eq060"><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mi class="MJX-tex-caligraphic" mathvariant="script">P</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>W</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:msup></mml:math></inline-formula> is defined.</p>
<p>Where defined, <inline-formula><mml:math id="Eq061"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>&#119898;&#119894;&#119892;&#8462;&#119905;</mml:mi><mml:mo lspace="0.500em">&#8290;</mml:mo><mml:mo>&#981;</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>K</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> iff for some <inline-formula><mml:math id="Eq062"><mml:mrow><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup><mml:mo rspace="0.1389em">&#8712;</mml:mo><mml:mrow><mml:mo lspace="0.1389em" rspace="0em">&#8745;</mml:mo><mml:mi>K</mml:mi></mml:mrow></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="Eq063"><mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mi class="MJX-tex-caligraphic" mathvariant="script">P</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>W</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo lspace="0em">.</mml:mo></mml:mrow></mml:math></inline-formula><xref ref-type="fn" rid="n21">21</xref></p>
</disp-quote>
<p>Here <inline-formula><mml:math id="Eq064"><mml:mrow><mml:mi class="MJX-tex-caligraphic" mathvariant="script">P</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>W</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is the set of all propositions (the set of all partial functions from worlds to truth values). This set directly settles any proposition <italic>p</italic>, since <italic>p</italic> itself will be an element of <inline-formula><mml:math id="Eq065"><mml:mrow><mml:mi class="MJX-tex-caligraphic" mathvariant="script">P</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>W</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. The set <inline-formula><mml:math id="Eq066"><mml:mrow><mml:mo rspace="0em">&#8745;</mml:mo><mml:mi>K</mml:mi></mml:mrow></mml:math></inline-formula> is:</p>
<disp-quote>
<p><inline-formula><mml:math id="Eq067"><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup><mml:mo lspace="0.278em">:</mml:mo></mml:mrow></mml:math></inline-formula> for all <inline-formula><mml:math id="Eq068"><mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#8712;</mml:mo><mml:mi>K</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mrow></mml:math></inline-formula>}.</p>
</disp-quote>
<p>We can show now that, on this approach, <italic>might</italic> (<italic>o is delicious</italic>) will be defined in every context. To see this, let <inline-formula><mml:math id="Eq069"><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>K</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> be a context. Then we have:</p>
<disp-quote>
<p><inline-formula><mml:math id="Eq070"><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>&#119898;&#119894;&#119892;&#8462;&#119905;</mml:mi><mml:mo lspace="0.500em">&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mi>o</mml:mi><mml:mo lspace="0.500em">&#8290;</mml:mo><mml:mi>&#119894;&#119904;</mml:mi><mml:mo lspace="0.500em">&#8290;</mml:mo><mml:mi>&#119889;&#119890;&#119897;&#119894;&#119888;&#119894;&#119900;&#119906;&#119904;</mml:mi></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>K</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is defined iff <inline-formula><mml:math id="Eq071"><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>o</mml:mi><mml:mo lspace="0.500em">&#8290;</mml:mo><mml:mi>&#119894;&#119904;</mml:mi><mml:mo lspace="0.500em">&#8290;</mml:mo><mml:mi>&#119889;&#119890;&#119897;&#119894;&#119888;&#119894;&#119900;&#119906;&#119904;</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mi class="MJX-tex-caligraphic" mathvariant="script">P</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>W</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:msup></mml:math></inline-formula> is defined.</p>
</disp-quote>
<p>And we have:</p>
<disp-quote>
<p><inline-formula><mml:math id="Eq072"><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>o</mml:mi><mml:mo lspace="0.500em">&#8290;</mml:mo><mml:mi>&#119894;&#119904;</mml:mi><mml:mo lspace="0.500em">&#8290;</mml:mo><mml:mi>&#119889;&#119890;&#119897;&#119894;&#119888;&#119894;&#119900;&#119906;&#119904;</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mi class="MJX-tex-caligraphic" mathvariant="script">P</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>W</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:msup></mml:math></inline-formula> is defined iff <inline-formula><mml:math id="Eq073"><mml:mrow><mml:mi class="MJX-tex-caligraphic" mathvariant="script">P</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>W</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> directly settles <inline-formula><mml:math id="Eq074"><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#955;</mml:mi><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup><mml:mo lspace="0em" rspace="0.667em">.</mml:mo><mml:mi>o</mml:mi></mml:mrow></mml:math></inline-formula> is delicious to <italic>j</italic> in <italic>w</italic>&#8242;].</p>
</disp-quote>
<p>Now, given Anand and Korotkova&#8217;s assumption, <inline-formula><mml:math id="Eq075"><mml:mrow><mml:mi class="MJX-tex-caligraphic" mathvariant="script">P</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>W</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> directly settles <inline-formula><mml:math id="Eq076"><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#955;</mml:mi><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup><mml:mo lspace="0em" rspace="0.667em">.</mml:mo><mml:mi>o</mml:mi></mml:mrow></mml:math></inline-formula> is delicious to <italic>j</italic> in <italic>w</italic>&#8242;] just in case <inline-formula><mml:math id="Eq077"><mml:mrow><mml:mi class="MJX-tex-caligraphic" mathvariant="script">P</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>W</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> contains a proposition that entails <inline-formula><mml:math id="Eq078"><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#955;</mml:mi><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup><mml:mo lspace="0em" rspace="0.667em">.</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:math></inline-formula> has tasted <italic>o</italic> in <italic>w</italic>&#8242;]. But since <inline-formula><mml:math id="Eq079"><mml:mrow><mml:mi class="MJX-tex-caligraphic" mathvariant="script">P</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>W</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is the set of <italic>all</italic> propositions, it of course contains such a proposition: <inline-formula><mml:math id="Eq080"><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#955;</mml:mi><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup><mml:mo lspace="0em" rspace="0.667em">.</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:math></inline-formula> has tasted <italic>o</italic> in <italic>w</italic>&#8242;] itself will do. Thus, since <italic>might</italic> (<italic>o is delicious</italic>) is defined in every context, it will be defined even in autocentric contexts in which the speaker has not tasted <italic>o</italic>. Thus, on this approach, <italic>might</italic> (<italic>o is delicious</italic>) will not give rise to an acquaintance inference.</p>
<p>While this is an elegant solution to the initial problem for the presupposition view, I see three potential problems for the resulting account.</p>
<p>First, I noted above that the presupposition view was supported by one of Cariani&#8217;s observations about disjunction. But recall Cariani&#8217;s other observation about disjunction, which is that <inline-formula><mml:math id="Eq081"><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo>&#8744;</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#172;</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> is assertable even if the speaker hasn&#8217;t tasted <italic>a</italic> before. But if the speaker of context <italic>c</italic> hasn&#8217;t tasted <italic>a</italic> before, this version of the presupposition view predicts that neither <inline-formula><mml:math id="Eq464"><mml:mi>T</mml:mi><mml:mi>a</mml:mi></mml:math></inline-formula> nor <inline-formula><mml:math id="Eq082"><mml:mrow><mml:mo rspace="0.167em">&#172;</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow></mml:mrow></mml:math></inline-formula> will be defined at the point of evaluation <inline-formula><mml:math id="Eq083"><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>K</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>. It is thus hard to see how <inline-formula><mml:math id="Eq084"><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo>&#8744;</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#172;</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> could come out true at that point. For on standard trivalent theories of disjunction, if <inline-formula><mml:math id="Eq085"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> and <inline-formula><mml:math id="Eq086"><mml:mo>&#968;</mml:mo></mml:math></inline-formula> are both undefined, then so is <inline-formula><mml:math id="Eq087"><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mo>&#981;</mml:mo><mml:mo>&#8744;</mml:mo><mml:mo>&#968;</mml:mo></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>.<xref ref-type="fn" rid="n22">22</xref></p>
<p>Second, I also noted above that the acquaintance requirement interacts with the universal quantifier in much the same way that standard presuppositions do. But when we turn to other quantifiers&#8212;such as the non-rum quantifiers discussed earlier&#8212;we start to see disanalogies. Compare:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(10)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>Exactly two things on the dessert table are delicious.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(15)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>Exactly two students in my class stopped smoking recently.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>Earlier we suggested that (10) would ordinarily imply that the speaker had tasted everything on the dessert table. But (15) does not necessarily give rise to a corresponding universal presupposition, as B. R. George observes.<xref ref-type="fn" rid="n23">23</xref> To see this, suppose there are ten students in my class, two of whom smoked in the past and no longer smoke, and eight of whom never smoked. According to George, (15) has a reading on which it is true in this situation.</p>
<p>These differences between <italic>delicious</italic> and standard presupposition triggers pose a <italic>prima facie</italic> problem for any theory that hopes to treat the acquaintance requirement as a standard presupposition. For suppose we construct a theory of presupposition that predicts that (15) has a reading on which it means:</p>
<disp-quote>
<p>Exactly two students in my class smoked in the past and do not smoke now.</p>
</disp-quote>
<p>If the theoretical machinery that produces this reading is simply applied without alteration to (10), the resulting theory will predict that (10) has a reading on which it means (approximately):</p>
<disp-quote>
<p>Exactly two things on the dessert table are such that I have tasted them and find them delicious.</p>
</disp-quote>
<p>But this does not seem to be a possible interpretation of (10). The upshot of this is that the presupposition view needs a further mechanism&#8212;beyond the obviation mechanism discussed above&#8212;in order to predict the behavior of taste predicates under non-<sc>rum</sc> quantifiers. But proponents of the presupposition view have yet to spell out the workings of such a mechanism.</p>
<p>The final issue I want to raise concerns what I regard as a conceptually awkward feature of the presupposition view. Suppose you haven&#8217;t tasted the cr&#232;me caramel, but you believe that it is delicious&#8212;it looks delicious and everyone at the party is raving about it. This seems possible&#8212;it seems possible to believe that something is delicious even if you haven&#8217;t tasted it yet, as a number of authors have observed.<xref ref-type="fn" rid="n24">24</xref> As we&#8217;ll see in a moment, the presupposition view can accommodate this fact. The trouble arises when we go on to ask the following question: given that you believe that the cr&#232;me caramel is delicious, what should your attitude towards the content of the sentence <italic>The cr&#232;me caramel is delicious</italic> be? The natural answer is: you should believe it, at least if you are in an autocentric context. But the presupposition view appears to predict otherwise: it appears to predict that you can believe that the cr&#232;me caramel is delicious while at the same time rejecting the content of the sentence <italic>The cr&#232;me caramel is delicious</italic>. This is an odd result.</p>
<p>To see why the presupposition view has this feature, note that our initial observation above&#8212;that you can believe that something is delicious even if you haven&#8217;t tasted it yet&#8212;suggests that <italic>believes</italic> also obviates the acquaintance inference. Note, for example, the felicity of the following:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(16)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>I believe the cr&#232;me caramel is delicious, but I haven&#8217;t tried it yet.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>This could be handled in Anand and Korotkova&#8217;s system by allowing <italic>believes</italic> to shift the kernel parameter:</p>
<disp-quote>
<p><inline-formula><mml:math id="Eq088"><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:msub><mml:mi>B</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x00A0;</mml:mo><mml:mo>&#981;</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>K</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is defined iff for all <inline-formula><mml:math id="Eq089"><mml:mrow><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup><mml:mo>&#8712;</mml:mo><mml:mrow><mml:mi>D</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>o</mml:mi><mml:mo>&#8290;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:math></inline-formula> <inline-formula><mml:math id="Eq090"><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mi class="MJX-tex-caligraphic" mathvariant="script">P</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>W</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:msup></mml:math></inline-formula> is defined.</p>
<p>Where defined, <inline-formula><mml:math id="Eq091"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:msub><mml:mi>B</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x00A0;</mml:mo><mml:mo>&#981;</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>K</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> iff for all <inline-formula><mml:math id="Eq092"><mml:mrow><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup><mml:mo>&#8712;</mml:mo><mml:mrow><mml:mi>D</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>o</mml:mi><mml:mo>&#8290;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="Eq093"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mi class="MJX-tex-caligraphic" mathvariant="script">P</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>W</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula></p>
</disp-quote>
<p>Here, <italic>B<sub>i</sub></italic> translates <italic>I believe</italic>, and <inline-formula><mml:math id="Eq094"><mml:mrow><mml:mi>D</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>o</mml:mi><mml:mo>&#8290;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is the set of worlds compatible with what the speaker <italic>s<sub>c</sub></italic> believes in <italic>w</italic>. Because <italic>B<sub>i</sub></italic> shifts the kernel parameter to <inline-formula><mml:math id="Eq095"><mml:mrow><mml:mi class="MJX-tex-caligraphic" mathvariant="script">P</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>W</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, when we combine this with Anand and Korotkova&#8217;s account of taste predicates we get the desired result that <italic>I believe the cr&#232;me caramel is delicious</italic> may be true in an autocentric context even if the speaker hasn&#8217;t tasted the cr&#232;me caramel.</p>
<p>So far, so good. Now note that in frameworks like the one Anand and Korotkova employ, it is natural to provide a definition of the <italic>content</italic> of a sentence <inline-formula><mml:math id="Eq096"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> relative to a context <italic>c</italic> (aka &#8216;the proposition expressed by <inline-formula><mml:math id="Eq097"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> in <italic>c</italic>&#8217;).<xref ref-type="fn" rid="n25">25</xref> Ordinarily, this is thought to be what someone who uttered <inline-formula><mml:math id="Eq098"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> in <italic>c</italic> would thereby assert.<xref ref-type="fn" rid="n26">26</xref> And it would be what a sincere utterance of <inline-formula><mml:math id="Eq099"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> in <italic>c</italic> would add to the <italic>common ground</italic> of <italic>c</italic>.<xref ref-type="fn" rid="n27">27</xref> If we adopted a contextualist approach to this notion, we would define it as follows:</p>
<disp-quote>
<p>The content of <inline-formula><mml:math id="Eq100"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> in <italic>c</italic> is: <inline-formula><mml:math id="Eq101"><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#955;</mml:mi><mml:mi>w</mml:mi><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>K</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> is defined. <inline-formula><mml:math id="Eq102"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>K</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>].</p>
</disp-quote>
<p>So the content of <inline-formula><mml:math id="Eq103"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> in <italic>c</italic> is a partial function from worlds to truth values. It is defined at a world <italic>w</italic> iff <inline-formula><mml:math id="Eq104"><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>K</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup></mml:math></inline-formula> is defined. If defined at <italic>w</italic>, it maps <italic>w</italic> to truth iff <inline-formula><mml:math id="Eq105"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>K</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>.</p>
<p>Now when we take this definition of the content of <inline-formula><mml:math id="Eq106"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> in context <italic>c</italic> and combine it with the semantics for taste predicates that Anand and Korotkova offer, we get the result that the content of <italic>The cr&#232;me caramel is delicious</italic> in an autocentric context <italic>c</italic> is the following proposition:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(a)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p><inline-formula><mml:math id="Eq107"><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#955;</mml:mi><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup><mml:mo lspace="0.278em" rspace="0.778em">:</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> has tasted the cr&#232;me caramel in <inline-formula><mml:math id="Eq108"><mml:mrow><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup><mml:mo lspace="0em">.</mml:mo></mml:mrow></mml:math></inline-formula> the cr&#232;me caramel is delicious to <italic>s<sub>c</sub></italic> in <inline-formula><mml:math id="Eq109"><mml:mrow><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:math></inline-formula></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>where <italic>s<sub>c</sub></italic> is the speaker of <italic>c</italic>. This is a &#8216;partial proposition,&#8217; a partial function from worlds to truth values. It is defined at a world <italic>w</italic> iff <italic>s<sub>c</sub></italic> has tasted the cr&#232;me caramel in <italic>w</italic>. Where defined, it maps <italic>w</italic> to truth just in case the cr&#232;me caramel is delicious to <italic>s<sub>c</sub></italic> in <italic>w</italic>.</p>
<p>Now here is the problem. Suppose that <italic>I believe the cr&#232;me caramel is delicious</italic> is true in an autocentric context <italic>c</italic>. Suppose further that the speaker <italic>s<sub>c</sub></italic> hasn&#8217;t tasted the cr&#232;me caramel and that <italic>s<sub>c</sub></italic> believes that they haven&#8217;t tasted the cr&#232;me caramel. Then it follows that if <italic>s<sub>c</sub></italic>&#8217;s belief state is non-empty, <italic>s<sub>c</sub></italic> does not believe proposition (a) in context <italic>c</italic>. To see this, let <italic>w</italic> be a world compatible with what <italic>s<sub>c</sub></italic> believes in <italic>c</italic>. Since <italic>s<sub>c</sub></italic> believes in <italic>c</italic> that they have not tried the cr&#232;me caramel yet, it follows that <italic>s<sub>c</sub></italic> has not tried the cr&#232;me caramel in <italic>w</italic>. Hence, (a) is not defined at <italic>w</italic> and so does not map <italic>w</italic> to 1. Thus, it follows that <italic>s<sub>c</sub></italic> does not believe proposition (a) in <italic>c</italic>. But since (a) is the proposition expressed by <italic>The cr&#232;me caramel is delicious</italic> in <italic>c</italic>, it follows that although the sentence <italic>I believe the cr&#232;me caramel is delicious</italic> is true in context <italic>c</italic>, the speaker does not believe the proposition expressed by <italic>The cr&#232;me caramel is delicious</italic> in <italic>c</italic>.</p>
<p>But how can this be? How can I believe that the cr&#232;me caramel is delicious, but not believe the proposition expressed by the sentence <italic>The cr&#232;me caramel is delicious</italic> in my autocentric context? Don&#8217;t I <italic>have to</italic> believe that content, given that I believe that the cr&#232;me caramel is delicious? Perhaps there is some story one could tell about sentences, contents, and beliefs that would make negative answers to these questions palatable, but I would prefer to see if we can formulate a theory that avoids this problem altogether.<xref ref-type="fn" rid="n28">28</xref></p>
<p>What this last observation seems to show is that the acquaintance requirement should be thought of as a requirement on <italic>assertability</italic>, not on <italic>truth</italic> or on <italic>having a truth value</italic>. In order for <italic>The cr&#232;me caramel is delicious</italic> to be <italic>assertable</italic> in a context, it is required that the speaker has tasted the cr&#232;me caramel before. But in order for that sentence to be <italic>true</italic> in a context, it <italic>isn&#8217;t</italic> required that the speaker has tasted the cr&#232;me caramel before. That is why you can believe the content of <italic>The cr&#232;me caramel is delicious</italic> even if you haven&#8217;t tasted the cr&#232;me caramel yet&#8212;you can believe it because it still might be true.</p>
</sec>
<sec id="S4">
<title>4. The expressivist view</title>
<p>Although I reject the epistemic view and the presupposition view for the reasons given, our expressivist alternative will incorporate insights from each view. From the epistemic view, we take the idea that the acquaintance requirement is generated in part by a normative requirement on assertion, and from the presupposition view, we take the idea that certain operators obviate the acquaintance requirement by manipulating a parameter in the points of evaluation. But the expressivist theory improves on these approaches: unlike the epistemic view, its account of the basic acquaintance inference extends smoothly to disjunction and quantifiers; unlike the presupposition view, it does not make the acquaintance requirement a requirement on the truth of taste sentences.</p>
<p>Recall the key expressivist idea: in saying that the cr&#232;me caramel is delicious, I am expressing &#8216;my liking&#8217; of the taste of the cr&#232;me caramel. Since I can&#8217;t like the taste of something without having tasted it, that explains why the acquaintance inference arises. But what do we mean when we say that a speech act <italic>expresses</italic> a given mental state? While there are no doubt different plausible answers we could give to this question, I shall take my cue from <xref ref-type="bibr" rid="B43">Willer and Kennedy, <italic>op. cit.</italic>, 831</xref> who suggest that speech acts &#8220;express states of mind insofar as they require the speaker to be in a certain state of mind for the utterance to be in accordance with the norms for performing the speech act.&#8221; Suppose, for example, that there is a norm that entails that one may assert <inline-formula><mml:math id="Eq110"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> only if one believes <inline-formula><mml:math id="Eq111"><mml:mo>&#981;</mml:mo></mml:math></inline-formula>. Then if I assert <inline-formula><mml:math id="Eq112"><mml:mo>&#981;</mml:mo></mml:math></inline-formula>, my assertion will ordinarily implicate that I believe <inline-formula><mml:math id="Eq113"><mml:mo>&#981;</mml:mo></mml:math></inline-formula>. For if I assert <inline-formula><mml:math id="Eq114"><mml:mo>&#981;</mml:mo></mml:math></inline-formula>, my audience will normally assume that I am attempting to comply with that norm, and if I am complying with it, I will believe <inline-formula><mml:math id="Eq115"><mml:mo>&#981;</mml:mo></mml:math></inline-formula>. That is one sense in which assertions may be said to express beliefs.</p>
<p>If we want to say that my assertion of <italic>The cr&#232;me caramel is delicious</italic> expresses my liking of the cr&#232;me caramel in this sense, we need a theory according to which there is a norm that entails that one may assert <italic>The cr&#232;me caramel is delicious</italic> only if one likes it. For if there is such a norm, then if I assert <italic>The cr&#232;me caramel is delicious</italic>, my assertion will typically implicate that I like the cr&#232;me caramel. For if I assert that sentence, my audience will normally assume that I am attempting to comply with that norm, and if I am complying with it, I will like the cr&#232;me caramel. But in light of the examples discussed above, the theory will also need to cover more complex cases. For example, when I taste all of the items on the dessert table and like exactly two of them, I am in a certain complex psychological state, the state of liking two items on the dessert table and disliking all of the others. So the norm in question will need to entail that I may assert <italic>Exactly two things are on the dessert table are delicious</italic> only if I am in this complex state.</p>
<p>What kind of inference is the acquaintance inference according to this view? On the present approach, the relationship between an assertion of <italic>The cr&#232;me caramel is delicious</italic> and the proposition that the speaker likes the taste of cr&#232;me caramel is similar to the the relationship between an assertion of <italic>It&#8217;s raining</italic> and the proposition that the speaker believes that it&#8217;s raining. We may call such inferences <italic>expressive inferences</italic>, for they are inferences from an utterance to a proposition concerning the state of mind the speaker expresses in making that utterance. Thus, according to the expressivist theory of taste predicates offered here, the acquaintance inference is an expressive inference.</p>
<sec id="S4.1">
<title>4.1 An informal sketch</title>
<p>Our approach starts with the idea of a <italic>categorical standard of taste</italic>. You can think of your categorical standard of taste as a record of what you&#8217;ve tasted and whether you found it delicious or not. We can model your categorical standard of taste as a partial function <inline-formula><mml:math id="Eq116"><mml:mi>&#967;</mml:mi></mml:math></inline-formula> that maps items in the relevant domain of discourse <italic>D</italic> to 0 or 1. More specifically, <inline-formula><mml:math id="Eq117"><mml:mi>&#967;</mml:mi></mml:math></inline-formula> maps an object <italic>o</italic> to 1 if you tasted and liked <italic>o</italic>, it maps <italic>o</italic> to 0 if you tasted and didn&#8217;t like <italic>o</italic>, and it is undefined for <italic>o</italic> if you haven&#8217;t tasted <italic>o</italic>. Suppose, for example, that there are only three things in the relevant domain of discourse: a cr&#232;me caramel, a sponge cake, and an apple tart. And suppose you&#8217;ve only tried the cr&#232;me caramel and the sponge cake, and that you liked the cr&#232;me caramel but didn&#8217;t like the sponge cake. Then your categorical standard <inline-formula><mml:math id="Eq118"><mml:mi>&#967;</mml:mi></mml:math></inline-formula> maps the cr&#232;me caramel to 1 (since you liked it), maps the sponge cake to 0 (since you didn&#8217;t like it), and is undefined for the apple tart (since you haven&#8217;t tried it).</p>
<p>The other notion we need is that of a <italic>complete extension</italic> of your categorical standard of taste. A complete extension of your categorical standard <inline-formula><mml:math id="Eq119"><mml:mi>&#967;</mml:mi></mml:math></inline-formula> is simply any way of extending <inline-formula><mml:math id="Eq120"><mml:mi>&#967;</mml:mi></mml:math></inline-formula> to <italic>all</italic> of the items in the domain, including the ones you haven&#8217;t tasted. In other words, a complete extension of your categorical standard <inline-formula><mml:math id="Eq121"><mml:mi>&#967;</mml:mi></mml:math></inline-formula> is a <italic>total</italic> function <inline-formula><mml:math id="Eq122"><mml:mi>&#963;</mml:mi></mml:math></inline-formula> from <italic>D</italic> to <inline-formula><mml:math id="Eq123"><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy='false'>}</mml:mo></mml:mrow></mml:math></inline-formula> such that for any <inline-formula><mml:math id="Eq124"><mml:mrow><mml:mi>o</mml:mi><mml:mo>&#8712;</mml:mo><mml:mi>D</mml:mi></mml:mrow></mml:math></inline-formula> for which <inline-formula><mml:math id="Eq125"><mml:mi>&#967;</mml:mi></mml:math></inline-formula> is defined, <inline-formula><mml:math id="Eq126"><mml:mrow><mml:mrow><mml:mi>&#963;</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mi>&#967;</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula>. Thus, any complete extension of <inline-formula><mml:math id="Eq127"><mml:mi>&#967;</mml:mi></mml:math></inline-formula> agrees with <inline-formula><mml:math id="Eq128"><mml:mi>&#967;</mml:mi></mml:math></inline-formula> on all the items that <inline-formula><mml:math id="Eq129"><mml:mi>&#967;</mml:mi></mml:math></inline-formula> decides, but then goes on to decide all the other items in the domain as well. So if there are <italic>n</italic> (<inline-formula><mml:math id="Eq130"><mml:mrow><mml:mi>n</mml:mi><mml:mo>&#8805;</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula>) things in the domain that you haven&#8217;t tasted, there will be <inline-formula><mml:math id="Eq131"><mml:msup><mml:mn>2</mml:mn><mml:mi>n</mml:mi></mml:msup></mml:math></inline-formula> complete extensions of your categorical standard. Since, for example, there is only one relevant thing you haven&#8217;t tasted in the scenario described above, there are two complete extensions of your categorical standard:</p>
<list list-type="simple">
<list-item><p><inline-formula><mml:math id="Eq132"><mml:msub><mml:mi>&#963;</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:math></inline-formula>, which maps the cr&#232;me caramel to 1, the sponge cake to 0, and the apple tart to 0;</p></list-item>
<list-item><p><inline-formula><mml:math id="Eq133"><mml:msub><mml:mi>&#963;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math></inline-formula>, which maps the cr&#232;me caramel to 1, the sponge cake to 0, and the apple tart to 1.</p></list-item>
</list>
<p>Note that both of these coincide with <inline-formula><mml:math id="Eq134"><mml:mi>&#967;</mml:mi></mml:math></inline-formula> on the items you&#8217;ve already tasted, namely, the cr&#232;me caramel and the sponge cake.</p>
<p>Now let&#8217;s say that a sentence of the form <italic>a is delicious</italic> is satisfied at a complete extension <inline-formula><mml:math id="Eq135"><mml:mi>&#963;</mml:mi></mml:math></inline-formula> iff <inline-formula><mml:math id="Eq136"><mml:mi>&#963;</mml:mi></mml:math></inline-formula> maps <italic>a</italic> to 1. And let us say that a sentence of the form <italic>not</italic>-<inline-formula><mml:math id="Eq137"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> is satisfied at a complete extension <inline-formula><mml:math id="Eq138"><mml:mi>&#963;</mml:mi></mml:math></inline-formula> iff <inline-formula><mml:math id="Eq139"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> is not satisfied at <inline-formula><mml:math id="Eq140"><mml:mi>&#963;</mml:mi></mml:math></inline-formula>. Furthermore, let us say that a sentence <inline-formula><mml:math id="Eq141"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> is <italic>assertable for you</italic> iff: <inline-formula><mml:math id="Eq142"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> is satisfied at <italic>every</italic> complete extension <inline-formula><mml:math id="Eq143"><mml:mi>&#963;</mml:mi></mml:math></inline-formula> of your categorical standard <inline-formula><mml:math id="Eq144"><mml:mi>&#967;</mml:mi></mml:math></inline-formula>. Then we predict that since you haven&#8217;t tasted the apple tart, you can assert neither <italic>The apple tart is delicious</italic> nor its negation. To see this, note that <italic>The apple tart is delicious</italic> is assertable for you iff every complete extension of your categorical standard <inline-formula><mml:math id="Eq145"><mml:mi>&#967;</mml:mi></mml:math></inline-formula> maps the apple tart to 1. But since <inline-formula><mml:math id="Eq146"><mml:msub><mml:mi>&#963;</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:math></inline-formula> maps the apple tart to 0, it follows that that sentence is not assertable for you. Note also that <italic>The apple tart is not delicious</italic> is assertable for you iff it is satisfied at every complete extension of your categorical standard. But consider <inline-formula><mml:math id="Eq147"><mml:msub><mml:mi>&#963;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math></inline-formula>. <italic>The apple tart is not delicious</italic> is satisfied at <inline-formula><mml:math id="Eq148"><mml:msub><mml:mi>&#963;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math></inline-formula> iff <italic>The apple tart is delicious</italic> is <italic>not</italic> satisfied at <inline-formula><mml:math id="Eq149"><mml:msub><mml:mi>&#963;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math></inline-formula>. But since <inline-formula><mml:math id="Eq150"><mml:msub><mml:mi>&#963;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math></inline-formula> maps the apple tart to 1, <italic>The apple tart is delicious is</italic> satisfied at <inline-formula><mml:math id="Eq151"><mml:msub><mml:mi>&#963;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math></inline-formula>, which means that its negation is not satisfied at <inline-formula><mml:math id="Eq152"><mml:msub><mml:mi>&#963;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math></inline-formula>. Since <inline-formula><mml:math id="Eq153"><mml:msub><mml:mi>&#963;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math></inline-formula> is a complete extension of your categorical standard, it follows that <italic>The apple tart is not delicious</italic> is also not assertable for you. Thus, we predict that both <italic>a is delicious</italic> and its negation are subject to the acquaintance requirement.</p>
<p>But the real test of this theory is how it handles the interpretation of complex sentences, such as disjunctions and quantified sentences. To extend the theory to these cases, it will will help to start developing the theory more formally.</p>
</sec>
<sec id="S4.2">
<title>4.2 The basic framework</title>
<p>The theory that follows has two principal components, both of which were visible in the foregoing informal sketch. First, we will give a recursive definition of <italic>satisfaction at a point (of evaluation)</italic>. The recursive semantics will be fairly standard, aside from the treatment of epistemic modals and attitude verbs. Second, we will use this recursive semantics to formulate a particular <italic>norm of assertion</italic>, one formulated by supervaluating over complete extensions. This is the innovation that yields distinctive predictions. I call the resulting theory <italic>lightweight expressivism</italic>, because our official theory is neutral on questions of truth and content, and so may be combined with either a contextualist, a relativist, or a &#8216;pure expressivist&#8217; account of those notions. We&#8217;ll return to this point later in the essay (Section 4.5), but let us first outline the theory.</p>
<p>We assume a fixed but arbitrary non-empty domain of discourse <italic>D</italic> and a non-empty set of worlds <italic>W</italic>. We can give a more precise characterization of an agent&#8217;s categorical standard of taste as follows:</p>
<p><bold>Definition 1</bold>. An agent <italic>j</italic>&#8217;s <italic>categorical standard of taste</italic> in world <italic>w</italic>, <inline-formula><mml:math id="Eq154"><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>, is a (possibly partial) function from <italic>D</italic> to {0, 1}, where:</p>
<list list-type="simple">
<list-item><p>(i) <inline-formula><mml:math id="Eq155"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> if <italic>j</italic> has tasted and liked <italic>o</italic> in <italic>w</italic>,</p></list-item>
<list-item><p>(ii) <inline-formula><mml:math id="Eq156"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula> if <italic>j</italic> has tasted <italic>o</italic> in <italic>w</italic> and it is not the case that <italic>j</italic> liked <italic>o</italic> in <italic>w</italic>, and</p></list-item>
<list-item><p>(iii) <inline-formula><mml:math id="Eq157"><mml:mrow><mml:mi>o</mml:mi><mml:mo>&#8713;</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>o</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>m</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula> if <italic>j</italic> hasn&#8217;t tasted <italic>o</italic> in <italic>w</italic>.</p></list-item>
</list>
<p>To state our theory, we need to adopt a few more definitions.</p>
<p><bold>Definition 2</bold>. A <italic>generator</italic> <inline-formula><mml:math id="Eq158"><mml:mi>&#963;</mml:mi></mml:math></inline-formula> is a (total) function that maps a pair of a world and an individual <inline-formula><mml:math id="Eq159"><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> to a standard of taste <inline-formula><mml:math id="Eq160"><mml:msup><mml:mi>&#963;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>.<xref ref-type="fn" rid="n29">29</xref></p>
<p><bold>Definition 3</bold>. A generator <inline-formula><mml:math id="Eq161"><mml:mi>&#963;</mml:mi></mml:math></inline-formula> is <italic>complete</italic> iff for all <inline-formula><mml:math id="Eq162"><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="Eq163"><mml:msup><mml:mi>&#963;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is a total function; otherwise, it is <italic>incomplete</italic>.</p>
<p>We assume that <inline-formula><mml:math id="Eq164"><mml:mi>&#967;</mml:mi></mml:math></inline-formula> is a generator in this sense. That is, <inline-formula><mml:math id="Eq165"><mml:mi>&#967;</mml:mi></mml:math></inline-formula> is a function that maps a pair <inline-formula><mml:math id="Eq166"><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> to <inline-formula><mml:math id="Eq167"><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>, <italic>j</italic>&#8217;s categorical standard of taste in <italic>w</italic>. Note that <inline-formula><mml:math id="Eq168"><mml:mi>&#967;</mml:mi></mml:math></inline-formula> will be an incomplete generator, since not everyone has tasted everything. We also need the notion of a <italic>complete extension</italic> of <inline-formula><mml:math id="Eq169"><mml:mi>&#967;</mml:mi></mml:math></inline-formula>:</p>
<p><bold>Definition 4</bold>. A generator <inline-formula><mml:math id="Eq170"><mml:mi>&#963;</mml:mi></mml:math></inline-formula> is a <italic>complete extension of <inline-formula><mml:math id="Eq171"><mml:mi>&#967;</mml:mi></mml:math></inline-formula></italic>, <inline-formula><mml:math id="Eq172"><mml:mrow><mml:mi>&#963;</mml:mi><mml:mo>&#8827;</mml:mo><mml:mi>&#967;</mml:mi></mml:mrow></mml:math></inline-formula>, iff</p>
<list list-type="order">
<list-item><p>(i) <inline-formula><mml:math id="Eq173"><mml:mi>&#963;</mml:mi></mml:math></inline-formula> is complete, and</p></list-item>
<list-item><p>(ii) for all <inline-formula><mml:math id="Eq174"><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> and all <italic>o</italic>, if <inline-formula><mml:math id="Eq175"><mml:mrow><mml:mi>o</mml:mi><mml:mo>&#8712;</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>o</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>m</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math id="Eq176"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#963;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula>.</p></list-item>
</list>
<p>So if <inline-formula><mml:math id="Eq177"><mml:mi>&#963;</mml:mi></mml:math></inline-formula> is a complete extension of <inline-formula><mml:math id="Eq178"><mml:mi>&#967;</mml:mi></mml:math></inline-formula>, then <inline-formula><mml:math id="Eq179"><mml:msup><mml:mi>&#963;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> agrees with <inline-formula><mml:math id="Eq180"><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> on all the cases that <inline-formula><mml:math id="Eq181"><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> decides, but then goes on and decides all the other cases as well. If <inline-formula><mml:math id="Eq182"><mml:mi>&#963;</mml:mi></mml:math></inline-formula> is a complete extension of <inline-formula><mml:math id="Eq183"><mml:mi>&#967;</mml:mi></mml:math></inline-formula>, I shall also say that <inline-formula><mml:math id="Eq184"><mml:msup><mml:mi>&#963;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is complete extension of <inline-formula><mml:math id="Eq185"><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>.</p>
<p>We assume a formal language whose vocabulary includes variables, individual constants, <italic>n</italic>-ary predicates (including a distinguished one-place taste predicate <italic>T</italic>), Boolean connectives, generalized quantifiers, an epistemic possibility modal, and a belief operator. The definition of the formulas of the language can be gleaned from the recursive semantic clauses given below. A model will consist of our generator <inline-formula><mml:math id="Eq186"><mml:mi>&#967;</mml:mi></mml:math></inline-formula>, our sets <italic>D</italic> and <italic>W</italic>, and an interpretation function <italic>I</italic>. <italic>I</italic> assigns an element of <italic>D</italic> to each individual constant, and assigns a function from <italic>W</italic> to subsets of <italic>D<sup>n</sup></italic> to all <italic>n</italic>-ary predicates other than the taste predicate <italic>T</italic>. Where <italic>t</italic> is a term (individual constant or variable), the denotation of <italic>t, t<sup>g</sup></italic>, is <italic>g(t)</italic> if <italic>t</italic> is a variable, and <italic>I(t)</italic> otherwise. If <italic>t</italic> is an individual constant, we write &#8216;<italic>t</italic>&#8217; in the metalanguage instead of &#8216;<italic>I(t)</italic>&#8217;.</p>
<p>A <italic>point</italic> is an <italic>n</italic>-tuple <inline-formula><mml:math id="Eq187"><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> consisting of a world <italic>w</italic>, an individual (a &#8216;judge&#8217;) <italic>j</italic>, a complete generator <inline-formula><mml:math id="Eq188"><mml:mi>&#963;</mml:mi></mml:math></inline-formula>, and a variable assignment <italic>g</italic>. The atomic clauses of our definition of satisfaction at a point are as follows:</p>
<list list-type="simple">
<list-item><p>(S1) <inline-formula><mml:math id="Eq189"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>P</mml:mi><mml:mo>&#8290;</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mi mathvariant="normal">&#8230;</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> iff <inline-formula><mml:math id="Eq190"><mml:mrow><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msubsup><mml:mi>t</mml:mi><mml:mn>1</mml:mn><mml:mi>g</mml:mi></mml:msubsup><mml:mo>,</mml:mo><mml:mi mathvariant="normal">&#8230;</mml:mi><mml:mo>,</mml:mo><mml:msubsup><mml:mi>t</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi></mml:msubsup><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo>&#8712;</mml:mo><mml:mrow><mml:mi>I</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula>, where <inline-formula><mml:math id="Eq466"><mml:mi>P</mml:mi></mml:math></inline-formula> is any <italic>n</italic>-ary predicate other than <inline-formula><mml:math id="Eq465"><mml:mi>T</mml:mi></mml:math></inline-formula></p></list-item>
<list-item><p>(S2) <inline-formula><mml:math id="Eq191"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> iff <inline-formula><mml:math id="Eq192"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#963;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msup><mml:mi>t</mml:mi><mml:mi>g</mml:mi></mml:msup><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula></p></list-item>
</list>
<p>The remaining clauses will be given below, but first I want to indicate how the theory accounts for the acquaintance inference in the simplest case, the case of atomic taste sentences.<xref ref-type="fn" rid="n30">30</xref></p>
<p>A <italic>context c</italic> is an <italic>n</italic>-tuple <inline-formula><mml:math id="Eq193"><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> consisting of a world <italic>w<sub>c</sub></italic>, a speaker <italic>s<sub>c</sub></italic>, a judge <italic>j<sub>c</sub></italic>, and a variable assignment <italic>g<sub>c</sub></italic>. A context <italic>c</italic> is <italic>autocentric</italic> iff <inline-formula><mml:math id="Eq194"><mml:mrow><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>; otherwise it is <italic>exocentric</italic>. We can now formulate a general norm of assertion by supervaluating over the complete extensions of <inline-formula><mml:math id="Eq195"><mml:mi>&#967;</mml:mi></mml:math></inline-formula>:</p>
<disp-quote>
<p><sc>assertion norm</sc></p>
<p>Sentence <inline-formula><mml:math id="Eq196"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> is <italic>assertable in c</italic>, <inline-formula><mml:math id="Eq197"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mi>c</mml:mi></mml:msup><mml:mo>=</mml:mo><mml:mi class="MJX-tex-caligraphic" mathvariant="script">A</mml:mi></mml:mrow></mml:math></inline-formula>, iff</p>
<list list-type="simple">
<list-item><p>(i) <italic>s<sub>c</sub></italic> believes <inline-formula><mml:math id="Eq198"><mml:msup><mml:mrow><mml:mo stretchy='false'>&#10216;</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>&#10217;</mml:mo></mml:mrow><mml:mi>c</mml:mi></mml:msup></mml:math></inline-formula> at <italic>t<sub>c</sub></italic> in <italic>w<sub>c</sub></italic>, and</p></list-item>
<list-item><p>(ii) for all <inline-formula><mml:math id="Eq199"><mml:mrow><mml:mi>&#963;</mml:mi><mml:mo>&#8827;</mml:mo><mml:mi>&#967;</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="Eq200"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>.</p></list-item>
</list>
</disp-quote>
<p>For the sake of simplicity, we will for the most part ignore the part of this norm that requires the speaker to believe what she asserts, in which case we may simply assume that for any sentence <inline-formula><mml:math id="Eq201"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> and context <italic>c</italic>, <inline-formula><mml:math id="Eq202"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mi>c</mml:mi></mml:msup><mml:mo>=</mml:mo><mml:mi class="MJX-tex-caligraphic" mathvariant="script">A</mml:mi></mml:mrow></mml:math></inline-formula> iff (ii) holds.</p>
<p>It follows from this account that if I haven&#8217;t tasted <italic>a</italic> and I occupy an autocentric context, <italic>a is delicious</italic> will not be assertable for me. To see this, note that if I haven&#8217;t tasted <italic>a</italic>, then if <inline-formula><mml:math id="Eq203"><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is my categorical standard of taste in <italic>w</italic>, <inline-formula><mml:math id="Eq204"><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> will not be defined for <italic>a</italic>. So there will be some complete extension <inline-formula><mml:math id="Eq205"><mml:msup><mml:mi>&#963;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> of <inline-formula><mml:math id="Eq206"><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> that maps <italic>a</italic> to 0. Thus, the present account predicts that atomic taste sentences come with an acquaintance requirement. More generally, we have:</p>
<p><bold>Fact 1</bold>. <inline-formula><mml:math id="Eq207"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mi>c</mml:mi></mml:msup><mml:mo>=</mml:mo><mml:mi class="MJX-tex-caligraphic" mathvariant="script">A</mml:mi></mml:mrow></mml:math></inline-formula> <italic>iff <inline-formula><mml:math id="Eq208"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>.<xref ref-type="fn" rid="n31">31</xref></italic></p>
<p>Recall that <inline-formula><mml:math id="Eq209"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> iff <italic>j<sub>c</sub></italic> has tasted and liked <italic>a</italic> in <italic>w<sub>c</sub></italic>. Thus, the theory predicts that an assertion of <italic>The cr&#232;me caramel is delicious</italic> in an autocentric context will express one&#8217;s liking of the taste of the cr&#232;me caramel, in the sense discussed earlier. For if one asserts <italic>The cr&#232;me caramel is delicious</italic> in an autocentric context, one&#8217;s audience will assume that one is attempting to comply with the Assertion Norm. And if one is complying with that norm, <bold>Fact 1</bold> ensures that one has tasted and liked the the cr&#232;me caramel.</p>
</sec>
<sec id="S4.3">
<title>4.3 Boolean connectives</title>
<p>Our earlier discussion highlighted the fact that the acquaintance requirement interacts non-trivially with disjunction and quantification. In order to extend our theory to these expressions, it will first be useful to highlight two particular complete extensions of <inline-formula><mml:math id="Eq210"><mml:mi>&#967;</mml:mi></mml:math></inline-formula> and note two facts about them.</p>
<p><bold>Definition 5.</bold> The <italic>picky extension</italic> <inline-formula><mml:math id="Eq211"><mml:msub><mml:mi>&#963;</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:math></inline-formula> is defined as follows:</p>
<list list-type="simple">
<list-item><p>(i) <inline-formula><mml:math id="Eq212"><mml:mrow><mml:msub><mml:mi>&#963;</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo>&#8827;</mml:mo><mml:mi>&#967;</mml:mi></mml:mrow></mml:math></inline-formula>, and</p></list-item>
<list-item><p>(ii) for all <inline-formula><mml:math id="Eq213"><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> and all <inline-formula><mml:math id="Eq214"><mml:mrow><mml:mrow><mml:mi>o</mml:mi><mml:mo>&#8713;</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>o</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>m</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mrow><mml:msubsup><mml:mi>&#963;</mml:mi><mml:mn>0</mml:mn><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:mrow></mml:math></inline-formula>.</p></list-item>
</list>
<p><bold>Definition 6.</bold> The <italic>easy-to-please extension</italic> <inline-formula><mml:math id="Eq215"><mml:msub><mml:mi>&#963;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math></inline-formula> is defined as follows:</p>
<list list-type="simple">
<list-item><p>(i) <inline-formula><mml:math id="Eq216"><mml:mrow><mml:msub><mml:mi>&#963;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#8827;</mml:mo><mml:mi>&#967;</mml:mi></mml:mrow></mml:math></inline-formula>, and</p></list-item>
<list-item><p>(ii) for all <inline-formula><mml:math id="Eq217"><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> and all <inline-formula><mml:math id="Eq218"><mml:mrow><mml:mrow><mml:mi>o</mml:mi><mml:mo>&#8713;</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>o</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>m</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mrow><mml:msubsup><mml:mi>&#963;</mml:mi><mml:mn>1</mml:mn><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mrow></mml:math></inline-formula>.</p></list-item>
</list>
<p>So <inline-formula><mml:math id="Eq219"><mml:msubsup><mml:mi>&#963;</mml:mi><mml:mn>0</mml:mn><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> maps everything not in the domain of <inline-formula><mml:math id="Eq220"><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> to 0; <inline-formula><mml:math id="Eq221"><mml:msubsup><mml:mi>&#963;</mml:mi><mml:mn>0</mml:mn><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> is picky in that it &#8216;doesn&#8217;t like&#8217; anything it hasn&#8217;t tried. And <inline-formula><mml:math id="Eq222"><mml:msubsup><mml:mi>&#963;</mml:mi><mml:mn>1</mml:mn><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> maps everything not in the domain of <inline-formula><mml:math id="Eq223"><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> to 1; <inline-formula><mml:math id="Eq224"><mml:msubsup><mml:mi>&#963;</mml:mi><mml:mn>1</mml:mn><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> is easy to please in that it &#8216;likes&#8217; everything it hasn&#8217;t tried. The main role these two complete extensions play in what follows is technical: proofs of various facts about the system below can usually be found by adverting to one or both of these extensions.<xref ref-type="fn" rid="n32">32</xref> Two crucial facts about these complete extensions of <inline-formula><mml:math id="Eq225"><mml:mi>&#967;</mml:mi></mml:math></inline-formula>:</p>
<p><bold>Lemma 1.</bold> <italic>Let w be a world, and let j and o be elements of D. Then:</italic></p>
<list list-type="simple">
<list-item><p>(1) <inline-formula><mml:math id="Eq226"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> <italic>iff</italic> <inline-formula><mml:math id="Eq227"><mml:mrow><mml:mrow><mml:msubsup><mml:mi>&#963;</mml:mi><mml:mn>0</mml:mn><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula><italic/></p></list-item>
<list-item><p>(2) <inline-formula><mml:math id="Eq228"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula> <italic>iff</italic> <inline-formula><mml:math id="Eq229"><mml:mrow><mml:mrow><mml:msubsup><mml:mi>&#963;</mml:mi><mml:mn>1</mml:mn><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula><xref ref-type="fn" rid="n33">33</xref><italic/></p></list-item>
</list>
<p>We adopt the classical recursive clauses for the Boolean connectives:</p>
<list list-type="simple">
<list-item><p>(S3) <inline-formula><mml:math id="Eq230"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#172;</mml:mo><mml:mo>&#981;</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> iff <inline-formula><mml:math id="Eq231"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula></p></list-item>
<list-item><p>(S4) <inline-formula><mml:math id="Eq232"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo>&#981;</mml:mo><mml:mo>&#8743;</mml:mo><mml:mo>&#968;</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> iff <inline-formula><mml:math id="Eq233"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula></p></list-item>
<list-item><p>(S5) <inline-formula><mml:math id="Eq234"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo>&#981;</mml:mo><mml:mo>&#8744;</mml:mo><mml:mo>&#968;</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> iff <inline-formula><mml:math id="Eq235"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> or <inline-formula><mml:math id="Eq236"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#968;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula></p></list-item>
</list>
<p>When paired with our Assertion Norm, we predict our earlier observations concerning these connectives. For example, if you say <italic>The cr&#232;me caramel is not delicious</italic>, this will imply that you tasted and didn&#8217;t like the cr&#232;me caramel:</p>
<p><bold>Fact 2.</bold> <inline-formula><mml:math id="Eq237"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#172;</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mi>c</mml:mi></mml:msup><mml:mo>=</mml:mo><mml:mi class="MJX-tex-caligraphic" mathvariant="script">A</mml:mi></mml:mrow></mml:math></inline-formula> <italic>iff <inline-formula><mml:math id="Eq238"><mml:mrow><mml:mrow><mml:mrow><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mo lspace="0em">.</mml:mo></mml:mrow></mml:math></inline-formula><xref ref-type="fn" rid="n34">34</xref></italic></p>
<p>And if you say <italic>The cr&#232;me caramel is delicious and it&#8217;s gluten-free</italic>, this will imply that you tasted and liked the cr&#232;me caramel:</p>
<p><bold>Fact 3.</bold> <inline-formula><mml:math id="Eq239"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo>&#8743;</mml:mo><mml:mo>&#981;</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mi>c</mml:mi></mml:msup><mml:mo>=</mml:mo><mml:mi class="MJX-tex-caligraphic" mathvariant="script">A</mml:mi></mml:mrow></mml:math></inline-formula> <italic>only if <inline-formula><mml:math id="Eq240"><mml:mrow><mml:mrow><mml:mrow><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo lspace="0em">.</mml:mo></mml:mrow></mml:math></inline-formula></italic></p>
<p>(The proof of <bold>Fact 3</bold> is left to the reader.) Note that this last fact helps to explain an oft-noted feature of the acquaintance requirement, which is that it is not easily cancellable:<xref ref-type="fn" rid="n35">35</xref></p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(17)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>? The cr&#232;me caramel is delicious, but I haven&#8217;t tried it.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>The most interesting connective here is disjunction, since, as we saw, it posed problems for both the epistemic view and the presupposition view. Two points are important. First, the expressivist view predicts that if, in an autocentric context, you say <italic>Either the cr&#232;me caramel is delicious or the pie is</italic>, this will imply that either you tasted and liked the cr&#232;me caramel or you tasted and liked the pie:</p>
<p><bold>Fact 4.</bold> <inline-formula><mml:math id="Eq241"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo>&#8744;</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>b</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mi>c</mml:mi></mml:msup><mml:mo>=</mml:mo><mml:mi class="MJX-tex-caligraphic" mathvariant="script">A</mml:mi></mml:mrow></mml:math></inline-formula> <italic>iff <inline-formula><mml:math id="Eq242"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> or <inline-formula><mml:math id="Eq243"><mml:mrow><mml:mrow><mml:mrow><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>b</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo lspace="0em">.</mml:mo></mml:mrow></mml:math></inline-formula><xref ref-type="fn" rid="n36">36</xref></italic></p>
<p>Note that this implies Cariani&#8217;s observation&#8212;the disjunction implies that you tasted at least one of them&#8212;but it in fact implies something stronger: that you tasted <italic>and liked</italic> at least one of them. So if, for example, you tasted the pie and didn&#8217;t like it, and you didn&#8217;t taste the cr&#232;me caramel but are disposed to like it, you will still not be in a position to assert the disjunction.</p>
<p>Second, we also have:</p>
<p><bold>Fact 5.</bold> <italic>For any context c, <inline-formula><mml:math id="Eq244"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo>&#8744;</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#172;</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mi>c</mml:mi></mml:msup><mml:mo>=</mml:mo><mml:mi class="MJX-tex-caligraphic" mathvariant="script">A</mml:mi></mml:mrow></mml:math></inline-formula>.<xref ref-type="fn" rid="n37">37</xref></italic></p>
<p>This predicts Cariani&#8217;s other observation about disjunction: that <inline-formula><mml:math id="Eq245"><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo>&#8744;</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#172;</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> is assertable even if one hasn&#8217;t tasted <italic>a</italic>. Thus, the expressivist view avoids one of the problems facing the presupposition view.</p>
</sec>
<sec id="S4.4">
<title>4.4 Generalized quantifiers</title>
<p>Generalized quantifiers also seemed to pose various challenges for both the epistemic and the presupposition view. In contrast, the expressivist view yields several interesting fine-grained predictions simply by adopting wholly standard recursive clauses for the relevant quantifiers. Consider, for example, the following:</p>
<list list-type="simple">
<list-item><p>(S6) <inline-formula><mml:math id="Eq246"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:msub><mml:mtext mathvariant="italic">some</mml:mtext><mml:mi>x</mml:mi></mml:msub><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#968;</mml:mo><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> iff</p>
<p>&#160;&#160;&#160;&#160;&#160;&#160;&#160;&#160;&#160;<inline-formula><mml:math id="Eq247"><mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:mi>o</mml:mi><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mi>g</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>/</mml:mo><mml:mi>o</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy='false'>}</mml:mo></mml:mrow><mml:mo>&#8745;</mml:mo><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:mi>o</mml:mi><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#968;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mi>g</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>/</mml:mo><mml:mi>o</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy='false'>}</mml:mo></mml:mrow></mml:mrow><mml:mo>&#8800;</mml:mo><mml:mi mathvariant="normal">&#8709;</mml:mi></mml:mrow></mml:math></inline-formula><xref ref-type="fn" rid="n38">38</xref></p></list-item>
<list-item><p>(S7) <inline-formula><mml:math id="Eq248"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:msub><mml:mtext mathvariant="italic">every</mml:mtext><mml:mi>x</mml:mi></mml:msub><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#968;</mml:mo><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> iff</p>
<p>&#160;&#160;&#160;&#160;&#160;&#160;&#160;&#160;&#160;<inline-formula><mml:math id="Eq249"><mml:mrow><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:mi>o</mml:mi><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mi>g</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>/</mml:mo><mml:mi>o</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy='false'>}</mml:mo></mml:mrow><mml:mo>&#8838;</mml:mo><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:mi>o</mml:mi><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#968;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mi>g</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>/</mml:mo><mml:mi>o</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy='false'>}</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula></p></list-item>
<list-item><p>(S8) <inline-formula><mml:math id="Eq250"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:msub><mml:mtext mathvariant="italic">no</mml:mtext><mml:mi>x</mml:mi></mml:msub><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#968;</mml:mo><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> iff</p>
<p>&#160;&#160;&#160;&#160;&#160;&#160;&#160;&#160;&#160;<inline-formula><mml:math id="Eq251"><mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:mi>o</mml:mi><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mi>g</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>/</mml:mo><mml:mi>o</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy='false'>}</mml:mo></mml:mrow><mml:mo>&#8745;</mml:mo><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:mi>o</mml:mi><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#968;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mi>g</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>/</mml:mo><mml:mi>o</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy='false'>}</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mi mathvariant="normal">&#8709;</mml:mi></mml:mrow></mml:math></inline-formula></p></list-item>
<list-item><p>(S9) <inline-formula><mml:math id="Eq252"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:msub><mml:mtext mathvariant="italic">exactly two</mml:mtext><mml:mi>x</mml:mi></mml:msub><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#968;</mml:mo><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> iff</p>
<p>&#160;&#160;&#160;&#160;&#160;&#160;&#160;&#160;&#160;<inline-formula><mml:math id="Eq253"><mml:mrow><mml:mrow><mml:mo stretchy='false'>|</mml:mo><mml:mrow><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:mi>o</mml:mi><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mi>g</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>/</mml:mo><mml:mi>o</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy='false'>}</mml:mo></mml:mrow><mml:mo>&#8745;</mml:mo><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:mi>o</mml:mi><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#968;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mi>g</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>/</mml:mo><mml:mi>o</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy='false'>}</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy='false'>|</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:math></inline-formula></p></list-item>
<list-item><p>(S10) <inline-formula><mml:math id="Eq254"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:msub><mml:mtext mathvariant="italic">at most two</mml:mtext><mml:mi>x</mml:mi></mml:msub><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#981;</mml:mo><mml:mo>,</mml:mo><mml:mo>&#968;</mml:mo><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> iff</p>
<p>&#160;&#160;&#160;&#160;&#160;&#160;&#160;&#160;&#160;<inline-formula><mml:math id="Eq255"><mml:mrow><mml:mrow><mml:mo stretchy='false'>|</mml:mo><mml:mrow><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:mi>o</mml:mi><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mi>g</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>/</mml:mo><mml:mi>o</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy='false'>}</mml:mo></mml:mrow><mml:mo>&#8745;</mml:mo><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:mi>o</mml:mi><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#968;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mi>g</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>/</mml:mo><mml:mi>o</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy='false'>}</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy='false'>|</mml:mo></mml:mrow><mml:mo>&#8804;</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:math></inline-formula></p></list-item>
</list>
<p>When combined with our Assertion Norm, this yields a number of results of interest. We can start with a general result that pertains to all generalized quantifiers. To state it, first note that for each generalized quantifier <italic>Q<sub>x</sub></italic>, there is a corresponding binary relation <italic>Q<sub>R</sub></italic> on subsets <inline-formula><mml:math id="Eq256"><mml:mrow><mml:mi>A</mml:mi><mml:mo>,</mml:mo><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> of <italic>D</italic> such that:</p>
<disp-quote>
<p><inline-formula><mml:math id="Eq257"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:msub><mml:mtext mathvariant="italic">Q</mml:mtext><mml:mi>x</mml:mi></mml:msub><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#981;</mml:mo><mml:mo>,</mml:mo><mml:mo>&#968;</mml:mo><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> iff</p>
<p><inline-formula><mml:math id="Eq258"><mml:mrow><mml:msub><mml:mi>Q</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:mi>o</mml:mi><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mi>g</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>/</mml:mo><mml:mi>o</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy='false'>}</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:mi>o</mml:mi><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#968;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mi>g</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>/</mml:mo><mml:mi>o</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy='false'>}</mml:mo></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula></p>
</disp-quote>
<p>For example:</p>
<table-wrap>
<table>
<tr>
<td align="left" valign="top"><inline-formula><mml:math id="Eq259"><mml:msub><mml:mtext mathvariant="italic">some</mml:mtext><mml:mi>R</mml:mi></mml:msub></mml:math></inline-formula>:</td>
<td align="left" valign="top"><inline-formula><mml:math id="Eq260"><mml:mrow><mml:mrow><mml:mi>A</mml:mi><mml:mo>&#8745;</mml:mo><mml:mi>B</mml:mi></mml:mrow><mml:mo>&#8800;</mml:mo><mml:mi mathvariant="normal">&#8709;</mml:mi></mml:mrow></mml:math></inline-formula></td>
<td align="left" valign="top">&#8195;&#8195;<inline-formula><mml:math id="Eq261"><mml:msub><mml:mtext mathvariant="italic">no</mml:mtext><mml:mi>R</mml:mi></mml:msub></mml:math></inline-formula>:</td>
<td align="left" valign="top"><inline-formula><mml:math id="Eq262"><mml:mrow><mml:mrow><mml:mi>A</mml:mi><mml:mo>&#8745;</mml:mo><mml:mi>B</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mi mathvariant="normal">&#8709;</mml:mi></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top"><inline-formula><mml:math id="Eq263"><mml:mrow><mml:msub><mml:mtext mathvariant="italic">every</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mi/></mml:mrow></mml:math></inline-formula></td>
<td align="left" valign="top"><inline-formula><mml:math id="Eq264"><mml:mrow><mml:mi>A</mml:mi><mml:mo>&#8838;</mml:mo><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula></td>
<td align="left" valign="top">&#8195;&#8195;<inline-formula><mml:math id="Eq265"><mml:msub><mml:mtext mathvariant="italic">exactly two</mml:mtext><mml:mi>R</mml:mi></mml:msub></mml:math></inline-formula>:</td>
<td align="left" valign="top"><inline-formula><mml:math id="Eq266"><mml:mrow><mml:mrow><mml:mo stretchy='false'>|</mml:mo><mml:mrow><mml:mi>A</mml:mi><mml:mo>&#8745;</mml:mo><mml:mi>B</mml:mi></mml:mrow><mml:mo stretchy='false'>|</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:math></inline-formula></td>
</tr>
</table>
</table-wrap>
<p>Then we have:</p>
<p><bold>Fact 6.</bold> <italic>For any generalized quantifier Q<sub>x</sub> and corresponding binary relation Q<sub>R</sub> on subsets of D:</italic></p>
<p><italic>if</italic> <inline-formula><mml:math id="Eq267"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:msub><mml:mi>Q</mml:mi><mml:mi>x</mml:mi></mml:msub><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mi>F</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>x</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>x</mml:mi></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mi>c</mml:mi></mml:msup><mml:mo>=</mml:mo><mml:mi class="MJX-tex-caligraphic" mathvariant="script">A</mml:mi></mml:mrow></mml:math></inline-formula><italic>, then</italic> <inline-formula><mml:math id="Eq268"><mml:mrow><mml:msub><mml:mi>Q</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mi>I</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>F</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:mi>o</mml:mi><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mrow><mml:mrow><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy='false'>}</mml:mo></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.<xref ref-type="fn" rid="n39">39</xref></p>
<p>Note that <inline-formula><mml:math id="Eq269"><mml:mrow><mml:mi>I</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>F</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is the set of things that are <italic>F</italic> in <italic>w<sub>c</sub></italic> and <inline-formula><mml:math id="Eq270"><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:mi>o</mml:mi><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mrow><mml:mrow><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy='false'>}</mml:mo></mml:mrow></mml:math></inline-formula> is the set of things that <italic>j<sub>c</sub></italic> tasted and liked in <italic>w<sub>c</sub></italic>. So, if you say <italic>Q things on the dessert table are delicious</italic>, this will imply that <italic>Q</italic> things on the dessert table are such that you tasted and liked them. For example, if you say <italic>Something on the dessert table is delicious</italic>, this will imply that there is something on the dessert table that you tasted and liked. Note again that this is stronger than just: there is something on the dessert table that you tasted. It&#8217;s not enough that you have tasted something on the table, didn&#8217;t like it, but are disposed to like something else on the table that you didn&#8217;t try. Similarly, if you say <italic>Exactly two things on the dessert table are delicious</italic>, this implies that exactly two things on the table are such that you tasted and liked them.</p>
<p>Recall that both the epistemic view and the presupposition view encountered trouble with &#8216;non-rum&#8217; generalized quantifiers like <italic>exactly two</italic>. The epistemic view either failed to yield a prediction or (when supplemented by the Quantifier Principle) yielded the wrong result. The presupposition view faced a problem here as well, since the way the acquaintance requirement interacts with <italic>exactly two</italic> appears subtly different from the way standard presuppositions interact with that quantifer. The expressivist view arguably does better here.</p>
<p><bold>Fact 7.</bold> <italic>If <inline-formula><mml:math id="Eq271"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:msub><mml:mtext mathvariant="italic">exactly two</mml:mtext><mml:mi>x</mml:mi></mml:msub><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mi>F</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>x</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>x</mml:mi></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mi>c</mml:mi></mml:msup><mml:mo>=</mml:mo><mml:mi class="MJX-tex-caligraphic" mathvariant="script">A</mml:mi></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math id="Eq272"><mml:mrow><mml:mrow><mml:mi>I</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>F</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#8838;</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>o</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>m</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula>.<xref ref-type="fn" rid="n40">40</xref></italic></p>
<p>So, if you say <italic>Exactly two things on the dessert table are delicious</italic>, this implies that you&#8217;ve tasted everything on the dessert table. Note that our earlier result was: if you say <italic>Exactly two things on the dessert table are delicious</italic>, this implies that you&#8217;ve tasted <italic>and liked</italic> exactly two things on the table. Together, the two results imply that if you say <italic>Exactly two things on the dessert table are delicious</italic>, this will imply that you tasted everything on the dessert table but only liked two of them.</p>
</sec>
<sec id="S4.5">
<title>4.5 Truth and content</title>
<p>Our theory thus far consists of two things: (i) a recursive definition of satisfaction at a point, and (ii) the Assertion Norm. We still need to extend our recursive semantics to epistemic modals and attitude verbs, but it will help to first pause here and say something about the notions of truth and content, i.e., about what it is for a sentence to be true in a context and about what the content of a sentence relative to a context is. Although our recursive semantics places some constraints on how these notions may be defined, it leaves many options open. In particular, it is neutral between the main competitors one finds in the literature on predicates of taste, such as contextualism, relativism, and &#8216;pure expressivism.&#8217;</p>
<p>When it comes to defining truth at a context, contextualists about taste predicates often say things like this:</p>
<disp-quote>
<p>A sentence of the form <italic>o is delicious</italic> is true in a context <inline-formula><mml:math id="Eq273"><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> iff <underline><italic>o</italic> is delicious to <italic>j<sub>c</sub></italic> in <italic>w<sub>c</sub></italic></underline>.<xref ref-type="fn" rid="n41">41</xref></p>
</disp-quote>
<p>A relativist in the style of <xref ref-type="bibr" rid="B22">MacFarlane, <italic>op. cit.</italic></xref>, on the other hand, will say something like this:</p>
<disp-quote>
<p>A sentence of the form <italic>o is delicious</italic> is true in a context of use <italic>c<sub>1</sub></italic> and context of assessment <italic>c<sub>2</sub></italic> iff <underline><italic>o</italic> is delicious according to <italic>&#964;</italic><sub>2</sub> in <italic>w<sub>1</sub></italic></underline>, where <italic>&#964;</italic><sub>2</sub> is the standard of taste of the judge of <italic>c<sub>2</sub></italic> and where <italic>w<sub>1</sub></italic> is the world of <italic>c<sub>1</sub></italic>.<xref ref-type="fn" rid="n42">42</xref></p>
</disp-quote>
<p>But one thing that tends to go under-theorized in this literature is how to understand the underlined metalanguage predicates, predicates like <italic>delicious to j in w</italic> or <italic>delicious according to j&#8217;s standard of taste in w</italic>. In particular, what happens when we apply one of these predicates to an item <italic>o</italic> that individual <italic>j</italic> has not tasted in <italic>w</italic>? Could these predicates be true of <italic>o</italic> even if <italic>j</italic> has not tasted <italic>o</italic> in <italic>w</italic>?</p>
<p>That issue is rarely addressed explicitly, but the theories that are formulated using these metalanguage predicates appear to presuppose that such a predicate can be true or false of an item <italic>o</italic> even if the relevant agent has not tasted <italic>o</italic> in the relevant world. I say this because the semantic theories in question are typically presented as bivalent theories, so that for any sentence <inline-formula><mml:math id="Eq276"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> and point of evaluation <italic>e</italic>, <inline-formula><mml:math id="Eq277"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> is either true or false at <italic>e</italic>. But it is hard to see how these theories could be bivalent if for some objects <italic>o</italic>, the metalanguage predicate <italic>delicious to j in w</italic> is neither true nor false of <italic>o</italic>. For then wouldn&#8217;t the object-language sentence <italic>o is delicious</italic> be neither true nor false at a point of evaluation at which <italic>j</italic> is the judge and <italic>w</italic> the world?</p>
<p>If we do accept that these metalanguage predicates can be true or false of an item <italic>o</italic> even if the relevant agent has not tasted <italic>o</italic> in the relevant world, then we should also say that they can be <italic>true</italic> of an item <italic>o</italic> even if the relevant agent has not tasted <italic>o</italic> in the relevant world. Otherwise, we would license speeches like this:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(18)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>The cr&#232;me caramel is not delicious because I haven&#8217;t tasted it yet.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>But that is absurd: my not having tried something isn&#8217;t sufficient grounds for saying that it isn&#8217;t delicious. So it seems to be a tacit assumption of the literature that these metalanguage predicates can be true of an item <italic>o</italic> even if the relevant agent has not tasted <italic>o</italic> in the relevant world. We adopt this assumption here as well. But this assumption raises a question: how should we understand what these predicates are expressing? What has to be true of me and an item <italic>o</italic> that I haven&#8217;t tasted yet in order for <italic>o</italic> to be delicious to me, or delicious according to my standard of taste?</p>
<p>One natural (though not inevitable) answer to this question appeals to the notion of a <italic>disposition</italic>.<xref ref-type="fn" rid="n43">43</xref> For example, we might say that what it is for <italic>o</italic> to be delicious to <italic>j</italic> (or according to <italic>j</italic>&#8217;s standard of taste) in <italic>w</italic> is for <italic>j</italic> to be disposed in <italic>w</italic> to like the taste of <italic>o</italic>. For such an account allows that <italic>o</italic> might be delicious for <italic>j</italic> in <italic>w</italic> even if <italic>j</italic> has not tasted <italic>o</italic> in <italic>w</italic>, since one can be disposed to like the taste of something that one has not tasted. Thus, I propose to understand the contextualist&#8217;s metalanguage predicate <italic>o is delicious to j in w</italic> as saying that <italic>j</italic> is disposed to like the taste of <italic>o</italic> in <italic>w</italic>, and we can understand the relativist&#8217;s metalanguage predicate in a similar manner.</p>
<p>With that clarification in hand, we can formulate contextualism and relativism within the present theoretical setting by appealing to the notion of an agent&#8217;s <italic>hypothetical standard of taste</italic>. In contrast to an agent&#8217;s categorical standard of taste, an agent&#8217;s hypothetical standard will be defined for all items in the domain, even items that the agent has yet to taste. I propose to define hypothetical standards as follows:</p>
<p><bold>Definition 7.</bold> An agent <italic>j</italic>&#8217;s <italic>hypothetical standard of taste</italic> in world <italic>w</italic>, <inline-formula><mml:math id="Eq278"><mml:msup><mml:mi>&#948;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>, is a total function from <italic>D</italic> to {0, 1}, where:</p>
<list list-type="simple">
<list-item><p>(i) <inline-formula><mml:math id="Eq279"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#948;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> if <italic>j</italic> is disposed to like the taste of <italic>o</italic> in <italic>w</italic>, and</p></list-item>
<list-item><p>(ii) <inline-formula><mml:math id="Eq280"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#948;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula> if <italic>j</italic> is not disposed to like the taste of <italic>o</italic> in <italic>w</italic>.</p></list-item>
</list>
<p>We may suppose that an agent&#8217;s categorical standard of taste at a world is the restriction of their hypothetical standard to the set of things they&#8217;ve tasted. In other words, <inline-formula><mml:math id="Eq281"><mml:msup><mml:mi>&#948;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is a complete extension of <inline-formula><mml:math id="Eq282"><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>. We assume that <inline-formula><mml:math id="Eq283"><mml:mi>&#948;</mml:mi></mml:math></inline-formula> is a generator that maps each <inline-formula><mml:math id="Eq284"><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> to <inline-formula><mml:math id="Eq285"><mml:msup><mml:mi>&#948;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>, <italic>j</italic>&#8217;s hypothetical standard of taste in <italic>w</italic>.</p>
<p>Using this notion allows us to formulate a version of contextualism as follows:</p>
<disp-quote>
<p><sc>standard contextualism</sc></p>
<p>The content of <inline-formula><mml:math id="Eq286"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> in <italic>c</italic> is <inline-formula><mml:math id="Eq287"><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mrow><mml:mi>&#955;</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>w</mml:mi></mml:mrow><mml:mo lspace="0em" rspace="0.167em">.</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi>&#948;</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:math></inline-formula>.</p>
<p>A sentence <inline-formula><mml:math id="Eq288"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> is true in <italic>c</italic> iff the content of <inline-formula><mml:math id="Eq289"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> in <italic>c</italic> is true at <italic>w<sub>c</sub></italic>.</p>
</disp-quote>
<p>Note that the &#8216;generator parameter&#8217; here has been set to the hypothetical generator <inline-formula><mml:math id="Eq290"><mml:mi>&#948;</mml:mi></mml:math></inline-formula> in this definition. So, on this approach, the content of <italic>The cr&#232;me caramel delicious</italic> in an autocentric context is the proposition that the speaker is disposed to like the taste of the cr&#232;me caramel. Thus, in asserting that sentence in an autocentric context, one&#8217;s assertion will be true iff that proposition is true. Note that this means that unlike on the presupposition view, if I assert that <italic>The cr&#232;me caramel delicious</italic> in an autocentric context, my assertion may be true even if I haven&#8217;t tasted (and so couldn&#8217;t be said to like) the cr&#232;me caramel&#8212;for one may be disposed to like something that one has not tried. Of course, in such a case, not all will be well with my assertion, for it will violate the Assertion Norm. The result will be a true assertion that I was not in a position to make. Note also that it is clear from this overall account that I would not be <italic>asserting</italic> that I like the cr&#232;me caramel&#8212;I can&#8217;t be asserting that, since my assertion might be true even if I haven&#8217;t tasted (and so could not be said to like) the cr&#232;me caramel.<xref ref-type="fn" rid="n44">44</xref></p>
<p>A relativist in the style of <xref ref-type="bibr" rid="B22">MacFarlane, <italic>op. cit.</italic>, Ch. 7</xref>, on the other hand, might instead adopt the following account of truth and content:</p>
<disp-quote>
<p><sc>relativism</sc></p>
<p>The content of <inline-formula><mml:math id="Eq291"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> in <italic>c</italic> is <inline-formula><mml:math id="Eq292"><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mrow><mml:mi>&#955;</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo lspace="0em" rspace="0.167em">.</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#948;</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:math></inline-formula>.</p>
<p>A sentence <inline-formula><mml:math id="Eq293"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> is true as used at <italic>c<sub>1</sub></italic> and as assessed from <italic>c<sub>2</sub></italic> iff the content of <inline-formula><mml:math id="Eq294"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> in <italic>c</italic> is true at <inline-formula><mml:math id="Eq295"><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote>
<p>While the contextualist and relativist might agree on the conditions under which it is appropriate to assert a taste sentence, they will likely disagree on when it is appropriate to disagree with or retract such an assertion; see <xref ref-type="bibr" rid="B22">MacFarlane, <italic>op. cit.</italic>, Ch. 7</xref> for discussion.</p>
<p>Note that both the relativist and contextualist versions of our proposal would count as species of <italic>hybrid expressivism</italic>.<xref ref-type="fn" rid="n45">45</xref> For it follows from our account of assertion that an assertion of <italic>The cr&#232;me caramel is delicious</italic> in an autocentric context would, in addition to expressing one&#8217;s liking of the cr&#232;me caramel, express a certain <italic>belief</italic>. For the contextualist, it expresses the belief that one is disposed to like the cr&#232;me caramel; the relativist&#8217;s description of that belief would be more subtle. But on both accounts, that belief is an ordinary belief, one assessable for truth or falsity (though the relativist may allow its truth value to vary with the context of assessment).</p>
<p>But our approach doesn&#8217;t require hybrid expressivism; it is also compatible with <italic>pure expressivism</italic>:</p>
<disp-quote>
<p><sc>pure expressivism</sc></p>
<p>The content of <inline-formula><mml:math id="Eq296"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> in <italic>c</italic> is <inline-formula><mml:math id="Eq297"><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mrow><mml:mi>&#955;</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo rspace="0.278em" stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo rspace="0.278em">:</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:math></inline-formula>.</p>
<p>If <inline-formula><mml:math id="Eq298"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> is not sensitive to the generator parameter, then <inline-formula><mml:math id="Eq299"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> is true in <italic>c</italic> iff the content of <inline-formula><mml:math id="Eq300"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> in <italic>c</italic> is true at <inline-formula><mml:math id="Eq301"><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> (for any <inline-formula><mml:math id="Eq302"><mml:mi>&#963;</mml:mi></mml:math></inline-formula>).</p>
</disp-quote>
<p>The pure expressivist allows that the notion of truth in a context is defined for the &#8216;fact-stating&#8217; fragment of the language but denies that it applies beyond this. Thus, the notion of truth in a context is simply not defined for sentences like the <italic>The cr&#232;me caramel is delicious</italic>.<xref ref-type="fn" rid="n46">46</xref> The pure expressivist would presumably also claim that the &#8216;beliefs&#8217; expressed by simple taste sentences are not ones that can be assessed for truth or falsity, since it is not their job to represent the world as being a certain way. These last two claims distinguish the pure expressivist from the hybrid expressivist (at least in the present taxonomy).</p>
<p>These views&#8212;contextualism, relativism, and pure expressivism&#8212;differ in their accounts of disagreement, of retraction, and of what states of mind simple taste assertions express. How precisely to understand these views&#8212;relativism and pure expressivism, in particular&#8212;requires more elaboration, elaboration that will not be provided here.<xref ref-type="fn" rid="n47">47</xref> The point I wish to emphasize is that all of these views are compatible with our lightweight expressivist account, which consists of the recursive definition of satisfaction at a point and the Assertion Norm.</p>
</sec>
<sec id="S4.6">
<title>4.6 Obviation</title>
<p>We noted earlier that epistemic modals and the attitude verb <italic>believes</italic> seem to obviate the acquaintance requirement. Although the presupposition view offered a simple account of this fact, the resulting view had the odd result that I could believe that the cr&#232;me caramel is delicious to me without believing the content of the sentence <italic>The cr&#232;me caramel is delicious</italic>. The presupposition view has this result because it combines two features: (i) it allows <italic>believes</italic> to obviate the acquaintance requirement, and (ii) it treats sentences of the form <italic>a is delicious</italic> as undefined in autocentric contexts in which the speaker hasn&#8217;t tried <italic>a</italic>. Our lightweight expressivist view avoids this result because although it has the first of these features, it lacks the second.</p>
<p>We&#8217;ll demonstrate how this works for the contextualist version of our view, but essentially the same point carries over to the other versions. As on the presupposition view, obviation is achieved when an operator shifts the generator parameter away from its default value. On the contextualist version of our approach, <italic>believes</italic> shifts the generator parameter <inline-formula><mml:math id="Eq303"><mml:mi>&#963;</mml:mi></mml:math></inline-formula> to the hypothetical generator <inline-formula><mml:math id="Eq304"><mml:mi>&#948;</mml:mi></mml:math></inline-formula>:</p>
<list list-type="simple">
<list-item><p>(S11) <inline-formula><mml:math id="Eq305"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:msub><mml:mi>B</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x00A0;</mml:mo><mml:mo>&#981;</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> iff for all <inline-formula><mml:math id="Eq306"><mml:mrow><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;&#8242;</mml:mo></mml:msup><mml:mo>&#8712;</mml:mo><mml:mrow><mml:mi>D</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>o</mml:mi><mml:mo>&#8290;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="Eq307"><mml:mrow><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#955;</mml:mi><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup><mml:mo lspace="0em" rspace="0.167em">.</mml:mo><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#948;</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;&#8242;</mml:mo></mml:msup><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo lspace="0em">.</mml:mo></mml:mrow></mml:math></inline-formula></p></list-item>
</list>
<p>Together with our account of assertability in a context, this yields the following result (where <italic>c</italic> is an autocentric context):</p>
<p><bold>Fact 8.</bold> <inline-formula><mml:math id="Eq308"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:msub><mml:mi>B</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x00A0;</mml:mo><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mi>c</mml:mi></mml:msup><mml:mo>=</mml:mo><mml:mi class="MJX-tex-caligraphic" mathvariant="script">A</mml:mi></mml:mrow></mml:math></inline-formula> <italic>iff for all <inline-formula><mml:math id="Eq309"><mml:mrow><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;&#8242;</mml:mo></mml:msup><mml:mo>&#8712;</mml:mo><mml:mrow><mml:mi>D</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>o</mml:mi><mml:mo>&#8290;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="Eq310"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#948;</mml:mi><mml:mrow><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;&#8242;</mml:mo></mml:msup><mml:mo>,</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>.</italic></p>
<p>(Proof of <bold>Fact 8</bold> is left to the reader.) Note that this means that <italic>I believe that the cr&#232;me caramel is delicious</italic> is assertable in an autocentric context <italic>c</italic> even if the speaker <italic>s<sub>c</sub></italic> hasn&#8217;t tasted the cr&#232;me caramel. For the belief ascription is assertable in an autocentric context just in case the speaker believes that they are disposed to like the taste of the cr&#232;me caramel, which may be true even if the speaker hasn&#8217;t tasted the cr&#232;me caramel. So <italic>believes</italic> obviates the acquaintance requirement on this account.</p>
<p>To see how the expressivist view avoids the odd consequence of the presupposition view, suppose that <italic>I believe that the cr&#232;me caramel is delicious</italic> is true in an autocentric context <italic>c</italic>. According to the expressivist view, that sentence is true in <italic>c</italic> iff:</p>
<disp-quote>
<p><inline-formula><mml:math id="Eq311"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:msub><mml:mi>B</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x00A0;</mml:mo><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi>&#948;</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> iff</p>
<p>for all <inline-formula><mml:math id="Eq312"><mml:mrow><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;&#8242;</mml:mo></mml:msup><mml:mo>&#8712;</mml:mo><mml:mrow><mml:mi>D</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>o</mml:mi><mml:mo>&#8290;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="Eq313"><mml:mrow><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#955;</mml:mi><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup><mml:mo lspace="0em" rspace="0.167em">.</mml:mo><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>T</mml:mi><mml:mi>a</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup><mml:mo>,</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi>&#948;</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;&#8242;</mml:mo></mml:msup><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> iff</p>
<p>for all <inline-formula><mml:math id="Eq314"><mml:mrow><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;&#8242;</mml:mo></mml:msup><mml:mo>&#8712;</mml:mo><mml:mrow><mml:mi>D</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>o</mml:mi><mml:mo>&#8290;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="Eq315"><mml:mrow><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#955;</mml:mi><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup><mml:mo lspace="0em" rspace="0.167em">.</mml:mo><mml:msup><mml:mi>&#948;</mml:mi><mml:mrow><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup><mml:mo>,</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;&#8242;</mml:mo></mml:msup><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula></p>
</disp-quote>
<p>Thus, where <italic>a</italic> is the cr&#232;me caramel, <italic>I believe that the cr&#232;me caramel is delicious</italic> is true in the autocentric context <italic>c</italic> iff the speaker <italic>s<sub>c</sub></italic> believes the following proposition:</p>
<list list-type="simple">
<list-item><p>(a&#8242;) <inline-formula><mml:math id="Eq316"><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mrow><mml:mi>&#955;</mml:mi><mml:mo>&#8290;</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup></mml:mrow><mml:mo lspace="0em" rspace="0.667em">.</mml:mo><mml:mrow><mml:mrow><mml:msup><mml:mi>&#948;</mml:mi><mml:mrow><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup><mml:mo>,</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:math></inline-formula></p></list-item>
</list>
<p>This is the proposition that <italic>s<sub>c</sub></italic> is disposed to like the taste of the cr&#232;me caramel.</p>
<p>It follows from this that the speaker <italic>s<sub>c</sub></italic> also believes the proposition expressed by the sentence <italic>The cr&#232;me caramel is delicious</italic> in <italic>c</italic>. To see this, note that on the contextualist version of our approach, the proposition expressed by <italic>The cr&#232;me caramel is delicious</italic> in the autocentric context <italic>c</italic> is the following:</p>
<list list-type="simple">
<list-item><p><inline-formula><mml:math id="Eq317"><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mrow><mml:mi>&#955;</mml:mi><mml:mo>&#8290;</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup></mml:mrow><mml:mo lspace="0em" rspace="0.167em">.</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup><mml:mo>,</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi>&#948;</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:math></inline-formula></p>
<p>= <inline-formula><mml:math id="Eq318"><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mrow><mml:mi>&#955;</mml:mi><mml:mo>&#8290;</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup></mml:mrow><mml:mo lspace="0em" rspace="0.167em">.</mml:mo><mml:mrow><mml:mrow><mml:msup><mml:mi>&#948;</mml:mi><mml:mrow><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup><mml:mo>,</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:math></inline-formula></p></list-item>
</list>
<p>which is just (a&#8242;) again. Thus, if <italic>I believe that the cr&#232;me caramel is delicious</italic> is true in the autocentric context <italic>c, s<sub>c</sub></italic> believes proposition (a&#8242;) in <italic>c</italic>. And if <italic>s<sub>c</sub></italic> believes (a&#8242;) in <italic>c</italic>, then <italic>s<sub>c</sub></italic> believes the content expressed by <italic>The cr&#232;me caramel is delicious</italic> in <italic>c</italic>, since this just is proposition (a&#8242;). Thus, on the expressivist approach, it is not possible for the sentence <italic>I believe that the cr&#232;me caramel is delicious</italic> to be true in an autocentric context <italic>c</italic> unless the speaker believes what is said by the sentence <italic>The cr&#232;me caramel is delicious</italic> in <italic>c</italic>. Expressivism thus avoids the odd consequence of the presupposition view.</p>
<p>One last remark about obviation. We noted earlier that epistemic modals and indicative conditionals also obviate the acquaintance inference. We can predict these results by positing lexical entries for these operators according to which they again shift the generator parameter <inline-formula><mml:math id="Eq319"><mml:mi>&#963;</mml:mi></mml:math></inline-formula> to <inline-formula><mml:math id="Eq320"><mml:mi>&#948;</mml:mi></mml:math></inline-formula> (in addition to shifting the world parameter, as is standard). For example, an entry for <italic>might</italic> suitable for the contextualist might look like this:</p>
<list list-type="simple">
<list-item><p>(S12) <inline-formula><mml:math id="Eq321"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mtext mathvariant="italic">might</mml:mtext><mml:mo lspace="0.500em">&#8290;</mml:mo><mml:mo>&#981;</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> iff for some <inline-formula><mml:math id="Eq322"><mml:mrow><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup><mml:mo>&#8712;</mml:mo><mml:mrow><mml:mi>R</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="Eq323"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:msup><mml:mi>w</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#948;</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>, where <italic>R(w)</italic> is the set of possible worlds compatible with what is known in <italic>w</italic>.</p></list-item>
</list>
<p>The reader may verify that this allows <italic>The cr&#232;me caramel might be delicious</italic> to be true and assertable in an autocentric context even if the speaker hasn&#8217;t tasted the cr&#232;me caramel.<xref ref-type="fn" rid="n48">48</xref></p>
</sec>
</sec>
</body>
<back>
<fn-group>
<fn id="n1"><p>See Mary Mothersill, <italic>Beauty Restored</italic> (<xref ref-type="bibr" rid="B24">Oxford: Oxford University Press, 1984</xref>), 160, Hazel Pearson, &#8220;A Judge-Free Semantics for Predicates of Personal Taste,&#8221; <italic>Journal of Semantics</italic> 30/3 (<xref ref-type="bibr" rid="B29">2013</xref>), 117&#8211;118, and John MacFarlane, <italic>Assessment-Sensitivity: Relative Truth and its Applications</italic> (<xref ref-type="bibr" rid="B22">Oxford: Oxford University Press, 2014</xref>), 3&#8211;4.</p></fn>
<fn id="n2"><p>Immanuel Kant, <italic>Critique of the Power of Judgment</italic> (<xref ref-type="bibr" rid="B18">Cambridge: Cambridge University Press, 1790/2000</xref>), &#167;33.</p></fn>
<fn id="n3"><p><xref ref-type="bibr" rid="B24">Mothersill, <italic>op. cit.</italic>, 160</xref>. For an overview of the debate about aesthetic testimony (and for references to that literature), see Jon Robson, &#8220;Aesthetic Testimony,&#8221; <italic>Philosophy Compass</italic> 7/1 (<xref ref-type="bibr" rid="B32">2012</xref>).</p></fn>
<fn id="n4"><p>Dilip Ninan, &#8220;Taste Predicates and the Acquaintance Inference,&#8221; <italic>Semantics and Linguistic Theory</italic> 24 (<xref ref-type="bibr" rid="B27">2014</xref>), 291. See also Rachel Etta Rudolph, &#8220;Acquaintance and Evidence in Appearance Language,&#8221; <italic>Linguistics and Philosophy</italic> 46 (<xref ref-type="bibr" rid="B33">2023</xref>).</p></fn>
<fn id="n5"><p>Peter Lasersohn, &#8220;Context Dependence, Disagreement, and Predicates of Personal Taste,&#8221; <italic>Linguistics and Philosophy</italic> 28/6 (<xref ref-type="bibr" rid="B21">2005</xref>), &#167;6.1.</p></fn>
<fn id="n6"><p>See Pranav Anand and Natasha Korotkova, &#8220;Acquaintance Content and Obviation,&#8221; <italic>Sinn und Bedeutung</italic> 22 (<xref ref-type="bibr" rid="B1">2018</xref>), 63. There may also be cases in which <italic>no</italic> acquaintance inference arises at all, not even an exocentric one. But uncontroversial examples of this are not easy to find, and so I set this issue aside in the present essay.</p></fn>
<fn id="n7"><p>See Roger Scruton <italic>Art and Imagination: A Study in the Philosophy of Mind</italic> (<xref ref-type="bibr" rid="B37">London: Methuen, 1974</xref>), Ch. 4, Nils Franz&#233;n &#8220;Aesthetic Evaluation and First-Hand Experience,&#8221; <italic>Australasian Journal of Philosophy</italic> 96/4 (<xref ref-type="bibr" rid="B11">2018</xref>), and Malte Willer and Chris Kennedy &#8220;Assertion, Expression, Experience,&#8221; <italic>Inquiry</italic> 65/7 (<xref ref-type="bibr" rid="B43">2022</xref>)). Lenny Clapp &#8220;A Non-Alethic Approach to Faultless Disagreement,&#8221; <italic>Dialectica</italic> 69/4 (<xref ref-type="bibr" rid="B6">2015</xref>) and Teresa Marques &#8220;Aesthetic Predicates: A Hybrid Dispositional Account,&#8221; <italic>Inquiry</italic> 59/6 (<xref ref-type="bibr" rid="B23">2016</xref>) also advocate expressivist approaches to taste predicates, but they focus on issues surrounding the notion of disagreement rather than on the acquaintance requirement.</p></fn>
<fn id="n8"><p><xref ref-type="bibr" rid="B21">Lasersohn</xref>, <italic>op. cit.</italic>, &#167;4.3 rejects expressivism about taste on roughly these grounds. There is a large literature in metaethics on the problem alluded to above, the &#8216;Frege-Geach&#8217; problem. See, for example, Peter T Geach &#8220;Assertion,&#8221; <italic>The Philosophical Review</italic> 74/4 (<xref ref-type="bibr" rid="B13">1965</xref>), Simon Blackburn <italic>Essays in Quasi-Realism</italic> (<xref ref-type="bibr" rid="B4">Oxford: Oxford University Press, 1993</xref>), Allan Gibbard <italic>Wise Choices, Apt Feelings: A Theory of Normative Judgment</italic> (<xref ref-type="bibr" rid="B15">Cambridge, MA: Harvard University Press, 1990</xref>), Allan Gibbard <italic>Thinking How to Live</italic> (<xref ref-type="bibr" rid="B16">Cambridge, MA: Harvard University Press, 2008</xref>), Mark Schroeder <italic>Being For</italic> (<xref ref-type="bibr" rid="B35">New York: Oxford University Press, 2008</xref>), Malte Willer &#8220;Advice for Noncognitivists,&#8221; <italic>Pacific Philosophical Quarterly</italic> 98 (<xref ref-type="bibr" rid="B42">2017</xref>), Seth Yalcin &#8220;Bayesian Expressivism,&#8221; <italic>Proceedings of the Aristotelian Society</italic> 112/2 (<xref ref-type="bibr" rid="B48">2012</xref>), Seth Yalcin &#8220;Expressivism by Force,&#8221; in Daniel Fogal, Daniel Harris, and Matt Moss (eds.), <italic>New Work on Speech Acts</italic> (<xref ref-type="bibr" rid="B49">Oxford University Press Oxford, 2018</xref>), Alejandro P&#233;rez Carballo &#8220;Negation, Expressivism, and Intentionality,&#8221; <italic>The Philosophical Quarterly</italic> 70/279 (<xref ref-type="bibr" rid="B30">2020</xref>), and the references therein.</p></fn>
<fn id="n9"><p>The approach advocated here is partly inspired by that of <xref ref-type="bibr" rid="B43">Willer and Kennedy, <italic>op. cit.</italic></xref>, which explains certain high-level similarities between the two theories. For example, both theories take the acquaintance requirement to arise out of a normative constraint on assertion, while remaining relatively neutral on certain disputes about truth and content. But there are many differences between the two theories, both technical and conceptual. For example, the account developed below consists of a standard static semantics plus a supervaluational definition of assertability; Willer and Kennedy propose a dynamic semantics in which supervaluationism plays no role. Furthermore, Willer and Kennedy do not discuss disjunction and generalized quantifiers, both of which play a large role in framing the present dialectic. Finally, see n. <xref ref-type="fn" rid="n28">28</xref> for a potential problem facing Willer and Kennedy&#8217;s approach, a problem not faced by the present approach. I should also mention that the formal proposal presented in Section 4 is similar to the one I offered in an earlier paper, Dilip Ninan &#8220;The Projection Problem for Predicates of Taste,&#8221; <italic>Semantics and Linguistic Theory</italic> 30 (<xref ref-type="bibr" rid="B28">2020</xref>). But in that work, the acquaintance requirement was treated as a presupposition, a view I now reject for the reasons given in Section 3.</p></fn>
<fn id="n10"><p>Gerald Gazdar <italic>Pragmatics: Implicature, Presupposition, and Logical Form</italic> (<xref ref-type="bibr" rid="B12">London: Academic Press, 1979</xref>), Timothy Williamson &#8220;Knowing and Asserting,&#8221; <italic>Philosophical Review</italic> 105/4 (<xref ref-type="bibr" rid="B44">1996</xref>).</p></fn>
<fn id="n11"><p>H. P. Grice <italic>Studies in the Way of Words</italic> (<xref ref-type="bibr" rid="B17">Cambridge, MA: Harvard University Press, 1989</xref>).</p></fn>
<fn id="n12"><p>Here &#8216;<italic>o</italic>&#8217; is being used as a term in the metalanguage that picks out an arbitrary object in the domain and also as a variable in the object language that is implicitly assigned to that object. This principle is inspired by a similar one found in Richard Wollheim <italic>Art and Its Objects</italic> (<xref ref-type="bibr" rid="B46">Cambridge: Cambridge University Press, 1980</xref>), 233.</p></fn>
<fn id="n13"><p>The claim that <italic>It must have rained last night</italic> does not suggest that the speaker knows it rained last night is controversial, turning in part on the question of whether <italic>must <inline-formula><mml:math id="Eq470"><mml:mo>&#981;</mml:mo></mml:math></inline-formula></italic> entails <inline-formula><mml:math id="Eq467"><mml:mo>&#981;</mml:mo></mml:math></inline-formula>. We set that issue aside here, though see Kai von Fintel and Anthony Gillies &#8220;<italic>Must</italic>&#8230; Stay&#8230; Strong!,&#8221; <italic>Natural Language Semantics</italic> 18/4 (<xref ref-type="bibr" rid="B41">2010</xref>).</p></fn>
<fn id="n14"><p>See also Patrick Mu&#241;oz <italic>On Tongues: The Grammar of Experiential Evaluation</italic> (Ph. D. diss.), University of Chicago, <xref ref-type="bibr" rid="B25">2019</xref>, 164&#8211;169.</p></fn>
<fn id="n15"><p>Though see Alexander Dinges and Julia Zakkou &#8220;Taste, Traits, and Tendencies,&#8221; <italic>Philosophical Studies</italic> 178 (<xref ref-type="bibr" rid="B8">2021</xref>), 1193&#8211;1194.</p></fn>
<fn id="n16"><p>Fabrizio Cariani <italic>The Modal Future: A Theory of Future-Directed Thought and Talk</italic> (<xref ref-type="bibr" rid="B5">Cambridge: Cambridge University Press, 2021</xref>), &#167;13.8.</p></fn>
<fn id="n17"><p>For any term <italic>a</italic>, I use <italic>Ta</italic> to translate <italic>a is delicious</italic>.</p></fn>
<fn id="n18"><p>I use <italic>Dx</italic> to translate <italic>x is on the dessert table</italic>; recall that <italic>Tx</italic> translates <italic>x is delicious</italic> (<italic>T</italic> is a <underline>t</underline>aste predicate).</p></fn>
<fn id="n19"><p>See, for example, Yoad Winter <italic>Elements of Formal Semantics: An Introduction to the Mathematical Theory of Meaning in Natural Language</italic> (<xref ref-type="bibr" rid="B45">Edinburgh: Edinburgh University Press, 2016</xref>), Ch. 4.</p></fn>
<fn id="n20"><p><xref ref-type="bibr" rid="B29">Pearson</xref>, <italic>op. cit.</italic>, <xref ref-type="bibr" rid="B1">Anand and Korotkova</xref>, <italic>op. cit.</italic>, and <xref ref-type="bibr" rid="B28">Ninan</xref>, <italic>op. cit.</italic>, (2020) all advocate versions of the presupposition view. For an introduction to the relevant notion of presupposition, see David I. Beaver Bart Geurts and Kristie Denlinger, &#8220;Presupposition,&#8221; in Edward N. Zalta (ed.), <italic>The Stanford Encyclopedia of Philosophy</italic>, Spring 2021 edition (<xref ref-type="bibr" rid="B3">2021</xref>).</p></fn>
<fn id="n21"><p>This account of <italic>might</italic> is my own proposal. Anand and Korotkova do not give a semantics for <italic>might</italic>. They do give a semantics for <italic>must</italic>, but it does not actually obviate the acquaintance inference, as <xref ref-type="bibr" rid="B43">Willer and Kennedy, <italic>op. cit.</italic></xref>, 847 observe. The account given above corrects this flaw. The key is to make <italic>might</italic> shift the kernel parameter to <inline-formula><mml:math id="Eq468"><mml:mrow><mml:mi class="MJX-tex-caligraphic" mathvariant="script">P</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>W</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> rather than to <inline-formula><mml:math id="Eq469"><mml:mrow><mml:mo rspace="0em">&#8745;</mml:mo><mml:mi>K</mml:mi></mml:mrow></mml:math></inline-formula>.</p></fn>
<fn id="n22"><p>This is true both of the Strong Kleene theory and the theory of Stanley Peters &#8220;A Truth-Conditional Formulation of Karttunen&#8217;s Account of Presupposition,&#8221; <italic>Synthese</italic> 40/2 (<xref ref-type="bibr" rid="B31">1979</xref>).</p></fn>
<fn id="n23"><p>B.R. George <italic>Presupposition Repairs: A Static, Trivalent Approach to Predicting Projection</italic> (M. A. thesis), UCLA, <xref ref-type="bibr" rid="B14">2008</xref>, 13&#8211;14.</p></fn>
<fn id="n24"><p>Tamina Stephenson <italic>Towards a Theory of Subjective Meaning</italic> (Ph. D. diss.), MIT, <xref ref-type="bibr" rid="B40">2007</xref>, &#167;2.5.2, <xref ref-type="bibr" rid="B25">Mu&#241;oz</xref>, <italic>op. cit.</italic>, 187, <xref ref-type="bibr" rid="B43">Willer and Kennedy</xref>, <italic>op. cit.</italic>, 849.</p></fn>
<fn id="n25"><p>David Kaplan &#8220;Demonstratives,&#8221; in Joseph Almog, John Perry, and Howard Wettstein (eds.), <italic>Themes from Kaplan</italic> (<xref ref-type="bibr" rid="B19">New York: Oxford University Press, 1989</xref>).</p></fn>
<fn id="n26"><p>Dilip Ninan &#8220;Semantics and the Objects of Assertion,&#8221; <italic>Linguistics and Philosophy</italic> 33/5 (<xref ref-type="bibr" rid="B26">2010</xref>).</p></fn>
<fn id="n27"><p>Robert Stalnaker &#8220;Assertion,&#8221; in P. Cole (ed.), <italic>Syntax and Semantics 9: Pragmatics</italic> (<xref ref-type="bibr" rid="B38">New York: Academic Press, 1978</xref>) and Robert Stalnaker &#8220;Common Ground,&#8221; <italic>Linguistics And Philosophy</italic> 25/5-6 (<xref ref-type="bibr" rid="B39">2002</xref>).</p></fn>
<fn id="n28"><p>I should note the odd consequence here doesn&#8217;t depend on the contextualist account of content defined above; the same problem would arise if we instead adopt a relativist or pure expressivist account of content (on which see below). The problem also seems to arise for the view of <xref ref-type="bibr" rid="B43">Willer and Kennedy, <italic>op. cit.</italic></xref>. For on their approach, if I haven&#8217;t tasted the cr&#232;me caramel and I occupy an autocentric context, then the content of <italic>The cr&#232;me caramel is delicious</italic> will be the empty set. Thus, I may believe that the cr&#232;me caramel is delicious without believing that content.</p></fn>
<fn id="n29"><p>Note that <inline-formula><mml:math id="Eq328"><mml:msup><mml:mi>&#963;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is the result of applying function <inline-formula><mml:math id="Eq329"><mml:mi>&#963;</mml:mi></mml:math></inline-formula> to argument <inline-formula><mml:math id="Eq330"><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>, i.e., <inline-formula><mml:math id="Eq331"><mml:mrow><mml:msup><mml:mi>&#963;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mrow><mml:mi>&#963;</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula>.</p></fn>
<fn id="n30"><p>Statements (S1)&#8211;(S12) constitute the recursive definition of satisfaction at a point. The definition is not given all at once, but instead presented over the course of the remainder in order to facilitate discussion of the individual clauses.</p></fn>
<fn id="n31"><p><italic>Proof.</italic> For the left-to-right direction, we show the contrapositive. So suppose <inline-formula><mml:math id="Eq332"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#8800;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>. Then there are two cases: either <inline-formula><mml:math id="Eq333"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula> or <inline-formula><mml:math id="Eq334"><mml:mrow><mml:mi>a</mml:mi><mml:mo>&#8713;</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>o</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>m</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula>. In the first case, if <inline-formula><mml:math id="Eq335"><mml:mrow><mml:mi>&#963;</mml:mi><mml:mo>&#8827;</mml:mo><mml:mi>&#967;</mml:mi></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math id="Eq336"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#963;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula> and so <inline-formula><mml:math id="Eq337"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#963;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#8800;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>. Thus, <inline-formula><mml:math id="Eq338"><mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8800;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo lspace="0em">.</mml:mo></mml:mrow></mml:math></inline-formula> So not every <inline-formula><mml:math id="Eq339"><mml:mrow><mml:mi>&#963;</mml:mi><mml:mo>&#8827;</mml:mo><mml:mi>&#967;</mml:mi></mml:mrow></mml:math></inline-formula> is such that <inline-formula><mml:math id="Eq340"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>. But then <inline-formula><mml:math id="Eq341"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mi>c</mml:mi></mml:msup><mml:mo>&#8800;</mml:mo><mml:mi class="MJX-tex-caligraphic" mathvariant="script">A</mml:mi></mml:mrow></mml:math></inline-formula>. In the second case, choose a complete extension <inline-formula><mml:math id="Eq342"><mml:mi>&#963;</mml:mi></mml:math></inline-formula> of <inline-formula><mml:math id="Eq343"><mml:mi>&#967;</mml:mi></mml:math></inline-formula> such that, for all <inline-formula><mml:math id="Eq344"><mml:mrow><mml:mi>o</mml:mi><mml:mo>&#8713;</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>o</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>m</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="Eq345"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#963;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula>. Then again <inline-formula><mml:math id="Eq346"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#963;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula> and so <inline-formula><mml:math id="Eq347"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#963;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#8800;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>, which again means that <inline-formula><mml:math id="Eq348"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mi>c</mml:mi></mml:msup><mml:mo>&#8800;</mml:mo><mml:mi class="MJX-tex-caligraphic" mathvariant="script">A</mml:mi></mml:mrow></mml:math></inline-formula>. For the right-to-left direction, suppose <inline-formula><mml:math id="Eq349"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>. Then for all <inline-formula><mml:math id="Eq350"><mml:mrow><mml:mi>&#963;</mml:mi><mml:mo>&#8827;</mml:mo><mml:mi>&#967;</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="Eq351"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#963;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>. Thus, for all <inline-formula><mml:math id="Eq352"><mml:mrow><mml:mi>&#963;</mml:mi><mml:mo>&#8827;</mml:mo><mml:mi>&#967;</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="Eq353"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>, and so <inline-formula><mml:math id="Eq354"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mi>c</mml:mi></mml:msup><mml:mo>=</mml:mo><mml:mi class="MJX-tex-caligraphic" mathvariant="script">A</mml:mi></mml:mrow></mml:math></inline-formula>. &#8718;</p></fn>
<fn id="n32"><p>It is possible that we could restrict the set of complete extensions over which we supervaluate to just these two complete extensions of <inline-formula><mml:math id="Eq355"><mml:mi>&#967;</mml:mi></mml:math></inline-formula>; see <xref ref-type="bibr" rid="B14">George, <italic>op. cit.</italic></xref> for related discussion concerning presuppositions in the Strong Kleene setting.</p></fn>
<fn id="n33"><p><italic>Proof.</italic> For both claims, the left-to-right direction simply follows from the fact that <inline-formula><mml:math id="Eq356"><mml:msub><mml:mi>&#963;</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:math></inline-formula> and <inline-formula><mml:math id="Eq357"><mml:msub><mml:mi>&#963;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math></inline-formula> are complete extensions of <inline-formula><mml:math id="Eq358"><mml:mi>&#967;</mml:mi></mml:math></inline-formula>. For the right-to-left direction of (1), suppose <inline-formula><mml:math id="Eq359"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#8800;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>. Then either <inline-formula><mml:math id="Eq360"><mml:mrow><mml:mi>o</mml:mi><mml:mo>&#8713;</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>o</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>m</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula> or <inline-formula><mml:math id="Eq361"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula>. If <inline-formula><mml:math id="Eq362"><mml:mrow><mml:mi>o</mml:mi><mml:mo>&#8713;</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>o</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>m</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="Eq363"><mml:mrow><mml:mrow><mml:msub><mml:mi>&#963;</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula> given that <inline-formula><mml:math id="Eq364"><mml:msub><mml:mi>&#963;</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:math></inline-formula> maps every <inline-formula><mml:math id="Eq365"><mml:mrow><mml:msup><mml:mi>o</mml:mi><mml:mo>&#8242;</mml:mo></mml:msup><mml:mo>&#8713;</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>o</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>m</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula> to 0. If <inline-formula><mml:math id="Eq366"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="Eq367"><mml:mrow><mml:mrow><mml:msub><mml:mi>&#963;</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula>, simply because <inline-formula><mml:math id="Eq368"><mml:mrow><mml:msub><mml:mi>&#963;</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo>&#8827;</mml:mo><mml:mi>&#967;</mml:mi></mml:mrow></mml:math></inline-formula>. Either way, <inline-formula><mml:math id="Eq369"><mml:mrow><mml:mrow><mml:msub><mml:mi>&#963;</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula>, and so <inline-formula><mml:math id="Eq370"><mml:mrow><mml:mrow><mml:msub><mml:mi>&#963;</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#8800;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>. The argument for the right-to-left direction of (2) is similar. &#8718;</p></fn>
<fn id="n34"><p><italic>Proof</italic>. For the left-to-right direction: Suppose <inline-formula><mml:math id="Eq371"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#8800;</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula>. Then by <bold>Lemma 1.2</bold>, <inline-formula><mml:math id="Eq372"><mml:mrow><mml:mrow><mml:msubsup><mml:mi>&#963;</mml:mi><mml:mn>1</mml:mn><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msubsup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#8800;</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula>, where <inline-formula><mml:math id="Eq373"><mml:msub><mml:mi>&#963;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math></inline-formula> is the easy-to-please extension of <inline-formula><mml:math id="Eq374"><mml:mi>&#967;</mml:mi></mml:math></inline-formula>. So <inline-formula><mml:math id="Eq375"><mml:mrow><mml:mrow><mml:msubsup><mml:mi>&#963;</mml:mi><mml:mn>1</mml:mn><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msubsup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>, which means that <inline-formula><mml:math id="Eq376"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>&#963;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>. Given the clause for negation, this means that <inline-formula><mml:math id="Eq377"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#172;</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>&#963;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula>. But then there is a <inline-formula><mml:math id="Eq378"><mml:mrow><mml:mi>&#963;</mml:mi><mml:mo>&#8827;</mml:mo><mml:mi>&#967;</mml:mi></mml:mrow></mml:math></inline-formula> such that <inline-formula><mml:math id="Eq379"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#172;</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8800;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>, for <inline-formula><mml:math id="Eq380"><mml:msub><mml:mi>&#963;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math></inline-formula> is such a <inline-formula><mml:math id="Eq381"><mml:mi>&#963;</mml:mi></mml:math></inline-formula>. It follows that from our assertion norm that <inline-formula><mml:math id="Eq382"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#172;</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mi>c</mml:mi></mml:msup><mml:mo>&#8800;</mml:mo><mml:mi class="MJX-tex-caligraphic" mathvariant="script">A</mml:mi></mml:mrow></mml:math></inline-formula>. For the right-to-left direction, suppose <inline-formula><mml:math id="Eq383"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula>. Then if <inline-formula><mml:math id="Eq384"><mml:mi>&#963;</mml:mi></mml:math></inline-formula> is a complete extension of <inline-formula><mml:math id="Eq385"><mml:mi>&#967;</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math id="Eq386"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#963;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula>. So <inline-formula><mml:math id="Eq387"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula>, which means <inline-formula><mml:math id="Eq388"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#172;</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>. Since <inline-formula><mml:math id="Eq389"><mml:mi>&#963;</mml:mi></mml:math></inline-formula> was an arbitrary complete extension of <inline-formula><mml:math id="Eq390"><mml:mi>&#967;</mml:mi></mml:math></inline-formula>, this holds for them all, which means <inline-formula><mml:math id="Eq391"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#172;</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mi>c</mml:mi></mml:msup><mml:mo>=</mml:mo><mml:mi class="MJX-tex-caligraphic" mathvariant="script">A</mml:mi></mml:mrow></mml:math></inline-formula>. &#8718;</p></fn>
<fn id="n35"><p>Peter Klecha, &#8220;Diagnosing Modality in Predictive Expressions,&#8221; <italic>Journal of Semantics</italic> 31/3 (<xref ref-type="bibr" rid="B20">2014</xref>), 451.</p></fn>
<fn id="n36"><p><italic>Proof.</italic> For the left-to-right direction: Suppose <inline-formula><mml:math id="Eq392"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo>&#8744;</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>b</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mi>c</mml:mi></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>. Then for all <inline-formula><mml:math id="Eq393"><mml:mrow><mml:mi>&#963;</mml:mi><mml:mo>&#8827;</mml:mo><mml:mi>&#967;</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="Eq394"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo>&#8744;</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>b</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>. So, for all <inline-formula><mml:math id="Eq395"><mml:mrow><mml:mi>&#963;</mml:mi><mml:mo>&#8827;</mml:mo><mml:mi>&#967;</mml:mi></mml:mrow></mml:math></inline-formula>, either <inline-formula><mml:math id="Eq396"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> or <inline-formula><mml:math id="Eq397"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>b</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>. So, for all <inline-formula><mml:math id="Eq398"><mml:mrow><mml:mi>&#963;</mml:mi><mml:mo>&#8827;</mml:mo><mml:mi>&#967;</mml:mi></mml:mrow></mml:math></inline-formula>, either <inline-formula><mml:math id="Eq399"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#963;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> or <inline-formula><mml:math id="Eq400"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#963;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>b</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>. It follows that either <inline-formula><mml:math id="Eq401"><mml:mrow><mml:mrow><mml:msubsup><mml:mi>&#963;</mml:mi><mml:mn>0</mml:mn><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msubsup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> or <inline-formula><mml:math id="Eq402"><mml:mrow><mml:mrow><mml:msubsup><mml:mi>&#963;</mml:mi><mml:mn>0</mml:mn><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msubsup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>, where <inline-formula><mml:math id="Eq403"><mml:msub><mml:mi>&#963;</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:math></inline-formula> is the picky extension of <inline-formula><mml:math id="Eq404"><mml:mi>&#967;</mml:mi></mml:math></inline-formula>. So, given <bold>Lemma 1.1</bold>, it follows that either <inline-formula><mml:math id="Eq405"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> or <inline-formula><mml:math id="Eq406"><mml:mrow><mml:mrow><mml:mrow><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>b</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo lspace="0em">.</mml:mo></mml:mrow></mml:math></inline-formula> For the right-to-left direction: Suppose <inline-formula><mml:math id="Eq407"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> or <inline-formula><mml:math id="Eq408"><mml:mrow><mml:mrow><mml:mrow><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>b</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo lspace="0em">.</mml:mo></mml:mrow></mml:math></inline-formula> Suppose first that <inline-formula><mml:math id="Eq409"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>. Then we know that for all <inline-formula><mml:math id="Eq410"><mml:mrow><mml:mrow><mml:mi>&#963;</mml:mi><mml:mo>&#8827;</mml:mo><mml:mi>&#967;</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mrow></mml:math></inline-formula> from which it follows that for all <inline-formula><mml:math id="Eq411"><mml:mrow><mml:mrow><mml:mi>&#963;</mml:mi><mml:mo>&#8827;</mml:mo><mml:mi>&#967;</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo>&#8744;</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>b</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mrow></mml:math></inline-formula>. And this means that <inline-formula><mml:math id="Eq412"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo>&#8744;</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>b</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mi>c</mml:mi></mml:msup><mml:mo>=</mml:mo><mml:mi class="MJX-tex-caligraphic" mathvariant="script">A</mml:mi></mml:mrow></mml:math></inline-formula>. The reasoning for the case where <inline-formula><mml:math id="Eq413"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>b</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> is similar. &#8718;</p></fn>
<fn id="n37"><p><italic>Proof.</italic> We know that <inline-formula><mml:math id="Eq414"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo>&#8744;</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#172;</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mi>c</mml:mi></mml:msup><mml:mo>=</mml:mo><mml:mi class="MJX-tex-caligraphic" mathvariant="script">A</mml:mi></mml:mrow></mml:math></inline-formula> iff for all <inline-formula><mml:math id="Eq415"><mml:mrow><mml:mrow><mml:mi>&#963;</mml:mi><mml:mo>&#8827;</mml:mo><mml:mi>&#967;</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo>&#8744;</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#172;</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mrow></mml:math></inline-formula>. So let <inline-formula><mml:math id="Eq416"><mml:mi>&#963;</mml:mi></mml:math></inline-formula> be an arbitrary complete extension of <inline-formula><mml:math id="Eq417"><mml:mi>&#967;</mml:mi></mml:math></inline-formula>. Note that:</p>
<p><disp-quote>
<p><inline-formula><mml:math id="Eq418"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo>&#8744;</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#172;</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>a</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> iff <inline-formula><mml:math id="Eq419"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#963;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> or <inline-formula><mml:math id="Eq420"><mml:mrow><mml:mrow><mml:msup><mml:mi>&#963;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote></p>
<p>And note that the right-hand side of this biconditional must hold, because <inline-formula><mml:math id="Eq421"><mml:mrow><mml:mi>a</mml:mi><mml:mo>&#8712;</mml:mo><mml:mi>D</mml:mi></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="Eq422"><mml:msup><mml:mi>&#963;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup></mml:math></inline-formula> is a total function from D into {0, 1}. &#8718;</p></fn>
<fn id="n38"><p>For any variable assignment <italic>g</italic>, variable <italic>x</italic>, and object <inline-formula><mml:math id="Eq423"><mml:mrow><mml:mi>o</mml:mi><mml:mo>&#8712;</mml:mo><mml:mi>D</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="Eq424"><mml:mrow><mml:mi>g</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>/</mml:mo><mml:mi>o</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is the assignment <italic>h</italic> such that <inline-formula><mml:math id="Eq425"><mml:mrow><mml:mrow><mml:mi>h</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mi>o</mml:mi></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="Eq426"><mml:mrow><mml:mrow><mml:mi>h</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>y</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mi>g</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>y</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula> for all variables <italic>y</italic> distinct from <italic>x</italic>. All sets here are understood to be subsets of our domain <italic>D</italic>.</p></fn>
<fn id="n39"><p><italic>Proof.</italic> Suppose <inline-formula><mml:math id="Eq427"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:msub><mml:mi>Q</mml:mi><mml:mi>x</mml:mi></mml:msub><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mi>F</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>x</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>x</mml:mi></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mi>c</mml:mi></mml:msup><mml:mo>=</mml:mo><mml:mi class="MJX-tex-caligraphic" mathvariant="script">A</mml:mi></mml:mrow></mml:math></inline-formula>. So, for all <inline-formula><mml:math id="Eq428"><mml:mrow><mml:mi>&#963;</mml:mi><mml:mo>&#8827;</mml:mo><mml:mi>&#967;</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="Eq429"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:msub><mml:mi>Q</mml:mi><mml:mi>x</mml:mi></mml:msub><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mi>F</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>x</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>x</mml:mi></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi>&#963;</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>. So for all <inline-formula><mml:math id="Eq430"><mml:mrow><mml:mi>&#963;</mml:mi><mml:mo>&#8827;</mml:mo><mml:mi>&#967;</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="Eq431"><mml:mrow><mml:msub><mml:mi>Q</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mi>I</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>F</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:mi>o</mml:mi><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mrow><mml:mrow><mml:msup><mml:mi>&#963;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy='false'>}</mml:mo></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. So, where <inline-formula><mml:math id="Eq432"><mml:msub><mml:mi>&#963;</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:math></inline-formula> is the picky extension of <inline-formula><mml:math id="Eq433"><mml:mi>&#967;</mml:mi></mml:math></inline-formula>, we have <inline-formula><mml:math id="Eq434"><mml:mrow><mml:msub><mml:mi>Q</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mi>I</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>F</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:mi>o</mml:mi><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mrow><mml:mrow><mml:msubsup><mml:mi>&#963;</mml:mi><mml:mn>0</mml:mn><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msubsup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy='false'>}</mml:mo></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. And note that given <bold>Lemma 1.1</bold>, we have the following equivalence:</p>
<p><disp-quote>
<p><inline-formula><mml:math id="Eq435"><mml:mrow><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:mi>o</mml:mi><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mrow><mml:mrow><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy='false'>}</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:mi>o</mml:mi><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mrow><mml:mrow><mml:msubsup><mml:mi>&#963;</mml:mi><mml:mn>0</mml:mn><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msubsup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy='false'>}</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote></p>
<p>Thus, <inline-formula><mml:math id="Eq436"><mml:mrow><mml:msub><mml:mi>Q</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mi>I</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>F</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:mi>o</mml:mi><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mrow><mml:mrow><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy='false'>}</mml:mo></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, which is what we needed to show. &#8718;</p></fn>
<fn id="n40"><p><italic>Proof.</italic> Suppose [<sc>exactly two</sc><sub>x</sub> <inline-formula><mml:math id="Eq437"><mml:mrow><mml:msup><mml:mrow><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mi>F</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>x</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>x</mml:mi></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mi>c</mml:mi></mml:msup><mml:mo>=</mml:mo><mml:mi class="MJX-tex-caligraphic" mathvariant="script">A</mml:mi></mml:mrow></mml:math></inline-formula>. So:</p>
<p><disp-quote>
<p>(<inline-formula><mml:math id="Eq438"><mml:mo>&#8902;</mml:mo></mml:math></inline-formula>) for all <inline-formula><mml:math id="Eq439"><mml:mrow><mml:mi>&#963;</mml:mi><mml:mo>&#8827;</mml:mo><mml:mi>&#967;</mml:mi></mml:mrow></mml:math></inline-formula>: <inline-formula><mml:math id="Eq440"><mml:mrow><mml:mrow><mml:mo stretchy='false'>|</mml:mo><mml:mrow><mml:mrow><mml:mi>I</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>F</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#8745;</mml:mo><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:mi>o</mml:mi><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mrow><mml:mrow><mml:msup><mml:mi>&#963;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy='false'>}</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy='false'>|</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote></p>
<p>And note that by Fact 6, we also have:</p>
<p><disp-quote>
<p><inline-formula><mml:math id="Eq441"><mml:mrow><mml:mrow><mml:mo stretchy='false'>|</mml:mo><mml:mrow><mml:mrow><mml:mi>I</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>F</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#8745;</mml:mo><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:mi>o</mml:mi><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mrow><mml:mrow><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy='false'>}</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy='false'>|</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote></p>
<p>So let o<sub>1</sub> and o<sub>2</sub> be distinct elements of D such that:</p>
<p><disp-quote>
<p><inline-formula><mml:math id="Eq442"><mml:mrow><mml:mrow><mml:mrow><mml:mi>I</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>F</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#8745;</mml:mo><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:mi>o</mml:mi><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mrow><mml:mrow><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy='false'>}</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:msub><mml:mi>o</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>o</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo stretchy='false'>}</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote></p>
<p>Now suppose, for <italic>reductio</italic>, that there is an <inline-formula><mml:math id="Eq443"><mml:mrow><mml:mi>o</mml:mi><mml:mo>&#8712;</mml:mo><mml:mrow><mml:mi>I</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>F</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula> such that <inline-formula><mml:math id="Eq444"><mml:mrow><mml:mi>o</mml:mi><mml:mo>&#8713;</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>o</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>m</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula>. Let o<sub>3</sub> be such an o. Note that o<sub>3</sub> is distinct from both o<sub>1</sub> and o<sub>2</sub> since the latter are both in <inline-formula><mml:math id="Eq445"><mml:mrow><mml:mi>d</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>o</mml:mi><mml:mo>&#8290;</mml:mo><mml:mi>m</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msup><mml:mi>&#967;</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> while o<sub>3</sub> is not. Note that the easy-to-please extension <inline-formula><mml:math id="Eq446"><mml:msub><mml:mi>&#963;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math></inline-formula> of <inline-formula><mml:math id="Eq447"><mml:mi>&#967;</mml:mi></mml:math></inline-formula> will be such that <inline-formula><mml:math id="Eq448"><mml:mrow><mml:mrow><mml:msubsup><mml:mi>&#963;</mml:mi><mml:mn>1</mml:mn><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msubsup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>o</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msubsup><mml:mi>&#963;</mml:mi><mml:mn>1</mml:mn><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msubsup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>o</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msubsup><mml:mi>&#963;</mml:mi><mml:mn>1</mml:mn><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msubsup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>o</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>. Thus:</p>
<p><disp-quote>
<p><inline-formula><mml:math id="Eq449"><mml:mrow><mml:mrow><mml:mrow><mml:mi>I</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>F</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#8745;</mml:mo><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:mi>o</mml:mi><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mrow><mml:mrow><mml:msubsup><mml:mi>&#963;</mml:mi><mml:mn>1</mml:mn><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msubsup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy='false'>}</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:msub><mml:mi>o</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>o</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>o</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mo stretchy='false'>}</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote></p>
<p>But then:</p>
<p><disp-quote>
<p><inline-formula><mml:math id="Eq450"><mml:mrow><mml:mrow><mml:mo stretchy='false'>|</mml:mo><mml:mrow><mml:mrow><mml:mi>I</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>F</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#8745;</mml:mo><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:mi>o</mml:mi><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mrow><mml:mrow><mml:msubsup><mml:mi>&#963;</mml:mi><mml:mn>1</mml:mn><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msubsup><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy='false'>}</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy='false'>|</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote></p>
<p>But since <inline-formula><mml:math id="Eq451"><mml:mrow><mml:msub><mml:mi>&#963;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#8827;</mml:mo><mml:mi>&#967;</mml:mi></mml:mrow></mml:math></inline-formula>, this contradicts <inline-formula><mml:math id="Eq452"><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mo lspace="0em" rspace="0em">&#8902;</mml:mo><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>.</p></fn>
<fn id="n41"><p>See, for example, Jonathan Schaffer, &#8220;Perspective in Taste Predicates and Epistemic Modals,&#8221; in Andy Egan and Brian Weatherson (eds.), <italic>Epistemic Modality</italic> (<xref ref-type="bibr" rid="B34">Oxford: Oxford University Press, 2011</xref>).</p></fn>
<fn id="n42"><p>See, for example, <xref ref-type="bibr" rid="B22">MacFarlane, <italic>op. cit.</italic>, 150&#8211;151</xref>.</p></fn>
<fn id="n43"><p>Andy Egan, &#8220;Disputing about Taste,&#8221; in Ted Warfield and Richard Feldman (eds.), <italic>Disagreement</italic> (<xref ref-type="bibr" rid="B9">Oxford: Oxford University Press, 2010</xref>).</p></fn>
<fn id="n44"><p>An objectivist about taste could adopt the above definitions of truth and content with one modification. If objectivism is true, then there is a generator <inline-formula><mml:math id="Eq453"><mml:mi>&#969;</mml:mi></mml:math></inline-formula> that is a constant function from centered worlds <inline-formula><mml:math id="Eq454"><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> to the objective standard of taste <inline-formula><mml:math id="Eq455"><mml:msup><mml:mi>&#969;</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>. The objectivist account of truth and content results from taking the contextualist account of content and replacing <inline-formula><mml:math id="Eq456"><mml:mi>&#948;</mml:mi></mml:math></inline-formula> with <inline-formula><mml:math id="Eq457"><mml:mi>&#969;</mml:mi></mml:math></inline-formula>. An anonymous referee points out that the present approach is also compatible with <italic>non-indexical contextualism</italic>:</p>
<p><disp-quote>
<p><sc>non-indexical contextualism</sc></p>
<p>The content of <inline-formula><mml:math id="Eq458"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> in <italic>c</italic> is <inline-formula><mml:math id="Eq459"><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mrow><mml:mi>&#955;</mml:mi><mml:mo>&#8290;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo lspace="0em" rspace="0.167em">.</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo>&#981;</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>&#948;</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:math></inline-formula>.</p>
<p>A sentence <inline-formula><mml:math id="Eq460"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> is true in <italic>c</italic> iff the content of <inline-formula><mml:math id="Eq461"><mml:mo>&#981;</mml:mo></mml:math></inline-formula> in <italic>c</italic> is true at <inline-formula><mml:math id="Eq462"><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>j</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote></p></fn>
<fn id="n45"><p>On hybrid expressivism in metaethics, see Stephen J Barker, &#8220;Is Value Content a Component of Conventional Implicature?,&#8221; <italic>Analysis</italic> 60/3 (<xref ref-type="bibr" rid="B2">2000</xref>), David Copp, &#8220;Realist-Expressivism: A Neglected Option for Moral Realism,&#8221; <italic>Social Philosophy and Policy</italic> 18/2 (<xref ref-type="bibr" rid="B7">2001</xref>), Stephen Finlay, &#8220;Value and Implicature,&#8221; <italic>Philosophers&#8217; Imprint</italic> 5/4 (<xref ref-type="bibr" rid="B10">2005</xref>), Mark Schroeder, &#8220;Hybrid Expressivism: Virtues and Vices,&#8221; <italic>Ethics</italic> 119/2 (<xref ref-type="bibr" rid="B36">2009</xref>), and the references in the latter.</p></fn>
<fn id="n46"><p>See Seth Yalcin, &#8220;Nonfactualism About Epistemic Modality,&#8221; in Andy Egan and Brian Weatherson (eds.), <italic>Epistemic Modality</italic> (<xref ref-type="bibr" rid="B47">Oxford: Oxford University Press, 2011</xref>), &#167;10 for this way of characterizing pure expressivism</p></fn>
<fn id="n47"><p>See <xref ref-type="bibr" rid="B22">MacFarlane, <italic>op. cit.</italic></xref>, &#167;7.3 on the distinction between relativism and pure expressivism.</p></fn>
<fn id="n48"><p>For helpful comments and discussion, thanks to an audience at Institut Jean Nicod in Paris and to Emmanuel Chemla, Chris Kennedy, Natasha Korotkova, Philippe Schlenker, and Malte Willer. This article benefitted from a FIAS fellowship at the Paris Institute for Advanced Study (France). It has received funding from the European Union&#8217;s Horizon 2020 research and innovation programme under the Marie Sk&#322;odowska-Curie grant agreement No. 945408, and from the French State programme &#8220;Investissements d&#8217;avenir,&#8221; managed by the Agence Nationale de la Recherche (ANR-11-LABX-0027-01 Labex RFIEA+).</p></fn>
</fn-group>
<ref-list>
<ref id="B1"><mixed-citation publication-type="journal"><string-name><surname>Anand</surname>, <given-names>Pranav</given-names></string-name> and <string-name><given-names>Natasha</given-names> <surname>Korotkova</surname></string-name> <article-title>&#8220;Acquaintance Content and Obviation&#8221;</article-title> <source>Sinn und Bedeutung</source> <volume>22</volume> (<year>2018</year>): <fpage>55</fpage>&#8211;<lpage>72</lpage></mixed-citation></ref>
<ref id="B2"><mixed-citation publication-type="journal"><string-name><surname>Barker</surname>, <given-names>Stephen J</given-names></string-name> <article-title>&#8220;Is Value Content a Component of Conventional Implicature?&#8221;</article-title> <source>Analysis</source> <volume>60</volume>/<issue>3</issue> (<year>2000</year>): <fpage>268</fpage>&#8211;<lpage>279</lpage></mixed-citation></ref>
<ref id="B3"><mixed-citation publication-type="journal"><string-name><surname>Beaver</surname>, <given-names>David I.</given-names></string-name>, <string-name><given-names>Bart</given-names> <surname>Geurts</surname></string-name> and <string-name><given-names>Kristie</given-names> <surname>Denlinger</surname></string-name> <article-title>&#8220;Presupposition&#8221;</article-title> in <string-name><given-names>Edward N.</given-names> <surname>Zalta</surname></string-name> (ed.), <source>The Stanford Encyclopedia of Philosophy</source> <season>Spring</season> <year>2021</year> edition. 2021</mixed-citation></ref>
<ref id="B4"><mixed-citation publication-type="book"><string-name><surname>Blackburn</surname>, <given-names>Simon</given-names></string-name> <source>Essays in Quasi-Realism</source>. <publisher-loc>Oxford</publisher-loc>: <publisher-name>Oxford University Press</publisher-name>, <year>1993</year></mixed-citation></ref>
<ref id="B5"><mixed-citation publication-type="book"><string-name><surname>Cariani</surname>, <given-names>Fabrizio</given-names></string-name> <source>The Modal Future: A Theory of Future-Directed Thought and Talk</source>. <publisher-loc>Cambridge</publisher-loc>: <publisher-name>Cambridge University Press</publisher-name>, <year>2021</year></mixed-citation></ref>
<ref id="B6"><mixed-citation publication-type="journal"><string-name><surname>Clapp</surname>, <given-names>Lenny</given-names></string-name> <article-title>&#8220;A Non-Alethic Approach to Faultless Disagreement&#8221;</article-title> <source>Dialectica</source> <volume>69</volume>/<issue>4</issue> (<year>2015</year>): <fpage>517</fpage>&#8211;<lpage>550</lpage></mixed-citation></ref>
<ref id="B7"><mixed-citation publication-type="journal"><string-name><surname>Copp</surname>, <given-names>David</given-names></string-name> <article-title>&#8220;Realist-Expressivism: A Neglected Option for Moral Realism&#8221;</article-title> <source>Social Philosophy and Policy</source> <volume>18</volume>/<issue>2</issue> (<year>2001</year>): <fpage>1</fpage>&#8211;<lpage>43</lpage></mixed-citation></ref>
<ref id="B8"><mixed-citation publication-type="journal"><string-name><surname>Dinges</surname>, <given-names>Alexander</given-names></string-name> and <string-name><given-names>Julia</given-names> <surname>Zakkou</surname></string-name> <article-title>&#8220;Taste, Traits, and Tendencies&#8221;</article-title> <source>Philosophical Studies</source> <volume>178</volume> (<year>2021</year>): <fpage>1183</fpage>&#8211;<lpage>1206</lpage></mixed-citation></ref>
<ref id="B9"><mixed-citation publication-type="book"><string-name><surname>Egan</surname>, <given-names>Andy</given-names></string-name> <chapter-title>&#8220;Disputing about Taste&#8221;</chapter-title> in <string-name><given-names>Ted</given-names> <surname>Warfield</surname></string-name> and <string-name><given-names>Richard</given-names> <surname>Feldman</surname></string-name> (eds.), <source>Disagreement</source>. <publisher-loc>Oxford</publisher-loc>: <publisher-name>Oxford University Press</publisher-name>, <year>2010</year></mixed-citation></ref>
<ref id="B10"><mixed-citation publication-type="journal"><string-name><surname>Finlay</surname>, <given-names>Stephen</given-names></string-name> <article-title>&#8220;Value and Implicature&#8221;</article-title> <source>Philosophers&#8217; Imprint</source> <volume>5</volume>/<issue>4</issue> (<year>2005</year>): <fpage>1</fpage>&#8211;<lpage>20</lpage></mixed-citation></ref>
<ref id="B11"><mixed-citation publication-type="journal"><string-name><surname>Franz&#233;</surname>, <given-names>Nilsn</given-names></string-name> <article-title>&#8220;Aesthetic Evaluation and First-Hand Experience&#8221;</article-title> <source>Australasian Journal of Philosophy</source> <volume>96</volume>/<issue>4</issue> (<year>2018</year>): <fpage>669</fpage>&#8211;<lpage>682</lpage></mixed-citation></ref>
<ref id="B12"><mixed-citation publication-type="book"><string-name><surname>Gazdar</surname>, <given-names>Gerald</given-names></string-name> <source>Pragmatics: Implicature, Presupposition, and Logical Form</source>. <publisher-loc>London</publisher-loc>: <publisher-name>Academic Press</publisher-name>, <year>1979</year></mixed-citation></ref>
<ref id="B13"><mixed-citation publication-type="journal"><string-name><surname>Geach</surname>, <given-names>Peter T</given-names></string-name> <article-title>&#8220;Assertion&#8221;</article-title> <source>The Philosophical Review</source> <volume>74</volume>/<issue>4</issue> (<year>1965</year>): <fpage>449</fpage>&#8211;<lpage>465</lpage></mixed-citation></ref>
<ref id="B14"><mixed-citation publication-type="thesis"><string-name><surname>George</surname>, <given-names>B.R.</given-names></string-name> <source>Presupposition Repairs: A Static, Trivalent Approach to Predicting Projection</source>. M. A. thesis <publisher-name>UCLA</publisher-name> <year>2008</year></mixed-citation></ref>
<ref id="B15"><mixed-citation publication-type="book"><string-name><surname>Gibbard</surname>, <given-names>Allan</given-names></string-name> <source>Wise Choices, Apt Feelings: A Theory of Normative Judgment</source>. <publisher-loc>Cambridge, MA</publisher-loc>: <publisher-name>Harvard University Press</publisher-name>, <year>1990</year></mixed-citation></ref>
<ref id="B16"><mixed-citation publication-type="book"><string-name><surname>Gibbard</surname>, <given-names>Allan</given-names></string-name> <source>Thinking How to Live</source>. <publisher-loc>Cambridge, MA</publisher-loc>: <publisher-name>Harvard University Press</publisher-name>, <year>2008</year></mixed-citation></ref>
<ref id="B17"><mixed-citation publication-type="book"><string-name><surname>Grice</surname>, <given-names>H. P.</given-names></string-name> <source>Studies in the Way of Words</source>. <publisher-loc>Cambridge, MA</publisher-loc>: <publisher-name>Harvard University Press</publisher-name>, <year>1989</year></mixed-citation></ref>
<ref id="B18"><mixed-citation publication-type="book"><string-name><surname>Kant</surname>, <given-names>Immanuel</given-names></string-name> <source>Critique of the Power of Judgment</source>. <publisher-loc>Cambridge</publisher-loc>: <publisher-name>Cambridge University Press</publisher-name>, <year>1790/2000</year></mixed-citation></ref>
<ref id="B19"><mixed-citation publication-type="book"><string-name><surname>Kaplan</surname>, <given-names>David</given-names></string-name> <chapter-title>&#8220;Demonstratives&#8221;</chapter-title> in <string-name><given-names>Joseph</given-names> <surname>Almog</surname></string-name>, <string-name><given-names>John</given-names> <surname>Perry</surname></string-name>, and <string-name><given-names>Howard</given-names> <surname>Wettstein</surname></string-name> (eds.), <source>Themes from Kaplan</source>. <publisher-loc>New York</publisher-loc>: <publisher-name>Oxford University Press</publisher-name>, <year>1989</year>: <fpage>481</fpage>&#8211;<lpage>563</lpage></mixed-citation></ref>
<ref id="B20"><mixed-citation publication-type="journal"><string-name><surname>Klecha</surname>, <given-names>Peter</given-names></string-name> <article-title>&#8220;Diagnosing Modality in Predictive Expressions&#8221;</article-title> <source>Journal of Semantics</source> <volume>31</volume>/<issue>3</issue> (<year>2014</year>): <fpage>443</fpage>&#8211;<lpage>455</lpage></mixed-citation></ref>
<ref id="B21"><mixed-citation publication-type="journal"><string-name><surname>Lasersohn</surname>, <given-names>Peter</given-names></string-name> <article-title>&#8220;Context Dependence, Disagreement, and Predicates of Personal Taste&#8221;</article-title> <source>Linguistics and Philosophy</source> <volume>28</volume>/<issue>6</issue> (<year>2005</year>): <fpage>643</fpage>&#8211;<lpage>686</lpage></mixed-citation></ref>
<ref id="B22"><mixed-citation publication-type="book"><string-name><surname>MacFarlane</surname>, <given-names>John</given-names></string-name> <source>Assessment-Sensitivity: Relative Truth and its Applications</source>. <publisher-loc>Oxford</publisher-loc>: <publisher-name>Oxford University Press</publisher-name>, <year>2014</year></mixed-citation></ref>
<ref id="B23"><mixed-citation publication-type="journal"><string-name><surname>Marques</surname>, <given-names>Teresa</given-names></string-name> <article-title>&#8220;Aesthetic Predicates: A Hybrid Dispositional Account&#8221;</article-title> <source>Inquiry</source> <volume>59</volume>/<issue>6</issue> (<year>2016</year>): <fpage>723</fpage>&#8211;<lpage>751</lpage></mixed-citation></ref>
<ref id="B24"><mixed-citation publication-type="book"><string-name><surname>Mothersill</surname>, <given-names>Mary</given-names></string-name> <source>Beauty Restored</source>. <publisher-loc>Oxford</publisher-loc>: <publisher-name>Oxford University Press</publisher-name>, <year>1984</year></mixed-citation></ref>
<ref id="B25"><mixed-citation publication-type="thesis"><string-name><surname>Mu&#241;</surname>, <given-names>Patrickoz</given-names></string-name> <source>On Tongues: The Grammar of Experiential Evaluation</source>. Ph. D. diss. <publisher-name>University of Chicago 2019</publisher-name></mixed-citation></ref>
<ref id="B26"><mixed-citation publication-type="journal"><string-name><surname>Ninan</surname>, <given-names>Dilip</given-names></string-name> <article-title>&#8220;Semantics and the Objects of Assertion&#8221;</article-title> <source>Linguistics and Philosophy</source> <volume>33</volume>/<issue>5</issue> (<year>2010</year>): <fpage>355</fpage>&#8211;<lpage>380</lpage></mixed-citation></ref>
<ref id="B27"><mixed-citation publication-type="journal"><string-name><surname>Ninan</surname>, <given-names>Dilip</given-names></string-name> <article-title>&#8220;Taste Predicates and the Acquaintance Inference&#8221;</article-title> <source>Semantics and Linguistic Theory</source> <volume>24</volume> (<year>2014</year>): <fpage>290</fpage>&#8211;<lpage>309</lpage></mixed-citation></ref>
<ref id="B28"><mixed-citation publication-type="journal"><string-name><surname>Ninan</surname>, <given-names>Dilip</given-names></string-name> <article-title>&#8220;The Projection Problem for Predicates of Taste&#8221;</article-title> <source>Semantics and Linguistic Theory</source> <volume>30</volume> (<year>2020</year>): <fpage>753</fpage>&#8211;<lpage>788</lpage></mixed-citation></ref>
<ref id="B29"><mixed-citation publication-type="journal"><string-name><surname>Pearson</surname>, <given-names>Hazel</given-names></string-name> <article-title>&#8220;A Judge-Free Semantics for Predicates of Personal Taste&#8221;</article-title> <source>Journal of Semantics</source> <volume>30</volume>/<issue>3</issue> (<year>2013</year>): <fpage>103</fpage>&#8211;<lpage>154</lpage></mixed-citation></ref>
<ref id="B30"><mixed-citation publication-type="journal"><string-name><surname>P&#233;</surname>, <given-names>Alejandrorez Carballo</given-names></string-name> <article-title>&#8220;Negation, Expressivism, and Intentionality&#8221;</article-title> <source>The Philosophical Quarterly</source> <volume>70/279</volume> (<year>2020</year>): <fpage>246</fpage>&#8211;<lpage>267</lpage></mixed-citation></ref>
<ref id="B31"><mixed-citation publication-type="journal"><string-name><surname>Peters</surname>, <given-names>Stanley</given-names></string-name> <article-title>&#8220;A Truth-Conditional Formulation of Karttunen&#8217;s Account of Presupposition&#8221;</article-title> <source>Synthese</source> <volume>40</volume>/<issue>2</issue> (<year>1979</year>): <fpage>301</fpage>&#8211;<lpage>316</lpage></mixed-citation></ref>
<ref id="B32"><mixed-citation publication-type="journal"><string-name><surname>Robson</surname>, <given-names>Jon</given-names></string-name> <article-title>&#8220;Aesthetic Testimony&#8221;</article-title> <source>Philosophy Compass</source> <volume>7</volume>/<issue>1</issue> (<year>2012</year>): <fpage>1</fpage>&#8211;<lpage>10</lpage></mixed-citation></ref>
<ref id="B33"><mixed-citation publication-type="journal"><string-name><surname>Rudolph</surname>, <given-names>Rachel Etta</given-names></string-name> <article-title>&#8220;Acquaintance and Evidence in Appearance Language&#8221;</article-title> <source>Linguistics and Philosophy</source> <volume>46</volume> (<year>2023</year>): <fpage>1</fpage>&#8211;<lpage>29</lpage></mixed-citation></ref>
<ref id="B34"><mixed-citation publication-type="book"><string-name><surname>Schaffer</surname>, <given-names>Jonathan</given-names></string-name> <chapter-title>&#8220;Perspective in Taste Predicates and Epistemic Modals&#8221;</chapter-title> in <string-name><given-names>Andy</given-names> <surname>Egan</surname></string-name> and <string-name><given-names>Brian</given-names> <surname>Weatherson</surname></string-name> (eds.), <source>Epistemic Modality</source>. <publisher-loc>Oxford</publisher-loc>: <publisher-name>Oxford University Press</publisher-name>, <year>2011</year>: <fpage>179</fpage>&#8211;<lpage>226</lpage></mixed-citation></ref>
<ref id="B35"><mixed-citation publication-type="book"><string-name><surname>Schroeder</surname>, <given-names>Mark</given-names></string-name> <source>Being For</source>. <publisher-loc>New York</publisher-loc>: <publisher-name>Oxford University Press</publisher-name>, <year>2008</year></mixed-citation></ref>
<ref id="B36"><mixed-citation publication-type="journal"><string-name><surname>Schroeder</surname>, <given-names>Mark</given-names></string-name> <article-title>&#8220;Hybrid Expressivism: Virtues and Vices&#8221;</article-title> <source>Ethics</source> <volume>119</volume>/<issue>2</issue> (<year>2009</year>): <fpage>257</fpage>&#8211;<lpage>309</lpage></mixed-citation></ref>
<ref id="B37"><mixed-citation publication-type="book"><string-name><surname>Scruton</surname>, <given-names>Roger</given-names></string-name> <source>Art and Imagination: A Study in the Philosophy of Mind</source>. <publisher-loc>London</publisher-loc>: <publisher-name>Methuen</publisher-name>, <year>1974</year></mixed-citation></ref>
<ref id="B38"><mixed-citation publication-type="book"><string-name><surname>Stalnaker</surname>, <given-names>Robert</given-names></string-name> <chapter-title>&#8220;Assertion&#8221;</chapter-title> in <string-name><given-names>P.</given-names> <surname>Cole</surname></string-name> (ed.), <source>Syntax and Semantics 9: Pragmatics</source>. <publisher-loc>New York</publisher-loc>: <publisher-name>Academic Press</publisher-name>, <year>1978</year>: <fpage>315</fpage>&#8211;<lpage>332</lpage></mixed-citation></ref>
<ref id="B39"><mixed-citation publication-type="journal"><string-name><surname>Stalnaker</surname>, <given-names>Robert</given-names></string-name> <article-title>&#8220;Common Ground&#8221;</article-title> <source>Linguistics And Philosophy</source> <volume>25</volume>/<issue>5-6</issue> (<year>2002</year>): <fpage>701</fpage>&#8211;<lpage>721</lpage></mixed-citation></ref>
<ref id="B40"><mixed-citation publication-type="thesis"><string-name><surname>Stephenson</surname>, <given-names>Tamina</given-names></string-name> <source>Towards a Theory of Subjective Meaning</source>. Ph. D. diss. <publisher-name>MIT</publisher-name> <year>2007</year></mixed-citation></ref>
<ref id="B41"><mixed-citation publication-type="journal"><string-name><surname>von Fintel</surname>, <given-names>Kai</given-names></string-name> and <string-name><given-names>Anthony</given-names> <surname>Gillies</surname></string-name> <article-title>&#8220;Must&#8230; Stay&#8230; Strong!&#8221;</article-title> <source>Natural Language Semantics</source> <volume>18</volume>/<issue>4</issue> (<year>2010</year>): <fpage>351</fpage>&#8211;<lpage>383</lpage></mixed-citation></ref>
<ref id="B42"><mixed-citation publication-type="journal"><string-name><surname>Willer</surname>, <given-names>Malte</given-names></string-name> <article-title>&#8220;Advice for Noncognitivists&#8221;</article-title> <source>Pacific Philosophical Quarterly</source> <volume>98</volume> (<year>2017</year>): <fpage>174</fpage>&#8211;<lpage>207</lpage></mixed-citation></ref>
<ref id="B43"><mixed-citation publication-type="journal"><string-name><surname>Willer</surname>, <given-names>Malte</given-names></string-name> and <string-name><given-names>Chris</given-names> <surname>Kenn</surname></string-name> edy <article-title>&#8220;Assertion, Expression, Experience&#8221;</article-title> <source>Inquiry</source> <volume>65</volume>/<issue>7</issue> (<year>2022</year>)</mixed-citation></ref>
<ref id="B44"><mixed-citation publication-type="journal"><string-name><surname>Williamson</surname>, <given-names>Timothy</given-names></string-name> <article-title>&#8220;Knowing and Asserting&#8221;</article-title> <source>Philosophical Review</source> <volume>105</volume>/<issue>4</issue> (<year>1996</year>): <fpage>489</fpage>&#8211;<lpage>523</lpage></mixed-citation></ref>
<ref id="B45"><mixed-citation publication-type="book"><string-name><surname>Winter</surname>, <given-names>Yoad</given-names></string-name> <source>Elements of Formal Semantics: An Introduction to the Mathematical Theory of Meaning in Natural Language</source>. <publisher-loc>Edinburgh</publisher-loc>: <publisher-name>Edinburgh University Press</publisher-name>, <year>2016</year></mixed-citation></ref>
<ref id="B46"><mixed-citation publication-type="book"><string-name><surname>Wollheim</surname>, <given-names>Richard</given-names></string-name> <source>Art and Its Objects</source>. <publisher-loc>Cambridge</publisher-loc>: <publisher-name>Cambridge University Press</publisher-name>, <year>1980</year></mixed-citation></ref>
<ref id="B47"><mixed-citation publication-type="book"><string-name><surname>Yalcin</surname>, <given-names>Seth</given-names></string-name> <chapter-title>&#8220;Nonfactualism About Epistemic Modality&#8221;</chapter-title> in <string-name><given-names>Andy</given-names> <surname>Egan</surname></string-name> and <string-name><given-names>Brian</given-names> <surname>Weatherson</surname></string-name> (eds.), <source>Epistemic Modality</source>. <publisher-loc>Oxford</publisher-loc>: <publisher-name>Oxford University Press</publisher-name>, <year>2011</year>: <fpage>295</fpage>&#8211;<lpage>332</lpage></mixed-citation></ref>
<ref id="B48"><mixed-citation publication-type="journal"><string-name><surname>Yalcin</surname>, <given-names>Seth</given-names></string-name> <article-title>&#8220;Bayesian Expressivism&#8221;</article-title> <source>Proceedings of the Aristotelian Society</source> <volume>112</volume>/<issue>2</issue> (<year>2012</year>): <fpage>123</fpage>&#8211;<lpage>160</lpage></mixed-citation></ref>
<ref id="B49"><mixed-citation publication-type="book"><string-name><surname>Yalcin</surname>, <given-names>Seth</given-names></string-name> <chapter-title>&#8220;Expressivism by Force&#8221;</chapter-title> in <string-name><given-names>Daniel</given-names> <surname>Fogal</surname></string-name>, <string-name><given-names>Daniel</given-names> <surname>Harris</surname></string-name>, and <string-name><given-names>Matt</given-names> <surname>Moss</surname></string-name> (eds.), <source>New Work on Speech Acts</source>. <publisher-name>Oxford University Press</publisher-name> <publisher-loc>Oxford</publisher-loc>, <year>2018</year>: <fpage>400</fpage>&#8211;<lpage>426</lpage></mixed-citation></ref>
</ref-list>
</back>
</article>