<?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.4085</article-id>
<article-categories>
<subj-group>
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Generic Excluded Middle</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname>Kirkpatrick</surname>
<given-names>James Ravi</given-names>
</name>
<email>jameskirkpatrick91@gmail.com</email>
<xref ref-type="aff" rid="aff-1">1</xref>
</contrib>
</contrib-group>
<aff id="aff-1"><label>1</label>University of Oxford and Magdalen College, Oxford</aff>
<pub-date publication-format="electronic" date-type="pub" iso-8601-date="2025-07-25">
<day>25</day>
<month>07</month>
<year>2025</year>
</pub-date>
<pub-date pub-type="collection">
<year>2025</year>
</pub-date>
<volume>25</volume>
<elocation-id>9</elocation-id>
<history>
<date date-type="received" iso-8601-date="2023-03-21">
<day>21</day>
<month>03</month>
<year>2023</year>
</date>
<date date-type="accepted" iso-8601-date="2023-10-25">
<day>25</day>
<month>10</month>
<year>2023</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2025 James Ravi Kirkpatrick</copyright-statement>
<copyright-year>2025</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.4085/"/>
<abstract>
<p>There is a standard quantificational view of generic sentences according to which they have a tripartite logical form involving a phonologically null generic operator called &#8216;Gen&#8217;. Recently, a number of theorists have questioned the standard view and revived a competing proposal according to which generics involve the predication of properties to kinds. This paper offers a novel argument against the kind-predication approach on the basis of the invalidity of Generic Excluded Middle, a principle according to which any sentence of the form &#8988;Either Fs are G or Fs are not G&#8989; is true. I argue that the kind-predication approach erroneously predicts that GEM is valid, and that it can only avoid this conclusion by either collapsing into a form of the quantificational analysis or otherwise garnering unpalatable metaphysical commitments. I also show that, while the quantificational approach does not validate GEM as a matter of logical form, the principle may be validated on certain semantic analyses of the generic operator, and so, such theories should be rejected.</p>
</abstract>
<kwd-group>
<kwd>generics</kwd>
<kwd>characterising sentences</kwd>
<kwd>kind predication</kwd>
<kwd>generic excluded middle</kwd>
<kwd>homogeneity</kwd>
<kwd>property inheritance</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec>
<title>1. Introduction</title>
<p>There is a standard view of characterising sentences (or <italic>generics</italic>, for short), such as those in (1), according to which their logical form is essentially quantificational.<xref ref-type="fn" rid="n1">1</xref><sup>,</sup><xref ref-type="fn" rid="n2">2</xref></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>a.</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>Ravens are black.</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>A duck lays eggs.</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>The tiger has stripes.</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>d.</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>This kind of animal has a mane. [Uttered while pointing at a lion.]</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>It is well-known that such sentences manage to express generic generalisations about groups of particular events, facts, or individuals without the presence of an overt or articulated quantifier or operator appearing to be responsible for expressing this content. For example, (1a) expresses a generalisation about ravens similar, say, to that which is expressed by <italic>Ravens are generally black</italic>, even though it does not contain an explicit quantificational adverb, like <italic>generally</italic>. And the lack of a dedicated, phonologically articulated generic operator is no quirk of English either: no known language has such a generic operator (cf. <xref ref-type="bibr" rid="B35">Krifka et al., 1995</xref>; <xref ref-type="bibr" rid="B19">Dayal, 1999</xref>).</p>
<p>Nevertheless, proponents of the standard quantificational view argue that, despite appearances, generics are essentially quantificational. That is, despite the lack of any overt or pronounced elements that are responsible for their general content, generics have a tripartite logical form involving a quantifier, a restrictor clause, and a matrix clause, akin to explicitly quantificational sentences like <italic>Ravens are generally black</italic>. To bridge the theoretical gap between generics and sentences containing overt quantifiers, theorists posit a covert, unpronounced generic operator, which they call &#8216;Gen&#8217;, and they argue it is responsible for the general content of generics. While theorists disagree about how to semantically analyse <italic>Gen</italic>, most theorists agree that <italic>Gen</italic> is covertly present in the logical form of generics.</p>
<p>However, a number of theorists have recently argued against the standard approach and revived a competing proposal (<xref ref-type="bibr" rid="B42">Liebesman, 2011</xref>; <xref ref-type="bibr" rid="B43">Liebesman and Magidor, 2017</xref>, <xref ref-type="bibr" rid="B44">2025</xref>; <xref ref-type="bibr" rid="B54">Teichman, 2023</xref>).<xref ref-type="fn" rid="n3">3</xref> According to this proposal, generics are akin to sentences which genuinely express kind-level predications, such as those in (2), and do not involve quantification or covert material in their logical form.</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(2)</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>Dodos are extinct.</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>Potatoes were cultivated in South America.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>These theorists argue that, not only does the kind-predication view provide a unified semantic analysis for characterising sentences and genuinely kind-predicational sentences like those in (2), it better explains complex copredications, like <italic>Mosquitoes are widespread and irritating</italic>, as well as the fact that no known language has a dedicated, phonologically articulated generic operator. Consequently, this view has received a lot of attention and its challenge must be taken seriously by proponents of the standard view.</p>
<p>Determining whether the kind-predication approach or the quantificational approach is correct is a delicate task. In this paper, I will attempt to adjudicate between these theories by considering the following principle concerning generics:</p>
<disp-quote>
<p><bold>Generic Excluded Middle (GEM):</bold> For any bare plural characterising sentence of the schematic form <inline-formula><mml:math id="Eq001"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Fs are G</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula>, the sentence <inline-formula><mml:math id="Eq002"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Either Fs are G or Fs are not G</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula> is true.</p>
</disp-quote>
<p>Investigating whether GEM is valid is a useful tool for evaluating theories of generics more generally, since it provides a simple, yet overlooked, test for whether a theory of generics is empirically adequate. For if GEM is invalid, it follows that any semantic analysis that validates GEM is empirically inadequate. Conversely, if GEM is valid, any semantic analysis that invalidates GEM is empirically inadequate.</p>
<p>In this paper, I will argue that GEM is invalid and I will present a novel argument against the kind-predication approach on the grounds that it erroneously predicts that GEM is valid. Ultimately, I think that the kind-predication approach can avoid validating GEM, but only by either endorsing quantificational structure or committing itself to unpalatable metaphysical consequences. Conversely, I will also argue in favour of the standard quantificational approach to generics on the grounds that it has the resources to predict the invalidity of GEM, although this is by no means guaranteed. In particular, I show that certain semantic analyses of the generic operator <italic>Gen</italic> have the unfortunate consequence of entailing GEM, and so, they should be rejected.</p>
<p>The paper is structured as follows. Section 2 outlines the logical forms that the kind-predication and quantificational approaches posit for generic sentences. Section 3 introduces Generic Excluded Middle and argues that it is invalid. It then draws out some consequences of the invalidity of GEM for the two approaches. Section 4 argues that, to capture the invalidity of GEM, the kind-predication approach must either collapse into a form of the quantificational approach or else garner unpalatable metaphysical commitments. Section 5 considers what additional assumptions are needed for quantificational accounts of generics to validate GEM by considering a number of specific semantic analyses. Section 6 concludes.</p>
</sec>
<sec>
<title>2. Generics and Quantificational Structure</title>
<p>Let us begin by carefully distinguishing the logical forms that the quantificational approach and the kind-predication approach postulate for generics. According to the quantificational approach, the logical form of generic sentences is a tripartite quantificational structure consisting of a phonologically null quantifier called &#8216;Gen&#8217;. The generic operator <italic>Gen</italic> is usually analysed as an adverb of quantification in the style of Lewis (<xref ref-type="bibr" rid="B41">1975</xref>).<xref ref-type="fn" rid="n4">4</xref> More specifically, the <italic>Gen</italic> operator relates two open sentences called the restrictor clause and the matrix clause. The matrix clause makes the main assertion of the generic sentence, specifying the property attributed to the relevant members of the domain of quantification. The restrictor clause states the restricting cases relevant to the matrix. The <italic>Gen</italic> operator unselectively binds over any free variables in its scope, whether they be individuals, situations, worlds, or events. The variables it binds depends on the particular analysis in question. Consequently, the general logical form of generics will be given as in the following schema:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(3)</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="Eq003"><mml:mrow><mml:mrow><mml:mtext>Gen</mml:mtext><mml:mo lspace="0.500em">&#x2062;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mi mathvariant="normal">&#x2026;</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mtext mathvariant="bold">Restrictor</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mi mathvariant="normal">&#x2026;</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#x2203;</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mi mathvariant="normal">&#x2026;</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mtext mathvariant="bold">Matrix</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy='false'>}</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi mathvariant="normal">&#x2026;</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>}</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mi mathvariant="normal">&#x2026;</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>where <inline-formula><mml:math id="Eq004"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mi mathvariant="normal">&#x2026;</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> are the variables to be bound by <italic>Gen</italic>, <inline-formula><mml:math id="Eq005"><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mi mathvariant="normal">&#x2026;</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> are the variables to be bound existentially with scope just in the Matrix, <inline-formula><mml:math id="Eq006"><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x2026;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>m</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x2026;</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is a formula where <inline-formula><mml:math id="Eq007"><mml:msub><mml:mi>x</mml:mi><mml:mi>m</mml:mi></mml:msub></mml:math></inline-formula> occurs free, and <inline-formula><mml:math id="Eq008"><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x2026;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>m</mml:mi></mml:msub><mml:mo stretchy='false'>}</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x2026;</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is a formula where <inline-formula><mml:math id="Eq009"><mml:msub><mml:mi>x</mml:mi><mml:mi>m</mml:mi></mml:msub></mml:math></inline-formula> possibly occurs free. For perspicuity, I will sometimes write <inline-formula><mml:math id="Eq010"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Gen</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula> as shorthand, where &#8216;<inline-formula><mml:math id="Eq011"><mml:mi>&#x03D5;</mml:mi></mml:math></inline-formula>&#8217; and &#8216;<inline-formula><mml:math id="Eq012"><mml:mi>&#x03C8;</mml:mi></mml:math></inline-formula>&#8217; are the restrictor and matrix material respectively.</p>
<p>While we have not yet provided a semantic interpretation for the above notation, nor tied it directly to the syntax, this schema provides us with a useful means to represent various readings of characterising sentences. Indeed, a compelling piece of linguistic evidence in support of the quantificational analysis comes from Carlson&#8217;s observation that some sentences appear to have more than one generic interpretation (<xref ref-type="bibr" rid="B8">Carlson, 1989</xref>). For example, there are two salient generic interpretations of the sentence in (4), which may be represented as follows:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(4)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>Typhoons arise in this part of the Pacific.</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>Typhoons in general have a common origin in this part of the Pacific<inline-formula><mml:math id="Eq013"><mml:mrow><mml:mrow><mml:mtext>Gen</mml:mtext><mml:mo lspace="0.500em">&#x2062;</mml:mo><mml:mi>x</mml:mi></mml:mrow><mml:mo>;</mml:mo><mml:mrow><mml:mi>y</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mtext>typhoons</mml:mtext><mml:mo>&#x2062;</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 stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>y</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mtext>this.part.of.the.Pacific</mml:mtext><mml:mo>&#x2227;</mml:mo><mml:mrow><mml:mtext>arise.in</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula></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>There arise typhoons in this part of the Pacific <inline-formula><mml:math id="Eq014"><mml:mrow><mml:mtext>Gen</mml:mtext><mml:mo lspace="0.500em">&#x2062;</mml:mo><mml:mi>x</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>=</mml:mo><mml:mtext>this.part.of.the.Pacific</mml:mtext></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#x2203;</mml:mo><mml:mrow><mml:mi>y</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mrow><mml:mtext>typhoons</mml:mtext><mml:mo>&#x2062;</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>&#x2227;</mml:mo><mml:mrow><mml:mtext>arise.in</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>y</mml:mi><mml:mo>,</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>The ambiguity in (4) is evidence for the quantificational approach because quantified sentences often exhibit the same type of ambiguity. Moreover, the quantificational approach can accommodate the two readings of (4) by partitioning the surface material into the restrictor and matrix clauses in different ways. In (4a), the bare plural <italic>typhoons</italic> contributes material to the restrictor clause and the predicate <italic>arise in this part of the Pacific</italic> contributes material to the matrix clause; whereas in (4b), the demonstrative <italic>this part of the Pacific</italic> contributes material to the restrictor and the predicate <italic>arise in</italic> and the bare plural <italic>typhoons</italic> contributes material to the matrix.</p>
<p>What does the quantificational approach say about the semantics of <italic>Gen</italic>? Many semantic analyses have been proposed for the <italic>Gen</italic> operator, with proposals involving conditional probabilities (<xref ref-type="bibr" rid="B10">Cohen, 1996</xref>, <xref ref-type="bibr" rid="B11">1997</xref>, <xref ref-type="bibr" rid="B12">1999a</xref>), modal conditionals (<xref ref-type="bibr" rid="B2">Asher and Morreau, 1995</xref>; <xref ref-type="bibr" rid="B52">Pelletier and Asher, 1997</xref>; <xref ref-type="bibr" rid="B21">Eckardt, 2000</xref>; <xref ref-type="bibr" rid="B26">Greenberg, 2003</xref>, <xref ref-type="bibr" rid="B27">2007</xref>; <xref ref-type="bibr" rid="B3">Asher and Pelletier, 2013</xref>), default psychological generalisations (<xref ref-type="bibr" rid="B38">Leslie, 2007</xref>, <xref ref-type="bibr" rid="B39">2008</xref>), quantification over ways of being normal (<xref ref-type="bibr" rid="B49">Nickel, 2009</xref>, <xref ref-type="bibr" rid="B51">2016</xref>), and so on. Nevertheless, for the moment, we needn&#8217;t say anything more specific about the semantic analysis for <italic>Gen</italic>. What matters is that the logical form of characterising sentences is treated as quantificational. The only relevant factors are that (i) characterising sentences are assigned tripartite logical forms and (ii) <italic>Gen</italic> is treated as a quantifier of some sort.</p>
<p>Contrastingly, according to the kind-predication approach, the logical form of generic sentences is a simple dyadic subject&#8211;predicate structure, roughly equivalent to the logical form of atomic sentences that predicate properties of individuals. On this view, bare plurals refer to kinds and the sentence predicates a property of that kind. Consequently, characterising sentences of the schema (5a) receive the logical form (5b) as in:</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>Fs are G</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>G(F-kind)</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>Proponents of the kind-predication approach draw a strong analogy between sentences involving genuine reference to kinds like in (6a) and generic sentences like in (7a), arguing that they have essentially the same logical form:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(6)</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>Dinosaurs are extinct.</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>extinct(dinosaur-kind)</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(7)</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>Tigers have stripes.</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>striped(tiger-kind)</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>The kind-predication view is motivated by a number of considerations. First, proponents of the kind-predication approach claim that the lack of any phonological or orthographical realisation of <italic>Gen</italic> in any known language and its semantical intractability counts significantly against its existence (<xref ref-type="bibr" rid="B6">Carlson, 1977a</xref>; <xref ref-type="bibr" rid="B42">Liebesman, 2011</xref>). This is explained under the kind-predication approach, since it does not posit any such operator. Second, proponents of the kind-predication approach seek to provide a uniform treatment of sentences involving genuine reference to kinds and characterising sentences by generalising the treatment of the former to the latter. For example, given the subject term of (6a) refers to a kind, they claim that, by parity of reasoning, the subject term in (7a) must also refer to a kind. Third, and relatedly, they claim that only the kind-predication approach can explain the semantics of generics involving complex copredications, like <italic>Mosquitoes are widespread and irritating</italic>, which involve the co-occurrence of direct kind-predication and genericity (cf. <xref ref-type="bibr" rid="B6">Carlson, 1977a</xref>; <xref ref-type="bibr" rid="B42">Liebesman, 2011</xref>; <xref ref-type="bibr" rid="B43">Liebesman and Magidor, 2017</xref>, <xref ref-type="bibr" rid="B44">2025</xref>).<xref ref-type="fn" rid="n5">5</xref></p>
<p>What does the kind-predication approach say about the nature of kinds and how they can be predicated properties usually reserved for first-order individuals? What is the nature of tiger-kind and how can it have the property of being striped when such properties seem to be satisfied only by first-order individuals like tigers? Proponents of the kind-predication approach sometimes claim that kinds are whatever are the referents of bare plural nouns and that providing an account of kind-predication is in the remit of metaphysics, not semantics (<xref ref-type="bibr" rid="B42">Liebesman, 2011, 418</xref>). Indeed, for present purposes, it is irrelevant what is the nature of kinds and whether kind-level predications reduce to quantificational facts about individual members of the kind. What matters is that the logical form of characterising sentences is treated as non-quantificational. The only relevant factors are that (i) characterising sentences are assigned bipartite, subject&#8211;predicate logical forms, (ii) bare plurals denote kinds typed as (perhaps, higher-order) individuals, and (iii) the characterising sentences are true iff the relevant kinds have the properties in question.</p>
</sec>
<sec>
<title>3. Generic Excluded Middle</title>
<p>Having laid out the quantificational and kind-predication approaches to generics, let us now turn to Generic Excluded Middle, repeated below for convenience.</p>
<p><bold>Generic Excluded Middle (GEM):</bold> For any bare plural characterising sentence of the schematic form <inline-formula><mml:math id="Eq015"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Fs are G</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula>, the sentence <inline-formula><mml:math id="Eq016"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Either Fs are G or Fs are not G</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula> is true.</p>
<p>Before we examine whether GEM is valid, let us unpack its content. For discursive lucidity, let us distinguish between the <italic>opposite</italic> of a generic and its <italic>negation</italic>, where for any generic of the form <inline-formula><mml:math id="Eq017"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Fs are G</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula>, its opposite is <inline-formula><mml:math id="Eq018"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Fs are not G</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula> and its negation is <inline-formula><mml:math id="Eq019"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>It is not the case that Fs are G</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula>. Negated generics should be conceptually distinguished from their unnegated opposites, at least in principle, since narrow-scope negation may not necessarily be reducible to wide-scope negation. The idea behind GEM, then, is that, for any bare plural generic, either it or its opposite is true.</p>
<p>Unfortunately, despite any intuitive appeal that GEM might enjoy, the principle is subject to systematic counterexamples as witnessed by the following sentences:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(8)</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>Books are paperbacks or books are not paperbacks.</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>Fair coins land heads or fair coins do not land heads.</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>Lions are male or lions are not male.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>A counterexample to GEM is a disjunction constituted by a characterising sentence and its opposite, neither of which are true. Observe, then, that sentence (8a) is a counterexample to GEM: on their generic readings, the sentences &#8216;Books are paperbacks&#8217; and &#8216;Books aren&#8217;t paperbacks&#8217; aren&#8217;t true, even though it is true that books are either paperbacks or not paperbacks. Similar remarks apply for the other examples. On their generic readings, the sentences &#8216;Fair coins land heads&#8217;, &#8216;Fair coins don&#8217;t land heads&#8217;, &#8216;Lions are male&#8217;, and &#8216;Lions are not male&#8217; aren&#8217;t true, even though it is true that fair coins land either heads or tails and that lions are either male or not male. With sufficient ingenuity, such counterexamples multiply without limit. Therefore, GEM is invalid.<xref ref-type="fn" rid="n6">6</xref></p>
<p>I shall now offer an argument against the kind-predication approach to generics, an argument that also supports the quantificational approach. Let us first consider whether the kind-predication approach predicts the invalidity of GEM. To answer this question, GEM should be reformulated to highlight the bipartite logical structure that the kind-predication approach assigns to generics:</p>
<list list-type="simple">
<list-item><p><bold>Kind-Predication Generic Excluded Middle (K&#8211;GEM):</bold> For any generic sentence of the schematic form <inline-formula><mml:math id="Eq020"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Fs are G</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula>: <inline-formula><mml:math id="Eq021"><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>G(F-kind)</mml:mtext></mml:mrow><mml:mo>&#x2228;</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#x00AC;</mml:mo><mml:mrow><mml:mtext>G(F-kind)</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula> is true,</p></list-item>
</list>
<p>where &#8216;<inline-formula><mml:math id="Eq022"><mml:mo>&#x00AC;</mml:mo></mml:math></inline-formula>&#8217; and &#8216;<inline-formula><mml:math id="Eq023"><mml:mo>&#x2228;</mml:mo></mml:math></inline-formula>&#8217; are the usual truth-functional connectives. Observe that, in K&#8211;GEM, the negation in the second disjunct (<italic>Fs are not G</italic>) is given wide-scope because the kind-predication approach does not postulate enough structure to distinguish between the logical forms of negated generics and their unnegated opposite counterparts. In other words, both (9a) and (9b) receive (9c) as their logical form:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(9)</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="Eq024"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>It is not the case that Fs are G</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula></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="Eq025"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Fs are not G</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula></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><inline-formula><mml:math id="Eq026"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo lspace="0.167em">&#x2062;</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#x00AC;</mml:mo><mml:mrow><mml:mtext>G(F-kind)</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>This should not be surprising, since the kind-predication approach treats bare plurals as individual-denoting terms and sentences headed by individual-denoting terms generally treat sentential and predicate negation equivalently, as evidenced in (10):</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(10)</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 is not the case that John is happy.</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>John is not happy.</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><inline-formula><mml:math id="Eq027"><mml:mo>&#x00AC;</mml:mo></mml:math></inline-formula>happy(j)</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>An immediate upshot of the observation that the kind-predication approach does not distinguish between negated generics and their unnegated opposites is that, for the kind-predication approach, K&#8211;GEM is a special instance of the Law of Excluded Middle:</p>
<list list-type="simple">
<list-item><p><bold>Law of Excluded Middle (LEM):</bold> For any sentence <inline-formula><mml:math id="Eq028"><mml:mi>&#x03D5;</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math id="Eq029"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mo>&#x00A0;</mml:mo><mml:mtext>or</mml:mtext><mml:mo>&#x00A0;</mml:mo><mml:mo lspace="0.167em">&#x2062;</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#x00AC;</mml:mo><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula> is true.</p></list-item>
</list>
<p>In other words, the kind-predication approach and LEM jointly entail K&#8211;GEM. According to the kind-predication approach, bare plural DPs like <italic>tigers</italic> refer directly to kinds which are themselves modelled as special types of first-order individuals (<xref ref-type="bibr" rid="B42">Liebesman, 2011</xref>). Given that LEM says that every first-order individual either satisfies a given predicate or it does not, it follows from this first-order treatment of kinds that they either satisfy a given predicate or they do not. For example, just as the individual name <italic>Shere Khan</italic> either satisfies the predicate <italic>has stripes</italic> or it does not, so too does the bare plural <italic>tigers</italic> either satisfies the predicate <italic>has stripes</italic> or it does not. More generally, if a kind term F either satisfies a predicate G or it does not, then either <inline-formula><mml:math id="Eq030"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>G(F-kind)</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula> is true or <inline-formula><mml:math id="Eq031"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo lspace="0.167em">&#x2062;</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#x00AC;</mml:mo><mml:mrow><mml:mtext>G(F-kind)</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula> is true. Consequently, the kind-predication view, in conjunction with LEM, entails K&#8211;GEM and thus GEM.<xref ref-type="fn" rid="n7">7</xref></p>
<p>On the other hand, the quantificational approach does not entail GEM, at least not as a matter of logical form. To see this, we must first again reformulated GEM to highlight the relevant tripartite structure that the quantificational approach assigns as the logical form of generics:<xref ref-type="fn" rid="n8">8</xref></p>
<list list-type="simple">
<list-item><p><bold>Quantificational Generic Excluded Middle (Q&#8211;GEM):</bold> For any generic sentence of the schematic form <inline-formula><mml:math id="Eq032"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext mathvariant="italic">Fs are G</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula>: <inline-formula><mml:math id="Eq033"><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Gen</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x2228;</mml:mo><mml:mrow><mml:mtext>Gen</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#x00AC;</mml:mo><mml:mi>&#x03C8;</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:mrow></mml:math></inline-formula> is true.</p></list-item>
</list>
<p>An immediate consequence of this reformulation is that, unlike the kind-predication approach, the quantificational approach and LEM do not jointly entail GEM. After all, the quantificational approach postulates enough structure to distinguish between the logical forms of negated generics and their unnegated opposite counterparts:</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><inline-formula><mml:math id="Eq034"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>It is not the case that Fs are G</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula></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="Eq035"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo lspace="0.167em">&#x2062;</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#x00AC;</mml:mo><mml:mrow><mml:mtext>Gen</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(12)</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="Eq036"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Fs are not G</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula></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="Eq037"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Gen</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#x00AC;</mml:mo><mml:mi>&#x03C8;</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>Given that the quantificational approach can logically distinguish between these sentences, it does not follow that sentences of the form (11a) entail sentences of the form (12a), at least not as a matter of logical form. That is, for everything that we have said so far, neither <inline-formula><mml:math id="Eq038"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Gen</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula> nor <inline-formula><mml:math id="Eq039"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Gen</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#x00AC;</mml:mo><mml:mi>&#x03C8;</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula> may be true. So long as the semantics for <italic>Gen</italic> does not collapse the distinction between (11b) and (12b), there is no conflict with LEM. Consequently, the quantificational approach does not immediately entail GEM.</p>
<p>To summarise the discussion, the fact that the kind-predication approach entails GEM is significant evidence that the approach is incorrect. For given LEM, if the kind-predication approach is correct, then the disjunction &#8216;Books are paperbacks or books are not paperbacks&#8217; is true. But neither disjunct is true; neither &#8216;Books are paperbacks&#8217; nor &#8216;Books are not paperbacks&#8217; is true. Consequently, the original disjunction is not true, and so the kind-predication approach is incorrect. Furthermore, the fact that the quantificational approach does not immediately entail GEM is a significant advantage to its predictive power, since it avoids the unpalatable predication that sentences like those in (8) are true. Nevertheless, there may be specific semantic analyses of <italic>Gen</italic> that validate GEM. I shall examine such analyses in Section 5.</p>
<p>The question remains whether the kind-predication theorist has enough linguistic or metaphysical resources at her disposal to account for the invalidity of GEM. The following section will consider this question, arguing that either the kind-predication theorist must either embrace quantificational structure or else commit herself to some unpalatable metaphysical consequences.</p>
</sec>
<sec>
<title>4. Kind-Predication, Truth-Gaps, and Covert Material</title>
<p>In the previous section, I argued the simple kind-predication approach cannot account for the invalidity of GEM. However, the kind-predication theorist may respond to this argument either by (i) rejecting the Law of Excluded Middle, the principle upon which my argument relied, or by (ii) adopting additional covert material in the logical form of generics that allows them to distinguish between negated generics and their unnegated opposites. In this section, I shall consider and reject these responses.</p>
<sec>
<title>4.1 Kind-Predication and Metaphysics</title>
<p>It may be tempting to resist the above argument by rejecting LEM. After all, if LEM is invalid, then not every individual must either satisfy a property <inline-formula><mml:math id="Eq040"><mml:mi>G</mml:mi></mml:math></inline-formula> or not. Then there would be no reason to think every kind must either satisfy a given property or not. Consequently, rejecting LEM can reconcile the kind-predication approach with the invalidity of GEM. However rejecting LEM comes at a significant cost, namely, the rejection of standard classical logic. Given that classical logic and semantics are considered to be superior to its alternatives in terms of simplicity, power, and past success, it would be <italic>ad hoc</italic> to reject LEM to keep the kind-predication approach, at least without independent motivation.</p>
<p>There are at least two independently motivated strategies for rejecting LEM to which defenders of the kind-predication approach might appeal. First, one might argue that a generic is neither true nor false if the denotation of its subject term is undefined.<xref ref-type="fn" rid="n9">9</xref> Then, if the counterexamples to GEM contain undefined bare plural DPs, they would be neither true nor false. This would allow the kind-predication approach to reject LEM as cases of presuppositional failure or failure of reference, while accepting a localised version of LEM that holds for every <italic>defined</italic> sentence of the language.</p>
<p>Is there any independent reason to think that bare plurals in characterising sentences are sometimes undefined? Some theorists have pointed out that not just any nominal constituent can form a kind-referring definite DP (<xref ref-type="bibr" rid="B17">Dahl, 1975</xref>; <xref ref-type="bibr" rid="B7">Carlson, 1977b</xref>). For example, the contrast in the acceptability of the following pair of sentences has been traced back to the existence of a &#8220;well-established kind&#8221; for Coke bottles, but not for green bottles:<xref ref-type="fn" rid="n10">10</xref></p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(13)</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>&#160;&#160;The Coke bottle has a narrow neck.</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 green bottle has a narrow neck.<xref ref-type="fn" rid="n11">11</xref></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>If this point extends to bare plural DPs, then bare plural DPs that fail to refer to well-established kinds are undefined and sentences in which they are contained are neither true nor false. On this response, our truth-value judgements about counterexamples to GEM are mistaken. While we mistakenly judge the sentence &#8216;Fair coins land heads or fair coins do not land heads&#8217; to be false, it is actually truth-valueless, since <italic>fair coins</italic> fails to refer to a well-established kind. As a result, not every instance of GEM (and, by extension, LEM) is true: the principle holds only of those generics whose DPs refer to &#8220;well-established kinds&#8221;. Consequently, the kind-predication view does not entail GEM.</p>
<p>However, this strategy is inadequate for at least three reasons. First, the strategy will not work for all of the counterexamples to GEM. Some bare plural DPs in the counterexamples are not obvious candidates for reference failure, since it is highly plausible that they denote well-established kinds (if they denote kinds at all). For example, book-kind and lion-kind have as good a chance as any to satisfy &#8220;well-establishedness&#8221; in the intended sense. And we can truly assert generics involve the bare plurals <italic>books</italic> and <italic>lions</italic>, such as &#8216;Books play a quintessential role in every student&#8217;s life&#8217; and &#8216;Lions have manes&#8217;. Consequently, generics like &#8216;Books are paperback or books are not paperback&#8217; and &#8216;Lions are male or lions are not male&#8217; are still counterexamples to GEM.</p>
<p>Second, the strategy incorrectly predicts truth-value judgements about the counterexamples to GEM. The counterexamples to GEM and their individual disjuncts are typically judged as False, not the &#8216;squeamish&#8217; &#8220;I-don&#8217;t-know&#8221; or &#8216;Neither&#8217; commonly reported by LEM-deniers.<xref ref-type="fn" rid="n12">12</xref> Consequently, it is highly doubtful that the counterexamples to GEM involve the presupposition failure or failure of reference that usually motivates these strategies for rejecting LEM.</p>
<p>Third, and more generally, the strategy inaccurately predicts that bare plural DPs must refer to well-established kinds for the characterising sentences in which they are contained to be felicitous. But, while characterising sentences containing definite DPs that supposedly refer to non-well-established kinds are infelicitous, their bare plural counterparts sound fine (<xref ref-type="bibr" rid="B35">Krifka et al., 1995, 11&#8211;12</xref>):</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="final-sentence">
<list-item><p>#The green bottle has a narrow neck.</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>Green bottles have narrow necks.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>Since bare plural DPs do not pattern with their definite DPs counterparts, there is little reason to think they only refer to well-established kinds. Moreover, many generics, whose DPs are gerrymandered and do not refer to anything well-established, are judged true. For example, the sentence &#8216;Australian Tour de France winners are Australian&#8217; seems true, even though it is doubtful that Australian Tour de France winners is a well-established kind (cf. <xref ref-type="bibr" rid="B18">Dayal, 1992</xref>). Requiring that all generics involve &#8220;well-established&#8221; kinds limits our ability to explain why such generics are true. Given these reasons, the first strategy is inadequate for rejecting LEM.</p>
<p>Let us now turn to the second strategy for rejecting LEM. This strategy holds that the peculiarities of property inheritance allows for property gaps that, in turn, give rise to truth-value gaps. To see how this strategy works, recall that the kind-predication approach takes a kind to have an individual-level property just in case the kind inherits that property from its members. The idea, then, behind the second strategy is that kinds can fail to inherit certain properties (e.g., the property of being a G) from their members, while also failing to inherit the corresponding negative property (e.g., the property of not being a G). For example, one could argue that, even though fair coins are the kind of thing that can land heads, they do not instantiate this property to the extent that (or in a way in which) fair-coin-kind would inherit this property from its members. Similarly, even though fair coins are the kind of thing that might not land heads, they do not instantiate this property to the extent that (or in a way in which) fair-coin-kind would inherit the property of not landing heads from its members. If this is right, it seems plausible to say that it&#8217;s not true that fair-coin-kind lands heads and it&#8217;s not true that fair-coin-kind doesn&#8217;t land heads. Then, neither (8b) nor the sentence &#8216;Either fair-coin-kind lands heads or fair-coin-kind doesn&#8217;t land heads&#8217; is true.<xref ref-type="fn" rid="n13">13</xref> And similar remarks apply for lions and books. Consequently, proponents of this second strategy can explain why GEM isn&#8217;t valid in terms of the invalidity of LEM.</p>
<p>The problem with this strategy is it hinges on a rather opaque notion of property inheritance. To properly evaluate this approach, one would hope for a developed account of how kinds inherit properties from their members, one that also explains how property inheritance gives rise to the right kinds of property gaps. Unfortunately, proponents of the kind-predication view are generally sceptical that any useful general principles governing the property inheritance relation can be provided. For example, Liebesman writes:</p>
<disp-quote>
<p>Attempting to give a systematic account of the way in which material objects inherit properties from their parts is something of a fool&#8217;s errand. The quantity and salience of the parts that is required for inheritance varies greatly. [&#8230;] The relationship between kinds and their members is similarly unsystematic. Generics ascribe properties to kinds and, given the multiplicity of properties and the multiplicity of ways kinds inherit properties from their members, no fully general account of inheritance will be forthcoming. (<xref ref-type="bibr" rid="B42">Liebesman, 2011, 420</xref>)</p>
</disp-quote>
<p>The lack of any concrete theory of property inheritance makes it difficult to properly evaluate this proposal, especially since there are numerous ways that proponents of the kind-predication approach can develop their account of inheritance. Nevertheless, I want to raise two general concerns about this strategy.</p>
<p>First, it&#8217;s important just to appreciate how radical these kinds of property gaps are. According to this strategy, while fair-coin-kind doesn&#8217;t instantiate the property of landing heads, failing to instantiate that property is not enough for it not to be the case that fair-coin-kind lands heads. Furthermore, while fair-coin-kind doesn&#8217;t instantiate the property of <italic>not</italic> landing heads, this is not enough for it not to be the case that fair-coin-kind doesn&#8217;t land heads. But since every fair coin either lands heads or doesn&#8217;t land heads, proponents of the kind-predication approach are committed to claim that fair-coin-kind <italic>does</italic> inherit the disjunctive property of either landing heads or not landing heads. Consequently, advocates of this strategy should be happy to assert sentences like the following:</p>
<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>It is not the case that fair-coin-kind instantiates the property of landing heads, and it&#8217;s not the case that fair-coin-kind instantiates the property of not landing heads, but it is the case that fair-coin-kind either lands heads or doesn&#8217;t land heads.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>Offhand, at least, such sentences sound highly contradictory. Proponents of the kind-predication approach must explain away the contradictory-soundness of such sentences, but it&#8217;s not clear how they would do so.</p>
<p>The second problem arises because the property inheritance approach is committed to the idea that certain generics and their opposites express propositions neither of which are true or false, or, at the very least, that certain generics and their opposites express partial propositions, which can be understood as partial functions from worlds to truth-values.<xref ref-type="fn" rid="n14">14</xref> To make this idea precise, let us first distinguish between the positive extension for a generic sentence <inline-formula><mml:math id="Eq041"><mml:mi>S</mml:mi></mml:math></inline-formula> and its negative extension (call these <inline-formula><mml:math id="Eq042"><mml:msup><mml:mrow><mml:mo stretchy='false'>&#x27E6;</mml:mo><mml:mi>S</mml:mi><mml:mo stretchy='false'>&#x27E7;</mml:mo></mml:mrow><mml:mo>+</mml:mo></mml:msup></mml:math></inline-formula> and <inline-formula><mml:math id="Eq043"><mml:msup><mml:mrow><mml:mo stretchy='false'>&#x27E6;</mml:mo><mml:mi>S</mml:mi><mml:mo stretchy='false'>&#x27E7;</mml:mo></mml:mrow><mml:mo>&#x2013;</mml:mo></mml:msup></mml:math></inline-formula>, respectively) in such a way that failing to fall in a sentence&#8217;s positive extension is consistent with failing to fall in a sentence&#8217;s negative extension. Following Liebesman&#8217;s quantificational glosses on the truth-conditions of &#8216;Ravens are black&#8217;, for example, we can state its positive and negative extensions in terms of an equivalence with the semantic content of &#8216;Most ravens are black&#8217;, as follows:<xref ref-type="fn" rid="n15">15</xref></p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(16)</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="Eq044"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>&#x27E6;</mml:mo><mml:mtext>Ravens are black</mml:mtext><mml:mo stretchy='false'>&#x27E7;</mml:mo></mml:mrow><mml:mo>+</mml:mo></mml:msup><mml:msub><mml:mo>&#x2261;</mml:mo><mml:mrow><mml:mo stretchy='false'>&#x27E8;</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy='false'>&#x27E9;</mml:mo></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:mi>w</mml:mi><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mtext>most ravens are black in</mml:mtext><mml:mo>&#x00A0;</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>}</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula></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="Eq045"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>&#x27E6;</mml:mo><mml:mtext>Ravens are black</mml:mtext><mml:mo stretchy='false'>&#x27E7;</mml:mo></mml:mrow><mml:mo>&#x2013;</mml:mo></mml:msup><mml:msub><mml:mo>&#x2261;</mml:mo><mml:mrow><mml:mo stretchy='false'>&#x27E8;</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy='false'>&#x27E9;</mml:mo></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:mi>w</mml:mi><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mtext>most ravens aren&#x2019;t black in</mml:mtext><mml:mo>&#x00A0;</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>}</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>where, &#8216;<inline-formula><mml:math id="Eq046"><mml:msub><mml:mo>&#x2261;</mml:mo><mml:mrow><mml:mo stretchy='false'>&#x27E8;</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy='false'>&#x27E9;</mml:mo></mml:mrow></mml:msub></mml:math></inline-formula>&#8217; denotes a higher-order identity relation between propositions.<xref ref-type="fn" rid="n16">16</xref> It should be clear from these equivalences that the positive and negative extensions of &#8216;Ravens are black&#8217; aren&#8217;t jointly exhaustive, that is, <inline-formula><mml:math id="Eq047"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>&#x27E6;</mml:mo><mml:mtext>Ravens are black</mml:mtext><mml:mo stretchy='false'>&#x27E7;</mml:mo></mml:mrow><mml:mo>+</mml:mo></mml:msup><mml:mo>&#x222A;</mml:mo><mml:msup><mml:mrow><mml:mo stretchy='false'>&#x27E6;</mml:mo><mml:mtext>Ravens are black</mml:mtext><mml:mo stretchy='false'>&#x27E7;</mml:mo></mml:mrow><mml:mo>&#x2013;</mml:mo></mml:msup><mml:mo>&#x2260;</mml:mo><mml:mi>W</mml:mi></mml:mrow></mml:math></inline-formula>.</p>
<p>Next, let us specify the positive and negative extensions of the opposites of these generics analogously, as in (17).</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(17)</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="Eq048"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>&#x27E6;</mml:mo><mml:mtext>Ravens aren&#x2019;t black</mml:mtext><mml:mo stretchy='false'>&#x27E7;</mml:mo></mml:mrow><mml:mo>+</mml:mo></mml:msup><mml:msub><mml:mo>&#x2261;</mml:mo><mml:mrow><mml:mo stretchy='false'>&#x27E8;</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy='false'>&#x27E9;</mml:mo></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:mi>w</mml:mi><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mtext>most ravens aren&#x2019;t black in</mml:mtext><mml:mo>&#x00A0;</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>}</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula></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="Eq049"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>&#x27E6;</mml:mo><mml:mtext>Ravens aren&#x2019;t black</mml:mtext><mml:mo stretchy='false'>&#x27E7;</mml:mo></mml:mrow><mml:mo>&#x2013;</mml:mo></mml:msup><mml:msub><mml:mo>&#x2261;</mml:mo><mml:mrow><mml:mo stretchy='false'>&#x27E8;</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy='false'>&#x27E9;</mml:mo></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:mi>w</mml:mi><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mtext>most ravens are black in</mml:mtext><mml:mo>&#x00A0;</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>}</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>Again, it should be clear from these equivalences that, given that the kind-predication approach identifies the negation of a generic with its opposite, the positive and negative extensions of the negation of a generic will be equivalent to the positive and negative extensions of its opposite, which, in turn, will be equivalent to the negative and positive extensions of the unnegated generic, respectively, as in (18):</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(18)</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="Eq050"><mml:mtable columnspacing="0pt" rowspacing="0.0pt"><mml:mtr><mml:mtd columnalign="right"><mml:mrow><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>&#x27E6;</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#x00AC;</mml:mo><mml:mtext>(Ravens are black)</mml:mtext></mml:mrow><mml:mo stretchy='false'>&#x27E7;</mml:mo></mml:mrow><mml:mo>+</mml:mo></mml:msup></mml:mrow></mml:mtd><mml:mtd columnalign="left"><mml:mrow><mml:msub><mml:mo>&#x2261;</mml:mo><mml:mrow><mml:mo stretchy='false'>&#x27E8;</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy='false'>&#x27E9;</mml:mo></mml:mrow></mml:msub><mml:msup><mml:mrow><mml:mo stretchy='false'>&#x27E6;</mml:mo><mml:mtext>Ravens aren&#x2019;t black</mml:mtext><mml:mo stretchy='false'>&#x27E7;</mml:mo></mml:mrow><mml:mo>+</mml:mo></mml:msup></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd columnalign="left"><mml:mrow><mml:msub><mml:mo>&#x2261;</mml:mo><mml:mrow><mml:mo stretchy='false'>&#x27E8;</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy='false'>&#x27E9;</mml:mo></mml:mrow></mml:msub><mml:msup><mml:mrow><mml:mo stretchy='false'>&#x27E6;</mml:mo><mml:mtext>Ravens are black</mml:mtext><mml:mo stretchy='false'>&#x27E7;</mml:mo></mml:mrow><mml:mo>&#x2013;</mml:mo></mml:msup></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></inline-formula></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="Eq051"><mml:mtable columnspacing="0pt" rowspacing="0.0pt"><mml:mtr><mml:mtd columnalign="right"><mml:mrow><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>&#x27E6;</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#x00AC;</mml:mo><mml:mtext>(Ravens aren&#x2019;t black)</mml:mtext></mml:mrow><mml:mo stretchy='false'>&#x27E7;</mml:mo></mml:mrow><mml:mo>+</mml:mo></mml:msup></mml:mrow></mml:mtd><mml:mtd columnalign="left"><mml:mrow><mml:msub><mml:mo>&#x2261;</mml:mo><mml:mrow><mml:mo stretchy='false'>&#x27E8;</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy='false'>&#x27E9;</mml:mo></mml:mrow></mml:msub><mml:msup><mml:mrow><mml:mo stretchy='false'>&#x27E6;</mml:mo><mml:mtext>Ravens aren&#x2019;t black</mml:mtext><mml:mo stretchy='false'>&#x27E7;</mml:mo></mml:mrow><mml:mo>+</mml:mo></mml:msup></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd columnalign="left"><mml:mrow><mml:msub><mml:mo>&#x2261;</mml:mo><mml:mrow><mml:mo stretchy='false'>&#x27E8;</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy='false'>&#x27E9;</mml:mo></mml:mrow></mml:msub><mml:msup><mml:mrow><mml:mo stretchy='false'>&#x27E6;</mml:mo><mml:mtext>Ravens are black</mml:mtext><mml:mo stretchy='false'>&#x27E7;</mml:mo></mml:mrow><mml:mo>&#x2013;</mml:mo></mml:msup></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></inline-formula></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>Thus, this strategy effectively abandons the idea that generic sentences and their negation determine an extension and an anti-extension that are mutually exclusive and jointly exhaustive with respect to the universe of discourse in the occasion of use. Furthermore, this abandonment percolates down to how the semantics treats the extension and anti-extension of predicate terms. These are treated in a non-standard way, so that the property denoted by the anti-extension of a predicate term is not simply the complement of its extension.</p>
<p>The problem with this suggestion is that it is difficult to maintain this kind of semantics alongside other commitments held by the kind-predication approach, while also providing a systematic treatment of negation that respects our intuitive truth-value judgements about certain classes of generics. Consider, for example, Liebesman&#8217;s quantificational glosses for the truth-conditions for &#8216;Mosquitoes carry WNV&#8217; in (19) and its translation into the above notation in (20) (cf. <xref ref-type="bibr" rid="B42">Liebesman, 2011, 420&#8211;421</xref>):</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(19)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>Mosquitoes carry WNV <inline-formula><mml:math id="Eq052"><mml:mo stretchy='false'>&#x2194;</mml:mo></mml:math></inline-formula> Some mosquitoes carry the WNV</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(20)</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="Eq053"><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>&#x27E6;</mml:mo><mml:mtext>Mosquitoes carry WNV</mml:mtext><mml:mo stretchy='false'>&#x27E7;</mml:mo></mml:mrow><mml:mo>+</mml:mo></mml:msup><mml:msub><mml:mo>&#x2261;</mml:mo><mml:mrow><mml:mo stretchy='false'>&#x27E8;</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy='false'>&#x27E9;</mml:mo></mml:mrow></mml:msub><mml:msup><mml:mrow><mml:mo stretchy='false'>&#x27E6;</mml:mo><mml:mtext>Some mosquitoes carry the WNV</mml:mtext><mml:mo stretchy='false'>&#x27E7;</mml:mo></mml:mrow><mml:mo>+</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>Observe that the opposite, &#8216;Mosquitoes don&#8217;t carry WNV&#8217;, is intuitively false, but when we try to state its semantic content using the above notation and by applying the quantificational gloss from (19) in the natural way, we get the following equivalences:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(21)</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="Eq054"><mml:mtable columnspacing="0pt" rowspacing="0.0pt"><mml:mtr><mml:mtd/><mml:mtd columnalign="left"><mml:msup><mml:mrow><mml:mo stretchy='false'>&#x27E6;</mml:mo><mml:mtext>Mosquitoes don&#x2019;t carry WNV</mml:mtext><mml:mo stretchy='false'>&#x27E7;</mml:mo></mml:mrow><mml:mo>+</mml:mo></mml:msup></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd columnalign="left"><mml:mrow><mml:msub><mml:mo>&#x2261;</mml:mo><mml:mrow><mml:mo stretchy='false'>&#x27E8;</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy='false'>&#x27E9;</mml:mo></mml:mrow></mml:msub><mml:msup><mml:mrow><mml:mo stretchy='false'>&#x27E6;</mml:mo><mml:mtext>Mosquitoes carry WNV</mml:mtext><mml:mo stretchy='false'>&#x27E7;</mml:mo></mml:mrow><mml:mo>&#x2013;</mml:mo></mml:msup></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd columnalign="left"><mml:mrow><mml:msub><mml:mo>&#x2261;</mml:mo><mml:mrow><mml:mo stretchy='false'>&#x27E8;</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy='false'>&#x27E9;</mml:mo></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy='false'>{</mml:mo><mml:mi>w</mml:mi><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mrow><mml:mtext>some mosquitoes don&#x2019;t carry WNV in</mml:mtext><mml:mo>&#x00A0;</mml:mo><mml:mo>&#x2062;</mml:mo><mml:mi>w</mml:mi></mml:mrow><mml:mo stretchy='false'>}</mml:mo></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></inline-formula></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>These truth-conditions are clearly inadequate: the sentence &#8216;Mosquitoes don&#8217;t carry WNV&#8217; is intuitively false, even though the vast majority of mosquitoes aren&#8217;t WNV-carriers, but the above semantics predicts that it is true, since some mosquitoes don&#8217;t carry WNV.<xref ref-type="fn" rid="n17">17</xref></p>
<p>Alternatively, proponents of the kind-predication approach might make the <italic>ad hoc</italic> stipulation that the proposition expressed by &#8216;Mosquitoes don&#8217;t carry WNV&#8217; <italic>just is</italic> the complement of the proposition expressed by &#8216;Mosquitoes carry WNV&#8217;. That is, the following equivalences hold:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(22)</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="Eq055"><mml:mtable columnspacing="0pt" rowspacing="0.0pt"><mml:mtr><mml:mtd/><mml:mtd columnalign="left"><mml:msup><mml:mrow><mml:mo stretchy='false'>&#x27E6;</mml:mo><mml:mtext>Mosquitoes don&#x2019;t carry WNV</mml:mtext><mml:mo stretchy='false'>&#x27E7;</mml:mo></mml:mrow><mml:mo>+</mml:mo></mml:msup></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd columnalign="left"><mml:mrow><mml:msub><mml:mo>&#x2261;</mml:mo><mml:mrow><mml:mo stretchy='false'>&#x27E8;</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy='false'>&#x27E9;</mml:mo></mml:mrow></mml:msub><mml:mi>W</mml:mi><mml:mo>&#x2013;</mml:mo><mml:msup><mml:mrow><mml:mo stretchy='false'>&#x27E6;</mml:mo><mml:mtext>Mosquitoes carry WNV</mml:mtext><mml:mo stretchy='false'>&#x27E7;</mml:mo></mml:mrow><mml:mo>+</mml:mo></mml:msup></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd columnalign="left"><mml:mrow><mml:msub><mml:mo>&#x2261;</mml:mo><mml:mrow><mml:mo stretchy='false'>&#x27E8;</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy='false'>&#x27E9;</mml:mo></mml:mrow></mml:msub><mml:msup><mml:mrow><mml:mo stretchy='false'>&#x27E6;</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#x00AC;</mml:mo><mml:mtext>(Some mosquitoes carry WMV)</mml:mtext></mml:mrow><mml:mo stretchy='false'>&#x27E7;</mml:mo></mml:mrow><mml:mo>+</mml:mo></mml:msup></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></inline-formula></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>But, while this is empirically adequate, adopting this approach across the board threatens to collapse the distinction between positive and negative extensions that allow the kind-predication proponent to reject LEM in the first place. Furthermore, it requires negation to interact in generic sentences in an entirely unsystematic manner, taking different truth-conditional scope in different circumstances. The non-systematicity in the behaviour of negation would be a serious blow to the plausibility of this strategy.<xref ref-type="fn" rid="n18">18</xref></p>
<p>These brief remarks do not count decisively against the property inheritance approach. But I hope they serve to highlight some reasons to be cautious about adopting this approach.<xref ref-type="fn" rid="n19">19</xref> The only grounds for rejecting LEM comes from rejecting the equivalence between the failure to inherit the property of being G and inheriting the property of being not-G. But rejecting this equivalence leads both to property gaps and to truth-value gaps. Any appeal to this strategy in explaining the data around GEM requires further details about how property inheritance works. As things stand, the metaphysical costs of rejecting LEM are too high.</p>
</sec>
<sec>
<title>4.2 Kind-Predication and Linguistics</title>
<p>The other option is that the kind-predication theorist might appeal to additional covert structure in the logical form of generic sentences already encoded in the syntax of generics (<xref ref-type="bibr" rid="B7">Carlson, 1977b</xref>; <xref ref-type="bibr" rid="B9">Chierchia, 1998</xref>; <xref ref-type="bibr" rid="B54">Teichman, 2023</xref>). There are a number of ways of implementing this idea. Some theorists admit the existence of a <italic>monadic</italic> generic operator <italic>Gn</italic> that is part of the verbal aspect of generic sentences (<xref ref-type="bibr" rid="B9">Chierchia, 1998</xref>); others argue that a covert predicate modifier shifts episodic or stage-level predicates like <italic>smoke</italic> to kind-level predicates suitable for predication to kinds (<xref ref-type="bibr" rid="B54">Teichman, 2023</xref>); and some argue that a generic quantifier is introduced by some pragmatic process of reinterpretation (<xref ref-type="bibr" rid="B15">Cohen, 2013</xref>). Despite these differences, each of these proposal are committed to the claim that generic sentences end up being assigned a tripartite, quantificational logical form.</p>
<p>Let us see how this works in practice. Following Chierchia (<xref ref-type="bibr" rid="B9">1998</xref>), the logical form of the generic <italic>Dogs bark</italic> is as follows:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(23)</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-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="phimp-4085_kirkpatrick-g1.png"/></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="Eq056"><mml:mrow><mml:mtext>Gn</mml:mtext><mml:mo>&#x00A0;</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi><mml:mrow><mml:msup><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi/><mml:mo rspace="0em">&#x222A;</mml:mo><mml:mo lspace="0em">&#x2229;</mml:mo></mml:mrow></mml:msup><mml:mtext>dog</mml:mtext><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo>&#x2227;</mml:mo><mml:mi>C</mml:mi><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mtext>bark</mml:mtext><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>where <inline-formula><mml:math id="Eq057"><mml:mrow><mml:mrow><mml:mmultiscripts><mml:mtext>dog</mml:mtext><mml:mprescripts/><mml:mrow/><mml:mrow><mml:mi/><mml:mo rspace="0em">&#x222A;</mml:mo><mml:mo lspace="0em">&#x2229;</mml:mo></mml:mrow></mml:mmultiscripts><mml:mo>=</mml:mo><mml:mrow><mml:mi>&#x03BB;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>x</mml:mi></mml:mrow></mml:mrow><mml:mo lspace="0em" rspace="0.167em">.</mml:mo><mml:mrow><mml:mi>&#x03BB;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>s</mml:mi></mml:mrow><mml:mo lspace="0em" rspace="0.167em">.</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>o</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>g</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula>, the result of typeshifting from dog-kind to denotation of the predicate <italic>dog</italic>, and <inline-formula><mml:math id="Eq058"><mml:mi>C</mml:mi></mml:math></inline-formula> is a variable whose value is supplied by the context, restricting the domain of Gn to appropriate individuals and situations.<xref ref-type="fn" rid="n20">20</xref> Once these quantificational, tripartite logical forms are admitted, it is clear how the kind-predication theorist now has the descriptive power to distinguish negated generics from their unnegated opposites:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(24)</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-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="phimp-4085_kirkpatrick-g2.png"/></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="Eq060"><mml:mrow><mml:mo rspace="0.167em">&#x00AC;</mml:mo><mml:mtext>Gn</mml:mtext><mml:mo>&#x00A0;</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi><mml:mrow><mml:msup><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi/><mml:mo rspace="0em">&#x222A;</mml:mo><mml:mo lspace="0em">&#x2229;</mml:mo></mml:mrow></mml:msup><mml:mtext>dog</mml:mtext><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo>&#x2227;</mml:mo><mml:mi>C</mml:mi><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mtext>bark</mml:mtext><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(25)</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-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="phimp-4085_kirkpatrick-g3.png"/></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="Eq062"><mml:mrow><mml:mtext>Gn</mml:mtext><mml:mo>&#x00A0;</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi><mml:mrow><mml:msup><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mi/><mml:mo rspace="0em">&#x222A;</mml:mo><mml:mo lspace="0em">&#x2229;</mml:mo></mml:mrow></mml:msup><mml:mtext>dog</mml:mtext><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo>&#x2227;</mml:mo><mml:mi>C</mml:mi><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mo rspace="0.167em">&#x00AC;</mml:mo><mml:mtext>bark</mml:mtext><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>Furthermore, with this additional descriptive power, the sophisticated kind-predication theorist can agree that LEM is valid without admitting that GEM is valid for exactly the same reasons why the quantificational theorist can.</p>
<p>While I have no general in-principle objections to these sophisticated versions of the kind-predication approach, I should like to observe that these strategies essentially concede that the logical form of generic sentences is quantificational.<xref ref-type="fn" rid="n21">21</xref> The role that covert material plays in these theories is to distinguish between negated generics and their unnegated opposites. And these theorists have postulated that the additional covert material is quantificational; indeed, it&#8217;s not clear how else one can distinguish the scope of negation. So, if one endorses covert structure on the basis of the argument from the invalidity of GEM, then one is committed to endorsing something like the generic quantifier <italic>Gen</italic> as well. More generally, in this section, I have argued that the kind-predication theorist must admit the existence of something like <italic>Gen</italic> or commit herself to unpalatable metaphysical consequences, such truth-value or property gaps.</p>
</sec>
</sec>
<sec>
<title>5. Further Reflections on the Quantificational Approach</title>
<p>In Section 3, I argued that the quantificational approach does not entail GEM as a matter of logical form, but specific semantic analyses of <italic>Gen</italic> may end up validating GEM. In this section, I begin by demonstrating that some semantic analyses of <italic>Gen</italic> straightforwardly invalidate GEM, while others must posit additional principles and constraints to invalidate it (&#167;5.1). I then argue that other semantic analyses of <italic>Gen</italic> straightforwardly validate GEM, and so, they should be rejected (&#167;5.2).</p>
<sec>
<title>5.1 Invalidating GEM</title>
<p>To see how the quantificational approach to generics can invalidate GEM, we must consider how specific semantic analyses of <italic>Gen</italic> handle GEM. While numerous versions of the quantificational approach have been proposed, I will focus on two specific semantic analyses of <italic>Gen</italic> &#8211; the normality-based view and the probability-based view &#8211; and argue that they both avoid validating GEM. An exhaustive survey of different semantic analyses of generics is outside the scope of this paper. But I hope that my remarks here will illustrate how to check whether theories validate GEM. In particular, the central observation I wish to stress is that one&#8217;s semantics mustn&#8217;t collapse the truth-conditional distinction between negated generics and their (unnegated opposites), on pain of validating GEM.</p>
<p>Normality-based accounts typically deploy (restricted) universal quantification over normal individuals or normal worlds. For example, according to Yael Greenberg&#8217;s (<xref ref-type="bibr" rid="B26">2003</xref>; <xref ref-type="bibr" rid="B27">2007</xref>), a generic of the form <inline-formula><mml:math id="Eq063"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext mathvariant="italic">Fs are G</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula> is true iff, roughly speaking, in all appropriately accessible worlds, every contextually relevant and normal F-individual has the G-property in those worlds.<xref ref-type="fn" rid="n22">22</xref> More formally, Greenberg proposes that generics of the form <inline-formula><mml:math id="Eq064"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext mathvariant="italic">Fs are G</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula> have the following truth-conditions:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(26)</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="Eq065"><mml:mrow><mml:mo rspace="0.167em">&#x2200;</mml:mo><mml:mrow><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mrow><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2062;</mml:mo><mml:mo>&#x00A0;</mml:mo><mml:mtext>is</mml:mtext><mml:mo>&#x00A0;</mml:mo><mml:mtext>appropriately</mml:mtext><mml:mo>&#x00A0;</mml:mo><mml:mtext>accessible</mml:mtext><mml:mo>&#x00A0;</mml:mo><mml:mtext>from</mml:mtext><mml:mo>&#x00A0;</mml:mo><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow><mml:mo rspace="0.758em" stretchy='false'>&#x2192;</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#x2200;</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mrow><mml:msup><mml:mi>P</mml:mi><mml:mtext>cont.norm</mml:mtext></mml:msup><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy='false'>&#x2192;</mml:mo><mml:mrow><mml:mi>Q</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow><mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>where &#8216;<inline-formula><mml:math id="Eq066"><mml:msub><mml:mi>w</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:math></inline-formula>&#8217; is the actual world, &#8216;<inline-formula><mml:math id="Eq067"><mml:mi>P</mml:mi></mml:math></inline-formula>&#8217; and &#8216;<inline-formula><mml:math id="Eq068"><mml:mi>Q</mml:mi></mml:math></inline-formula>&#8217; are the subject and VP properties, respectively, and the superscript &#8216;cont.norm&#8217; is a restriction on <inline-formula><mml:math id="Eq069"><mml:mi>P</mml:mi></mml:math></inline-formula> to the contextually relevant and normal <inline-formula><mml:math id="Eq070"><mml:mi>P</mml:mi></mml:math></inline-formula>-individuals.</p>
<p>Contrastingly, probability-based versions of the orthodoxy typically deploy universal or majority-based quantification over all suitable smoothed out admissible temporal segments of possible worlds that extrapolate from the current history so far. For example, Cohen (<xref ref-type="bibr" rid="B10">1996</xref>, <xref ref-type="bibr" rid="B11">1997</xref>, <xref ref-type="bibr" rid="B12">1999a</xref>) proposes that a generic of the form <inline-formula><mml:math id="Eq071"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Fs are G</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula> is, roughly speaking, true iff the probability of an arbitrary F&#8217;s being G is greater than 0.5, where <italic>an F&#8217;s being G</italic> is understood in terms of conditional probability. More formally, Cohen (<xref ref-type="bibr" rid="B12">1999a, 37</xref>) proposes the following truth-conditions:<xref ref-type="fn" rid="n23">23</xref></p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(27)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p><italic>Cohen&#8217;s semantics, first version</italic></p></list-item>
<list-item><p>Let <inline-formula><mml:math id="Eq072"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Gen</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula> be a sentence, where <inline-formula><mml:math id="Eq073"><mml:mi>&#x03C8;</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math id="Eq074"><mml:mi>&#x03D5;</mml:mi></mml:math></inline-formula> are properties.</p></list-item>
<list-item><p>Let <inline-formula><mml:math id="Eq075"><mml:mrow><mml:mi>A</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mstyle mathsize="small"><mml:mtext>ALT</mml:mtext></mml:mstyle><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula>, the set of alternatives to <inline-formula><mml:math id="Eq076"><mml:mi>&#x03D5;</mml:mi></mml:math></inline-formula>. Then</p></list-item>
<list-item><p><inline-formula><mml:math id="Eq077"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Gen</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula> is true iff <inline-formula><mml:math id="Eq078"><mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x007C;</mml:mo><mml:mrow><mml:mi>&#x03C8;</mml:mi><mml:mo rspace="0.055em">&#x2227;</mml:mo><mml:mrow><mml:mo>&#x22C1;</mml:mo><mml:mi>A</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&gt;</mml:mo><mml:mn>0.5</mml:mn></mml:mrow></mml:math></inline-formula></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>where <inline-formula><mml:math id="Eq079"><mml:mi>P</mml:mi></mml:math></inline-formula> is a frequentist probability function. These relative probability judgements are interpreted in a Branching Time framework (<xref ref-type="bibr" rid="B55">Thomason, 1984</xref>), where we consider not only the sequence of events that we have actually observed, but also possible continuations of that sequence into the future. Given frequentism, this amounts to the claim that the frequency of <inline-formula><mml:math id="Eq080"><mml:mi>&#x03D5;</mml:mi></mml:math></inline-formula>s in a suitable reference class of <inline-formula><mml:math id="Eq081"><mml:mi>&#x03C8;</mml:mi></mml:math></inline-formula>&#8217;s that also satisfy one of the alternatives associated with <inline-formula><mml:math id="Eq082"><mml:mi>&#x03D5;</mml:mi></mml:math></inline-formula> is greater than 0.5.</p>
<p>To see how these theories work, consider the truth-conditions that that they assign to (1a), repeated below as (28) with a LF as in (28a):</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(28)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>(= (1a)) Ravens are black.</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>Gen x[raven(x)][black(x)]</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(29)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>(28a) is true iff <inline-formula><mml:math id="Eq083"><mml:mrow><mml:mo rspace="0.167em">&#x2200;</mml:mo><mml:mrow><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mrow><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2062;</mml:mo><mml:mo>&#x00A0;</mml:mo><mml:mtext>is appropriately accessible from</mml:mtext><mml:mo>&#x00A0;</mml:mo><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow><mml:mo rspace="0.778em" stretchy='false'>&#x2192;</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#x2200;</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mrow><mml:msup><mml:mtext>raven</mml:mtext><mml:mtext>cont.norm</mml:mtext></mml:msup><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy='false'>&#x2192;</mml:mo><mml:mrow><mml:mtext>black</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(30)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>(28a) is true iff <inline-formula><mml:math id="Eq084"><mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mrow><mml:mtext>black</mml:mtext><mml:mo>&#x2062;</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>&#x007C;</mml:mo><mml:mrow><mml:mtext>raven</mml:mtext><mml:mo>&#x2062;</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:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&gt;</mml:mo><mml:mn>0.5</mml:mn></mml:mrow></mml:math></inline-formula></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>Both of these analyses are empirically adequate with respect to (28). On Greenberg&#8217;s theory, (28a) is true iff, in all appropriately accessible worlds, every contextually relevant and normal raven is black in those worlds. And on Cohen&#8217;s theory, (28a) is true iff the probability of an arbitrary raven&#8217;s being black is greater than 0.5.</p>
<p>But how do these accounts fare with our counterexamples to GEM? Consider, again, the sentences in (8), repeated below as (31).</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(31)</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>(=(8a)) Books are paperbacks or books are not paperbacks.</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>(=(8b)) Fair coins land heads or fair coins do not land heads.</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>(=(8c)) Lions are male or lions are not male.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>Greenberg&#8217;s account clearly and correctly predicts that (8a) is false. For, according to her theory, the first disjunct &#8216;Books are paperbacks&#8217; is true just in case, roughly speaking, in all appropriately accessible worlds, every contextually relevant and normal book is paperbacked in those worlds. Similarly, the second disjunct, &#8216;Books are not paperbacks&#8217;, is true just in case in all appropriately accessible worlds, every contextually relevant and normal book is not paperbacked in those worlds. But since only some of those books are paperbacks in those worlds, and the others are hardbacks, neither disjunct is true, and so the disjunction is false overall. These remarks generalise to (8b) and (8c); Greenberg&#8217;s theory predicts they are false for analogous reasons. And, abstracting away from the specifics of Greenberg&#8217;s theory, we can observe that any theory involving universal quantification over (perhaps suitably restricted) normal individuals or worlds can, in principle, avoid validating GEM, since there is no guarantee that either a universal generalisation nor its opposite is true.</p>
<p>Matters are more complicated on Cohen&#8217;s account. It is clear that Cohen&#8217;s semantics predicts that (8b) is false. For both disjuncts are false on Cohen&#8217;s semantics: the first disjunct &#8216;Fair coins land heads&#8217; is false, since <inline-formula><mml:math id="Eq085"><mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mrow><mml:mtext>land.heads</mml:mtext><mml:mo>&#x2062;</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>&#x007C;</mml:mo><mml:mrow><mml:mtext>fair.coin</mml:mtext><mml:mo>&#x2062;</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:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>0.5</mml:mn></mml:mrow></mml:math></inline-formula>, as is the second disjunct &#8216;Fair coins don&#8217;t land heads&#8217;, since <inline-formula><mml:math id="Eq086"><mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mrow><mml:mtext>land.heads</mml:mtext><mml:mo>&#x2062;</mml:mo><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>&#x2032;</mml:mo></mml:msup></mml:mrow><mml:mo>&#x007C;</mml:mo><mml:mrow><mml:mtext>fair.coin</mml:mtext><mml:mo>&#x2062;</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:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>0.5</mml:mn></mml:mrow></mml:math></inline-formula>, where <inline-formula><mml:math id="Eq087"><mml:mrow><mml:mi>P</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msup><mml:mi>A</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is the probability of &#8216;not <inline-formula><mml:math id="Eq088"><mml:mi>A</mml:mi></mml:math></inline-formula>&#8217;.<xref ref-type="fn" rid="n24">24</xref></p>
<p>But things are trickier for (8a) and (8c). As I have stated Cohen&#8217;s semantics in (7), it predicts that these disjunctions are true, since the vast majority of books are paperbacks and most lions are female. This is clearly the wrong result. But, in part to account for these kinds of sentences, Cohen proposes that a generic <inline-formula><mml:math id="Eq089"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Gen</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula> is homogeneous in the following sense:<xref ref-type="fn" rid="n25">25</xref></p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(32)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p><bold>Homogeneity (Cohen).</bold> A reference class <inline-formula><mml:math id="Eq090"><mml:mi>&#x03C8;</mml:mi></mml:math></inline-formula> is homogeneous with respect to a property <inline-formula><mml:math id="Eq091"><mml:mi>&#x03D5;</mml:mi></mml:math></inline-formula>, iff there is no <italic>suitable</italic> set of properties <inline-formula><mml:math id="Eq092"><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:math></inline-formula> such that:</p>
<list list-type="simple">
<list-item><p>1. <inline-formula><mml:math id="Eq093"><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:math></inline-formula> induces a partition on <inline-formula><mml:math id="Eq094"><mml:mi>&#x03C8;</mml:mi></mml:math></inline-formula>, i.e., <inline-formula><mml:math id="Eq095"><mml:mrow><mml:mrow><mml:mo rspace="0.167em">&#x2200;</mml:mo><mml:mi>x</mml:mi></mml:mrow><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mrow><mml:mrow><mml:mi>&#x03C8;</mml:mi><mml:mo>&#x2062;</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 stretchy='false'>&#x2192;</mml:mo><mml:mrow><mml:mrow><mml:mo rspace="0.167em">&#x2203;</mml:mo><mml:mo>!</mml:mo></mml:mrow><mml:mo>&#x2061;</mml:mo><mml:mi>&#x03C9;</mml:mi></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mrow><mml:mi>&#x03C9;</mml:mi><mml:mo>&#x2062;</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:mrow></mml:math></inline-formula>.</p></list-item>
<list-item><p>2. <inline-formula><mml:math id="Eq096"><mml:mrow><mml:mrow><mml:mrow><mml:mo rspace="0.167em">&#x2203;</mml:mo><mml:mi>&#x03C9;</mml:mi></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x007C;</mml:mo><mml:mrow><mml:mi>&#x03C8;</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mi>&#x03C9;</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x2260;</mml:mo><mml:mrow><mml:mi>P</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x007C;</mml:mo><mml:mi>&#x03C8;</mml:mi></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula>.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>In words, a reference class <inline-formula><mml:math id="Eq097"><mml:mi>&#x03C8;</mml:mi></mml:math></inline-formula> is homogeneous iff there is no suitable partitioning of it such that the probability of <inline-formula><mml:math id="Eq098"><mml:mi>&#x03D5;</mml:mi></mml:math></inline-formula> given one of the subsets of <inline-formula><mml:math id="Eq099"><mml:mi>&#x03C8;</mml:mi></mml:math></inline-formula> induced by the partition is different from the probability of <inline-formula><mml:math id="Eq100"><mml:mi>&#x03D5;</mml:mi></mml:math></inline-formula> given <inline-formula><mml:math id="Eq101"><mml:mi>&#x03C8;</mml:mi></mml:math></inline-formula> as a whole.</p>
<p>Cohen then hardwires the requirement that generics are homogeneous directly into his truth-conditions, as we can see in the following, simplified revision of (27):<xref ref-type="fn" rid="n26">26</xref><sup>,</sup><xref ref-type="fn" rid="n27">27</xref></p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(33)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p><italic>Cohen&#8217;s semantics, revised</italic></p></list-item>
<list-item><p>Let <inline-formula><mml:math id="Eq102"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Gen</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula> be a sentence, where <inline-formula><mml:math id="Eq103"><mml:mi>&#x03C8;</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math id="Eq104"><mml:mi>&#x03D5;</mml:mi></mml:math></inline-formula> are properties.</p></list-item>
<list-item><p>Let <inline-formula><mml:math id="Eq105"><mml:mrow><mml:mi>A</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mstyle mathsize="small"><mml:mtext>ALT</mml:mtext></mml:mstyle><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula>, the set of alternatives to <inline-formula><mml:math id="Eq106"><mml:mi>&#x03D5;</mml:mi></mml:math></inline-formula>. Then</p></list-item>
<list-item><p><inline-formula><mml:math id="Eq107"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Gen</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula> is true iff for every <inline-formula><mml:math id="Eq108"><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:math></inline-formula>, a salient partition of <inline-formula><mml:math id="Eq109"><mml:mi>&#x03C8;</mml:mi></mml:math></inline-formula>, and for every <inline-formula><mml:math id="Eq110"><mml:mrow><mml:mi>&#x03C9;</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="Eq111"><mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x007C;</mml:mo><mml:mrow><mml:mi>&#x03C8;</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mi>&#x03C9;</mml:mi><mml:mo rspace="0.055em">&#x2227;</mml:mo><mml:mrow><mml:mo>&#x22C1;</mml:mo><mml:mi>A</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&gt;</mml:mo><mml:mn>0.5</mml:mn></mml:mrow></mml:math></inline-formula></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>What exactly counts as a &#8220;salient&#8221; partition? Cohen (<xref ref-type="bibr" rid="B12">1999a</xref>, <xref ref-type="bibr" rid="B13">b</xref>, <xref ref-type="bibr" rid="B14">2004</xref>) argues that this will depend on the domain of the generic and the predicated property, as well as how we cognitively represent the corresponding concepts. For example, the concept <italic>book</italic> may be represented as dividing into genres, such as <italic>encyclopaedia, mystery, romance</italic>, and so on. Now consider the following sentence:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(34)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>Books are paperbacks.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>Assuming that the concept <italic>book</italic> is represented in the manner just described, we may ask whether the domain is homogeneous with respect to the property of being paperback. The answer is no, since some genres of books like encyclopaedias are typically hardbacks. But then, there is some partition <inline-formula><mml:math id="Eq112"><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:math></inline-formula> over the property of being a book according to genre, such that there is some genre <inline-formula><mml:math id="Eq113"><mml:mrow><mml:mi>&#x03C9;</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow></mml:math></inline-formula>, such that <inline-formula><mml:math id="Eq114"><mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x007C;</mml:mo><mml:mrow><mml:mi>&#x03C8;</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mi>&#x03C9;</mml:mi><mml:mo rspace="0.055em">&#x2227;</mml:mo><mml:mrow><mml:mo>&#x22C1;</mml:mo><mml:mi>A</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&lt;</mml:mo><mml:mn>0.5</mml:mn></mml:mrow></mml:math></inline-formula> (where <inline-formula><mml:math id="Eq115"><mml:mrow><mml:mi>&#x03C8;</mml:mi><mml:mo>,</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula> be the properties of being a book and being paperbacked, respectively). Consequently, the homogeneity requirement is not satisfied, and so (34) is false. The same observation also applies to its opposite, &#8216;Books are not paperbacks&#8217;; since most genres of books are typically paperbacks, there is some genre <inline-formula><mml:math id="Eq116"><mml:mrow><mml:mi>&#x03C9;</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow></mml:math></inline-formula>, say, <italic>romance</italic>, such that <inline-formula><mml:math id="Eq117"><mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:msup><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x007C;</mml:mo><mml:mrow><mml:mi>&#x03C8;</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mi>&#x03C9;</mml:mi><mml:mo rspace="0.055em">&#x2227;</mml:mo><mml:mrow><mml:mo>&#x22C1;</mml:mo><mml:mi>A</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&lt;</mml:mo><mml:mn>0.5</mml:mn></mml:mrow></mml:math></inline-formula>. Thus, &#8216;Books are not paperbacks&#8217; is false. Thus, Cohen&#8217;s account correctly predicts that (8a) is false.</p>
<p>Similar remarks apply to (8c). While the majority of lions are female, if we partition the domain of lions according to sex, there will be a subclass of lions that are not male &#8211; the female lions &#8211; and there will be a subclass of lions that are not not male &#8211; the male lions. The existence of these subclasses means that the homogeneity requirement is not satisfied for both &#8216;Lions are male&#8217; and &#8216;Lions are female&#8217;, and so both of these sentence are false. Thus, Cohen&#8217;s account predicts that (8c) is false. Thus, Cohen&#8217;s account avoids validating GEM.</p>
</sec>
<sec>
<title>5.2 Validating GEM</title>
<p>In the previous subsection, we observed a distinction between those theories of generics that invalidate GEM as a straightforward consequence of their semantics, such as Greenberg&#8217;s, and those theories of generics that require additional assumptions to invalidate GEM, such as Cohen&#8217;s semantics and his homogeneity constraint. In this subsection, I want to demonstrate how specific semantic and metaphysical assumptions about the nature of <italic>Gen</italic> can lead to quantificational approaches validating GEM.</p>
<sec>
<title>5.2.1 Von Fintel (<xref ref-type="bibr" rid="B56">1997</xref>)</title>
<p>Von Fintel (<xref ref-type="bibr" rid="B56">1997</xref>) presents a compositional semantics for sentences like <italic>Only mammals give live birth</italic>. In order to make his theory empirically adequate, von Fintel argues that generics validate GEM. He begins with a long-standing observation that definite plurals and generic bare plurals seem to carry an &#8216;all-or-nothing&#8217; presupposition (<xref ref-type="bibr" rid="B24">Fodor, 1970, 159&#8211;67</xref>). For example, the sentence &#8216;The children are asleep&#8217; seems to presuppose that either all or none of the children are asleep, and asserts that all of them are asleep. For example, the sentence &#8216;Ravens are black&#8217; seems to presuppose that either all or no contextually salient ravens are black, and asserted that all such ravens are black. Von Fintel takes this to be evidence that the <italic>Gen</italic> operator is lexically specified to trigger a presupposition of homogeneity:<xref ref-type="fn" rid="n28">28</xref></p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(35)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p><bold>Homogeneity (von Fintel).</bold> <inline-formula><mml:math id="Eq118"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Gen</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula> is defined only if:</p>
<p><inline-formula><mml:math id="Eq119"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mo rspace="0.167em">&#x2200;</mml:mo><mml:mi>x</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>D</mml:mi><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo stretchy='false'>&#x2192;</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo>&#x2228;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mo rspace="0.167em">&#x2200;</mml:mo><mml:mi>x</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>D</mml:mi><mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo stretchy='false'>&#x2192;</mml:mo><mml:mo rspace="0.167em">&#x00AC;</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula></p>
<p>where <inline-formula><mml:math id="Eq120"><mml:mi>D</mml:mi></mml:math></inline-formula> is some suitable domain of individuals.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>Given Homogeneity, it directly follows that <inline-formula><mml:math id="Eq121"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Gen</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula> is false iff <inline-formula><mml:math id="Eq122"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Gen</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#x00AC;</mml:mo><mml:mi>&#x03C8;</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula> is true, or shorter:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(36)</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="Eq123"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo lspace="0.167em">&#x2062;</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#x00AC;</mml:mo><mml:mrow><mml:mtext>Gen</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula> iff <inline-formula><mml:math id="Eq124"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Gen</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#x00AC;</mml:mo><mml:mi>&#x03C8;</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>Given (36), LEM, and the substitution of material equivalences, GEM immediately follows. Given LEM, <inline-formula><mml:math id="Eq125"><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Gen</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x2228;</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#x00AC;</mml:mo><mml:mrow><mml:mtext>Gen</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula>. Then, given (36), <inline-formula><mml:math id="Eq126"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Gen</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#x00AC;</mml:mo><mml:mi>&#x03C8;</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula> can be substituted for <inline-formula><mml:math id="Eq127"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo lspace="0.167em">&#x2062;</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#x00AC;</mml:mo><mml:mrow><mml:mtext>Gen</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula> to get Q&#8211;GEM: <inline-formula><mml:math id="Eq128"><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Gen</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x2228;</mml:mo><mml:mrow><mml:mtext>Gen</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#x00AC;</mml:mo><mml:mi>&#x03C8;</mml:mi></mml:mrow><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:mrow></mml:math></inline-formula>. Consequently, if the <italic>Gen</italic> operator triggers the homogeneity presupposition, then the quantificational approach validates GEM.</p>
<p>However, there is reason to doubt that the <italic>Gen</italic> operator triggers the homogeneity presupposition, since it fails standard tests for determining whether a sentence generates a presupposition (<xref ref-type="bibr" rid="B31">Kirkpatrick, 2015</xref>, <xref ref-type="bibr" rid="B32">2019</xref>; <xref ref-type="bibr" rid="B36">Kri&#382;, 2015</xref>). First, generic sentences fail the &#8216;Hey, wait a minute&#8217; (HWM) test proposed by von Fintel (<xref ref-type="bibr" rid="B58">2004b</xref>). According to the HWM test, a complaint is legitimate when it is about a presupposition of an utterance that is not established fact prior to that utterance, but not when it is about an asserted, non-presuppositional component of the utterance. Consider (37):</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(37)</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>Has Elmo 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>Hey, wait a minute! I had no idea Elmo used to smoke.</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>#Hey, wait a minute! I had no idea that Elmo stopped smoking.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>B&#8217;s complaint to the presuppositional component of A&#8217;s utterance is felicitous, but C&#8217;s complaint to the asserted, non-presuppositional component is infelicitous. Consequently, the claim that Elmo used to smoke is a presupposition, whereas the claim that Elmo stopped smoking is not.</p>
<p>If characterising sentences trigger presuppositions that either all or no individual in a certain domain satisfied the predicate, then we would expect that C&#8217;s complaint to A&#8217;s utterance would be felicitous. But this is clearly not the case.</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(38)</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>Are cats black?</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>Hey, wait a minute! I had no idea that cats could be black.</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>#Hey, wait a minute! I had no idea that either all or no normally coloured cats had to be black.<xref ref-type="fn" rid="n29">29</xref></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>While B&#8217;s complaint to a clearly presuppositional component of A&#8217;s utterance is felicitous, C&#8217;s complaint is not. Consequently, characterising sentences fail the HWM test.</p>
<p>Second, generic sentences fail projection tests for presuppositions. It is well-known that presuppositions project from questions, as evidenced by the fact that the question in (37) commits the speaker to the belief that Elmo used to smoke. If characterising sentences trigger homogeneity presuppositions, the question in (38) would commit A to the belief that either all or no normally coloured cats are black. But this is not the case. The question of whether cats are black is compatible with normally coloured cats being coloured in a variety of ways &#8212; normally coloured cats may be brown, ginger, white, black, or any mixture of the four.</p>
<p>Furthermore, it is well-known that presuppositions project from the antecedent of a conditional. For example, (39) presupposes that Elmo used to smoke:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(39)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>If Elmo stopped smoking, then he&#8217;s probably feeling jittery.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>If characterising sentences triggered homogeneity presuppositions, then (40) should entail that either all or no normally coloured cats are black. But this is clearly not the case:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(40)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>If cats are black, then we better be careful crossing paths with cats.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>Since passing the HWM and projection tests are plausible necessary conditions for the existence of presuppositions, this is strong evidence that the <italic>Gen</italic> operator is not lexically specified to trigger the Homogeneity Presupposition. Consequently, von Fintel&#8217;s homogeneity argument for GEM fails.<xref ref-type="fn" rid="n30">30</xref><sup>,</sup><xref ref-type="fn" rid="n31">31</xref></p>
</sec>
<sec>
<title>5.2.2 Nickel (<xref ref-type="bibr" rid="B49">2009</xref>, <xref ref-type="bibr" rid="B50">2010</xref>, <xref ref-type="bibr" rid="B51">2016</xref>)</title>
<p>To conclude this section, I want to focus on Bernhard Nickel&#8217;s (<xref ref-type="bibr" rid="B49">2009</xref>; <xref ref-type="bibr" rid="B51">2016</xref>) theory of generics, an important theory which I think is worth serious consideration.</p>
<p>According to Nickel&#8217;s theory, the generic operator <italic>Gen</italic> is, roughly speaking, an existential quantifier over ways of being normal, rather than a universal quantifier over normal individuals or worlds or a majority-based probability operator. More specifically, Nickel proposes the following truth-conditions:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(41)</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="Eq129"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext mathvariant="italic">Fs are G</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula> are true at a context <inline-formula><mml:math id="Eq130"><mml:mi>c</mml:mi></mml:math></inline-formula> iff there is a way <inline-formula><mml:math id="Eq131"><mml:mi>w</mml:mi></mml:math></inline-formula> of being a normal <inline-formula><mml:math id="Eq132"><mml:mi>F</mml:mi></mml:math></inline-formula> that is salient in <inline-formula><mml:math id="Eq133"><mml:mi>c</mml:mi></mml:math></inline-formula>, and all <inline-formula><mml:math id="Eq134"><mml:mrow><mml:mi>F</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:math></inline-formula> that are normal in way <inline-formula><mml:math id="Eq135"><mml:mi>w</mml:mi></mml:math></inline-formula> are <inline-formula><mml:math id="Eq136"><mml:mi>G</mml:mi></mml:math></inline-formula>.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>To see how Nickel&#8217;s theory works, consider the truth-conditions it gives for (1a) (= &#8216;Ravens are black&#8217;):</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(42)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>The sentence &#8216;Ravens are black&#8217; is true at a context <inline-formula><mml:math id="Eq137"><mml:mi>c</mml:mi></mml:math></inline-formula> iff there is a way <inline-formula><mml:math id="Eq138"><mml:mi>w</mml:mi></mml:math></inline-formula> of being a normal raven in context <inline-formula><mml:math id="Eq139"><mml:mi>c</mml:mi></mml:math></inline-formula>, and every raven that is normal in way <inline-formula><mml:math id="Eq140"><mml:mi>w</mml:mi></mml:math></inline-formula> is black.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>On the assumption that the context makes salient normal ways of being coloured, the truth-conditions for (1a) is empirically adequate.</p>
<p>However, a complication for Nickel&#8217;s theory arises with negated generics like (43) (cf. <xref ref-type="bibr" rid="B51">Nickel, 2016, 127ff.</xref>):</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(43)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>Ravens are not white.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>Intuitively, (43) denies that normal ravens are white. But this is not predicted by Nickel&#8217;s semantics. The negation in (43) can either be interpreted as taking wide-scoping over the whole sentence or as taking narrow-scope over the verb phrase. Applying Nickel&#8217;s semantics to these interpretations yields the truth-conditions in (44) and (45), respectively:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(44)</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 not the case that there is a way of being a normally coloured raven such that every raven that is normal in this way is white.</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>All ways of being a normally coloured raven are such that, for each of these ways, there is some raven that isn&#8217;t white.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(45)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>There is a way of being a normally coloured raven such that every raven that is normal in this way is not white.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>By pushing the negation in (44) through the quantifiers, we see that it is equivalent to (44a), which does not capture the intuitive meaning of (4), as it is compatible with normally-coloured white ravens. And (45) isn&#8217;t right either, since it only rules out that the possibility that white is the <italic>only</italic> normal colour for ravens.</p>
<p>In order to capture the intuitive reading of negated generics like (43), Nickel requires that his semantics validates the following homogeneity principle:<xref ref-type="fn" rid="n32">32</xref></p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(46)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p><bold>Homogeneity (Nickel).</bold> If this is true:
<disp-quote><p>All ways <inline-formula><mml:math id="Eq141"><mml:mi>w</mml:mi></mml:math></inline-formula> of being an <inline-formula><mml:math id="Eq142"><mml:mi>F</mml:mi></mml:math></inline-formula>-normal <inline-formula><mml:math id="Eq143"><mml:mi>A</mml:mi></mml:math></inline-formula> are such that, for each <inline-formula><mml:math id="Eq144"><mml:mi>w</mml:mi></mml:math></inline-formula>, there is an <inline-formula><mml:math id="Eq145"><mml:mi>A</mml:mi></mml:math></inline-formula> that is <inline-formula><mml:math id="Eq146"><mml:mi>w</mml:mi></mml:math></inline-formula> but that is not <inline-formula><mml:math id="Eq147"><mml:mi>F</mml:mi></mml:math></inline-formula>.</p>
</disp-quote></p>
<p>Then this is true:
<disp-quote>
<p>All ways of being an <inline-formula><mml:math id="Eq148"><mml:mi>F</mml:mi></mml:math></inline-formula>-normal <inline-formula><mml:math id="Eq149"><mml:mi>A</mml:mi></mml:math></inline-formula> are such that, for each <inline-formula><mml:math id="Eq150"><mml:mi>w</mml:mi></mml:math></inline-formula>, all <inline-formula><mml:math id="Eq151"><mml:mi>A</mml:mi></mml:math></inline-formula>s that are <inline-formula><mml:math id="Eq152"><mml:mi>w</mml:mi></mml:math></inline-formula> are not <inline-formula><mml:math id="Eq153"><mml:mi>F</mml:mi></mml:math></inline-formula>. (<xref ref-type="bibr" rid="B51">Nickel, 2016, 129</xref>)</p>
</disp-quote></p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>Given Nickel&#8217;s homogeneity principle, (44a) entails (47):</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(47)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>All ways of being a normally coloured raven are such that, for each of these ways, all ravens that are normal in that way are non-white.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>This is exactly what is needed to capture the intuitive meaning of (43).</p>
<p>However, the problem with Nickel&#8217;s homogeneity principle is that, together with his semantics and LEM, it entails that Generic Excluded Middle. To see this, consider an arbitrary instance of LEM:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(48)</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="Eq154"><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Fs are G</mml:mtext><mml:mo>&#x00A0;</mml:mo></mml:mrow><mml:mo>&#x2228;</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#x00AC;</mml:mo><mml:mrow><mml:mtext>(Fs are G)</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula>.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>I will now show that, regardless of which disjunct is true, GEM follows. This is straightforward when the first disjunct is true. For suppose <inline-formula><mml:math id="Eq155"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Fs are G</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula> is true; then, by disjunction introduction, <inline-formula><mml:math id="Eq156"><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Fs are G</mml:mtext><mml:mo>&#x00A0;</mml:mo></mml:mrow><mml:mo>&#x2228;</mml:mo><mml:mrow><mml:mo>&#x00A0;</mml:mo><mml:mtext>Fs are not G</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
<p>To show that the second disjunct also entails GEM, suppose <inline-formula><mml:math id="Eq157"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo lspace="0.167em">&#x2062;</mml:mo><mml:mrow><mml:mo rspace="0.167em">&#x00AC;</mml:mo><mml:mrow><mml:mtext>(Fs are G)</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula> is true. Then, by applying Nickel&#8217;s semantics and pushing the negation through the quantifiers, we get:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(49)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>All ways of being a <inline-formula><mml:math id="Eq158"><mml:mi>G</mml:mi></mml:math></inline-formula>-normal <inline-formula><mml:math id="Eq159"><mml:mi>F</mml:mi></mml:math></inline-formula> are such that, for each <inline-formula><mml:math id="Eq160"><mml:mi>w</mml:mi></mml:math></inline-formula>, there is some <inline-formula><mml:math id="Eq161"><mml:mi>F</mml:mi></mml:math></inline-formula> that is <inline-formula><mml:math id="Eq162"><mml:mi>w</mml:mi></mml:math></inline-formula> and not-<inline-formula><mml:math id="Eq163"><mml:mi>G</mml:mi></mml:math></inline-formula>.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>By applying Nickel&#8217;s homogeneity principle to (49), it follows that:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(50)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>All ways of being a <inline-formula><mml:math id="Eq164"><mml:mi>G</mml:mi></mml:math></inline-formula>-normal <inline-formula><mml:math id="Eq165"><mml:mi>F</mml:mi></mml:math></inline-formula> are such that, for each <inline-formula><mml:math id="Eq166"><mml:mi>w</mml:mi></mml:math></inline-formula>, all <inline-formula><mml:math id="Eq167"><mml:mi>F</mml:mi></mml:math></inline-formula>s that are <inline-formula><mml:math id="Eq168"><mml:mi>w</mml:mi></mml:math></inline-formula> are not-<inline-formula><mml:math id="Eq169"><mml:mi>G</mml:mi></mml:math></inline-formula>.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>That is, there is no way <inline-formula><mml:math id="Eq170"><mml:mi>w</mml:mi></mml:math></inline-formula> of being a <inline-formula><mml:math id="Eq171"><mml:mi>G</mml:mi></mml:math></inline-formula>-normal <inline-formula><mml:math id="Eq172"><mml:mi>F</mml:mi></mml:math></inline-formula> such that every <inline-formula><mml:math id="Eq173"><mml:mi>F</mml:mi></mml:math></inline-formula> that is <inline-formula><mml:math id="Eq174"><mml:mi>w</mml:mi></mml:math></inline-formula> is <inline-formula><mml:math id="Eq175"><mml:mi>G</mml:mi></mml:math></inline-formula>. So, by Nickel&#8217;s semantics, (51) is not true:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(51)</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="Eq176"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Fs are G</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula>.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>Now, since every <inline-formula><mml:math id="Eq177"><mml:mi>F</mml:mi></mml:math></inline-formula> is necessarily either a <inline-formula><mml:math id="Eq178"><mml:mi>G</mml:mi></mml:math></inline-formula> or not a <inline-formula><mml:math id="Eq179"><mml:mi>G</mml:mi></mml:math></inline-formula>, every instance of (52) should be a theorem on any theory of generics:<xref ref-type="fn" rid="n33">33</xref></p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(52)</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="Eq180"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Fs are G or not-G</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula>.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>Applying Nickel&#8217;s semantics, it follows that (52) is true only if:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(53)</p></list-item>
</list>
</list-item>
<list-item>
<list list-type="sentence-gloss">
<list-item>
<list list-type="final-sentence">
<list-item><p>There is a way of being a <inline-formula><mml:math id="Eq181"><mml:mi>G</mml:mi></mml:math></inline-formula>-normal <inline-formula><mml:math id="Eq182"><mml:mi>F</mml:mi></mml:math></inline-formula> (call it <inline-formula><mml:math id="Eq183"><mml:mrow><mml:mi>w</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>*</mml:mtext></mml:mrow></mml:math></inline-formula>) such that every <inline-formula><mml:math id="Eq184"><mml:mi>F</mml:mi></mml:math></inline-formula> that is normal in way <inline-formula><mml:math id="Eq185"><mml:mrow><mml:mi>w</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>*</mml:mtext></mml:mrow></mml:math></inline-formula> is either <inline-formula><mml:math id="Eq186"><mml:mi>G</mml:mi></mml:math></inline-formula> or not-<inline-formula><mml:math id="Eq187"><mml:mi>G</mml:mi></mml:math></inline-formula>.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>But, from (50), we have it that <italic>every</italic> way of being a <inline-formula><mml:math id="Eq188"><mml:mi>G</mml:mi></mml:math></inline-formula>-normal <inline-formula><mml:math id="Eq189"><mml:mi>F</mml:mi></mml:math></inline-formula> is such that, for each <inline-formula><mml:math id="Eq190"><mml:mi>w</mml:mi></mml:math></inline-formula>, all <inline-formula><mml:math id="Eq191"><mml:mi>F</mml:mi></mml:math></inline-formula>s that are <inline-formula><mml:math id="Eq192"><mml:mi>w</mml:mi></mml:math></inline-formula> are not-<inline-formula><mml:math id="Eq193"><mml:mi>G</mml:mi></mml:math></inline-formula>. So, it follows that <inline-formula><mml:math id="Eq194"><mml:mrow><mml:mi>w</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>*</mml:mtext></mml:mrow></mml:math></inline-formula> is a <inline-formula><mml:math id="Eq195"><mml:mi>G</mml:mi></mml:math></inline-formula>-normal way of being an <inline-formula><mml:math id="Eq196"><mml:mi>F</mml:mi></mml:math></inline-formula> such that every <inline-formula><mml:math id="Eq197"><mml:mi>F</mml:mi></mml:math></inline-formula> that is <inline-formula><mml:math id="Eq198"><mml:mrow><mml:mi>w</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>*</mml:mtext></mml:mrow></mml:math></inline-formula> is not-<inline-formula><mml:math id="Eq199"><mml:mi>G</mml:mi></mml:math></inline-formula>. In other words, by disjunctive syllogism, it follows from (50) and (53) that:</p>
<list list-type="gloss">
<list-item>
<list list-type="wordfirst">
<list-item><p>(54)</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="Eq200"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Fs are not-G</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula>.</p></list-item>
</list>
</list-item>
</list>
</list-item>
</list>
<p>And, finally, by disjunction-introduction, <inline-formula><mml:math id="Eq201"><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Fs are G</mml:mtext></mml:mrow><mml:mo>&#x2228;</mml:mo><mml:mrow><mml:mtext>Fs are not G</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:mrow></mml:math></inline-formula> is true. So, regardless of whether <inline-formula><mml:math id="Eq202"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Fs are G</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula> or <inline-formula><mml:math id="Eq203"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo lspace="0.167em">&#x2062;</mml:mo><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mrow><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mtext>Fs are G</mml:mtext><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula> is true, <inline-formula><mml:math id="Eq204"><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Fs are G</mml:mtext><mml:mo>&#x00A0;</mml:mo></mml:mrow><mml:mo>&#x2228;</mml:mo><mml:mrow><mml:mtext>Fs are not G</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:mrow></mml:math></inline-formula> is true.<xref ref-type="fn" rid="n34">34</xref> Thus Nickel&#8217;s theory, together with some extremely plausible and independently motivated principles, entails GEM. This result is devastating for Nickel&#8217;s theory.</p>
</sec>
</sec>
</sec>
<sec>
<title>6. Concluding Remarks</title>
<p>The main lesson of this paper concerns the semantics of generics: any adequate theory of generics must predict that GEM is invalid. This observation is particularly important when deciding between kind-predication and quantificational approaches to the semantics of characterising sentences. If the arguments in this paper are correct, the kind-predication approach entails GEM and so it is false. On the other hand, the quantificational approach fares much better. No general argument that the quantificational approach entails GEM is forthcoming and some prominent semantic analyses for <italic>Gen</italic> are shown not to entail GEM. Nevertheless, careful attention must be paid to whether particular semantic analyses of <italic>Gen</italic> entail GEM. As we have seen, some semantics for <italic>Gen</italic> do entail GEM, and so they too should be rejected. Investigating whether a particular semantics entails GEM is thus a useful test for whether that analysis is true.<xref ref-type="fn" rid="n35">35</xref></p>
</sec>
</body>
<back>
<fn-group>
<fn id="n1"><p>See, for example, Krifka et al. (<xref ref-type="bibr" rid="B35">1995</xref>); Pelletier and Asher (<xref ref-type="bibr" rid="B52">1997</xref>); Mari et al. (<xref ref-type="bibr" rid="B48">2013</xref>).</p></fn>
<fn id="n2"><p>This paper focuses mainly on bare plural generics of the form <inline-formula><mml:math id="Eq205"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Fs are G</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula>, and sets aside generics involving definite and indefinite determiners like <inline-formula><mml:math id="Eq206"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>The F is G</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="Eq207"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>An F is G</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula>. The meanings of these sentences differ from bare plural generics in subtle ways that put them beyond the scope of this paper.</p></fn>
<fn id="n3"><p>For historical proponents of the kind-predication view, see Lawler (<xref ref-type="bibr" rid="B37">1972</xref>); Dahl (<xref ref-type="bibr" rid="B17">1975</xref>); Carlson (<xref ref-type="bibr" rid="B6">1977a</xref>, <xref ref-type="bibr" rid="B7">b</xref>). For critical discussion of this view, see Krifka et al. (<xref ref-type="bibr" rid="B35">1995</xref>); Leslie (<xref ref-type="bibr" rid="B40">2015</xref>). For more general discussion of the relationship between generics and the metaphysics of kinds, see Liebesman and Sterken (<xref ref-type="bibr" rid="B45">2021</xref>).</p></fn>
<fn id="n4"><p>See, e.g., Krifka et al. (<xref ref-type="bibr" rid="B35">1995, 25ff.</xref>) and Mari et al. (<xref ref-type="bibr" rid="B48">2013</xref>). There is also a situation-based approach to quantificational adverbs, pioneered by Berman (<xref ref-type="bibr" rid="B5">1987</xref>) and adopted by von Fintel (<xref ref-type="bibr" rid="B57">2004a</xref>); Heim (<xref ref-type="bibr" rid="B28">1990</xref>); Elbourne (<xref ref-type="bibr" rid="B22">2005</xref>, <xref ref-type="bibr" rid="B23">2013</xref>), which I myself favour for generics (<xref ref-type="bibr" rid="B33">Kirkpatrick, 2023</xref>), but since the unselective binding approach is more familiar in the literature, it will be more convenient to work with it. There is also an approach that treats <italic>Gen</italic> as a quantificational determiner; see Pelletier and Asher (<xref ref-type="bibr" rid="B52">1997</xref>). These differences won&#8217;t matter when considering the central tenets of the quantificational approach.</p></fn>
<fn id="n5"><p>For further discussion on generics and copredications, see Collins (<xref ref-type="bibr" rid="B16">2018</xref>).</p></fn>
<fn id="n6"><p>An anonymous reviewer raises a concern about whether some of the sentences in (8) really are counterexamples to GEM or whether they conflate falsity and unassertability. It is worth emphasising that the claim that the target sentences are false is not an idiosyncratic judgement, and that there is wide support in the literature for the claim that these disjuncts are false; see, for example, Carlson (<xref ref-type="bibr" rid="B6">1977a</xref>), Pelletier and Asher (<xref ref-type="bibr" rid="B52">1997, 1132</xref>) and Leslie (<xref ref-type="bibr" rid="B39">2008, 7</xref>). Nevertheless, some theorists take these sentences to be merely unacceptable, similar to cases of presupposition failure, rather than cases of falsity; see, e.g., Cohen (<xref ref-type="bibr" rid="B12">1999a, 228</xref>). Whether the sentences in (8) are false or merely unacceptable is a subtle question, but it does not need to be settled in order to take the sentences in (8) to establish the invalidity of GEM. The important point is that, <italic>on their generic readings</italic>, assertions of &#8216;Books are paperbacks&#8217;, &#8216;Fair coins land heads&#8217;, or &#8216;Lions are male&#8217; (and their opposites) are not true. Furthermore, nothing in this paper rests on the claim that (8a&#8211;c) are false, rather than simply not true. (By way of analogy, it is instructive to consider what we should think about other cases of unassertability. For example, theorists who think that the sentence &#8216;The present King of France is bald&#8217; is unassertable due to presupposition failure will nevertheless agree that the disjunction &#8216;The present King of France is bald or the present King of France is not bald&#8217; is not true, albeit for the reason that its being true or false requires the existence of a unique king of France. Similarly, even those who judge the generics in (8) to be unassertable should agree that they are not true.) For further discussion of this point and the potential causes of infelicity or non-truth of the sentences in (8), see Sections 4 and 5.</p></fn>
<fn id="n7"><p>For discussion of other versions of the kind-predication approach that also entail GEM, see von Fintel (<xref ref-type="bibr" rid="B56">1997, 31&#8211;2</xref>).</p></fn>
<fn id="n8"><p>To remain neutral between competing versions of the quantificational approach, and different ways if dividing sentence material between the restrictor and matrix clauses, I simplify the LF representation by leaving tacit the variables bound by <italic>Gen</italic> and using <inline-formula><mml:math id="Eq208"><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>,</mml:mo><mml:mi>&#x03C8;</mml:mi></mml:mrow></mml:math></inline-formula> as schematic metavariables ranging over the denotations of the restrictor and matrix clauses respectively.</p></fn>
<fn id="n9"><p>For other semantic theories that predict truth-value gaps arise from undefinedness, see the Frege&#8211;Strawson theory of definite descriptions which holds that sentences containing definite descriptions are truth-valueless when their definite descriptions are undefined due to presupposition failure (<xref ref-type="bibr" rid="B29">Heim and Kratzer, 1998</xref>; <xref ref-type="bibr" rid="B23">Elbourne, 2013</xref>).</p></fn>
<fn id="n10"><p>An analysis of the notion &#8220;well-established kind&#8221; is not attempted here, since the distinction seems real enough given the strikingness of the example sentences.</p></fn>
<fn id="n11"><p>&#8216;#&#8217; indicates infelicity of some sort.</p></fn>
<fn id="n12"><p>Of course, this consideration will have less dialectical weight for theorists, like those mentioned in ft. 6, who judge the counterexamples to GEM to be merely unassertable, rather than false.</p></fn>
<fn id="n13"><p>Recall that it is common ground amongst most, if not all, three-valued logics that a disjunction is neither true nor false if both its disjuncts are neither true nor false.</p></fn>
<fn id="n14"><p>Here and throughout, I make the harmless idealisation assumption that the extensions of declarative English sentences can be modelled as (the characteristic functions of) sets of worlds.</p></fn>
<fn id="n15"><p>Dialectically speaking, I think my use of quantificational glosses on the propositions expressed by generics is unobjectionable, since Liebesman helps himself to quantificational glosses on the truth-conditions of generics and argues at length that doing so doesn&#8217;t commit him to the claim that generics are themselves quantificational; see Liebesman (<xref ref-type="bibr" rid="B42">2011, 420&#8211;421</xref>). The idea is meant to be that generics and their quantificational parses may be true in exactly the same circumstances, while nevertheless being semantically independent.</p></fn>
<fn id="n16"><p>See Dorr (<xref ref-type="bibr" rid="B20">2016</xref>).</p></fn>
<fn id="n17"><p>Even worse, this approach predicts that &#8216;Mosquitoes carry WNV&#8217; and &#8216;Mosquitoes don&#8217;t carry WNV&#8217; are both true, and so it invalidates an extremely plausible principle governing generics, <italic>Generic Non-Contradiction</italic>:</p>
<p><disp-quote>
<p><bold>Generic Non-Contradiction.</bold> For any bare plural characterising sentence of the form <inline-formula><mml:math id="Eq209"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Fs are G</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="Eq210"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Fs are G</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="Eq211"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Fs are not G</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula> cannot both be true.</p>
</disp-quote></p>
<p>See Hoeltje (<xref ref-type="bibr" rid="B30">2017, 114&#8211;116</xref>), for further discussion of Generic Non-Contradiction and its plausibility.</p></fn>
<fn id="n18"><p>For other reasons to be cautious about theories that predict property gaps in this way, albeit in a different context, see Williamson (<xref ref-type="bibr" rid="B59">1994, &#167;7.2</xref>), Glanzberg (<xref ref-type="bibr" rid="B25">2004</xref>), and Magidor (<xref ref-type="bibr" rid="B47">2013, 83&#8211;91</xref>).</p></fn>
<fn id="n19"><p>There are other reasons to be cautious about this notion of property inheritance. For example, kinds often seem to inherit some, but not other, properties from their members, even though exactly the same members instantiate both properties. For example, consider (i) seems true and (ii) to be true, even if all and only the male cardinals are the red ones.</p>
<p><list list-type="simple">
<list-item><p>(i) Cardinals are red.</p></list-item>
<list-item><p>(ii) Cardinals are male.</p></list-item>
</list></p>
<p>Explaining the difference in truth-value between these sentences is a general problem for theories of generics. But the present concern is that, while property inheritance is not guaranteed by a certain proposition of a kind&#8217;s membership having a certain property, proponents of the kind predication approach do not offer an explanation for these facts.</p></fn>
<fn id="n20"><p>Alternatively, one may retain full commitment to the view <italic>dogs</italic> denotes a kind, and instead postulate that Gn denotes a function from verb phrases to a function from kinds to truth-values (or the intensional equivalent); compare Teichman (<xref ref-type="bibr" rid="B54">2023</xref>).</p></fn>
<fn id="n21"><p>For arguments against Cohen (<xref ref-type="bibr" rid="B15">2013</xref>), see Sterken (<xref ref-type="bibr" rid="B53">2016</xref>).</p></fn>
<fn id="n22"><p>For present purposes, I will focus on Greenberg&#8217;s theory, but what I have to say generalises to other versions of the view. For other proponents of the normality-based approach, see, e.g., Asher and Morreau (<xref ref-type="bibr" rid="B1">1991</xref>, <xref ref-type="bibr" rid="B2">1995</xref>); Krifka et al. (<xref ref-type="bibr" rid="B35">1995</xref>); Pelletier and Asher (<xref ref-type="bibr" rid="B52">1997</xref>); Eckardt (<xref ref-type="bibr" rid="B21">2000</xref>); Asher and Pelletier (<xref ref-type="bibr" rid="B3">2013</xref>).</p></fn>
<fn id="n23"><p>Actually, Cohen proposes a slightly more complicated truth-conditions in order to accommodate what he calls &#8216;relative generics&#8217;. We will focus on a simplified version of his view, since nothing that I have to say here is impacted by relative generics.</p></fn>
<fn id="n24"><p>A wrinkle. It is physically possible, though exceedingly rare, for a flipped fair coin to land on its side. Taking this into account, <inline-formula><mml:math id="Eq212"><mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mrow><mml:mtext>land.heads</mml:mtext><mml:mo>&#x2062;</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>&#x007C;</mml:mo><mml:mrow><mml:mtext>fair.coin</mml:mtext><mml:mo>&#x2062;</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:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&lt;</mml:mo><mml:mn>0.5</mml:mn></mml:mrow></mml:math></inline-formula>, and so <inline-formula><mml:math id="Eq213"><mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mrow><mml:mtext>land.heads</mml:mtext><mml:mo>&#x2062;</mml:mo><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>&#x2032;</mml:mo></mml:msup></mml:mrow><mml:mrow><mml:mo>&#x007C;</mml:mo><mml:mtext>fair.coin</mml:mtext><mml:mo>&#x2062;</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:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&gt;</mml:mo><mml:mn>0.5</mml:mn></mml:mrow></mml:math></inline-formula>. It may be that Cohen&#8217;s homogeneity principle (or the proper interpretation of the probability operator) can save Cohen&#8217;s semantics from this wrinkle, but if not, his semantics has the disastrous consequence that &#8216;Fair coins don&#8217;t land heads&#8217; is true.</p></fn>
<fn id="n25"><p>For further discussion of Cohen&#8217;s homogeneity principle, see Cohen (<xref ref-type="bibr" rid="B12">1999a, 235ff.</xref>).</p></fn>
<fn id="n26"><p>Cohen&#8217;s actual statement of his truth-conditions is complicated by (i) his treatment of relative generics (see ft. 23) and (ii) his treatment of alternatives. For present purposes, I assume a simplified treatment of alternatives, though, see Cohen (<xref ref-type="bibr" rid="B13">1999b, 82&#8211;3</xref>; Chapter 5), for further discussion.</p></fn>
<fn id="n27"><p>Interestingly, Cohen (<xref ref-type="bibr" rid="B14">2004</xref>) proposes a different, non-equivalent homogeneity constraint, which he treats as a presupposition of generics, rather than an entailment of his semantics. See ft. 30, for further discussion of this proposal.</p></fn>
<fn id="n28"><p>See also L&#246;bner (<xref ref-type="bibr" rid="B46">1985</xref>); Barker (<xref ref-type="bibr" rid="B4">1996</xref>); Yoon (<xref ref-type="bibr" rid="B60">1996</xref>).</p></fn>
<fn id="n29"><p>For the sake of argument, I follow von Fintel in assuming that, for a generic <inline-formula><mml:math id="Eq214"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Fs are G</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula>, <italic>Gen</italic> quantifiers over the <inline-formula><mml:math id="Eq215"><mml:mi>G</mml:mi></mml:math></inline-formula>-normal <inline-formula><mml:math id="Eq216"><mml:mi>F</mml:mi></mml:math></inline-formula>s; my arguments apply to any variation on the contextual restriction.</p></fn>
<fn id="n30"><p>As mentioned in ft. 27, Cohen (<xref ref-type="bibr" rid="B14">2004</xref>) proposes that generics <italic>presuppose</italic> their domain is homogenous in the following sense:</p>
<p><list list-type="simple">
<list-item><p>(i) The generic [<inline-formula><mml:math id="Eq217"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Gen</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula>] presupposes that exactly one of the following holds:</p>
<list list-type="simple">
<list-item><p>1. for every psychologically salient partition <inline-formula><mml:math id="Eq218"><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:math></inline-formula> on <inline-formula><mml:math id="Eq219"><mml:mi>&#x03C8;</mml:mi></mml:math></inline-formula>, and for every <inline-formula><mml:math id="Eq220"><mml:mrow><mml:msup><mml:mi>&#x03C8;</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="Eq221"><mml:mrow><mml:mi>P</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x007C;</mml:mo><mml:msup><mml:mi>&#x03C8;</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is high,</p></list-item>
<list-item><p>2. for every psychologically salient partition <inline-formula><mml:math id="Eq222"><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:math></inline-formula> on <inline-formula><mml:math id="Eq223"><mml:mi>&#x03C8;</mml:mi></mml:math></inline-formula>, and for every <inline-formula><mml:math id="Eq224"><mml:mrow><mml:msup><mml:mi>&#x03C8;</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="Eq225"><mml:mrow><mml:mi>P</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x007C;</mml:mo><mml:msup><mml:mi>&#x03C8;</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is low. (<xref ref-type="bibr" rid="B14">Cohen, 2004, 531</xref>)</p></list-item>
</list>
</list-item>
</list></p>
<p>On a natural understanding of this view, a generic <inline-formula><mml:math id="Eq226"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mtext>Gen</mml:mtext><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula> is true, if for every psychologically salient partition <inline-formula><mml:math id="Eq227"><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:math></inline-formula> on <inline-formula><mml:math id="Eq228"><mml:mi>&#x03C8;</mml:mi></mml:math></inline-formula>, and for every <inline-formula><mml:math id="Eq229"><mml:mrow><mml:msup><mml:mi>&#x03C8;</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="Eq230"><mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x007C;</mml:mo><mml:msup><mml:mi>&#x03C8;</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&gt;</mml:mo><mml:mn>0.5</mml:mn></mml:mrow></mml:math></inline-formula>; the generic is false, if for every psychologically salient partition <inline-formula><mml:math id="Eq231"><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:math></inline-formula> on <inline-formula><mml:math id="Eq232"><mml:mi>&#x03C8;</mml:mi></mml:math></inline-formula>, and for every <inline-formula><mml:math id="Eq233"><mml:mrow><mml:msup><mml:mi>&#x03C8;</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="Eq234"><mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x007C;</mml:mo><mml:msup><mml:mi>&#x03C8;</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&lt;</mml:mo><mml:mn>0.5</mml:mn></mml:mrow></mml:math></inline-formula>; otherwise, it is undefined. Consequently, it should be clear Cohen&#8217;s <xref ref-type="bibr" rid="B14">2004</xref> is not equivalent to his earlier <xref ref-type="bibr" rid="B12">1999a</xref>; <xref ref-type="bibr" rid="B13">1999b</xref> theory. Furthermore, <xref ref-type="bibr" rid="B14">Cohen&#8217;s 2004</xref> implementation of homogeneity validates GEM for broadly similar reasons to von Fintel&#8217;s. Consequently, I think this proposal should be rejected, although I want to stress that most of his paper remains untouched by this objection.</p></fn>
<fn id="n31"><p>It&#8217;s unclear whether von Fintel must assume that Homogeneity is a presupposition for his theory of <italic>only</italic>-sentences (cf. <xref ref-type="bibr" rid="B56">von Fintel, 1997, 35</xref>). For example, Krifka (<xref ref-type="bibr" rid="B34">1996</xref>) treats homogeneity as a kind of pragmatic strengthening, rather than a presupposition. This approach accommodates our favourable intuitions towards GEM without validating it.</p></fn>
<fn id="n32"><p>Numerous places in Nickel&#8217;s informal remarks strongly suggest he intends his homogeneity principle to be an entitlement, such as the following: &#8220;The principle to enforce the sort of homogeneity I just described informally is simply the inference from claims of the form instantiated by [(5a)] to claims of the form instantiated by [(8)] are <italic>always valid</italic>&#8221; (<xref ref-type="bibr" rid="B51">Nickel, 2016, 129</xref>; my <italic>emphasis</italic>); see also Nickel (<xref ref-type="bibr" rid="B50">2010, 489ff.</xref>).</p></fn>
<fn id="n33"><p>Note the relevant reading of (13) involves a disjunctive matrix clause, rather than as a disjunction of generics. That is, the logical form of (13) is <inline-formula><mml:math id="Eq235"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mtext>Gen</mml:mtext><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mrow><mml:mo stretchy='false'>[</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>&#x2228;</mml:mo><mml:mo rspace="0.167em">&#x00AC;</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo stretchy='false'>]</mml:mo></mml:mrow><mml:mo stretchy='false'>]</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:math></inline-formula>, rather than an instance of GEM.</p></fn>
<fn id="n34"><p>For a related argument that Nickel&#8217;s view contradicts <italic>Generic Non-Contradiction</italic> &#8211; that is, the principle according to which all sentences of the form <inline-formula><mml:math id="Eq236"><mml:mrow><mml:mi mathvariant="normal">&#x231C;</mml:mi><mml:mo lspace="0.167em">&#x2062;</mml:mo><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mrow><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mtext>Fs are G</mml:mtext><mml:mo>&#x2227;</mml:mo><mml:mtext>Fs are not-G</mml:mtext></mml:mrow><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x231D;</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula> are valid &#8211; see Hoeltje (<xref ref-type="bibr" rid="B30">2017, pp. 114&#8211;116</xref>).</p></fn>
<fn id="n35"><p>I should like to thank Annie Bosse, Sam Carter, Daisy Dixon, Paul Elbourne, John Hawthorne, Ofra Magidor, Brian Rabern, Daniel Rothschild, and Timothy Williamson for helpful comments and discussion on previous drafts of this paper, as well as to two anonymous reviewers for Philosophers&#8217; Imprint for invaluable comments. This research was partially supported by the Arts and Humanities Research Council Doctoral Studentship (AH/L503885/1) and a Jacobsen Studentship provided by the Royal Institute of Philosophy.</p></fn>
</fn-group>
<ref-list>
<ref id="B1"><mixed-citation publication-type="book"><string-name><surname>Asher</surname>, <given-names>N.</given-names></string-name> and <string-name><given-names>M.</given-names> <surname>Morreau</surname></string-name>. <year>1991</year>. <chapter-title>Commonsense entailment: A modal theory of nonmonotonic reasoning</chapter-title>. In <source>Proceedings of the 12th International Joint Conference on Artifical Intelligence</source>, eds. <string-name><given-names>J.</given-names> <surname>Mylopoulos</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Reiter</surname></string-name>, <fpage>387</fpage>&#8211;<lpage>392</lpage>. <publisher-loc>San Francisco, CA.</publisher-loc>: <publisher-name>Morgan Kaufman Press</publisher-name>.</mixed-citation></ref>
<ref id="B2"><mixed-citation publication-type="book"><string-name><surname>Asher</surname>, <given-names>N.</given-names></string-name> and M. Morreau. <year>1995</year>. <chapter-title>What some generic sentences mean</chapter-title>. In <source>The Generic Book</source>, eds. <string-name><given-names>G.</given-names> <surname>Carlson</surname></string-name> and <string-name><given-names>F. J.</given-names> <surname>Pelletier</surname></string-name>, <fpage>300</fpage>&#8211;<lpage>339</lpage>. <publisher-loc>Chicago, IL.</publisher-loc>: <publisher-name>Chicago University Press</publisher-name>.</mixed-citation></ref>
<ref id="B3"><mixed-citation publication-type="book"><string-name><surname>Asher</surname>, <given-names>N.</given-names></string-name> and <string-name><given-names>F. J.</given-names> <surname>Pelletier</surname></string-name>. <year>2013</year>. <chapter-title>More truths about generics</chapter-title>. In <source>Genericity</source>, eds. <string-name><given-names>A.</given-names> <surname>Mari</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Beyssade</surname></string-name>, and <string-name><given-names>F.</given-names> <surname>del Prete</surname></string-name>, <fpage>312</fpage>&#8211;<lpage>333</lpage>. <publisher-loc>Oxford</publisher-loc>: <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="B4"><mixed-citation publication-type="journal"><string-name><surname>Barker</surname>, <given-names>C.</given-names></string-name> <year>1996</year>. <article-title>Presuppositions for proportional quantifiers</article-title>. <source>Natural Language Semantics</source> <volume>4</volume>(<issue>3</issue>): <fpage>237</fpage>&#8211;<lpage>259</lpage>.</mixed-citation></ref>
<ref id="B5"><mixed-citation publication-type="book"><string-name><surname>Berman</surname>, <given-names>S.</given-names></string-name> <year>1987</year>. <chapter-title>Situation-based semantics for adverbs of quantification</chapter-title>. In <source>Issues in Semantics, Volume 12 of University of Massachusetts Occassional Papers in Linguistics</source>, <fpage>45</fpage>&#8211;<lpage>68</lpage>. <publisher-loc>Amherst, MA.</publisher-loc>: <publisher-name>Graduate Linguistic Student Association</publisher-name>.</mixed-citation></ref>
<ref id="B6"><mixed-citation publication-type="thesis"><string-name><surname>Carlson</surname>, <given-names>G. N.</given-names></string-name> <year>1977a</year>. <source>Reference to Kinds in English</source>. Ph. D. thesis, <publisher-name>University of Massachusetts</publisher-name>, <publisher-loc>Amherst, MA</publisher-loc>.</mixed-citation></ref>
<ref id="B7"><mixed-citation publication-type="journal"><string-name><surname>Carlson</surname>, <given-names>G. N.</given-names></string-name> <year>1977b</year>. <article-title>A unified analysis of the English bare plural</article-title>. <source>Linguistics and Philosophy</source> <volume>1</volume>(<issue>3</issue>): <fpage>413</fpage>&#8211;<lpage>457</lpage>.</mixed-citation></ref>
<ref id="B8"><mixed-citation publication-type="book"><string-name><surname>Carlson</surname>, <given-names>G. N.</given-names></string-name> <year>1989</year>. <chapter-title>On the semantic composition of English generic sentences</chapter-title>. In <source>Properties, Types and Meaning</source>, eds. <string-name><given-names>G.</given-names> <surname>Chierchia</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Partee</surname></string-name>, and <string-name><given-names>R.</given-names> <surname>Turner</surname></string-name>, <fpage>167</fpage>&#8211;<lpage>192</lpage>. <publisher-loc>Dordrecht</publisher-loc>: <publisher-name>Kluwer Academic Publishers</publisher-name>.</mixed-citation></ref>
<ref id="B9"><mixed-citation publication-type="journal"><string-name><surname>Chierchia</surname>, <given-names>G.</given-names></string-name> <year>1998</year>. <article-title>Reference to kinds across language</article-title>. <source>Natural Language Semantics</source> <volume>6</volume>(<issue>4</issue>): <fpage>339</fpage>&#8211;<lpage>405</lpage>.</mixed-citation></ref>
<ref id="B10"><mixed-citation publication-type="thesis"><string-name><surname>Cohen</surname>, <given-names>A.</given-names></string-name> <year>1996</year>. <source>Think Generic: The Meaning and Use of Generic Sentences</source>. Ph. D. thesis, <publisher-name>Carnegie Mellon University</publisher-name>, <publisher-loc>Pittsburgh, PA</publisher-loc>.</mixed-citation></ref>
<ref id="B11"><mixed-citation publication-type="journal"><string-name><surname>Cohen</surname>, <given-names>A.</given-names></string-name> <year>1997</year>. <article-title>Default reasoning and generics</article-title>. <source>Computational Intelligence</source> <volume>13</volume>(<issue>4</issue>): <fpage>506</fpage>&#8211;<lpage>533</lpage>.</mixed-citation></ref>
<ref id="B12"><mixed-citation publication-type="journal"><string-name><surname>Cohen</surname>, <given-names>A.</given-names></string-name> <year>1999a</year>. <article-title>Generics, frequency adverbs, and probability</article-title>. <source>Linguistics and Philosophy</source> <volume>22</volume>(<issue>3</issue>): <fpage>221</fpage>&#8211;<lpage>253</lpage>.</mixed-citation></ref>
<ref id="B13"><mixed-citation publication-type="book"><string-name><surname>Cohen</surname>, <given-names>A.</given-names></string-name> <year>1999b</year>. <source>Think Generic!: The Meaning and Use of Generic Sentences</source>. <publisher-loc>Cambridge</publisher-loc>: <publisher-name>Cambridge University Press</publisher-name>.</mixed-citation></ref>
<ref id="B14"><mixed-citation publication-type="journal"><string-name><surname>Cohen</surname>, <given-names>A.</given-names></string-name> <year>2004</year>. <article-title>Generics and mental representations</article-title>. <source>Linguistics and Philosophy</source> <volume>27</volume>(<issue>5</issue>): <fpage>529</fpage>&#8211;<lpage>556</lpage>.</mixed-citation></ref>
<ref id="B15"><mixed-citation publication-type="book"><string-name><surname>Cohen</surname>, <given-names>A.</given-names></string-name> <year>2013</year>. <chapter-title>No quantification without reinterpretation</chapter-title>. In <source>Genericity</source>, eds. <string-name><given-names>A.</given-names> <surname>Mari</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Beyssade</surname></string-name>, and <string-name><given-names>F.</given-names> <surname>del Prete</surname></string-name>, <fpage>334</fpage>&#8211;<lpage>351</lpage>. <publisher-loc>Oxford</publisher-loc>: <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="B16"><mixed-citation publication-type="journal"><string-name><surname>Collins</surname>, <given-names>J.</given-names></string-name> <year>2018</year>. <article-title>Genericity sans Gen</article-title>. <source>Mind &amp; Language</source> <volume>33</volume>(<issue>1</issue>): <fpage>34</fpage>&#8211;<lpage>64</lpage>.</mixed-citation></ref>
<ref id="B17"><mixed-citation publication-type="book"><string-name><surname>Dahl</surname>, <given-names>&#214;.</given-names></string-name> <year>1975</year>. <chapter-title>On generics</chapter-title>. In <source>Formal Semantics of Natural Language</source>, ed. <string-name><given-names>E.</given-names> <surname>Keenan</surname></string-name>, <fpage>99</fpage>&#8211;<lpage>111</lpage>. <publisher-loc>Cambridge</publisher-loc>: <publisher-name>Cambridge University Press</publisher-name>.</mixed-citation></ref>
<ref id="B18"><mixed-citation publication-type="journal"><string-name><surname>Dayal</surname>, <given-names>V.</given-names></string-name> <year>1992</year>. <article-title>The singular-plural distinction in Hindi generics</article-title>. <source>Semantics and Linguistic Theory</source> <volume>2</volume>(<issue>0</issue>): <fpage>39</fpage>&#8211;<lpage>58</lpage>.</mixed-citation></ref>
<ref id="B19"><mixed-citation publication-type="book"><string-name><surname>Dayal</surname>, <given-names>V.</given-names></string-name> <year>1999</year>. <chapter-title>Bare NPs, reference to kinds, and incorporation</chapter-title>. In <source>Proceedings from Semantics and Linguistics Theory 9</source>, eds. <string-name><given-names>T.</given-names> <surname>Matthews</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Strolovitch</surname></string-name>, <fpage>34</fpage>&#8211;<lpage>51</lpage>. <publisher-loc>Ithaca, N.Y.</publisher-loc>: <publisher-name>Cornell University Press</publisher-name>.</mixed-citation></ref>
<ref id="B20"><mixed-citation publication-type="journal"><string-name><surname>Dorr</surname>, <given-names>C.</given-names></string-name> <year>2016</year>. <article-title>To be F Is to be G</article-title>. <source>Philosophical Perspectives</source> <volume>30</volume>(<issue>1</issue>): <fpage>39</fpage>&#8211;<lpage>134</lpage>.</mixed-citation></ref>
<ref id="B21"><mixed-citation publication-type="journal"><string-name><surname>Eckardt</surname>, <given-names>R.</given-names></string-name> <year>2000</year>. <article-title>Normal objects, normal worlds and the meaning of generic sentences</article-title>. <source>Journal of Semantics</source> <volume>16</volume>: <fpage>237</fpage>&#8211;<lpage>278</lpage>.</mixed-citation></ref>
<ref id="B22"><mixed-citation publication-type="book"><string-name><surname>Elbourne</surname>, <given-names>P.</given-names></string-name> <year>2005</year>. <source>Situations and Individuals</source>. <publisher-loc>Cambridge, MA.</publisher-loc>: <publisher-name>The MIT Press</publisher-name>.</mixed-citation></ref>
<ref id="B23"><mixed-citation publication-type="book"><string-name><surname>Elbourne</surname>, <given-names>P.</given-names></string-name> <year>2013</year>. <source>Definite Descriptions</source>. <publisher-loc>Oxford</publisher-loc>: <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="B24"><mixed-citation publication-type="thesis"><string-name><surname>Fodor</surname>, <given-names>J.</given-names></string-name> <year>1970</year>. <source>The Linguistic Description of Opaque Contexts</source>. Ph. D. thesis, <publisher-name>MIT</publisher-name>, <publisher-loc>Cambridge, MA</publisher-loc>.</mixed-citation></ref>
<ref id="B25"><mixed-citation publication-type="book"><string-name><surname>Glanzberg</surname>, <given-names>M.</given-names></string-name> <year>2004</year>. <chapter-title>Against Truth-Value Gaps</chapter-title>. In <source>Liars and Heaps</source>, ed. <string-name><given-names>J. C.</given-names> <surname>Beall</surname></string-name>, <fpage>151</fpage>&#8211;<lpage>94</lpage>. <publisher-loc>Oxford</publisher-loc>: <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="B26"><mixed-citation publication-type="book"><string-name><surname>Greenberg</surname>, <given-names>Y.</given-names></string-name> <year>2003</year>. <source>Manifestations of Genericity</source>. <publisher-loc>New York, N.Y.</publisher-loc>: <publisher-name>Routledge</publisher-name>.</mixed-citation></ref>
<ref id="B27"><mixed-citation publication-type="journal"><string-name><surname>Greenberg</surname>, <given-names>Y.</given-names></string-name> <year>2007</year>. <article-title>Exceptions to generics: Where vagueness, context dependence and modality interact</article-title>. <source>Journal of Semantics</source> <volume>24</volume>: <fpage>131</fpage>&#8211;<lpage>167</lpage>.</mixed-citation></ref>
<ref id="B28"><mixed-citation publication-type="journal"><string-name><surname>Heim</surname>, <given-names>I.</given-names></string-name> <year>1990</year>. <article-title>E-type pronouns and donkey anaphora</article-title>. <source>Linguistics and Philosophy</source> <volume>13</volume>(<issue>2</issue>): <fpage>137</fpage>&#8211;<lpage>177</lpage>.</mixed-citation></ref>
<ref id="B29"><mixed-citation publication-type="book"><string-name><surname>Heim</surname>, <given-names>I.</given-names></string-name> and <string-name><given-names>A.</given-names> <surname>Kratzer</surname></string-name>. <year>1998</year>. <source>Semantics in Generative Grammar</source>. <publisher-loc>Oxford</publisher-loc>: <publisher-name>Blackwell Publishers</publisher-name>.</mixed-citation></ref>
<ref id="B30"><mixed-citation publication-type="journal"><string-name><surname>Hoeltje</surname>, <given-names>M.</given-names></string-name> <year>2017</year>. <article-title>Generics and ways of being normal</article-title>. <source>Linguistics and Philosophy</source> <volume>40</volume>(<issue>2</issue>): <fpage>101</fpage>&#8211;<lpage>118</lpage>.</mixed-citation></ref>
<ref id="B31"><mixed-citation publication-type="thesis"><string-name><surname>Kirkpatrick</surname>, <given-names>J. R.</given-names></string-name> <year>2015</year>. <source>New Work for a Theory of Genericity</source>. BPhil Thesis, <publisher-name>University of Oxford</publisher-name>, <publisher-loc>Oxford</publisher-loc>.</mixed-citation></ref>
<ref id="B32"><mixed-citation publication-type="thesis"><string-name><surname>Kirkpatrick</surname>, <given-names>J. R.</given-names></string-name> <year>2019</year>. <source>Essays on Genericity</source>. DPhil Thesis, <publisher-name>University of Oxford</publisher-name>, <publisher-loc>Oxford</publisher-loc>.</mixed-citation></ref>
<ref id="B33"><mixed-citation publication-type="journal"><string-name><surname>Kirkpatrick</surname>, <given-names>J. R.</given-names></string-name> <year>2023</year>. <article-title>Generic conjunctivitis</article-title>. <source>Linguistics and Philosophy</source> <volume>46</volume>(<issue>2</issue>): <fpage>379</fpage>&#8211;<lpage>428</lpage>.</mixed-citation></ref>
<ref id="B34"><mixed-citation publication-type="journal"><string-name><surname>Krifka</surname>, <given-names>M.</given-names></string-name> <year>1996</year>. <article-title>Pragmatic strengthening in plural predications and donkey sentences</article-title>. <source>Semantics and Linguistic Theory</source> <volume>6</volume>: <fpage>136</fpage>&#8211;<lpage>153</lpage>.</mixed-citation></ref>
<ref id="B35"><mixed-citation publication-type="book"><string-name><surname>Krifka</surname>, <given-names>M.</given-names></string-name>, <string-name><given-names>F. J.</given-names> <surname>Pelletier</surname></string-name>, <string-name><given-names>A.</given-names> <surname>ter Meulen</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Chierchia</surname></string-name>, and <string-name><given-names>G.</given-names> <surname>Link</surname></string-name>. <year>1995</year>. <chapter-title>Genericity: An introduction</chapter-title>. In <source>The Generic Book</source>, eds. <string-name><given-names>G. N.</given-names> <surname>Carlson</surname></string-name> and <string-name><given-names>F. J.</given-names> <surname>Pelletier</surname></string-name>, <fpage>1</fpage>&#8211;<lpage>124</lpage>. <publisher-loc>Chicago, IL.</publisher-loc>: <publisher-name>Chicago University Press</publisher-name>.</mixed-citation></ref>
<ref id="B36"><mixed-citation publication-type="book"><string-name><surname>Kri&#382;</surname>, <given-names>M.</given-names></string-name> <year>2015</year>. <source>Aspects of Homogeneity in the Semantics of Natural Language</source>. Ph. D. thesis, <publisher-name>University of Vienna</publisher-name>, <publisher-loc>Vienna</publisher-loc>.</mixed-citation></ref>
<ref id="B37"><mixed-citation publication-type="book"><string-name><surname>Lawler</surname>, <given-names>J. M.</given-names></string-name> <year>1972</year>. <chapter-title>Generic to a fault</chapter-title>. In <source>Papers from the Eighth Annual Meeting, Chicago Linguistic Society</source>, <fpage>247</fpage>&#8211;<lpage>258</lpage>. <publisher-loc>Chicago, IL.</publisher-loc>: <publisher-name>Chicago Linguistics Society</publisher-name>.</mixed-citation></ref>
<ref id="B38"><mixed-citation publication-type="journal"><string-name><surname>Leslie</surname>, <given-names>S.-J.</given-names></string-name> <year>2007</year>. <article-title>Generics and the structure of the mind</article-title>. <source>Philosophical Perspectives</source> <volume>21</volume>(<issue>1</issue>): <fpage>375</fpage>&#8211;<lpage>403</lpage>.</mixed-citation></ref>
<ref id="B39"><mixed-citation publication-type="journal"><string-name><surname>Leslie</surname>, <given-names>S.-J.</given-names></string-name> <year>2008</year>. <article-title>Generics: Cognition and acquisition</article-title>. <source>The Philosophical Review</source> <volume>117</volume>(<issue>1</issue>): <fpage>1</fpage>&#8211;<lpage>47</lpage>.</mixed-citation></ref>
<ref id="B40"><mixed-citation publication-type="journal"><string-name><surname>Leslie</surname>, <given-names>S.-J.</given-names></string-name> <year>2015</year>. <article-title>Generics oversimplifi ed</article-title>. <source>No&#251;s</source> <volume>49</volume>(<issue>1</issue>): <fpage>28</fpage>&#8211;<lpage>54</lpage>.</mixed-citation></ref>
<ref id="B41"><mixed-citation publication-type="book"><string-name><surname>Lewis</surname>, <given-names>D.</given-names></string-name> <year>1975</year>. <chapter-title>Adverbs of quantification</chapter-title>. In <source>Formal Semantics of Natural Language</source>, ed. <string-name><given-names>E. L.</given-names> <surname>Keenan</surname></string-name>, <fpage>3</fpage>&#8211;<lpage>15</lpage>. <publisher-loc>Cambridge</publisher-loc>: <publisher-name>Cambridge University Press</publisher-name>.</mixed-citation></ref>
<ref id="B42"><mixed-citation publication-type="journal"><string-name><surname>Liebesman</surname>, <given-names>D.</given-names></string-name> <year>2011</year>. <article-title>Simple generics</article-title>. <source>No&#251;s</source> <volume>45</volume>(<issue>3</issue>): <fpage>409</fpage>&#8211;<lpage>442</lpage>.</mixed-citation></ref>
<ref id="B43"><mixed-citation publication-type="journal"><string-name><surname>Liebesman</surname>, <given-names>D.</given-names></string-name> and <string-name><given-names>O.</given-names> <surname>Magidor</surname></string-name>. <year>2017</year>. <article-title>Copredication and property inheritance</article-title>. <source>Philosophical Issues</source> <volume>27</volume>(<issue>1</issue>): <fpage>131</fpage>&#8211;<lpage>166</lpage>.</mixed-citation></ref>
<ref id="B44"><mixed-citation publication-type="book"><string-name><surname>Liebesman</surname>, <given-names>D.</given-names></string-name> and <string-name><given-names>O.</given-names> <surname>Magidor</surname></string-name>. <year>2025</year>. <source>Property Versatility and Copredication</source>. <publisher-loc>Oxford</publisher-loc>: <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="B45"><mixed-citation publication-type="journal"><string-name><surname>Liebesman</surname>, <given-names>D.</given-names></string-name> and <string-name><given-names>R. K.</given-names> <surname>Sterken</surname></string-name>. <year>2021</year>. <article-title>Generics and the metaphysics of kinds</article-title>. <source>Philosophy Compass</source> <volume>16</volume>(<issue>7</issue>): <elocation-id>e12754</elocation-id>.</mixed-citation></ref>
<ref id="B46"><mixed-citation publication-type="journal"><string-name><surname>L&#246;bner</surname>, <given-names>S.</given-names></string-name> <year>1985</year>. <article-title>Definites</article-title>. <source>Journal of Semantics</source> <volume>4</volume>(<issue>4</issue>): <fpage>279</fpage>&#8211;<lpage>326</lpage>.</mixed-citation></ref>
<ref id="B47"><mixed-citation publication-type="book"><string-name><surname>Magidor</surname>, <given-names>O.</given-names></string-name> <year>2013</year>. <source>Category Mistakes</source>. <publisher-loc>Oxford</publisher-loc>: <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="B48"><mixed-citation publication-type="book"><string-name><surname>Mari</surname>, <given-names>A.</given-names></string-name>, <string-name><given-names>C.</given-names> <surname>Beyssade</surname></string-name>, and <string-name><given-names>F.</given-names> <surname>del Prete</surname></string-name>. <year>2013</year>. <chapter-title>Introduction</chapter-title>. In <source>Genericity</source>, eds. <string-name><given-names>A.</given-names> <surname>Mari</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Beyssade</surname></string-name>, and <string-name><given-names>F.</given-names> <surname>del Prete</surname></string-name>, <fpage>1</fpage>&#8211;<lpage>92</lpage>. <publisher-loc>Oxford</publisher-loc>: <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="B49"><mixed-citation publication-type="journal"><string-name><surname>Nickel</surname>, <given-names>B.</given-names></string-name> <year>2009</year>. <article-title>Generics and the ways of normality</article-title>. <source>Linguistics and Philosophy</source> <volume>31</volume>(<issue>6</issue>): <fpage>629</fpage>&#8211;<lpage>648</lpage>.</mixed-citation></ref>
<ref id="B50"><mixed-citation publication-type="journal"><string-name><surname>Nickel</surname>, <given-names>B.</given-names></string-name> <year>2010</year>. <article-title>Generically free choice</article-title>. <source>Linguistics and Philosophy</source> <volume>33</volume>: <fpage>479</fpage>&#8211;<lpage>512</lpage>.</mixed-citation></ref>
<ref id="B51"><mixed-citation publication-type="book"><string-name><surname>Nickel</surname>, <given-names>B.</given-names></string-name> <year>2016</year>. <source>Between Logic and the World: An Integrated Theory of Generics</source>. <publisher-loc>Oxford</publisher-loc>: <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="B52"><mixed-citation publication-type="book"><string-name><surname>Pelletier</surname>, <given-names>F. J.</given-names></string-name> and <string-name><given-names>N.</given-names> <surname>Asher</surname></string-name>. <year>1997</year>. <chapter-title>Generics and defaults</chapter-title>. In <source>Handbook of Logic and Language</source>, eds. <string-name><given-names>J.</given-names> <surname>van Benthem</surname></string-name> and <string-name><given-names>A.</given-names> <surname>ter Meulen</surname></string-name>, <fpage>1125</fpage>&#8211;<lpage>1177</lpage>. <publisher-loc>Cambridge, MA.</publisher-loc>: <publisher-name>The MIT Press</publisher-name>.</mixed-citation></ref>
<ref id="B53"><mixed-citation publication-type="journal"><string-name><surname>Sterken</surname>, <given-names>R. K.</given-names></string-name> <year>2016</year>. <article-title>Generics, covert structure and Logical Form</article-title>. <source>Mind &amp; Language</source> <volume>31</volume>(<issue>5</issue>): <fpage>503</fpage>&#8211;<lpage>529</lpage>.</mixed-citation></ref>
<ref id="B54"><mixed-citation publication-type="journal"><string-name><surname>Teichman</surname>, <given-names>M.</given-names></string-name> <year>2023</year>. <article-title>The sophisticated kind theory</article-title>. <source>Inquiry</source> <volume>66</volume>: <fpage>1613</fpage>&#8211;<lpage>1654</lpage>.</mixed-citation></ref>
<ref id="B55"><mixed-citation publication-type="book"><string-name><surname>Thomason</surname>, <given-names>R. H.</given-names></string-name> <year>1984</year>. <chapter-title>Combinations of Tense and Modality</chapter-title>. In <source>Handbook of Philosophical Logic</source>, eds. <string-name><given-names>D. M.</given-names> <surname>Gabbay</surname></string-name> and <string-name><given-names>F.</given-names> <surname>Guenthner</surname></string-name>, Volume <volume>II</volume>, <fpage>205</fpage>&#8211;<lpage>234</lpage>. <publisher-loc>Dordrecht</publisher-loc>: <publisher-name>Reidel</publisher-name>.</mixed-citation></ref>
<ref id="B56"><mixed-citation publication-type="journal"><string-name><surname>von Fintel</surname>, <given-names>K.</given-names></string-name> <year>1997</year>. <article-title>Bare plurals, bare conditionals and <italic>only</italic></article-title>. <source>Journal of Semantics</source> <volume>14</volume>: <fpage>1</fpage>&#8211;<lpage>56</lpage>.</mixed-citation></ref>
<ref id="B57"><mixed-citation publication-type="book"><string-name><surname>von Fintel</surname>, <given-names>K.</given-names></string-name> <year>2004a</year>. <chapter-title>A minimal theory of adverbial quantification</chapter-title>. In <source>Context Dependence in the Analysis of Linguistic Meaning</source>, eds. <string-name><given-names>B.</given-names> <surname>Partee</surname></string-name> and <string-name><given-names>H.</given-names> <surname>Kamp</surname></string-name>, <fpage>137</fpage>&#8211;<lpage>175</lpage>. <publisher-loc>Amsterdam</publisher-loc>: <publisher-name>Elsevier</publisher-name>.</mixed-citation></ref>
<ref id="B58"><mixed-citation publication-type="book"><string-name><surname>von Fintel</surname>, <given-names>K.</given-names></string-name> <year>2004b</year>. <chapter-title>Would you believe it? The King of France is back! (Presuppositions and truth-value intuitions)</chapter-title>. In <source>Descriptions and Beyond</source>, eds. <string-name><given-names>M.</given-names> <surname>Reimer</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Bezuidenhout</surname></string-name>, <fpage>315</fpage>&#8211;<lpage>341</lpage>. <publisher-loc>Oxford</publisher-loc>: <publisher-name>Clarendon Press</publisher-name>.</mixed-citation></ref>
<ref id="B59"><mixed-citation publication-type="book"><string-name><surname>Williamson</surname>, <given-names>T.</given-names></string-name> <year>1994</year>. <source>Vagueness</source>. <publisher-loc>London</publisher-loc>: <publisher-name>Routledge</publisher-name>.</mixed-citation></ref>
<ref id="B60"><mixed-citation publication-type="journal"><string-name><surname>Yoon</surname>, <given-names>Y.</given-names></string-name> <year>1996</year>. <article-title>Total and partial predicates and the weak and strong interpretations</article-title>. <source>Natural Language Semantics</source> <volume>4</volume>(<issue>3</issue>): <fpage>217</fpage>&#8211;<lpage>236</lpage>.</mixed-citation></ref>
</ref-list>
</back>
</article>