<?xml version="1.0" encoding="utf-8"?>
<article xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:noNamespaceSchemaLocation="JATS-journalpublishing1-mathml3.xsd" dtd-version="1.2" article-type="Article">
<front>
<journal-meta>
<journal-id journal-id-type="nlm-ta">ergo</journal-id>
<journal-title-group>
<journal-title>Ergo an Open Access Journal of Philosophy</journal-title>
</journal-title-group>
<issn pub-type="epub">2330-4014</issn>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">1149</article-id>
<article-id pub-id-type="manuscript">8_12/CummingWinans_Counterfactuals.tex,8_12/CummingWinans_Counterfactuals.pdf</article-id>
<article-id pub-id-type="doi">10.3998/ergo.1149</article-id>
<title-group>
<article-title>C<sc>ounterfactuals and</sc> A<sc>bduction</sc></article-title>
<alt-title alt-title-type="running-head-verso">Counterfactuals and Abduction</alt-title>
<alt-title alt-title-type="running-head-recto">Samuel Cumming and Lauren Winans</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes" equal-contrib="yes">
<name>
<surname>CUMMING</surname>
<given-names>SAMUEL</given-names>
</name>
<email>sam.cumming@gmail.com</email>
<xref rid="aff1" ref-type="aff"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>WINANS</surname>
<given-names>LAUREN</given-names>
</name>
<email>laurenwinans@gmail.com</email>
<xref rid="aff2" ref-type="aff"/>
</contrib>
</contrib-group>
<aff id="aff1">
<institution>UCLA Philosophy</institution>
<institution content-type="position"></institution>
<institution content-type="dept"></institution>
<addr-line content-type="addrline1"></addr-line>
<country></country>
<addr-line content-type="city"></addr-line>
<addr-line content-type="zipcode"></addr-line>
<phone content-type="primary"></phone>
</aff>
<aff id="aff2">
<institution>UCLA Linguistics</institution>
<institution content-type="position"></institution>
<institution content-type="dept"></institution>
<addr-line content-type="addrline1"></addr-line>
<country></country>
<addr-line content-type="city"></addr-line>
<addr-line content-type="zipcode"></addr-line>
<phone content-type="primary"></phone>
</aff>
<pub-date>
<day>30</day>
<month>06</month>
<year>2021</year>
</pub-date>
<volume>8</volume>
<issue>1</issue>
<history>
<date date-type="received">
<day></day>
<month></month>
<year></year>
</date>
<date date-type="rev-recd">
<day></day>
<month></month>
<year></year>
</date>
<date date-type="accepted">
<day></day>
<month></month>
<year></year>
</date>
</history>
<permissions>
<license><license-p>CC BY-NC-ND 4.0</license-p></license>
</permissions>
<abstract id="ABS1">
<p id="P1">We argue that counterfactuals and indicative conditionals are not so different. Certain notorious differences previously observed between pairs of indicative and counterfactual sentences are actually due to the presence of an anti-abductive modal auxiliary (<italic>would</italic>) in the consequent of the counterfactual. But such auxiliaries, of which <italic>will</italic> is another example, span the counterfactual-indicative divide.</p>
</abstract>
<funding-group />
<counts>
<fig-count count="3" />
</counts>
<custom-meta-group>
<custom-meta id="competing-interest">
<meta-name></meta-name>
<meta-value></meta-value>
</custom-meta>
</custom-meta-group>
</article-meta>
</front>
<body>
<sec id="S1">
<label>1.</label><title>Overview</title>
<p id="P2">Those with an interest in the topic will concur that special rules apply when reasoning from a <sc>counterfactual</sc> hypothesis. Statements that are not so closely tied to the way things <italic>happen to be</italic> would appear to tell us more, by a kind of accommodation, about the way things <italic>generally go</italic>.<sup><xref rid="fn1" ref-type="fn">1</xref></sup> The apparently <italic>non-epistemic</italic> nature of counterfactual modality has, moreover, spurred philosophers in their search for objective (or &#x201C;metaphysical&#x201D;) underpinnings of necessity and possibility (e.g., <xref rid="R34" ref-type="bibr">Kment 2014</xref>; <xref rid="R65" ref-type="bibr">Williamson 2007</xref>).</p>
<p id="P3">Logical and metaphysical theses about counterfactuality invariably draw on linguistic evidence concerning the use of the counterfactual conditional <italic>sentence</italic>. Some of the characteristic features of counterfactual reasoning and modality can be extracted, it is thought, from a side-by-side comparison with a contrasting indicative form (cf. <xref rid="R2" ref-type="bibr">Adams 1970</xref>):<sup><xref rid="fn2" ref-type="fn">2</xref></sup>
<table-wrap id="T1a" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="2" align="left" valign="top">(1)</td>
<td align="left" valign="top">a.</td>
<td align="left" valign="top">If Pennie is at that bus stop, she is wearing a hat.</td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top">If Pennie <italic>were</italic> at that bus stop, she <italic>would be</italic> wearing a hat. (<xref rid="R27" ref-type="bibr">Humberstone 2011</xref>: 927)</td>
</tr>
</tbody>
</table>
</table-wrap>
In the pair above, the counterfactual sentence (1b) differs from the indicative (1a) in two respects:<sup><xref rid="fn3" ref-type="fn">3</xref></sup> the verb in the antecedent (<italic>were</italic>) carries a form of counterfactual marking, and the consequent contains an auxiliary (<italic>would</italic>) before the verb. A baseline difference in use is that the counterfactual (1b) is felicitous even when its antecedent is known to be false (i.e., when Pennie is known <italic>not</italic> to be at the bus stop). The indicative (1a) is inappropriate if this is the case.<sup><xref rid="fn4" ref-type="fn">4</xref></sup></p>
<p id="P4">But there is a further difference between the two, which will concern us here. Observe that the conditionals in (1) are, in a sense, <italic>enthymematic</italic>. Both require supplementation by further facts about the situation to complete the argument from antecedent to consequent. As it turns out, this <italic>factual supplementation</italic> is restricted, in a particular way, for (1b). There is no similar restriction on (1a).<sup><xref rid="fn5" ref-type="fn">5</xref></sup></p>
<p id="P5">The indicative conditional (1a) would be a natural utterance for one who, surveying the bus stop, saw that <italic>everyone there was wearing a hat</italic>. Yet the same observation cannot bridge the gap in the counterfactual conditional (1b). Instead, one would need to know, for instance, that <italic>it was Pennie&#x2019;s custom to put on a hat when venturing outside</italic>. While the first supplementary fact is a correlation that could well be random (&#x201C;the way things happen to be&#x201D;), the second is a more robust behavioural trait (&#x201C;the way things tend to go&#x201D;). As an initial pass, then, (1b) is restricted to supplementation by generalizations of the more robust sort.</p>
<p id="P6">Theorists have assumed the restriction on (1b) is general to all counterfactual conditionals, and is attributable specifically to (1b)&#x2019;s <italic>counterfactuality</italic>.<sup><xref rid="fn6" ref-type="fn">6</xref></sup> Indeed, the following theoretical views are commonplace, or at least prominently represented, in the literature:<sup><xref rid="fn7" ref-type="fn">7</xref></sup></p>
<list list-type="bullet" id="L1">
<list-item><p id="P7">Indicative conditionals, such as (1a), are <italic>epistemic</italic> modals (ranging over worlds that are epistemically possible).</p></list-item>
<list-item><p id="P8">Counterfactual conditionals, such as (1b), are, by contrast, <italic>metaphysical</italic> modals (ranging over worlds that are metaphysically possible).</p></list-item>
<list-item><p id="P9">Indicative conditionals are evaluated by reasoning from a knowledge base that may contain <italic>highly contingent facts</italic>.</p></list-item>
<list-item><p id="P10">Counterfactual conditionals are evaluated by (hypothetically) changing the world in a certain respect and determining what other changes follow from that one by <italic>general laws</italic>.</p></list-item>
</list>
<p id="P11">These views, when properly spelled out, are able to predict the pattern just instanced: (1b) must be supplemented by something resembling a general law of hat-wearing, while it is okay to link the clauses of (1a) by a non-lawlike generalization that happens to hold.</p>
<p id="P12">In this paper, we challenge the initial claim that the restriction on (1b) is characteristic of all and only counterfactuals, and hence the general assumption that the linguistic evidence in (1) bears on counterfactuality <italic>per se</italic>. As we will see, the same restriction occurs on certain modals that would be classified as <italic>epistemic</italic> and whose prejacents are inferred to hold <italic>in actuality</italic>. One such modal is (a particular use of) the English auxiliary <italic>will</italic>. This modal&#x2014;the subject of Winans (2016)&#x2014;is of particular interest, since it is the present tense counterpart of <italic>would</italic>, the auxiliary occurring in the consequent of (1b) (cf. <xref rid="R17" ref-type="bibr">Dudman 2001</xref>: 122&#x2013;23).</p>
<p id="P13">To demonstrate the same restriction for <italic>will</italic>, we return to the case of Pennie and the bus stop. Like the indicative conditional (1a), sentence (2a) is appropriate in a context where we can see that everyone at the bus stop is wearing a hat, and we know that, although we haven&#x2019;t spotted her yet, Pennie is among them. But in the same circumstances, (2b) is not appropriate. It improves if, instead of deriving the conclusion from what is visible at the bus stop, the speaker knows that Pennie wears a hat by habit.</p>
<table-wrap id="T2" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="2" align="left" valign="top">(2)</td>
<td align="left" valign="top">a.</td>
<td align="left" valign="top">Pennie must be wearing a hat.</td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top">Pennie will be wearing a hat.</td>
</tr>
</tbody>
</table>
</table-wrap>
<p id="P14">This parallel between (2b) and (1b), and the fact that they contain related modal auxiliaries, convinces us that, in the case of (1b), the restriction is due to the <italic>choice of auxiliary</italic> in the consequent, rather than its counterfactuality. Indeed, we are attracted by the following suite of claims:
<list list-type="bullet" id="L2">
<list-item><p id="P15"><italic>will</italic> and <italic>would</italic> apply the same constraint to their prejacent, namely <sc>anti-abductivity</sc> (to be introduced in <xref rid="S2" ref-type="sec">&#x00A7;2</xref>).</p></list-item>
<list-item><p id="P16">The anti-abductivity common to <italic>will</italic> and <italic>would</italic> is responsible for the relevant difference between (1a) and (1b), and many similar pairs that have led theorists to assign a distinctive status to counterfactuals.</p></list-item>
<list-item><p id="P17">Just as there are alternatives to <italic>will</italic> that are not anti-abductive (e.g., <italic>must</italic>), so are there alternatives to <italic>would</italic> in the consequent of a counterfactual conditional that are not anti-abductive, including (in English) the auxiliary cluster &#x2018;would have (to)&#x2019;.</p></list-item>
<list-item><p id="P18">The abductive/anti-abductive distinction does not pertain to the <italic>source</italic> of supplementary premises (i.e., the Kratzerian modal base and ordering source), and consequently should not be taken as a distinction in <italic>modality</italic>, along the lines of the epistemic/deontic distinction. It is instead a (fine-grained) difference in <sc>evidential status</sc>, more like the inferential/testimonial distinction.</p></list-item>
</list></p>
<p id="P19">We begin the argument in the next section with a detailed discussion of anti-abductivity in inferential <italic>will</italic> based on <xref rid="R66" ref-type="bibr">Winans (2016)</xref>. Following that we show that <italic>will&#x2019;s</italic> anti-abductive constraint also fits counterfactuals with <italic>would</italic> in the consequent.</p>
</sec>
<sec id="S2">
<label>2.</label><title>Introducing Anti-Abductivity</title>
<p id="P20">The English auxiliary <italic>will</italic>, familiarly, marks the future. But it has a second use as an <sc>inferential</sc> modal, where its occurrence is consistent with a <italic>present</italic> temporal interpretation of the embedded clause. The second use is clearly in force when that clause is stative and modified by <italic>now</italic>, as in &#x2018;Alma will be home now&#x2019;.<sup><xref rid="fn8" ref-type="fn">8</xref></sup></p>
<p id="P21">Inferential <italic>will</italic> is a necessity modal, similar to <italic>must</italic>.<sup><xref rid="fn9" ref-type="fn">9</xref></sup> Necessity modals, according to a prominent line of analysis, are operators that claim their prejacent (i.e., operand) <italic>follows from</italic> a particular set of premises.<sup><xref rid="fn10" ref-type="fn">10</xref></sup> Observe that neither &#x2018;will <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M141"><mml:mrow><mml:mi>P</mml:mi></mml:mrow></mml:math></inline-formula>&#x2019; nor &#x2018;must <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M142"><mml:mrow><mml:mi>P</mml:mi></mml:mrow></mml:math></inline-formula>&#x2019; is felicitous when <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M143"><mml:mrow><mml:mi>P</mml:mi></mml:mrow></mml:math></inline-formula> is established &#x201C;directly&#x201D; by the senses:
<table-wrap id="T3" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="3" align="left" valign="top">(3)</td>
<td colspan="2" align="left" valign="top"><italic>Watching rain fall from the sky</italic>.</td>
</tr>
<tr>
<td align="left" valign="top">a.</td>
<td align="left" valign="top">#It must be raining. (<xref rid="R30" ref-type="bibr">Karttunen 1972</xref>)</td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top">#It will be raining (now). (<xref rid="R66" ref-type="bibr">Winans 2016</xref>: 19)</td>
</tr>
</tbody>
</table>
</table-wrap>
They are used, instead, when the justification for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M144"><mml:mrow><mml:mi>P</mml:mi></mml:mrow></mml:math></inline-formula> is indirect, and specifically <italic>by inference</italic>.<sup><xref rid="fn11" ref-type="fn">11</xref></sup> <italic>Must</italic> and <italic>will</italic> are distinguished by the different demands they place on this licensing inference. As argued in <xref rid="R66" ref-type="bibr">Winans (2016)</xref>, whereas <italic>must</italic> is <sc>anaphoric</sc> and admits <sc>abductive</sc> inferences, <italic>will</italic> is <sc>anti-anaphoric</sc> and <sc>anti-abductive</sc>. We will be concerned with the last of these properties.<sup><xref rid="fn12" ref-type="fn">12</xref></sup></p>
<p id="P22">An <sc>abduction</sc>, for our purposes, is an inference from a proposition to its explanation or cause.<sup><xref rid="fn13" ref-type="fn">13</xref></sup> It may include further premises that are not themselves explained by its conclusion (e.g., the negation of a competing explanation), and the explanation in question may only be partial. But if there is partial explanation of at least one premise by the conclusion of an inference, that inference qualifies as an abduction. Here is a simple illustration:
<table-wrap id="T4" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="3" align="left" valign="top">(4)</td>
<td colspan="2" align="left" valign="top"><italic>Angela knows that her neighbors barbecue often. A friend is over at her house and they both smell smoke. Angela says</italic>:</td>
</tr>
<tr>
<td align="left" valign="top">a.</td>
<td align="left" valign="top">The neighbors must be barbecuing.</td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top">#The neighbors will be barbecuing (now). (<xref rid="R66" ref-type="bibr">Winans 2016</xref>: 1)</td>
</tr>
</tbody>
</table>
</table-wrap>
The claim <italic>the neighbours are barbecuing</italic> explains the observation <italic>it smells of smoke</italic>&#x2014;we can answer the question, &#x2018;Why does it smell of smoke?&#x2019;, with &#x2018;Because the neighbours are barbecuing&#x2019;. It follows that drawing this conclusion from that evidence is an abduction; on the proposal that <italic>will</italic> is anti-abductive, the infelicity of (4b) is therefore expected.<sup><xref rid="fn14" ref-type="fn">14</xref></sup></p>
<p id="P23">If the inference goes from cause to effect instead, <italic>will</italic> is felicitous:
<table-wrap id="T5" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="3" align="left" valign="top">(5)</td>
<td colspan="2" align="left" valign="top"><italic>Angela and Matt know that their neighbors barbecue every Friday night. While away from home, Angela realizes it&#x2019;s Friday night. She says to Matt</italic>:</td>
</tr>
<tr>
<td align="left" valign="top">a.</td>
<td align="left" valign="top">?The neighbors must be barbecuing.</td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top">The neighbors will be barbecuing (now). (<xref rid="R66" ref-type="bibr">Winans 2016</xref>: 2)</td>
</tr>
</tbody>
</table>
</table-wrap>
Here the prejacent has no part in the explanation of the premise: it is not Friday night <italic>because</italic> the neighbours are barbecuing (instead, the neighbours are barbecuing <italic>because</italic> it is Friday night).</p>
<p id="P24">Note the explanatory relationship does not have to be causal for the inference to be an abduction:<sup><xref rid="fn15" ref-type="fn">15</xref></sup></p>
<table-wrap id="T6" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="3" align="left" valign="top">(6)</td>
<td colspan="2" align="left" valign="top"><italic>An inventory of the coins that have fallen down the back of the sofa reveals</italic> (<italic>to me</italic>) <italic>that all are silver. My son says he lost his favourite coin back there. I say</italic>:</td>
</tr>
<tr>
<td align="left" valign="top">a.</td>
<td align="left" valign="top">It must be silver.</td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top">#It will be silver.</td>
</tr>
</tbody>
</table>
</table-wrap>
<p id="P25">The inference is an abduction because the premise (&#x2018;every coin down the back of the sofa is silver&#x2019;) is partially explained by the prejacent (&#x2018;<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M145"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula> is silver&#x2019;, where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M146"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula> names my son&#x2019;s favourite coin). We assume that <italic>accidental generalizations</italic> like this one <italic>metaphysically depend</italic> on the status of the individuals they generalize over (cf. <xref rid="R52" ref-type="bibr">Rosen 2010</xref>: 120). Thus whether every coin down the back of the sofa is silver depends (where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M147"><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M148"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M149"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula> are the only coins down the back of the sofa) on whether <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M150"><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:math></inline-formula> is silver, whether <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M151"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> is silver, and whether <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M152"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula> is silver. The dependency is not, however, causal: those facts do not <italic>cause</italic> every coin to be silver.</p>
<p id="P26">A law or <italic>nonaccidental</italic> generalization, by contrast, serves to (partially) explain the individual cases falling under it (<xref rid="R52" ref-type="bibr">Rosen 2010</xref>: 119&#x2013;20; cf. <xref rid="R36" ref-type="bibr">Kratzer 2012</xref>: 122&#x2013;23, 138&#x2013;39). That&#x2019;s why (5b) sounds good, though the prejacent is an instance of the generalization that occurs as a premise (<italic>the neighbours barbecue every Friday night</italic>). Moreover, if we replace the generalization in (6) with one that is nonaccidental, <italic>will</italic> is fine again:
<table-wrap id="T7" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="3" align="left" valign="top">(7)</td>
<td colspan="2" align="left" valign="top"><italic>Being an avid birder, I know that all the swans in this part of the world are black. You tell me that a swan has built a nest in the attic. I say</italic>:</td>
</tr>
<tr>
<td align="left" valign="top">a.</td>
<td align="left" valign="top">??It must be black.</td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top">It will be black.</td>
</tr>
</tbody>
</table>
</table-wrap></p>
<p id="P27">In her dissertation, Winans looks at a range of further examples in English, and also extends her investigation to other languages. The pattern just described turns out to be cross-linguistically robust: the counterparts of inferential <italic>will</italic> in other languages (i.e., modals that have an alternative use marking the future) are anti-abductive too.<sup><xref rid="fn16" ref-type="fn">16</xref></sup></p>
<p id="P28">Before moving on, we make one last point about <italic>will</italic>. Blocking abduction and requiring exclusively <italic>forward</italic> inference are not the same thing. There are inferences that are not abductions by our earlier definition, but that contain one or more abductive (or backward) steps:
<table-wrap id="T8" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="2" align="left" valign="top">(8)</td>
<td colspan="2" align="left" valign="top"><italic>Angela knows that her neighbors barbecue often, and that when they have barbecues they get drunk. A friend is over at her house and they both smell smoke. Angela says</italic>:</td>
</tr>
<tr>
<td align="left" valign="top">a.</td>
<td align="left" valign="top">The neighbors will be drunk (now). (<xref rid="R66" ref-type="bibr">Winans 2016</xref>: 33)</td>
</tr>
</tbody>
</table>
</table-wrap></p>
<p id="P29">The inference supporting (8a) proceeds from one effect (the smoke) to another (the drunkenness) via their <italic>common cause</italic> (the barbecue). While the first step is abductive, the argument as a whole is not (the smoke is explained by the barbecue, but not by the drunkenness). The fact that (8a) is felicitous indicates that <italic>will&#x2019;s</italic> restriction targets abduction specifically, not just any inference containing an abductive step.<sup><xref rid="fn17" ref-type="fn">17</xref></sup></p>
</sec>
<sec id="S3">
<label>3.</label><title>Counterfactuals</title>
<p id="P30">Our aim here is to argue that the linguistic behaviour supposed to be distinctive of counterfactuals is instead a manifestation of the anti-abductivity contributed by a modal auxiliary. In the previous section, we used the <italic>non-counterfactual</italic> modal <italic>will</italic> to illustrate anti-abductivity. In this one, we find the same constraint on <italic>would</italic>-counterfactuals,<sup><xref rid="fn18" ref-type="fn">18</xref></sup> and show that it accounts for the judgments at the beginning of the paper.</p>
<sec id="S4">
<label>3.1.</label><title>Inferential Analysis</title>
<p id="P31">An early account (<xref rid="R11" ref-type="bibr">Chisholm 1946</xref>) of the meaning of counterfactual conditionals treats them as claims that the proposition, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M153"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula>, contributed by the consequent,<sup><xref rid="fn19" ref-type="fn">19</xref></sup> <italic>follows from</italic> the proposition, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M154"><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:math></inline-formula>, contributed by the antecedent, in conjunction with a body of supplementary facts, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M155"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula>.</p>
<table-wrap id="T9" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="3" align="left" valign="top">(9)</td>
<td colspan="2" align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M1"><mml:mrow><mml:mi>A</mml:mi><mml:msub><mml:mo>&#x003E;</mml:mo><mml:mrow><mml:mfenced close="]" open="["><mml:mi>C</mml:mi></mml:mfenced></mml:mrow></mml:msub><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> is true iff</td>
</tr>
<tr>
<td align="left" valign="top">a.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M2"><mml:mrow><mml:mo>&#x2227;</mml:mo><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula> is true</td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M156"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> follows from <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M3"><mml:mrow><mml:mfenced close="}" open="{"><mml:mi>A</mml:mi></mml:mfenced><mml:mo>&#x222A;</mml:mo><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
</table-wrap>
<p id="P32">In other words, the bare counterfactual conditional <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M4"><mml:mrow><mml:mi>A</mml:mi><mml:mo>&#x003E;</mml:mo><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> compresses a specific piece of reasoning that may rely on additional (factual) premises <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M157"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula> and contain intermediate steps.<sup><xref rid="fn20" ref-type="fn">20</xref></sup></p>
<p id="P33">This inferential analysis makes the comparison with inferential <italic>will</italic> from the previous section straightforward, and for that reason we take it as our starting point. Though the &#x201C;similarity&#x201D; semantics of Stalnaker and Lewis is more popular, the inferential approach is largely intertranslatable with it,<sup><xref rid="fn21" ref-type="fn">21</xref></sup> and the added complexity of the Stalnaker-Lewis model does not in this case confer any benefits.</p>
<p id="P34">The relevant body of supplementary facts, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M158"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula>, is left unspecified in (9). This may be seen as an attractive feature. Suppose it is Alma&#x2019;s birthday. She&#x2019;s turning 40, and the year is 2020. It seems that either counterfactual below is acceptable in the context:
<table-wrap id="T10" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="2" align="left" valign="top">(10)</td>
<td align="left" valign="top">a.</td>
<td align="left" valign="top">If Alma had been born in the year 2000, she would be turning 20.</td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top">If Alma had been born in the year 2000, it would now be 2040.</td>
</tr>
</tbody>
</table>
</table-wrap>
The antecedent is the same in both sentences, but the conclusions are incompatible: if Alma had been born in 2000 and it was now 2040, she would certainly not be turning 20. The analysis in (9) allows this by leaving <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M159"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula> open; the antecedent is supplemented by a different fact in either case. In (10a), the hypothetical proposition that Alma was born in the year 2000 is supplemented by the true proposition that the current year is 2020. In (10b), it is supplemented instead by the true proposition that Alma is turning 40. If we supplement with one of these propositions, we must exclude the other (since taken together they are inconsistent with the antecedent), but it would seem that either choice is possible. And hence, perhaps, there is no absolute truth about &#x201C;what would have been the case&#x201D; had Alma been born in the year 2000.<sup><xref rid="fn22" ref-type="fn">22</xref></sup></p>
<p id="P35">It is possible to spell out the supplementary factual premises in the surrounding linguistic context. One way is to present the counterfactual as the conclusion of an argument:<sup><xref rid="fn23" ref-type="fn">23</xref></sup>
<table-wrap id="T11" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="3" colspan="2" align="left" valign="top">(11)</td>
<td colspan="2" align="left" valign="top">It is now 2020, so</td>
</tr>
<tr>
<td align="left" valign="top">a.</td>
<td align="left" valign="top">If Alma had been born in 2000, she would be turning 20. [<italic>True</italic>]</td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top">If Alma had been born in 2000, it would now be 2040. [<italic>False</italic>/#]</td>
</tr>
<tr>
<td rowspan="3" align="left" valign="top">(12)</td>
<td colspan="3" align="left" valign="top">Alma is turning 40, so</td>
</tr>
<tr>
<td colspan="2" align="left" valign="top">a.</td>
<td align="left" valign="top">If she had been born in 2000, she would be turning 20. [<italic>False</italic>/#]</td>
</tr>
<tr>
<td colspan="2" align="left" valign="top">b.</td>
<td align="left" valign="top">If she had been born in 2000, it would now be 2040. [<italic>True</italic>]</td>
</tr>
</tbody>
</table>
</table-wrap>
In the discussion to follow, we spell out the supplementary premise whenever it helps drive home an empirical point. We assume that, in so doing, we are making explicit what would otherwise have to be guessed from the context (rather than introducing a substantially different piece of linguistic data).<sup><xref rid="fn24" ref-type="fn">24</xref></sup></p>
</sec>
<sec id="S5">
<label>3.2.</label><title>Anti-Abductivity in Would-Counterfactuals</title>
<p id="P36">As <xref rid="R23" ref-type="bibr">Goodman (1947)</xref> famously pointed out, there are cases where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M160"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> follows from <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M161"><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:math></inline-formula> and certain facts <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M162"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula> (and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M163"><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:math></inline-formula> is contrary to fact) yet the <italic>would</italic>-counterfactual <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M5"><mml:mrow><mml:mi>A</mml:mi><mml:mo>&#x003E;</mml:mo><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> is either false or infelicitous. Though this wasn&#x2019;t yet apparent to Goodman, the cases turn out to be those where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M164"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> is a cause or explanation either of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M165"><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:math></inline-formula> or a member of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M166"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula>. The excluded inferences are abductions (<xref rid="R7" ref-type="bibr">Bjorndahl and Snider 2015</xref>).</p>
<p id="P37">Here&#x2019;s an example similar to Goodman&#x2019;s. Suppose the lawn is wet and the only possible explanations are inclement weather or the sprinkler (which, it is important to note, operates on a timer and so is independent of the weather). In the event that the sprinkler has been off and rain is responsible for the wet lawn, we get the following judgments:
<table-wrap id="T12" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">(13)</td>
<td align="left" valign="top">If it hadn&#x2019;t rained, the grass would be dry. [<italic>True</italic>]</td>
</tr>
<tr>
<td align="left" valign="top">(14)</td>
<td align="left" valign="top">If it hadn&#x2019;t rained, the sprinkler would have been on. [<italic>False</italic>/#]</td>
</tr>
</tbody>
</table>
</table-wrap></p>
<p id="P38">From the counterfactual hypothesis (<italic>it hasn&#x2019;t rained</italic>), supplemented by the fact that the sprinkler was off, we can derive the consequent of (13): <italic>the grass is dry</italic>. But note that from the same hypothesis, supplemented instead by the fact that the grass is wet, we can also derive the consequent of (14): <italic>the sprinkler was on</italic>.<sup><xref rid="fn25" ref-type="fn">25</xref></sup> The basic inferential analysis (9) therefore predicts that either conditional, with the right supplementation, will be true. But this prediction is incorrect: (14) cannot be heard as true. Indeed, if we try to make the supplementary premise explicit, the result sounds incoherent:
<table-wrap id="T13" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">(15)</td>
<td align="left" valign="top">#If it hadn&#x2019;t rained, the sprinkler would have been on, since the grass is wet.</td>
</tr>
</tbody>
</table>
</table-wrap></p>
<p id="P39">The problem seems to be that the inference supporting the consequent of (14) is abductive: the conclusion (<italic>the sprinkler was on</italic>) provides the explanation for one of the premises (<italic>the grass is wet</italic>). This is not so for (13), where the inference runs from cause (no rain and no sprinkler) to effect (dry grass). In further support of this diagnosis, observe that (14) out of the blue suggests a mechanism that turns the sprinkler on after a dry spell. Left to fill in the details ourselves, we default to a <italic>non-abductive</italic> argument.</p>
<p id="P40">Anti-abductivity in <italic>would</italic>-counterfactuals parallels the case of inferential <italic>will</italic>, already discussed. Abduction to the <italic>consequent</italic> of the counterfactual is blocked&#x2014;which is to say, to the prejacent of <italic>would</italic>. And <italic>would</italic>, of course, is the past tense of <italic>will</italic>. One is tempted, therefore, to see <italic>woll</italic>, the lexeme common to <italic>will</italic> and <italic>would</italic> (<xref rid="R1" ref-type="bibr">Abusch 1997</xref>: fn. 14), as the source of anti-abductivity in both cases.<sup><xref rid="fn26" ref-type="fn">26</xref></sup> There is correspondingly little temptation to attribute the constraint on <italic>would</italic>-counterfactuals to their counterfactual marking (such an account would not extend to <italic>will</italic>). An upshot of this is that the linguistic argument for the distinctive nature of counterfactual reasoning and modality is seriously compromised.</p>
<p id="P41">For if we return to Humberstone&#x2019;s contrasting pairs of conditionals, meant to exemplify the difference between indicative and counterfactual, we find that anti-abductivity (in the (b) sentences) is sufficient to explain the relevant contrast.<sup><xref rid="fn27" ref-type="fn">27</xref></sup></p>
<table-wrap id="T14" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="2" align="left" valign="top">(16)</td>
<td align="left" valign="top">a.</td>
<td align="left" valign="top">If Pennie is at that bus stop, she is wearing a hat.</td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top">If Pennie were at that bus stop, she would be wearing a hat.</td>
</tr>
<tr>
<td rowspan="2" align="left" valign="top">(17)</td>
<td align="left" valign="top">a.</td>
<td align="left" valign="top">If there was pepper in the tea, I didn&#x2019;t taste it.</td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top">If there had been pepper in the tea, I wouldn&#x2019;t have tasted it.</td>
</tr>
<tr>
<td rowspan="2" align="left" valign="top">(18)</td>
<td align="left" valign="top">a.</td>
<td align="left" valign="top">If there is a kitten in this room, it is concealed from view.</td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top">If there were a kitten in this room, it would be concealed from view.</td>
</tr>
</tbody>
</table>
</table-wrap>
<p id="P42">The (accidental) generalization that everyone at the bus stop is wearing a hat is explained in part by the proposition that Pennie (who, by hypothesis, is at the stop) is wearing a hat (see (6) above). Thus, if that generalization is used as a premise in the derivation of that proposition, the derivation is an abduction. The same goes for the blocked premises in the remaining two (b) examples. Failing to detect (i.e., not tasting) the pepper that is (by hypothesis) in the tea would explain the absence of that flavour when the tea was sipped; and the kitten in question&#x2019;s being concealed from view explains the fact that no kitten can now be seen, though one is in the room (by hypothesis).</p>
<p id="P43">A serious issue for the view that the (a) and (b) sentences above exemplify the difference between indicative and counterfactual is that the same contrast holds between <italic>indicatives</italic>: between those that do and those that do not contain (inferential) <italic>will</italic>&#x2014;just as our account tracing anti-abductivity to the auxiliary (<italic>will/would</italic>) predicts (cf. <xref rid="R16" ref-type="bibr">Dudman 1988</xref>: 120).
<table-wrap id="T15" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="2" align="left" valign="top">(19)</td>
<td align="left" valign="top">a.</td>
<td align="left" valign="top">If Pennie is at that bus stop, she is wearing a hat.</td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top">If Pennie is at that bus stop, she will be wearing a hat.</td>
</tr>
<tr>
<td rowspan="2" align="left" valign="top">(20)</td>
<td align="left" valign="top">a.</td>
<td align="left" valign="top">If there was pepper in the tea, I didn&#x2019;t taste it.</td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top">If there was pepper in the tea, I won&#x2019;t have tasted it.</td>
</tr>
<tr>
<td rowspan="2" align="left" valign="top">(21)</td>
<td align="left" valign="top">a.</td>
<td align="left" valign="top">If there is a kitten in this room, it is concealed from view.</td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top">If there is a kitten in this room, it will be concealed from view.</td>
</tr>
</tbody>
</table>
</table-wrap>
Once again, the (b) sentences most naturally suggest some sort of propensity&#x2014;for Pennie to wear a hat, for the speaker not to taste pepper, for kittens to conceal themselves from view. Inference from such a &#x201C;law&#x201D; to a particular instance is not abductive; the law explains the instance, rather than vice versa. What the indicative conditionals with <italic>will</italic> in the consequent do not seem to allow are, once again, inferences that conclude with explanations of particular premises: the headwear in evidence at the bus stop, an insipid sip of tea, a scene without kittens.</p>
<p id="P44">We take ourselves by now to have made a case for the first two items from our earlier list:
<list list-type="bullet" id="L3">
<list-item><p id="P45"><italic>will</italic> and <italic>would</italic> apply the same constraint, namely anti-abductivity.</p></list-item>
<list-item><p id="P46">The anti-abductivity common to <italic>will</italic> and <italic>would</italic> is responsible for the relevant difference between (1a) and (1b), and many similar pairs that have led theorists to assign a distinctive status to counterfactuals.</p></list-item>
</list></p>
<p id="P47">Further support for our account emerges from a consideration of counterfactual conditionals that allow abduction.</p>
</sec>
<sec id="S6">
<label>3.3.</label><title>Abductive Counterfactuals</title>
<p id="P48">On our account, the anti-abductivity of <italic>would</italic>-counterfactuals is due to the choice of auxiliary in the consequent (<italic>would</italic>), rather than their counterfactuality. We are therefore in a position to explain another feature of the linguistic data: the existence of counterfactual conditionals&#x2014;with a different auxiliary structure in the consequent&#x2014;that <italic>permit</italic> abduction.</p>
<p id="P49">Consider the following variant of (13):
<table-wrap id="T16" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">(22)</td>
<td align="left" valign="top">If it hadn&#x2019;t rained, the sprinkler <italic>would have to</italic> have been on (since the grass is wet). [<italic>True</italic>]</td>
</tr>
</tbody>
</table>
</table-wrap>
This is not a <italic>would</italic>-counterfactual, but a &#x2018;would have to&#x2019;-counterfactual. Instead of the single auxiliary <italic>would</italic>, the consequent stacks two auxiliaries, <italic>would</italic> above <italic>have</italic>. This variant form allows abduction: whereas (13) was false or infelicitous, (22) is true.<sup><xref rid="fn28" ref-type="fn">28</xref></sup></p>
<p id="P50">Counterfactual forms<sup><xref rid="fn29" ref-type="fn">29</xref></sup> that permit abduction furnish counterexamples to the hypothesis that reasoning from counterfactual premises is inherently anti-abductive, and hence to the idea that the counterfactuality of (1b) is responsible for this restriction on its use. But while the &#x2018;would have to&#x2019; form and its properties have long been observed, and even carefully documented,<sup><xref rid="fn30" ref-type="fn">30</xref></sup> the lesson has been resisted, and the importance of counterfactuality upheld, by various conservative tactics.</p>
<p id="P51">Broadly speaking, two lines of resistance are possible: (i) deny that &#x2018;would have to&#x2019;-counterfactuals are truly abductive, or (ii) deny that they are <italic>bona fide</italic> counterfactuals. A way to pursue the first approach is to dissect the double auxiliary into an ordinary (i.e., anti-abductive) <italic>would</italic>-counterfactual and a further embedded necessity claim (viz., that so-and-so <italic>has to be</italic> the case) in its consequent.<sup><xref rid="fn31" ref-type="fn">31</xref></sup> There are various versions of the second approach; an extreme one is to claim that abductive counterfactuals are only true if reinterpreted as <italic>indicatives</italic>.<sup><xref rid="fn32" ref-type="fn">32</xref></sup></p>
<p id="P52"><xref rid="R54" ref-type="bibr">Schulz (2007</xref>: Ch. 5) offers a more nuanced position. She holds that every counterfactual sentence can be interpreted as either an &#x201C;ontic&#x201D; (i.e., metaphysical) or an epistemic modal, and while the epistemic reading allows abduction, the ontic does not. Though conceding that not all counterfactuals are anti-abductive, her position is similar to the second line of resistance above, in that abductive conditionals are consigned to a different&#x2014;and peripheral&#x2014;modal category. She is, in this way, able to maintain a connection between anti-abductivity and the primary sort of counterfactual modality: ontic/metaphysical.</p>
<p id="P53">There is no real evidence for such an ambiguity, however. If all counterfactuals have an epistemic reading, then it should be possible to hear <italic>would</italic>-counterfactuals with abductive support as true.<sup><xref rid="fn33" ref-type="fn">33</xref></sup> We ought to hear a true reading of (14), and, for that matter, this wonderful example of <xref rid="R3" ref-type="bibr">Arregui&#x2019;s (2005</xref>: 91):
<table-wrap id="T23A" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="2" align="left" valign="top">(23)</td>
<td align="left" valign="top"><italic>A driver stops her car. The bridge she is driving on is unfinished, and a gap yawns ahead.</italic></td>
</tr>
<tr>
<td align="left" valign="top">If the driver had kept going, the bridge would have been completed.</td>
</tr>
</tbody>
</table>
</table-wrap></p>
<p id="P54a">But no true reading can be heard.</p>
<p id="P54">We have limited ourselves, in the consideration of counterfactual forms, to an examination of English. Our finding is that, here at least, verbal auxiliaries make up a paradigm in which counterfactuality and anti-abductivity are independently marked (see <xref rid="T1" ref-type="table">Table 1</xref>).<sup><xref rid="fn34" ref-type="fn">34</xref></sup> Our hunch is that this will turn out to be the rule across languages. As <xref rid="R66" ref-type="bibr">Winans (2016)</xref> already showed, there are anti-abductive indicatives (counterparts of <italic>will</italic>) in other languages. We expect to find abduction-allowing counterfactuals (counterparts of &#x2018;would have to&#x2019;) in other languages too, even among those with very different ways of marking counterfactuality.<sup><xref rid="fn35" ref-type="fn">35</xref></sup> We are skeptical, then, of any close conceptual connection between anti-abductivity and counterfactuality, and doubt that the one can be derived from the other. It seems to us that permitting a hypothetical premise to be contrary to fact and blocking abductive inferential support are simply different jobs that languages don&#x0027;t need to bundle together.<sup><xref rid="fn36" ref-type="fn">36</xref></sup></p>
<table-wrap id="T1" position="anchor" orientation="portrait">
<label>Table 1:</label><caption><p id="P235">Some English Modal Auxiliaries</p></caption>
<table frame="below" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<thead>
<tr>
<th rowspan="2" align="center" valign="top">C<sc>ounter</sc>-F<sc>actual</sc></th>
<th colspan="2" align="center" valign="top">A<sc>nti</sc>-A<sc>bductive</sc></th>
</tr>
<tr>
<th align="center" valign="top">+</th>
<th align="center" valign="top">&#x2212;</th>
</tr>
</thead>
<tbody>
<tr>
<td align="center" valign="top">+</td>
<td align="center" valign="top"><italic>would</italic></td>
<td align="center" valign="top"><italic>would have to</italic></td>
</tr>
<tr>
<td align="center" valign="top">&#x2212;</td>
<td align="center" valign="top"><italic>will</italic></td>
<td align="center" valign="top"><italic>must</italic></td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
<sec id="S7">
<label>4.</label><title>Anti-Abductivity in Action</title>
<p id="P55">In this section, we use special models of propositional logic to formalize anti-abductivity and offer (pared-down) truth conditions for <italic>will</italic>, <italic>would</italic>, and others.<sup><xref rid="fn37" ref-type="fn">37</xref></sup> The models are <sc>structural equation models</sc> (SEMs), and they make use of <italic>structural equations</italic> of the form
<disp-formula id="FD1">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M6">
<mml:mrow><mml:mi>X</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mi>X</mml:mi></mml:msub></mml:mrow>
</mml:math>
</disp-formula>
to express dependencies between propositions.<sup><xref rid="fn38" ref-type="fn">38</xref></sup></p>
<p id="P56">For example, suppose as before that the lawn is wet (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M167"><mml:mrow><mml:mi>W</mml:mi></mml:mrow></mml:math></inline-formula>) if it has rained (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M168"><mml:mrow><mml:mi>R</mml:mi></mml:mrow></mml:math></inline-formula>) or the sprinkler has been on (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M169"><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>). Here <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M170"><mml:mrow><mml:mi>W</mml:mi></mml:mrow></mml:math></inline-formula> depends on both <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M171"><mml:mrow><mml:mi>R</mml:mi></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M172"><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>, and its truth-value corresponds to that of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M7"><mml:mrow><mml:mi>R</mml:mi><mml:mo>&#x2228;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>. This dependency is expressed as follows (with the dependent proposition on the left):
<disp-formula id="FD2">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M8">
<mml:mrow><mml:mi>W</mml:mi><mml:mo>=</mml:mo><mml:mi>R</mml:mi><mml:mo>&#x2228;</mml:mo><mml:mi>S</mml:mi></mml:mrow>
</mml:math>
</disp-formula></p>
<p id="P57">More generally, a (boolean) SEM is a triple
<disp-formula id="FD3">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M9">
<mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>=</mml:mo><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi mathvariant="normal">V</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="normal">E</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">d</mml:mi><mml:mo>,</mml:mo><mml:mfenced close="}" open="{"><mml:mrow><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mi>X</mml:mi></mml:msub><mml:mo>:</mml:mo><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant="normal">E</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">d</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mfenced></mml:mrow>
</mml:math>
</disp-formula>
where</p>
<list list-type="bullet" id="L4">
<list-item><p id="P58"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M10"><mml:mrow><mml:mi mathvariant="normal">V</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">r</mml:mi></mml:mrow></mml:math></inline-formula> is a finite set of boolean variables (i.e., atomic propositions),</p></list-item>
<list-item><p id="P59"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M11"><mml:mrow><mml:mi mathvariant="normal">E</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">d</mml:mi></mml:mrow></mml:math></inline-formula> is a subset of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M12"><mml:mrow><mml:mi mathvariant="normal">V</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">r</mml:mi></mml:mrow></mml:math></inline-formula> (the endogenous&#x2014;or dependent&#x2014;variables), and</p></list-item>
<list-item><p id="P60">Each <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M13"><mml:mrow><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mi>X</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is a boolean expression over <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M14"><mml:mrow><mml:mi mathvariant="normal">V</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">r</mml:mi></mml:mrow></mml:math></inline-formula>, such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M15"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2209;</mml:mo><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mfenced><mml:mrow><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mi>X</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>, where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M16"><mml:mrow><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mfenced><mml:mi>&#x03D5;</mml:mi></mml:mfenced></mml:mrow></mml:math></inline-formula> is the set of variables from <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M17"><mml:mrow><mml:mi mathvariant="normal">V</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">r</mml:mi></mml:mrow></mml:math></inline-formula> occurring in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M18"><mml:mi>&#x03D5;</mml:mi></mml:math></inline-formula>.</p></list-item>
<list-item><p id="P61">A <italic>truth assignment</italic> for an SEM <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M19"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> is a function <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M20"><mml:mrow><mml:mi>v</mml:mi><mml:mo>:</mml:mo><mml:mi mathvariant="normal">V</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:msub><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant='script'>M</mml:mi></mml:msub><mml:mo>&#x2192;</mml:mo><mml:mfenced close="}" open="{"><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> that verifies, for each <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M21"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant="normal">E</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:msub><mml:mi mathvariant="normal">d</mml:mi><mml:mi mathvariant='script'>M</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, the formula <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M22"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2194;</mml:mo><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mi>X</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>.</p></list-item>
</list>
<p id="P62">The <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M23"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula>-<italic>parents</italic> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M24"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant="normal">E</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:msub><mml:mi mathvariant="normal">d</mml:mi><mml:mi mathvariant='script'>M</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> are the atomic propositions occurring in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M25"><mml:mrow><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mi>X</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> (i.e., <italic>atom</italic> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M26"><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mi>X</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>).<sup><xref rid="fn39" ref-type="fn">39</xref></sup> In <xref rid="F1" ref-type="fig">Figure 1</xref>, parenthood is indicated by a directed edge. The <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M27"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula>-<italic>ancestor</italic> relation is the transitive closure of the <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M28"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula>-<italic>parents</italic> relation, and we write <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M29"><mml:mrow><mml:mi>Y</mml:mi><mml:msub><mml:mo>&#x227A;</mml:mo><mml:mi mathvariant='script'>M</mml:mi></mml:msub><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula> for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M173"><mml:mrow><mml:mi>Y</mml:mi></mml:mrow></mml:math></inline-formula> is an <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M30"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula>-<italic>ancestor</italic> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M174"><mml:mrow><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula> (<xref rid="R7" ref-type="bibr">Bjorndahl &amp; Snider 2015</xref>: 11).</p>
<fig id="F1" position="float">
<label>Figure 1:</label>
<caption>
<p id="P148">Dependency graph showing the parents of W</p>
</caption>
<graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="ergo.1149-f0001.jpg"/>
</fig>
<p id="P63">We can now state the anti-abductivity constraint. We take it to apply to a proposition <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M175"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> (the prejacent of the anti-abductive modal auxiliary) in relation to a further set of propositions <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M176"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula> (the premise set).<sup><xref rid="fn40" ref-type="fn">40</xref></sup> Briefly, anti-abductivity prevents <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M177"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> from being the <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M31"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula>-<italic>ancestor</italic> of any member of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M178"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula>. More fully, since premises can be logically complex, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M179"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> cannot be an <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M32"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula>-<italic>ancestor</italic> of any <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M33"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mfenced><mml:mi>P</mml:mi></mml:mfenced></mml:mrow></mml:math></inline-formula>, for any <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M180"><mml:mrow><mml:mi>P</mml:mi></mml:mrow></mml:math></inline-formula> in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M181"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula>:<sup><xref rid="fn41" ref-type="fn">41</xref></sup>
<table-wrap id="T18" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">(24)</td>
<td align="left" valign="top">There is no <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M34"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mfenced><mml:mi>C</mml:mi></mml:mfenced></mml:mrow></mml:math></inline-formula> such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M35"><mml:mrow><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mfenced><mml:mi>B</mml:mi></mml:mfenced><mml:msub><mml:mo>&#x227A;</mml:mo><mml:mi mathvariant='script'>M</mml:mi></mml:msub><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
</table-wrap>
Next, we use the above definition to predict the data about <italic>will</italic> from <xref rid="S2" ref-type="sec">&#x00A7;2</xref>.</p>
<sec id="S8">
<label>4.1.</label><title>Will</title>
<p id="P64">The barbecue scenarios from <xref rid="S2" ref-type="sec">&#x00A7;2</xref> revolve around the following propositions: it&#x2019;s Friday night (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M182"><mml:mrow><mml:mi>F</mml:mi></mml:mrow></mml:math></inline-formula>), the neighbours are barbecuing (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M183"><mml:mrow><mml:mi>Q</mml:mi></mml:mrow></mml:math></inline-formula>), there&#x2019;s a smoky smell (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M184"><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>), the neighbours are drunk (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M185"><mml:mrow><mml:mi>D</mml:mi></mml:mrow></mml:math></inline-formula>). The dependencies between them are represented in <xref rid="F2" ref-type="fig">Figure 2</xref>.</p>
<fig id="F2" position="anchor">
<label>Figure 2:</label>
<caption>
<p id="P148A">Dependencies in the barbecue scenario</p>
</caption>
<graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="ergo.1149-f0002.jpg"/>
</fig>
<p id="P65">Given the formulation of anti-abductivity in (24), we correctly predict that (25) is acceptable when its prejacent <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M186"><mml:mrow><mml:mi>Q</mml:mi></mml:mrow></mml:math></inline-formula> is inferred from <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M187"><mml:mrow><mml:mi>F</mml:mi></mml:mrow></mml:math></inline-formula>, but not when it is inferred from <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M188"><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>; since, as may be read off <xref rid="F2" ref-type="fig">Figure 2</xref>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M36"><mml:mrow><mml:mi>Q</mml:mi><mml:mo>&#x227A;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M37"><mml:mrow><mml:mi>Q</mml:mi><mml:menclose notation='updiagonalstrike'><mml:mo>&#x227A;</mml:mo></mml:menclose><mml:mi>F</mml:mi></mml:mrow></mml:math></inline-formula>.
<table-wrap id="T19" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">(25)</td>
<td align="left" valign="top">The neighbours will be barbecuing.</td>
</tr>
</tbody>
</table>
</table-wrap>
Moreover, we predict that (26) is acceptable when its prejacent is inferred from <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M189"><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula> (a common cause inference), since <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M38"><mml:mrow><mml:mi>D</mml:mi><mml:menclose notation='updiagonalstrike'><mml:mo>&#x227A;</mml:mo></mml:menclose><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>.</p>
<table-wrap id="T20" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">(26)</td>
<td align="left" valign="top">The neighbours will be drunk.</td>
</tr>
</tbody>
</table>
</table-wrap>
<p id="P66">On the other hand, supposing <italic>must</italic> is not anti-abductive, we predict that (27) is felicitous even if the prejacent is inferred from <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M190"><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>.</p>
<table-wrap id="T21" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">(27)</td>
<td align="left" valign="top">The neighbours must be barbecuing.</td>
</tr>
</tbody>
</table>
</table-wrap>
<p id="P67">We propose the following schematic truth conditions for an utterance of &#x2018;will <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M191"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula>&#x2019; backed by the premise set <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M192"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula>:<sup><xref rid="fn42" ref-type="fn">42</xref></sup></p>
<table-wrap id="T22" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="5" align="left" valign="top">(28)</td>
<td colspan="2" align="left" valign="top">&#x2018;will <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M193"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M194"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula>)&#x2019; is true in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M39"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi></mml:mrow></mml:math></inline-formula> iff</td>
</tr>
<tr>
<td align="left" valign="top">a.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M40"><mml:mrow><mml:mo>&#x2200;</mml:mo><mml:mi>P</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M41"><mml:mrow><mml:mi>v</mml:mi><mml:mfenced><mml:mi>P</mml:mi></mml:mfenced><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M42"><mml:mrow><mml:mi>C</mml:mi><mml:menclose notation='updiagonalstrike'><mml:mo>&#x22A9;</mml:mo></mml:menclose><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top">c.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M43"><mml:mrow><mml:mi>C</mml:mi><mml:msub><mml:mo>&#x22A9;</mml:mo><mml:mi mathvariant='script'>M</mml:mi></mml:msub><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top">d.</td>
<td align="left" valign="top">There is no <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M44"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mfenced><mml:mi>C</mml:mi></mml:mfenced></mml:mrow></mml:math></inline-formula> such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M45"><mml:mrow><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mfenced><mml:mi>B</mml:mi></mml:mfenced><mml:msub><mml:mo>&#x227A;</mml:mo><mml:mi mathvariant='script'>M</mml:mi></mml:msub><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
</table-wrap>
<p id="P68">While clause (a) checks that the premises are all true, clause (b) models the <italic>indirect evidence</italic> requirement by ensuring that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M195"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> is not a trivial consequence of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M196"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula>.<sup><xref rid="fn43" ref-type="fn">43</xref></sup> Clause (c) ensures that the prejacent follows once we add the dependencies in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M46"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula>.<sup><xref rid="fn44" ref-type="fn">44</xref></sup> Finally, clause (d) is the anti-abductivity constraint. Since we are ignoring anaphoricity,<sup><xref rid="fn45" ref-type="fn">45</xref></sup> the corresponding analysis of &#x2018;must <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M197"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula>&#x2019; simply drops (d):<sup><xref rid="fn46" ref-type="fn">46</xref></sup></p>
<table-wrap id="T23" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="4" align="left" valign="top">(29)</td>
<td colspan="2" align="left" valign="top">&#x2018;must <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M198"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M199"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula>)&#x2019; is true in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M47"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi></mml:mrow></mml:math></inline-formula> iff</td>
</tr>
<tr>
<td align="left" valign="top">a.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M48"><mml:mrow><mml:mo>&#x2200;</mml:mo><mml:mi>P</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M49"><mml:mrow><mml:mi>v</mml:mi><mml:mfenced><mml:mi>P</mml:mi></mml:mfenced><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M50"><mml:mrow><mml:mi>C</mml:mi><mml:menclose notation='updiagonalstrike'><mml:mo>&#x22A9;</mml:mo></mml:menclose><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top">c.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M51"><mml:mrow><mml:mi>C</mml:mi><mml:msub><mml:mo>&#x22A9;</mml:mo><mml:mi mathvariant='script'>M</mml:mi></mml:msub><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="S9">
<label>4.2.</label><title>Conditionals</title>
<p id="P69">On the basic inferential analysis, a conditional is the claim that the consequent follows from the premise set plus the antecedent. We arrive at the following by adding non-triviality and anti-abductivity clauses to that analysis (or, thinking compositionally, by adding the expected contribution of the <italic>if</italic>-clause to the earlier analysis of &#x2018;will <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M200"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M201"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula>)&#x2019;).</p>
<table-wrap id="T24" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="5" align="left" valign="top">(30)</td>
<td colspan="2" align="left" valign="top">&#x2018;if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M202"><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:math></inline-formula>, will <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M203"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M204"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula>)&#x2019; is true in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M52"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi></mml:mrow></mml:math></inline-formula> iff</td>
</tr>
<tr>
<td align="left" valign="top">a.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M53"><mml:mrow><mml:mo>&#x2200;</mml:mo><mml:mi>P</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M54"><mml:mrow><mml:mi>v</mml:mi><mml:mfenced><mml:mi>P</mml:mi></mml:mfenced><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M55"><mml:mrow><mml:mfenced close="}" open="{"><mml:mi>A</mml:mi></mml:mfenced><mml:mo>&#x222A;</mml:mo><mml:mi>C</mml:mi><mml:menclose notation='updiagonalstrike'><mml:mo>&#x22A9;</mml:mo></mml:menclose><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top">c.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M56"><mml:mrow><mml:mfenced close="}" open="{"><mml:mi>A</mml:mi></mml:mfenced><mml:mo>&#x222A;</mml:mo><mml:mi>C</mml:mi><mml:msub><mml:mo>&#x22A9;</mml:mo><mml:mi mathvariant='script'>M</mml:mi></mml:msub><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top">d.</td>
<td align="left" valign="top">There is no <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M57"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mfenced><mml:mrow><mml:mfenced close="}" open="{"><mml:mi>A</mml:mi></mml:mfenced><mml:mo>&#x222A;</mml:mo><mml:mfenced><mml:mi>C</mml:mi></mml:mfenced></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M58"><mml:mrow><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mfenced><mml:mi>B</mml:mi></mml:mfenced><mml:msub><mml:mo>&#x227A;</mml:mo><mml:mi mathvariant='script'>M</mml:mi></mml:msub><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
</table-wrap>
<p id="P70">Note that only an (un)negated atomic clause can occur as the prejacent of <italic>will</italic>, so the template above is not a general schema for the conditional.<sup><xref rid="fn47" ref-type="fn">47</xref></sup> The analysis is the same as (28) except that we have replaced &#x2018;<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M205"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula>&#x2019; with &#x2018;<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M59"><mml:mrow><mml:mfenced close="}" open="{"><mml:mi>A</mml:mi></mml:mfenced><mml:mo>&#x222A;</mml:mo><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula>&#x2019; in clauses (b)&#x2013;(d).<sup><xref rid="fn48" ref-type="fn">48</xref></sup> Thus, for instance, clause (b) now requires that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M206"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> is not a trivial consequence of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M207"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula> augmented by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M208"><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:math></inline-formula>.<sup><xref rid="fn49" ref-type="fn">49</xref></sup> We can get the truth conditions for &#x2018;if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M209"><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:math></inline-formula>, must <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M210"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M211"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula>)&#x2019; by dropping (d), as before.</p>
<p id="P71">Counterfactual marking, on our account, relaxes the requirement that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M212"><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:math></inline-formula> is epistemically possible. Since we make no attempt to represent this constraint in (30), the analysis applies unchanged to the schema &#x2018;if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M213"><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:math></inline-formula>, would <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M214"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M215"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula>)&#x2019;, and applies minus clause (d) to &#x2018;if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M216"><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:math></inline-formula>, would have to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M217"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M218"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula>)&#x2019;.<sup><xref rid="fn50" ref-type="fn">50</xref></sup></p>
</sec>
<sec id="S10">
<label>4.3.</label><title>Adjusting for Error</title>
<p id="P72">Structural equation models are limited in two directions. They are limited <italic>vertically</italic>&#x2014;they can only go back so far in the causal ancestry of a proposition&#x2014;and <italic>horizontally</italic>&#x2014;a proposition can only have so many <italic>parents</italic> (i.e., there is a finite limit on the complexity of the function determining its truth-value). In reality, the list of potential factors that immediately bear on a given proposition might be open ended.</p>
<p id="P73">Consider the equation we used to model the state of the lawn based on the weather and the sprinkler:
<disp-formula id="FD4">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M60">
<mml:mrow><mml:mi>W</mml:mi><mml:mo>=</mml:mo><mml:mi>R</mml:mi><mml:mo>&#x2228;</mml:mo><mml:mi>S</mml:mi></mml:mrow>
</mml:math>
</disp-formula></p>
<p id="P74">This is an obvious simplification. For one thing, rain doesn&#x2019;t guarantee a wet lawn. Someone might have parked their car on it (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M219"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula>), or even set up a marquee to protect it from the elements (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M220"><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:math></inline-formula> ). We could add these conditions to the equation, but the result
<disp-formula id="FD5">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M61">
<mml:mrow><mml:mi>W</mml:mi><mml:mo>=</mml:mo><mml:mfenced><mml:mrow><mml:mi>R</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mfenced><mml:mrow><mml:mi>C</mml:mi><mml:mo>&#x2228;</mml:mo><mml:mi>M</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mfenced><mml:mo>&#x2228;</mml:mo><mml:mi>S</mml:mi></mml:mrow>
</mml:math>
</disp-formula>
is not obviously an improvement. The longer formula still fails to capture the true relationship between the variables (the marquee could blow down, the car could leak fluid), and the concession to nuance doesn&#x2019;t balance the downgrade in elegance.</p>
<p id="P75">Since we can&#x2019;t represent the true situation in a finite formula, we follow Pearl in allocating an additional exogenous <italic>error variable</italic> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M62"><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>X</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> to every formula <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M63"><mml:mrow><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mi>X</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>. &#x201C;Error&#x201D; is understood to subsume any combination of additional factors (including marquees and the like) that would make the prediction of the original equation come out false.</p>
<p id="P76">The introduction of the error variable is not without consequences. For suppose we update the equation as follows<sup><xref rid="fn51" ref-type="fn">51</xref></sup>
<disp-formula id="FD6">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M64">
<mml:mrow><mml:mi>W</mml:mi><mml:mo>=</mml:mo><mml:mfenced><mml:mrow><mml:mi>R</mml:mi><mml:mo>&#x2228;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:mfenced><mml:mo>&#x2227;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>U</mml:mi><mml:mi>W</mml:mi></mml:msub></mml:mrow>
</mml:math>
</disp-formula>
and then use it to evaluate the counterfactual</p>
<table-wrap id="T25" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">(31)</td>
<td align="left" valign="top">If it had rained, the grass would be wet.</td>
</tr>
</tbody>
</table>
</table-wrap>
<p id="P77">Our account now predicts that (31) is only true if the premise set includes the claim that the situation is normal (i.e., <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M65"><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>W</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula>). Without this further premise, we cannot infer <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M221"><mml:mrow><mml:mi>W</mml:mi></mml:mrow></mml:math></inline-formula> from the antecedent <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M222"><mml:mrow><mml:mi>R</mml:mi></mml:mrow></mml:math></inline-formula>. This prediction is not correct.<sup><xref rid="fn52" ref-type="fn">52</xref></sup> For consider that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M66"><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>W</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is really the disjunction of every claim to the effect that a particular (inhibiting) error has occurred, and hence <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M67"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>U</mml:mi><mml:mi>W</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> spelled out in full is the claim that no marquee has been erected, no car is parked on the lawn, etc. Now suppose someone utters (31) without considering whether a car might be parked on the lawn. We do not judge the utterance false merely because the negation of this unlikely proposition did not occur in their reasoning.<sup><xref rid="fn53" ref-type="fn">53</xref></sup> Indeed, anyone who utters (31) must fail to consider <italic>some</italic> potential source of error, since sources of error can be invented without limit. The problem is a serious one: no one can utter (31) truly on our account as it stands.</p>
<p id="P78">But how should we amend it? Note that (31) is not automatically true either (<xref rid="R58" ref-type="bibr">Stone 1994</xref>: 184). Instead, its truth-value depends on the facts. Was a car in fact parked on the lawn or not? If one was, (31) is false; if no car was, and indeed nothing else was there to keep the rain off, then (31) is true.</p>
<p id="P79">The situation is different for factors that truly are important or salient. We can fault someone who says
<table-wrap id="T26" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">(32)</td>
<td align="left" valign="top">It must have rained, since the grass is wet.</td>
</tr>
</tbody>
</table>
</table-wrap>
by pointing out that the wetness of the grass could have been due to the sprinkler instead. The speaker is not rationally exonerated if it turns out that, though they were not aware of it, the sprinkler was in fact turned off. Our analysis captures this by predicting that (32) is only true relative to a premise set that includes <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M68"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>.<sup><xref rid="fn54" ref-type="fn">54</xref></sup></p>
<p id="P80">The distinction we are relying on between a relevant factor and an abnormal interference is reflected in the interpretation of weak necessity modals (i.e., <italic>should</italic> and <italic>ought</italic>).</p>
<table-wrap id="T27" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="2" align="left" valign="top">(33)</td>
<td align="left" valign="top">a.</td>
<td align="left" valign="top">The grass will/must be wet, since it rained.</td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top">The grass ought to/should be wet, since it rained.</td>
</tr>
</tbody>
</table>
</table-wrap>
<p id="P81">We can follow (33b), but not (33a), with &#x2018;but it&#x2019;s not, because I covered it with a tarp.&#x2019; Weak modal claims can be true even if the error term is tripped (<xref rid="R58" ref-type="bibr">Stone 1994</xref>: 184). But even weak modals sound false if an important or salient variable is ignored:
<table-wrap id="T28" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">(34)</td>
<td align="left" valign="top">The grass should be dry, since the sprinkler hasn&#x2019;t been on.</td>
</tr>
</tbody>
</table>
</table-wrap>
That isn&#x2019;t true: it might have rained!</p>
<p id="P82">We propose a revision, in light of the above, to clause (c) in our analysis of inferential modals. For strong modals, the prejacent is required to follow from the premise set along with the <italic>actual</italic> value of every error variable <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M69"><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>X</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> (for endogenous <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M223"><mml:mrow><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula>). We update (30) accordingly:
<table-wrap id="T29" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="5" align="left" valign="top">(35)</td>
<td colspan="2" align="left" valign="top">If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M224"><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:math></inline-formula>, will <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M225"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M226"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula>)&#x2019; is true in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M70"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi></mml:mrow></mml:math></inline-formula> iff</td>
</tr>
<tr>
<td align="left" valign="top">a.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M71"><mml:mrow><mml:mo>&#x2200;</mml:mo><mml:mi>P</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M72"><mml:mrow><mml:mi>v</mml:mi><mml:mfenced><mml:mi>P</mml:mi></mml:mfenced><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M73"><mml:mrow><mml:mfenced close="}" open="{"><mml:mi>A</mml:mi></mml:mfenced><mml:mo>&#x222A;</mml:mo><mml:mi>C</mml:mi><mml:menclose notation='updiagonalstrike'><mml:mo>&#x22A9;</mml:mo></mml:menclose><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top">c.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M74"><mml:mrow><mml:mfenced close="}" open="{"><mml:mi>A</mml:mi></mml:mfenced><mml:mo>&#x222A;</mml:mo><mml:mi>C</mml:mi><mml:mo>&#x222A;</mml:mo><mml:mfenced close="}" open="{"><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>X</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mi>v</mml:mi><mml:mfenced><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>X</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mo>:</mml:mo><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>E</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:mfenced><mml:msub><mml:mo>&#x22A9;</mml:mo><mml:mi mathvariant='script'>M</mml:mi></mml:msub><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top">d.</td>
<td align="left" valign="top">There is no <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M75"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mfenced><mml:mrow><mml:mfenced close="}" open="{"><mml:mi>A</mml:mi></mml:mfenced><mml:mo>&#x222A;</mml:mo><mml:mfenced><mml:mi>C</mml:mi></mml:mfenced></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M76"><mml:mrow><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mfenced><mml:mi>B</mml:mi></mml:mfenced><mml:msub><mml:mo>&#x227A;</mml:mo><mml:mi mathvariant='script'>M</mml:mi></mml:msub><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
</table-wrap></p>
<p id="P83">Weak necessity modals, by contrast, are true if the inference goes through on the assumption that no error has occurred (whether or not that assumption is correct). They therefore receive the analysis below:<sup><xref rid="fn55" ref-type="fn">55</xref></sup>
<table-wrap id="T30" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="5" align="left" valign="top">(36)</td>
<td colspan="2" align="left" valign="top">&#x2018;should/ought <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M227"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M228"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula>)&#x2019; is true in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M77"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi></mml:mrow></mml:math></inline-formula> iff</td>
</tr>
<tr>
<td align="left" valign="top">a.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M78"><mml:mrow><mml:mo>&#x2200;</mml:mo><mml:mi>P</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M79"><mml:mrow><mml:mi>v</mml:mi><mml:mfenced><mml:mi>P</mml:mi></mml:mfenced><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M80"><mml:mrow><mml:mi>C</mml:mi><mml:menclose notation='updiagonalstrike'><mml:mo>&#x22A9;</mml:mo></mml:menclose><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top">c.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M81"><mml:mrow><mml:mi>C</mml:mi><mml:mo>&#x222A;</mml:mo><mml:mfenced close="}" open="{"><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>X</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mn>0</mml:mn><mml:mo>:</mml:mo><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>E</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:mfenced><mml:msub><mml:mo>&#x22A9;</mml:mo><mml:mi mathvariant='script'>M</mml:mi></mml:msub><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top">d.</td>
<td align="left" valign="top">There is no <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M82"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi></mml:mrow></mml:math></inline-formula><italic>-</italic>(<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M229"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula>) such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M83"><mml:mrow><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mfenced><mml:mi>B</mml:mi></mml:mfenced><mml:msub><mml:mo>&#x227A;</mml:mo><mml:mi mathvariant='script'>M</mml:mi></mml:msub><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
</table-wrap></p>
</sec>
</sec>
<sec id="S11">
<label>5.</label><title>Alternatives to Anti-Abductivity</title>
<p id="P84">In this paper we have argued for a reconsideration of linguistic data previously used to support a substantial distinction in status for counterfactuals. The argument, where it is novel, rests on an analogy between (counterfactual) <italic>would</italic> and (inferential) <italic>will</italic>. We claim that both forms of <italic>woll</italic> are anti-abductive, and in <xref rid="S5" ref-type="sec">&#x00A7;3.2</xref> showed that anti-abductivity in <italic>would</italic> suffices to explain the linguistic data in question. What we have not yet done is consider alternatives to the anti-abductivity analysis of <italic>would</italic>-counterfactuals. If there is a better analysis of <italic>would</italic>-counterfactuals to be had&#x2014;on which they don&#x2019;t line up with anti-abductive <italic>will</italic>&#x2014;then the analogy, and our argument, does not go through.</p>
<sec id="S12">
<label>5.1.</label><title>Interventionism</title>
<p id="P85">Interventionism (<xref rid="R47" ref-type="bibr">Pearl 1996</xref>; <xref rid="R48" ref-type="bibr">2009</xref>) is a precise proposal about the semantics of counterfactuals with widespread currency in contemporary philosophical accounts of modality and psychological accounts of reasoning.<sup><xref rid="fn56" ref-type="fn">56</xref></sup> It shares with <xref rid="R7" ref-type="bibr">Bjorndahl and Snider&#x2019;s (2015)</xref> anti-abductivity analysis the idea that the direction of explanatory dependency is crucial to the truth conditions of (<italic>would</italic>-) counterfactuals. However, the interventionist, not content with stipulating an embargo on abduction, provides a conceptual rationale against it&#x2014;one that aligns counterfactual reasoning with experimental <italic>intervention</italic>.</p>
<p id="P86">Performing an experiment is a way of distinguishing causation from correlation. The experimenter brings about a certain state by intervening in the (normal) causal order and disrupting the relationship with that state&#x2019;s (normal) causal antecedents. (For example, an experimental proband is selected at random to avoid the confounds of self-selection.) The causal <italic>consequences</italic> of the intervened-on state follow in the usual way, but intervention isolates these from the state&#x2019;s usual causal ancestors, along with any other state that in the normal course of things it would be (merely) correlated with. In other words, while causal consequences may be inferred from an intervened-on state, other standard inferences, including&#x2014;but not limited to&#x2014;abduction to a causal ancestor, are blocked. If you intervene to make the lawn dry (with a blow dryer, say), you cannot turn around and claim that the weather must have been fine.</p>
<p id="P87">The anti-abductivity of <italic>would</italic>-counterfactuals can, therefore, be seen as the surface ripple of something deeper: reasoning based on (hypothetical) intervention. Interventionist protocol both constrains reasoning&#x2014;in a manner that counterfactuals are supposed to emulate&#x2014;and <italic>gets at</italic> what is really there: the underlying causal structure. By comparison, reasoning from what one has &#x201C;passively&#x201D; observed is unconstrained (abduction, for instance, is legitimate). But this is so precisely because the objective causal relationships have not been sorted from the myriad other sources of correlation&#x2014;let alone from the &#x201C;strange combinations of rare eventualities &#x2026; that have nothing to do with general traits of influence and behavior&#x201D; (<xref rid="R4" ref-type="bibr">Balke and Pearl 1994</xref>: 231).</p>
<p id="P88">Corresponding to the interventionist mode of reasoning is a <italic>modality</italic> structured by objective features of the world: necessity in virtue of causal and other forms of metaphysical dependency.<sup><xref rid="fn57" ref-type="fn">57</xref></sup> In assigning a profounder origin to the anti-abductivity of <italic>would</italic>-counterfactuals, interventionism also lends support to the objective (or metaphysical) characterization of their modality&#x2014;in line with the received view that counterfactuals diverge from the epistemic modality of indicatives.</p>
<p id="P89">Interventionism, then, is a formidable alternative to the basic anti-abductivity account we have assumed; one that, moreover, supports the traditional view of the modal difference between counterfactuals and indicatives. We reject it, however, because it fails to provide an accurate characterization of the truth conditions of <italic>would</italic>-counterfactuals.<sup><xref rid="fn58" ref-type="fn">58</xref></sup></p>
<p id="P90">By lumping abduction in with the other inference patterns blocked by intervention, the interventionist ascribes a stronger constraint to (<italic>would</italic>-) counterfactuals than neat anti-abductivity. This is clear from the following informal first pass at the interventionist truth condition (Cf. <xref rid="R22" ref-type="bibr">Gibbard &amp; Harper 1978</xref>; <xref rid="R50" ref-type="bibr">Pollock 1976</xref>: 42):
<table-wrap id="T31" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="3" align="left" valign="top">(37)</td>
<td colspan="2" align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M84"><mml:mrow><mml:mi>A</mml:mi><mml:mo>&#x003E;</mml:mo><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> is true iff either</td>
</tr>
<tr>
<td align="left" valign="top">a.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M230"><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:math></inline-formula>, when combined with the facts that <italic>do not depend</italic> on whether <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M231"><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:math></inline-formula>, is sufficient to <italic>bring about B</italic>, or</td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M232"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> is true and does not depend on whether <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M233"><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:math></inline-formula>.</td>
</tr>
</tbody>
</table>
</table-wrap></p>
<p id="P91">Route (a) requires the consequent to occur downstream (dependency-wise) of the antecedent and any supplementary factual premises (this is the intended sense of &#x201C;bringing about&#x201D;).<sup><xref rid="fn59" ref-type="fn">59</xref></sup> This is a stronger requirement than anti-abductivity, which only says that the path to the consequent must <italic>not be upstream</italic> of any premise. This discrepancy will become important shortly.</p>
<p id="P92">The interventionist algorithm derives the truth condition above by an imagined procedure. We first wind the causal-explanatory history back, undoing everything that depends on the truth-value of the antecedent, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M234"><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:math></inline-formula>. Holding fixed the resulting causal-explanatory background (captured by the actual truth-values of the exogenous variables), we <italic>intervene</italic> on <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M235"><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:math></inline-formula>, setting its value at &#x201C;true.&#x201D; The intervention is modelled by detaching <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M236"><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:math></inline-formula> from its parents, so that its value can only propagate forward in the graph. Finally, we let a new history &#x201C;play out&#x201D; from the same causal-explanatory background&#x2014;but now with <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M237"><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:math></inline-formula> set to true&#x2014;and see whether the truth of the consequent <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M238"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> follows.</p>
<p id="P93">This computation is defined below. In the following, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M85"><mml:mrow><mml:msub><mml:mi mathvariant='script'>M</mml:mi><mml:mi>A</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the model identical to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M86"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> except that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M87"><mml:mrow><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mi>A</mml:mi></mml:msub><mml:mo>&#x2261;</mml:mo><mml:mi>T</mml:mi></mml:mrow></mml:math></inline-formula>, while <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M88"><mml:mrow><mml:msup><mml:mi>v</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:msub><mml:mo>~</mml:mo><mml:mrow><mml:mi>E</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mi>v</mml:mi></mml:mrow></mml:math></inline-formula> means that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M89"><mml:msup><mml:mi>v</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> matches <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M239"><mml:mrow><mml:mi>v</mml:mi></mml:mrow></mml:math></inline-formula> except possibly in the assignment it makes to endogenous variables.</p>
<table-wrap id="T32" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="4" align="left" valign="top">(38)</td>
<td colspan="2" align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M90"><mml:mrow><mml:mi>A</mml:mi><mml:mo>&#x003E;</mml:mo><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> is true in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M91"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi></mml:mrow></mml:math></inline-formula> iff</td>
</tr>
<tr>
<td align="left" valign="top">a.</td>
<td align="left" valign="top">There is a truth assignment <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M92"><mml:msup><mml:mi>v</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M93"><mml:mrow><mml:msub><mml:mi mathvariant='script'>M</mml:mi><mml:mi>A</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, such that</td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M94"><mml:mrow><mml:msup><mml:mi>v</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:msub><mml:mo>~</mml:mo><mml:mrow><mml:mi>E</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mi>v</mml:mi></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top">c.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M95"><mml:mrow><mml:msup><mml:mi>v</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mfenced><mml:mi>B</mml:mi></mml:mfenced><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
</table-wrap>
<p id="P94">With the truth condition now in hand, we can present a counterexample to interventionism. We first observe that, intuitively speaking, a <italic>would</italic>-counterfactual <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M96"><mml:mrow><mml:mi>A</mml:mi><mml:mo>&#x003E;</mml:mo><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> may be judged true though <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M240"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> follows from <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M241"><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:math></inline-formula> by an inference that goes by way of a <italic>common cause</italic>. This holds in the case below, where we infer the bang from the flash via a (counterfactual) detonation (<xref rid="R25" ref-type="bibr">Hiddleston 2005</xref>):
<table-wrap id="T33" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">(39)</td>
<td align="left" valign="top"><italic>A firework fails to detonate</italic>.<break/>If there had been a flash, there would have been a bang. [<italic>True</italic>]</td>
</tr>
</tbody>
</table>
</table-wrap></p>
<p id="P95">Now a common cause inference is not an abduction <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M97"><mml:mrow><mml:mfenced><mml:mrow><mml:mi>B</mml:mi><mml:menclose notation='updiagonalstrike'><mml:mo>&#x227A;</mml:mo></mml:menclose><mml:mi>A</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>, but it is not a purely forward inference either <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M98"><mml:mrow><mml:mfenced><mml:mrow><mml:mi>A</mml:mi><mml:menclose notation='updiagonalstrike'><mml:mo>&#x227A;</mml:mo></mml:menclose><mml:mi>B</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>. It consists of a step back (to a causal ancestor) followed by a step forward (to another effect of the same cause). As such, it lands in the gap between the weaker anti-abductive constraint and the stronger interventionist one. While anti-abductivity predicts that (39) is true, interventionism predicts&#x2014;incorrectly&#x2014;that it is false. Intervening to make it the case that there was a flash deletes the connection to the parent node representing the detonation of the firework. This blocks any inference from the truth of the former that runs via the truth of the latter (see <xref rid="F3" ref-type="fig">Figure 3</xref>).<sup><xref rid="fn60" ref-type="fn">60</xref></sup></p>
<fig id="F3" position="anchor">
<label>Figure 3:</label>
<caption>
<p id="P148B">Common cause structures before and after intervention on <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M242"><mml:mrow><mml:mi>F</mml:mi></mml:mrow></mml:math></inline-formula></p>
</caption>
<graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="ergo.1149-f0003.jpg"/>
</fig>
<p id="P96">So far in this paper we have avoided the term <italic>backtracking</italic>. The term was introduced (into the counterfactuals literature) to describe an inference that first went &#x201C;backwards&#x201D; and then &#x201C;forwards.&#x201D; Thus &#x2018;backtracking counterfactual&#x2019; originally meant one that was true in virtue of a common cause inference (as <xref rid="R5" ref-type="bibr">Bennett [2003</xref>: 208] chronicles, this meaning was lost, and &#x2018;backtracking&#x2019; came to mean simply &#x2018;backwards&#x2019; or <italic>abductive</italic>). The original sense (or at least the underlying concept) merits a revival. As we have seen, it delineates a kind of counterexample to interventionism, and hence an important contour to the empirical landscape.<sup><xref rid="fn61" ref-type="fn">61</xref></sup> &#x2018;Backtracking&#x2019; should not be merged with &#x2018;backwards&#x2019;, precisely because the former is acceptable in <italic>would</italic>-counterfactuals (and with inferential <italic>will</italic>, <xref rid="S2" ref-type="sec">&#x00A7;2</xref>), while the latter&#x2014;abduction&#x2014;is not (cf. <xref rid="R3" ref-type="bibr">Arregui 2005</xref>: 84&#x2013;85; Bjorndahl &amp; Snider 2005: 7&#x2013;9).<sup><xref rid="fn62" ref-type="fn">62</xref></sup></p>
</sec>
<sec id="S13">
<label>5.2.</label><title>Noncausal Approaches</title>
<p id="P97">Anti-abductivity provides an account of <italic>would</italic>-counterfactuals that is empirically superior to interventionism and related accounts from the causal modelling literature. But how does it compare to quite different approaches that distinguish good and bad examples of <italic>would</italic>-counterfactuals without restricting the causal direction of the inference? <xref rid="R36" ref-type="bibr">Kratzer 2012</xref> and <xref rid="R28" ref-type="bibr">Ippolito 2016</xref> are prominent accounts in this vein, and useful to consider, though their arguments do not in the end cast doubt on the importance of abduction to the understanding of <italic>would</italic>-counterfactuals.</p>
<p id="P98"><xref rid="R28" ref-type="bibr">Ippolito 2016</xref> contains a useful reanalysis of certain examples that seem at first to call for a causal treatment. To begin with, consider Pavel <xref rid="R60" ref-type="bibr">Tich&#x00FD;&#x2019;s (1976)</xref> case:
<table-wrap id="T34" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="2" align="left" valign="top">(40)</td>
<td align="left" valign="top"><italic>Invariably, if it is raining, Jones wears his hat. If it is not raining, Jones wears his hat at random. Today, it is raining and so Jones is wearing his hat</italic>.</td>
</tr>
<tr>
<td align="left" valign="top">But even if it had not been raining, Jones would have been wearing his hat. [<italic>False</italic>]</td>
</tr>
</tbody>
</table>
</table-wrap>
Since the conditional is false, the fact that Jones is wearing his hat (in the actual world, where it is raining) must be off-limits as a supplementary premise. But why? Suppose we change the example slightly (<xref rid="R61" ref-type="bibr">Veltman 2005</xref>):
<table-wrap id="T35" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="2" align="justify" valign="top">(41)</td>
<td align="left" valign="top"><italic>Every morning, Jones tosses a coin. If it is raining that day, he wears his hat, but if it is not then he only wears his hat if the coin came up heads. Today, the toss comes up heads, it is raining, and Jones is wearing his hat</italic>.</td>
</tr>
<tr>
<td align="left" valign="top">But even if it had not been raining, Jones would have been wearing his hat. [<italic>True</italic>]</td>
</tr>
</tbody>
</table>
</table-wrap></p>
<p id="P99">This time the inference goes through. Evidently, certain facts&#x2014;in this case the fact that the coin came up heads&#x2014;<italic>can</italic> occur as premises. Indeed, the judgments may be captured by a familiar rule: facts are admitted as long as they don&#x2019;t depend (causally) on the antecedent (cf. (37a)). Jones&#x2019;s hat-wearing depends on the weather; the result of a coin toss does not.</p>
<p id="P100">A different diagnosis competes with this causal one, however. In the false case (40), the consequent <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M243"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> can only be derived from itself or the negation of the antecedent <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M99"><mml:mrow><mml:mfenced><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>A</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>. While both propositions are true in the scenario, admitting either into the premise set (alongside the antecedent <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M244"><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:math></inline-formula>) ensures a <italic>trivial</italic> derivation of the consequent <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M245"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula>. By contrast, the true case (41) is one where the consequent follows from a premise (<italic>the coin came up heads</italic>) that is logically independent of both clauses of the conditional. Both judgments could be explained, therefore, by a restriction to <italic>nontrivial</italic> inference (<xref rid="R28" ref-type="bibr">Ippolito 2016</xref>: 18). This explanation is especially attractive, given that such a restriction is independently motivated by the (indirect) evidential requirement of the modal.<sup><xref rid="fn63" ref-type="fn">63</xref></sup></p>
<p id="P101">Note further that in the scenario of (41) the following seems false:
<table-wrap id="T36" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">(42)</td>
<td align="left" valign="top">If Smith had tossed the coin instead of Jones, it would still have landed heads. [<italic>False</italic>]</td>
</tr>
</tbody>
</table>
</table-wrap></p>
<p id="P102">A causal dependency account like (37) predicts this only if it can be made out that the result of the toss &#x201C;depends&#x201D; (in the relevant sense) on the the person who makes it.<sup><xref rid="fn64" ref-type="fn">64</xref></sup> But now consider the following (cf. <xref rid="R28" ref-type="bibr">Ippolito 2016</xref>: 4):
<table-wrap id="T37" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="2" align="left" valign="top">(43)</td>
<td align="left" valign="top"><italic>Smith&#x2019;s last counter is twelve squares away from home. Jones throws the dice and rolls a double six</italic>.</td>
</tr>
<tr>
<td align="left" valign="top">If Smith had rolled the dice instead of Jones, he would have been home. [<italic>True</italic>]</td>
</tr>
</tbody>
</table>
</table-wrap></p>
<p id="P103">The causal structure of (43) does not differ appreciably from that of (42), so it is hard to see how a causal theorist would account for the difference. On the nontriviality approach, however, the explanation is clear: while the consequent of (42) directly concerns the result of the toss (something that can only be trivially inferred from the facts of the case),<sup><xref rid="fn65" ref-type="fn">65</xref></sup> (43)&#x2019;s consequent concerns a further ramification of this result (which may be nontrivially inferred from it).<sup><xref rid="fn66" ref-type="fn">66</xref></sup></p>
<p id="P104">As Ippolito is aware, nontriviality cannot account for every case that would seem to turn on causal features of the situation. In particular, it doesn&#x2019;t suffice for a correct prediction (of falsity) in our central sort of case, exemplified by (14). For here the supplementary premise (<italic>the grass is wet</italic>) is logically independent of both conclusion (<italic>the sprinkler was on</italic>) and antecedent (<italic>it hasn&#x2019;t rained</italic>).</p>
<p id="P105">Instead, for such cases, Ippolito calls upon a recent account by <xref rid="R36" ref-type="bibr">Kratzer (2012)</xref>. Kratzer, as it happens, is convinced that causation is a red herring in (13)/(14), since she has found an analogous case where the causal direction is reversed (2012: 140). We set this case aside for the time being, and jump directly to her alternative proposal.</p>
<p id="P106">Instead of causal direction, Kratzer&#x2019;s account is based on the asymmetry between situations that <italic>confirm a nonaccidental generalization</italic> and those that, while not upsetting the generalization, don&#x2019;t confirm it either. (&#x2018;All ravens are black&#x2019; is supposed to be confirmed by the sighting of a black raven, but not by the sighting of a non-black thing that is also not a raven; the sighting of a non-black raven would of course falsify the generalization.) Notoriously, what counts as a confirming situation in this milieu depends on the wording of the generalization (&#x2018;All ravens are black&#x2019; is confirmed differently than the logically equivalent &#x2018;All non-black things are non-ravens&#x2019;). In particular, Kratzer&#x2019;s account predicts (2012: 141&#x2013;43) that if the generalization is worded as &#x2018;whenever <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M246"><mml:mrow><mml:mi>P</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M247"><mml:mrow><mml:mi>Q</mml:mi></mml:mrow></mml:math></inline-formula>&#x2019; then a confirming situation is one where both <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M248"><mml:mrow><mml:mi>P</mml:mi></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M249"><mml:mrow><mml:mi>Q</mml:mi></mml:mrow></mml:math></inline-formula> are the case (as opposed to one where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M100"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>Q</mml:mi></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M101"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>P</mml:mi></mml:mrow></mml:math></inline-formula> are the case).</p>
<p id="P107">Suppose the generalization operative across (13) and (14) is &#x2018;Whenever it doesn&#x2019;t rain and the sprinkler is off, the grass is dry.&#x2019; Hence a case where it doesn&#x2019;t rain, the sprinkler is off and the grass is dry is a confirming instance of the generalization, while a case where it doesn&#x2019;t rain, the sprinkler is on, and the grass is wet, is not. According to <xref rid="R36" ref-type="bibr">Kratzer&#x2019;s (2012</xref>: 144) <italic>confirming proposition constraint,</italic> facts that yield confirming instances of nonaccidental generalizations are preferred when it comes to supplementing the antecedent of a counterfactual. This means that we will supplement the hypothesis that it hasn&#x2019;t rained with the fact that the sprinkler is off (rather than the fact that the grass is wet), and hence that (13) is true, and (14) false.<sup><xref rid="fn67" ref-type="fn">67</xref></sup></p>
<p id="P108">Note that Kratzer&#x2019;s account makes different predictions to one based on causal asymmetry. We can compare it to such an account by considering a minimal pair of conditionals that differ in causal direction (from antecedent to consequent), but not in their verifying situation.<sup><xref rid="fn68" ref-type="fn">68</xref></sup> Suppose Bob decides whether to go to the office holiday party based solely on whether Alice is going. If she is going, then he stays at home, but if she isn&#x2019;t going, he goes. This year, Alice stays home, and so Bob goes.</p>
<table-wrap id="T38" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">(44)</td>
<td align="left" valign="top">If Alice had gone to the party, then Bob would have stayed home. [<italic>True</italic>]</td>
</tr>
<tr>
<td align="left" valign="top">(45)</td>
<td align="left" valign="top">If Bob had stayed home, then Alice would have gone to the party. [<italic>False</italic>]</td>
</tr>
</tbody>
</table>
</table-wrap>
<p id="P109">We judge the first counterfactual true and the second false. On a causal account, this is easily explained: it is because Bob&#x2019;s doings <italic>have no effect</italic> on Alice&#x2019;s actions. Kratzer&#x2019;s noncausal account, of course, cannot say this. It treats the rule as a causally neutral biconditional: <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M102"><mml:mrow><mml:mi>A</mml:mi><mml:mo>&#x2194;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula>.<sup><xref rid="fn69" ref-type="fn">69</xref></sup> Of course, by this rule, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M250"><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:math></inline-formula> follows from <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M103"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> just as much as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M104"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> follows from <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M251"><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:math></inline-formula>. Note that no supplementary premises are required for either inference, so Kratzer&#x2019;s confirming proposition constraint (which constrains the supplementation of a counterfactual antecedent) doesn&#x2019;t get traction here. But even if the constraint did apply, the verifying situation is the same for both sentences (i.e., one where Alice goes and Bob stays), so no matter the wording of the rule (whether it is &#x2018;Alice goes if and only if Bob stays&#x2019;, or &#x2018;Alice stays if and only if Bob goes&#x2019;), no difference in judgment would be predicted.<sup><xref rid="fn70" ref-type="fn">70</xref></sup></p>
</sec>
<sec id="S14">
<label>5.3.</label><title>The King</title>
<p id="P110"><xref rid="R36" ref-type="bibr">Kratzer (2012</xref>: 140) prefers a noncausal account of the difference between examples like (13) and (14) in part because she takes the following case to belong to the same camp (viz., &#x201C;Goodman&#x2019;s Puzzle&#x201D;), and hence to warrant an explanation in kind.
<table-wrap id="T39" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="3" align="left" valign="top">(46)</td>
<td colspan="2" align="left" valign="top"><italic>Whenever the Royal Bavarian Flag is up and the lights are on at Leoni Castle, the King of Bavaria is home. As it happens, the lights are on, but the flag is down and the king is away</italic>.</td>
</tr>
<tr>
<td align="left" valign="top">a.</td>
<td align="left" valign="top">If the flag had been up, the king would have been home. [<italic>True</italic>]</td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top">If the flag had been up, the lights would have been off. [<italic>False</italic>]</td>
</tr>
</tbody>
</table>
</table-wrap>
Our anti-abductive semantics for <italic>would</italic>-counterfactuals makes the wrong predictions for (46). When the lights are on and the flag is up, they are so, presumably, <italic>because</italic> the king is home. It follows that the inference from the flag hypothetically being up (and the lights being on) to the king being home is abductive&#x2014;and so the account (incorrectly) predicts (46a) to be false or infelicitous. Furthermore, the inference supporting (46b) is <italic>not</italic> an abduction,<sup><xref rid="fn71" ref-type="fn">71</xref></sup> and hence a constraint on abduction cannot explain its falsity.</p>
<p id="P111">The second disparity is easier to address than the first. We agree that (46b) is supported by a non-abductive inference, but propose that this inference is obscured by a more salient one supporting (46a).<sup><xref rid="fn72" ref-type="fn">72</xref></sup> Note that once a <italic>since</italic>-clause specifying the appropriate factual premise is added, foregrounding the inference in question, the counterfactual sounds true:
<table-wrap id="T40" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">(47)</td>
<td align="left" valign="top">If the flag had been up, the lights would have been off, since the king is away. [<italic>True</italic>]</td>
</tr>
</tbody>
</table>
</table-wrap></p>
<p id="P112">Our proposal is similar to Kratzer&#x2019;s own explanation of the initial falsity judgment for (46b). On her account, the operative generalization privileges a different argument, whose supplementary premise and conclusion are primed by the wording of the rule (see <xref rid="S13" ref-type="sec">&#x00A7;5.2</xref>).<sup><xref rid="fn73" ref-type="fn">73</xref></sup></p>
<p id="P113">Our account of (46b) presupposes the (more salient) veracity of (46a). How then are we to account for <italic>this</italic> judgment? The first thing to note is that the flag and the lights function as a <italic>signal</italic> of the king&#x2019;s presence at the castle. Indeed, this is critical to the way Kratzer&#x2019;s case operates (cf. <xref rid="R54" ref-type="bibr">Schulz 2007</xref>: 89&#x2013;90). If we remove this feature, the judgments revert to the pattern predicted by anti-abductivity:
<table-wrap id="T41" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">(48)</td>
<td colspan="2" align="left" valign="top"><italic>The only person authorized to raise the flag at Leoni castle is the steward. So:</italic></td>
</tr>
<tr>
<td align="left" valign="top"></td>
<td align="left" valign="top"><italic>a.</italic></td>
<td align="left" valign="top">#If the flag had been up, the steward would have been home.</td>
</tr>
<tr>
<td align="left" valign="top"></td>
<td align="left" valign="top">b.</td>
<td align="left" valign="top">If the flag had been up, the steward would have to have been home. [<italic>True</italic>]</td>
</tr>
</tbody>
</table>
</table-wrap></p>
<p id="P114">Now it is well known that <italic>evidential marking</italic> can be sensitive to the distinction between the content of a signal (or report) and the conclusion of an inference.<sup><xref rid="fn74" ref-type="fn">74</xref></sup> For instance, <italic>will</italic> and <italic>must</italic>, which we know to be compatible with inference, are both incompatible with reportage. Suppose you are some distance from the library and observe a sign on the door that reads &#x2018;closed&#x2019;, it would be moderately eccentric to then muse to yourself:<sup><xref rid="fn75" ref-type="fn">75</xref></sup>
<table-wrap id="T42" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">(49)</td>
<td align="left" valign="top">??The library will be closed.</td>
</tr>
</tbody>
</table>
</table-wrap></p>
<p id="P115">This could be because the inference from the sign to the store&#x2019;s being closed is abductive, but in that case we would expect the sentence to improve with <italic>must</italic>. However, neither is it quite right to say:
<table-wrap id="T43" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">(50)</td>
<td align="left" valign="top">??The library must be closed.</td>
</tr>
</tbody>
</table>
</table-wrap></p>
<p id="P116">The appropriate thing to say is just, &#x2018;The library is closed&#x2019;. What is more, changing the direction of causation doesn&#x2019;t alter the judgments. Suppose the game ends when the referee blows her whistle (the signal, in this case, is the cause of what it signals). It is odd, once again, to utter either (51a) or (51b) upon hearing the whistle. Only (51c) is acceptable.</p>
<table-wrap id="T44" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="3" align="left" valign="top">(51)</td>
<td align="left" valign="top">a.</td>
<td align="left" valign="top">??The game will be over.</td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top">??The game must be over.</td>
</tr>
<tr>
<td align="left" valign="top">c.</td>
<td align="left" valign="top">The game is over.</td>
</tr>
</tbody>
</table>
</table-wrap>
<p id="P117">Note that <italic>will</italic> is fine if the inference is to other (non-signalled) consequences of the whistle blowing (e.g., &#x2018;Her ears will be ringing&#x2019;).</p>
<p id="P118">Kratzer&#x2019;s King of Bavaria case would seem to belong to the same category. Suppose you are passing Leoni Castle and you notice the flag and lights (the official signs of the King&#x2019;s installation there). The first two remarks (directed to yourself, or a blind companion) seem odd by comparison with the third:
<table-wrap id="T45" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="3" align="left" valign="top">(52)</td>
<td align="left" valign="top">a.</td>
<td align="left" valign="top">??The king will be home.</td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top">??The king must be home.</td>
</tr>
<tr>
<td align="left" valign="top">c.</td>
<td align="left" valign="top">The king is home.</td>
</tr>
</tbody>
</table>
</table-wrap></p>
<p id="P119">Note that (52a) is improved if the king&#x2019;s presence is inferred instead from the fact that today is the national holiday that he traditionally spends at the castle.</p>
<p id="P120">What we propose, then, is that the justification for the prejacent of <italic>would</italic> as it occurs in (46a) is not inferential, but testimonial. It is the &#x201C;report&#x201D; made by the flag and the lights, rather than an inference to their likely cause, that secures the connection between antecedent and consequent. Of course, for this approach to predict the judgment that (46a) is good, it must be that <italic>would</italic> is compatible with reported prejacents. But this seems to be so, based on other judgments:<sup><xref rid="fn76" ref-type="fn">76</xref></sup>
<table-wrap id="T46" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="2" align="left" valign="top">(53)</td>
<td align="left" valign="top">a.</td>
<td align="left" valign="top">If there had been a &#x2018;closed&#x2019; sign on the door, the library would have been closed. [<italic>True</italic>]</td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top">If the referee had blown her whistle, the game would have been over. [<italic>True</italic>]</td>
</tr>
</tbody>
</table>
</table-wrap></p>
<p id="P121">Note that the judgment in (53a) is surprising if the connection is inferential rather than reportative, since the inference in question is abductive. (Why is there a &#x2018;closed&#x2019; sign on the door? Because the store is closed.)</p>
<p id="P122">Up to this point in the paper, we have dwelt on analogies between <italic>would</italic> and <italic>will</italic>. But here at the end we suggest a difference: <italic>will</italic> is anti-reportative, while <italic>would</italic> is not. Hopefully it is clear that this proposal is open to us; the mere fact that <italic>will</italic> and <italic>would</italic> share morphology does not mean they must restrict evidence in exactly the same way. Indeed, there is reason to expect just this difference. While there is an alternative to <italic>will</italic> (and <italic>must</italic>)&#x2014;the (reportative) simple clause&#x2014;in the non-counterfactual paradigm, there is no similar option in the consequent of a counterfactual.<sup><xref rid="fn77" ref-type="fn">77</xref></sup> As a result, if testimonial justifications belong in counterfactual structures, the task of admitting them will fall to a modal auxiliary, and <italic>would</italic> is a natural choice.</p>
</sec>
</sec>
<sec id="S15">
<label>6.</label><title>Conclusion</title>
<p id="P123">We have argued that the actual difference between counterfactuals and indicatives is the relatively mild one of marking whether the antecedent may be assumed false. The greater alleged differences are due instead to the presence of the anti-abductive modal auxiliary <italic>would</italic>, and reappear in indicative counterparts with <italic>will</italic>.</p>
<p id="P124">We are not the first to argue that <italic>would</italic>-counterfactuals and <italic>will</italic>-conditionals belong together (<xref rid="R5" ref-type="bibr">Bennett 2003</xref>: 13&#x2013;15; <xref rid="R16" ref-type="bibr">Dudman 1988</xref>; <xref rid="R17" ref-type="bibr">2001</xref>). But those earlier claimants have not clearly distinguished the two senses of <italic>will</italic>, and so have not based the comparison on its inferential meaning.<sup><xref rid="fn78" ref-type="fn">78</xref></sup> Nor have they pursued the ramifications of this co-classification along the lines we do here.<sup><xref rid="fn79" ref-type="fn">79</xref></sup> In particular, it has not been previously observed that the common constraint is anti-abductivity.<sup><xref rid="fn80" ref-type="fn">80</xref></sup> Hence it has not been argued, on that basis, that anti-abductivity and counterfactuality are dissociable in English. Previous co-classification accounts, lacking these attainments, have failed to draw sustained support (<xref rid="R5" ref-type="bibr">Bennett 2003</xref>: 15).</p>
<p id="P125">We believe that anti-abductivity is most naturally understood as a refinement of the <italic>inferential evidential restriction</italic> (<xref rid="R66" ref-type="bibr">Winans 2016</xref>: 39), rather than indicating a <italic>sui generis</italic> modal category. Framing <italic>would</italic> as an inferential evidential provides independent motivation for the nontriviality constraint argued for by Ippolito (<xref rid="S13" ref-type="sec">&#x00A7;5.2</xref>), and evidential categories have also helped us develop a response to Kratzer&#x2019;s puzzling example (<xref rid="S14" ref-type="sec">&#x00A7;5.3</xref>). But above all, there is, as far as we can see, no <italic>a priori</italic> reason to style an abductive modal <italic>epistemic</italic> and an anti-abductive one <italic>metaphysical</italic> (<italic>pace</italic> <xref rid="R54" ref-type="bibr">Schulz 2007</xref>: 127). We don&#x2019;t see abduction as particularly subjective or information-sensitive, nor do we associate forward inference with objectivity. The interventionist metaphor was supposed to push us in that direction, but its rhetorical force waned with interventionism&#x2019;s empirical credentials.</p>
<p id="P126">If we are correct in our main point, the consequences could be far reaching. Since the middle of the last century, it has been assumed that the difference between conditionals (1a) and (1b) is representative of the difference between counterfactual and indicative&#x2014;between reasoning about what is and what might otherwise have been. Significant texts about the nature of modality and modal reasoning have been written under that assumption, and it remains to be seen what we can still make of them in its absence.</p>
</sec>
</body>
<back>
<ack id="S16">
<title>Acknowledgements</title>
<p id="P127">We thank the referees and editorial team at <italic>Ergo</italic> for their care and good advice. Copious thanks also to Will Starr, Gabe Greenberg, Nathan Klinedinst, and Jessica Rett.</p>
</ack>
<fn-group>
<fn id="fn1"><label>1.</label><p id="P128">In particular, about (causal) laws:</p>
<p id="P129">We could say that people&#x2019;s use of counterfactual statements is aimed precisely at conveying generic causal information, uncontaminated by specific, transitory observations, about the real world. Observed facts often do reflect strange combinations of rare eventualities &#x2026; that have nothing to do with general traits of influence and behavior. The counterfactual sentence, however, emphasizes the law-like, necessary component of the relation considered. (<xref rid="R4" ref-type="bibr">Balke and Pearl 1994</xref>: 231)</p></fn>
<fn id="fn2"><label>2.</label><p id="P130">Two more from <xref rid="R27" ref-type="bibr">Humberstone (2011)</xref>:
<table-wrap id="T48" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="2" align="left" valign="top">(i)</td>
<td align="left" valign="top">a.</td>
<td align="left" valign="top">If there was pepper in the tea, I didn&#x2019;t taste it.</td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top">If there had been pepper in the tea, I wouldn&#x2019;t have tasted it.</td>
</tr>
<tr>
<td rowspan="2" align="left" valign="top">(ii)</td>
<td align="left" valign="top">a.</td>
<td align="left" valign="top">If there is a kitten in this room, it is concealed from view.</td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top">If there were a kitten in this room, it would be concealed from view.</td>
</tr>
</tbody>
</table>
</table-wrap></p>
</fn>
<fn id="fn3"><label>3.</label><p id="P131">They are not independent. In contemporary English, a counterfactually marked antecedent requires an (agreeing) modal auxiliary in the consequent. Nevertheless, (1) is not a minimal pair, for reasons it is the task of this paper to elaborate.</p></fn>
<fn id="fn4"><label>4.</label><p id="P132">See, e.g., <xref rid="R40" ref-type="bibr">Leahy (2018</xref>: 58). Note that a stronger counterfactuality is indicated by the &#x201C;two-past&#x201D; or pluperfect form &#x2018;had been&#x2019; (where the clause is interpreted to apply to the present or future; the tense is, in that sense, &#x201C;fake&#x201D;). The difference is that the &#x201C;two-past&#x201D; conditional is infelicitous unless the antecedent is known to be false (see, e.g., <xref rid="R59" ref-type="bibr">Tellings 2016</xref>: 12&#x2013;13).</p></fn>
<fn id="fn5"><label>5.</label><p id="P133">The restriction was first observed by <xref rid="R23" ref-type="bibr">Goodman (1947</xref>: 119&#x2013;120).</p></fn>
<fn id="fn6"><label>6.</label><p id="P134">Some hope to derive the restriction from the baseline difference in felicity where the antecedent is known to be false (following <xref rid="R56" ref-type="bibr">Stalnaker 1975</xref>). Others simply include it in the meaning of the counterfactual morphology (<xref rid="R32" ref-type="bibr">Kaufmann 2013</xref>: 1139&#x2013;40; <xref rid="R57" ref-type="bibr">Starr 2014</xref>: 1039). Either way, the restriction is attributed to the counterfactuality of (1b).</p></fn>
<fn id="fn7"><label>7.</label><p id="P135">For some or all of the theses that follow, consult <xref rid="R5" ref-type="bibr">Bennett (2003)</xref>, <xref rid="R21" ref-type="bibr">Gibbard (1981)</xref>, <xref rid="R24" ref-type="bibr">Harper (1981)</xref>, <xref rid="R36" ref-type="bibr">Kratzer (2012)</xref>, <xref rid="R38" ref-type="bibr">Kripke (1980)</xref>, <xref rid="R41" ref-type="bibr">Lewis (1973</xref>: 74&#x2013;77; <xref rid="R43" ref-type="bibr">1979</xref>), <xref rid="R48" ref-type="bibr">Pearl (2009)</xref>, <xref rid="R56" ref-type="bibr">Stalnaker (1975)</xref>, <xref rid="R65" ref-type="bibr">Williamson (2007)</xref>. It is worth pointing out that contemporary accounts in linguistics and philosophy occupy a range of positions that do not simply endorse all these theses, but rather select and refine them. See, for instance, <xref rid="R32" ref-type="bibr">Kaufmann (2013)</xref> for a developed example.</p></fn>
<fn id="fn8"><label>8.</label><p id="P136">We henceforth treat this arrangement as diagnostic of the inferential use. Note that <italic>will</italic> does not advert, in such cases, to some future moment of (direct) confirmation. The sentence is felicitous whether or not we anticipate such confirmation (cf. <xref rid="R8" ref-type="bibr">Cariani 2020</xref>: 346&#x2013;49). Unlike some theorists, we choose to maintain a distinction between the future and inferential uses, since we believe there are cases where the inferential evidential restriction is absent and the contribution of <italic>will</italic> is purely temporal. Of course, it is unusual for a speaker to claim non-inferential acquaintance with an event occurring in the future, but examples do crop up in speculative fiction (e.g., the title story from <xref rid="R10" ref-type="bibr">Chiang 2002</xref>).</p></fn>
<fn id="fn9"><label>9.</label><p id="P137"><xref rid="R12" ref-type="bibr">Condoravdi (2002)</xref>, <xref rid="R62" ref-type="bibr">Werner (2003</xref>; <xref rid="R63" ref-type="bibr">2006</xref>), <xref rid="R31" ref-type="bibr">Kaufmann (2005)</xref>, <xref rid="R33" ref-type="bibr">Klecha (2014)</xref>. Note <italic>will</italic> passes the basic test for being a &#x201C;strong&#x201D; necessity modal (<xref rid="R19" ref-type="bibr">von Fintel and Iatridou 2008</xref>):
<table-wrap id="T49" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">(i)</td>
<td align="left" valign="top">#Alma will be home right now, though she might not be.</td>
</tr>
</tbody>
</table>
</table-wrap></p>
</fn>
<fn id="fn10"><label>10.</label><p id="P138"><xref rid="R36" ref-type="bibr">Kratzer (2012</xref>: 9). On her account, the premise set is determined by the world of evaluation and certain features of the context of utterance (2012: 8&#x2013;11). Together, these parameters first settle an initial broad base of propositions&#x2014;the <sc>modal base</sc>&#x2014;and a further means of ordering them&#x2014;the <sc>ordering source</sc> (2012: 39). See <xref rid="R32" ref-type="bibr">Kaufmann (2013</xref>: 1140&#x2013;43) for a quick refresher on Kratzer&#x2019;s semantics.</p></fn>
<fn id="fn11"><label>11.</label><p id="P139"><italic>Will</italic> and <italic>must</italic> are thus <sc>inferential evidentials</sc>, a subvariety of indirect evidential in <xref rid="R64" ref-type="bibr">Willett&#x2019;s (1988)</xref> taxonomy. The inference that licenses the evidential also establishes the &#x201C;necessity&#x201D; of the prejacent. For more on modals and evidentials, see <xref rid="R36" ref-type="bibr">Kratzer (2012</xref>: 21&#x2013;23) and references therein.</p></fn>
<fn id="fn12"><label>12.</label><p id="P140">Anaphoricity is the requirement that the premises of the inference are <italic>public</italic>: perceptually available, recently asserted, or just generally known (<xref rid="R58" ref-type="bibr">Stone 1994</xref>). By contrast, <italic>will</italic> seems to require that some premises be known only to the speaker (<xref rid="R66" ref-type="bibr">Winans 2016</xref>: 22).</p></fn>
<fn id="fn13"><label>13.</label><p id="P141"><xref rid="R49" ref-type="bibr">Peirce (1883</xref>: 145) first defines abduction as an inverted syllogistic inference that runs from a &#x201C;result&#x201D; to the &#x201C;case&#x201D; responsible for generating it. Over time, this gets extended to inventing a hypothesis that would explain a surprising fact. Note that abduction in our sense is not meant to be an alternative to, or exclusive of, what is normally meant by <italic>deductive</italic> (or valid) inference.</p></fn>
<fn id="fn14"><label>14.</label><p id="P142">Note we can say, in the same situation:
<table-wrap id="T50" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">(i)</td>
<td align="left" valign="top">That will be the neighbours barbecuing.</td>
</tr>
</tbody>
</table>
</table-wrap></p>
<p id="P143">Winans argues (2016: ch. 3) that this follows on her account. The prejacent of <italic>will</italic> in (i) is the proposition <italic>the smoky smell is</italic> (<italic>the smell of</italic>) <italic>the neighbours barbecuing</italic>, which is of course not the same as the proposition <italic>the neighbours are barbecuing</italic>. While the latter proposition fits the schema &#x2018;there is a smoky smell because <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M252"><mml:mrow><mml:mi>P</mml:mi></mml:mrow></mml:math></inline-formula>&#x2019;, the former does not.</p></fn>
<fn id="fn15"><label>15.</label><p id="P144">Our broader sense of <italic>explanation</italic> follows <xref rid="R34" ref-type="bibr">Kment (2014</xref>: 5):
<disp-quote id="Q1A">
<p id="P143A">To say that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M253"><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:math></inline-formula> explains <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M254"><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:math></inline-formula> is to say that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M255"><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:math></inline-formula> is the reason why <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M256"><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:math></inline-formula> obtains, or that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M257"><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:math></inline-formula> is due to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M258"><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:math></inline-formula>. Explanation in this sense is a metaphysical relation, not an epistemic one. A cause partly explains its effect, but <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M259"><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:math></inline-formula> can also partly explain <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M260"><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:math></inline-formula> without being a cause of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M261"><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote></p>
</fn>
<fn id="fn16"><label>16.</label><p id="P145"><xref rid="R66" ref-type="bibr">Winans 2016</xref>: 58. The languages with a counterpart of <italic>will</italic> (among those she surveys) are: Spanish, Catalan, Turkish, Dutch, German, Greek, Hindi, and Korean.</p></fn>
<fn id="fn17"><label>17.</label><p id="P146">As we will see in <xref rid="S12" ref-type="sec">&#x00A7;5.1</xref>, <italic>will</italic> aligns with <italic>would</italic> on this empirical detail (the two discoveries were independent). Thanks to Will Starr (p.c.) for help with this comparative observation.</p></fn>
<fn id="fn18"><label>18.</label><p id="P147"><xref rid="R7" ref-type="bibr">Bjorndahl and Snider (2015)</xref> are the first (we know of) to argue that anti-abductivity (in the sense of <xref rid="S2" ref-type="sec">&#x00A7;2</xref>) characterizes the behaviour of <italic>would</italic>-counterfactuals.</p></fn>
<fn id="fn19"><label>19.</label><p id="P148c">Specifically, the proposition denoted by the prejacent of the modal auxiliary construction in the consequent.</p></fn>
<fn id="fn20"><label>20.</label><p id="P149">The reasoning in question may be <italic>nonmonotonic</italic>, which means that adding the hypothesis <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M262"><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:math></inline-formula> to the base facts <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M263"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula> has the potential (in principle) to <italic>destroy</italic> an existing inference from <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M264"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula> alone to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M265"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula>. So understood, (9) extends to cases where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M105"><mml:mrow><mml:mi>A</mml:mi><mml:msub><mml:mo>&#x003E;</mml:mo><mml:mrow><mml:mfenced close="]" open="["><mml:mi>C</mml:mi></mml:mfenced></mml:mrow></mml:msub><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> is used to say that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M266"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> would still follow (from <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M267"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula>) <italic>even if A</italic> had been so. Here is an example of such a counterfactual from Shakespeare&#x2019;s <italic>1 Henry IV</italic>:
<disp-quote id="Q1">
<p id="P150">G<sc>lendower</sc></p>
<p id="P151">&#x2026; and at my birth</p>
<p id="P152">The frame and huge foundation of the earth</p>
<p id="P153">Shaked like a coward.</p>
<p id="P154">H<sc>otspur</sc></p>
<p id="P155">Why so it would have done at the same season</p>
<p id="P156">If your mother&#x2019;s cat had but kittened, though yourself</p>
<p id="P157">Had never been born.</p></disp-quote></p>
</fn>
<fn id="fn21"><label>21.</label><p id="P158">Kratzer&#x2019;s benchmark papers provide the standard translation (see her 2012, as well as <xref rid="R42" ref-type="bibr">Lewis 1981</xref>; <xref rid="R41" ref-type="bibr">1973</xref>: 67). See <xref rid="R5" ref-type="bibr">Bennett (2003)</xref> and <xref rid="R65" ref-type="bibr">Williamson (2007)</xref> for arguments against the inferential approach.</p></fn>
<fn id="fn22"><label>22.</label><p id="P159">A famous illustration of the fact that conflicting conditionals may be licensed by different implicit premises is <xref rid="R21" ref-type="bibr">Gibbard&#x2019;s (1981)</xref> riverboat example (cf. <xref rid="R36" ref-type="bibr">Kratzer 2012</xref>: 102&#x2013;3). <xref rid="R40" ref-type="bibr">Leahy (2018</xref>: 64ff.) argues that the point extends to counterfactuals.</p></fn>
<fn id="fn23"><label>23.</label><p id="P160">The following are similar (cf. <xref rid="R4" ref-type="bibr">Balke and Pearl 1994</xref>: 230):
<table-wrap id="T51" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="3" align="left" valign="top">(i)</td>
<td colspan="2" align="left" valign="top">Given that it is now 2020,</td>
</tr>
<tr>
<td align="left" valign="top">a.</td>
<td align="left" valign="top">If Alma had been born in 2000, she would be turning 20. [<italic>True</italic>]</td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top">If Alma had been born in 2000, it would now be 2040. [<italic>False</italic>/#]</td>
</tr>
<tr>
<td rowspan="3" align="left" valign="top">(ii)</td>
<td colspan="2" align="left" valign="top">Given that Alma is turning 40,</td>
</tr>
<tr>
<td align="left" valign="top">a.</td>
<td align="left" valign="top">If she had been born in 2000, she would be turning 20. [<italic>False</italic>/#]</td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top">If she had been born in 2000, it would now be 2040. [<italic>True</italic>]</td>
</tr>
</tbody>
</table>
</table-wrap></p>
<p id="P161">The supplementary premise can alternatively be appended by <italic>since</italic>:
<table-wrap id="T52" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">(iii)</td>
<td align="left" valign="top">If Alma had been born in 2000, she would be turning 20, since it is now 2020.</td>
</tr>
<tr>
<td align="left" valign="top">(iv)</td>
<td align="left" valign="top">If Alma had been born in 2000, it would now be 2040, since she is turning 40.</td>
</tr>
</tbody>
</table>
</table-wrap></p>
<p id="P162">Note that supplementary premises, being factual, occur in the indicative mood and are not presented as hypothetical (we introduce them with <italic>since</italic> or &#x2018;given that&#x2019; rather than <italic>if</italic> ).</p></fn>
<fn id="fn24"><label>24.</label><p id="P163">Compare <xref rid="R58" ref-type="bibr">Stone (1994</xref>: 189), <xref rid="R36" ref-type="bibr">Kratzer (2012</xref>: 6).</p></fn>
<fn id="fn25"><label>25.</label><p id="P164">Both inferences rely, of course, on the background assumption that the grass is wet if and only if either it has rained or the sprinkler was on.</p></fn>
<fn id="fn26"><label>26.</label><p id="P165">Should a compositional morphological derivation be appropriate.</p></fn>
<fn id="fn27"><label>27.</label><p id="P166">The same goes for another famous illustration of the distinction. In the following pair (<xref rid="R2" ref-type="bibr">Adams 1970</xref>: 90), we naturally interpret the (<italic>woll</italic>-free) indicative as true by virtue of an obvious abduction from the circumstances of Kennedy&#x2019;s death:
<table-wrap id="T53" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="2" align="left" valign="top">(i)</td>
<td align="left" valign="top">a.</td>
<td align="left" valign="top">If Oswald didn&#x2019;t kill Kennedy, someone else did.</td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top">If Oswald hadn&#x2019;t killed Kennedy, someone else would have.</td>
</tr>
</tbody>
</table>
</table-wrap></p>
<p id="P167">Abduction is not permitted in the <italic>would</italic>-counterfactual, which means the interpreter is required to insert a more paranoid argument that is not based on the premise of his violent death.</p></fn>
<fn id="fn28"><label>28.</label><p id="P168">Jonathan <xref rid="R5" ref-type="bibr">Bennett (2003</xref>: 274) connects &#x2018;would have to&#x2019; to abduction:
<disp-quote id="Q1B">
<p id="P150a">[The auxiliary verb <italic>have&#x2019;s</italic>] real point is to register the thought that &#x2026; the consequent is acceptable as the <italic>best explanation</italic> for &#x2026; the antecedent. If the plane arrived at 2 p.m., that <italic>would have to have been</italic> because it left at noon&#x2014;the modal &#x2018;have to&#x2019; expresses the compulsion in our being forced to that explanation for lack of any other as good.</p>
</disp-quote></p>
<p>Similarly, <xref rid="R7" ref-type="bibr">Bjorndahl and Snider (2015</xref>: 10, fn. 3) argue that the abductive pattern corresponds to a different reading of the conditional (licensed by the double auxiliary in the consequent, 2015: 8&#x2013;9).</p></fn>
<fn id="fn29"><label>29.</label><p id="P169">Other auxiliary structures work too. For instance:
<table-wrap id="T54" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">(i)</td>
<td align="left" valign="top">If the grass had been dry, the sprinkler couldn&#x2019;t have been on. [<italic>True</italic>]</td>
</tr>
</tbody>
</table>
</table-wrap></p>
<p id="P170">It seems that counterfactual compatibility modals allow abduction (<xref rid="R3" ref-type="bibr">Arregui 2005</xref>: 89, although cf. 93). While it is possible to formulate anti-abductivity for such modals (see fn. 40), they do not seem to carry the constraint. (Thanks to Will Starr p.c. for pressing us to consider compatibility modals.)</p></fn>
<fn id="fn30"><label>30.</label><p id="P171">Under the heading of &#x201C;backtracking&#x201D; counterfactuals. See <xref rid="R43" ref-type="bibr">Lewis (1979</xref>: 458) for a famous discussion. Also <xref rid="R20" ref-type="bibr">Frank 1997</xref> and <xref rid="R3" ref-type="bibr">Arregui 2005</xref>.</p></fn>
<fn id="fn31"><label>31.</label><p id="P172">See, e.g., <xref rid="R14" ref-type="bibr">Davis 1979</xref>: 561. Note the embedded necessity analysis is appropriate for an example like the following:
<table-wrap id="T55" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">(i)</td>
<td align="left" valign="top">An autopsy revealed that his legs had been so badly damaged that if he hadn&#x2019;t died, they would have to have been amputated.</td>
</tr>
</tbody>
</table>
</table-wrap></p>
<p id="P173">Here we can isolate the state of <italic>medical</italic> necessity that would have ensued had the patient not died. It is less clear how to achieve a similar breakdown of (22), as there is no corresponding precept or goal requiring the sprinkler to be on (in the event of no rain, but wet grass). Besides, other abduction permitting constructions only have one auxiliary (see fn. 29), so this tactic will not work generally.</p></fn>
<fn id="fn32"><label>32.</label><p id="P174">Cf. <xref rid="R4" ref-type="bibr">Balke and Pearl 1994</xref>: 232. An indicative analysis is hard to square with the fact that (22) is felicitous when the antecedent is known to be false&#x2014;the hallmark of the counterfactual conditional. One could draw the indicative/counterfactual boundary differently, but there is pressure to group <italic>would</italic>- and &#x2018;would have to&#x2019;-conditionals together, as both auxiliary structures can occur on different clauses of the same consequent (cf. <xref rid="R27" ref-type="bibr">Humberstone 2011</xref>: 943&#x2013;44):
<table-wrap id="T56" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">(i)</td>
<td align="left" valign="top">If it hadn&#x2019;t rained, the grass would be dry or else the sprinkler would have to have been on.</td>
</tr>
</tbody>
</table>
</table-wrap></p>
<p id="P175">Furthermore, a &#x2018;would have to&#x2019;-clause cannot occur in parallel with an indicative clause in the consequent:
<table-wrap id="T57" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">(ii)</td>
<td align="left" valign="top">*If it hasn&#x2019;t/hadn&#x2019;t rained, the grass is dry or else the sprinkler would have to have been on.</td>
</tr>
</tbody>
</table>
</table-wrap></p>
</fn>
<fn id="fn33"><label>33.</label><p id="P176">Schulz does propose that the extra auxiliary <italic>have</italic> makes the epistemic reading prominent (2007: 88&#x2013;91, 128). Nevertheless, she seems committed to <italic>would</italic>-counterfactuals having epistemic readings (see 2007: 88&#x2013;89 and the parenthetical at 2007: 91).</p></fn>
<fn id="fn34"><label>34.</label><p id="P177">While English <italic>would</italic> is a case where the counterfactual (i.e., past tense) morphology may be separated from the morpheme contributing anti-abductivity (<italic>woll</italic>), we do not expect or claim that this should be the case more generally or cross-linguistically (we thank Nathan Klinedinst p.c. for pressing us on this). Indeed, English itself shows a less perspicuous pattern when it comes to the abductive paradigm: &#x2018;would have to&#x2019; is unrelated to <italic>must</italic>, and even contains <italic>would</italic> as a part.</p></fn>
<fn id="fn35"><label>35.</label><p id="P178">See <xref rid="R29" ref-type="bibr">Karawani (2014)</xref> for a recent taxonomy.</p></fn>
<fn id="fn36"><label>36.</label><p id="P179">One could even argue that the ability to distinguish types of inference (with abductive and anti-abductive forms) is particularly useful in the counterfactual domain, where the same hypothesis, supplemented by different facts, can deliver conclusions that are in conflict (see <xref rid="S4" ref-type="sec">&#x00A7;3.1</xref>).</p></fn>
<fn id="fn37"><label>37.</label><p id="P180">This section adapts <xref rid="R7" ref-type="bibr">Bjorndahl and Snider&#x2019;s (2015)</xref> account of anti-abductivity in <italic>would</italic>-counterfactuals. For an alternative formal approach, see <xref rid="R37" ref-type="bibr">Krawczyk (2012)</xref>.</p></fn>
<fn id="fn38"><label>38.</label><p id="P181">While Pearl, who inaugurated the use of SEMs in semantic theory, takes each boolean expression <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M106"><mml:mrow><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mi>X</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> to model <italic>autonomous causal processes</italic>, we generalize this understanding to other (metaphysically) explanatory relationships (cf. <xref rid="R53" ref-type="bibr">Schaffer 2016</xref>).</p></fn>
<fn id="fn39"><label>39.</label><p id="P182">We assume an <italic>acyclic</italic> parent relation, so that a truth assignment can always be computed from an arbitrary assignment to the exogenous variables (i.e., <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M107"><mml:mrow><mml:mi mathvariant="normal">V</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mo>&#x2004;</mml:mo><mml:mo>-</mml:mo><mml:mo>&#x2004;</mml:mo><mml:mi mathvariant="normal">E</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">d</mml:mi></mml:mrow></mml:math></inline-formula>).</p></fn>
<fn id="fn40"><label>40.</label><p id="P183">Though initially presented as a constraint on <italic>inference</italic>, anti-abductivity can be generalized to any modal operator that relates its prejacent to a further set of propositions&#x2014;whether by entailment, compatibility, or something in between.</p></fn>
<fn id="fn41"><label>41.</label><p id="P184">The truth-value of a logically complex formula (metaphysically) depends on the truth-values of the boolean variables that occur within it&#x2014;at least to a first approximation (cf. <xref rid="R52" ref-type="bibr">Rosen 2010</xref>). Note that the <italic>atom</italic> function is applied to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M268"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> merely to strip off negation if present (cf. <xref rid="R7" ref-type="bibr">Bjorndahl and Snider 2015</xref>: 12, fn. 4)&#x2014;a modal auxiliary cannot embed a proposition more complex than a negated atom. Also, to improve legibility, we allow <italic>atom</italic> to extract all the members of Var occurring in a <italic>set</italic> of formulas, and extend the definition of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M108"><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mo>&#x227A;</mml:mo><mml:mi mathvariant='script'>M</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> to unit sets of variables in the obvious way.</p></fn>
<fn id="fn42"><label>42.</label><p id="P185">While <italic>must</italic> requires the contents of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M269"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula> to be public, (anti-anaphoric) <italic>will</italic> requires some members of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M270"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula> (or else some parts of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M109"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula>) to be absent from the public record at the time of utterance. Note that we don&#x2019;t try to represent this requirement in (28). Neither do we offer an account of how <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M271"><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula> is settled (for an anti-anaphoric auxiliary), except to assume that the speaker&#x2019;s (public or private, explicit or implicit) commitment to certain inferential grounds will be a leading factor.</p></fn>
<fn id="fn43"><label>43.</label><p id="P186"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M110"><mml:mrow><mml:mi>S</mml:mi><mml:mo>&#x22A9;</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>, with <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M272"><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula> a set of formulas, means <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M111"><mml:mi>&#x03D5;</mml:mi></mml:math></inline-formula> follows from <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M273"><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula> by logic alone (i.e., without seeing the dependencies in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M112"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula>) ; in other words, every function <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M113"><mml:mrow><mml:mi>f</mml:mi><mml:mo>:</mml:mo><mml:mi mathvariant="normal">V</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:msub><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant='script'>M</mml:mi></mml:msub><mml:mo>&#x2192;</mml:mo><mml:mfenced close="}" open="{"><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> that verifies all the formulas in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M274"><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>, also verifies <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M114"><mml:mi>&#x03D5;</mml:mi></mml:math></inline-formula>. Clause (b) ensures that, if there is direct evidence for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M275"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula>, the speaker is not (trivially) inferring it on those grounds (i.e., from <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M276"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> itself or some other proposition that logically entails it). Instead <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M277"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> must receive an indirect justification, operationalized here as an inference that goes via the (non-logical) dependencies in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M115"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> (cf. <xref rid="R18" ref-type="bibr">von Fintel &amp; Gillies 2010</xref>; <xref rid="R54" ref-type="bibr">Schulz 2007</xref>: 137).</p></fn>
<fn id="fn44"><label>44.</label><p id="P187"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M116"><mml:mrow><mml:mi>S</mml:mi><mml:msub><mml:mo>&#x22A9;</mml:mo><mml:mi mathvariant='script'>M</mml:mi></mml:msub><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>, with <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M278"><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula> a set of formulas, holds iff every truth assignment <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M279"><mml:mrow><mml:mi>v</mml:mi></mml:mrow></mml:math></inline-formula> for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M117"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> that verifies all formulas in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M280"><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula> also verifies <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M118"><mml:mi>&#x03D5;</mml:mi></mml:math></inline-formula>.</p></fn>
<fn id="fn45"><label>45.</label><p id="P188">For an analysis of the anaphoricity of <italic>must</italic>, see <xref rid="R58" ref-type="bibr">Stone (1994)</xref>.</p></fn>
<fn id="fn46"><label>46.</label><p id="P189">Some judgments in this paper suggest that <italic>must</italic> is bad unless the inference is abductive. <xref rid="R58" ref-type="bibr">Stone (1994</xref>: 183) offer clear examples to the contrary, so we don&#x2019;t require this of <italic>must</italic> (or &#x2018;would have to&#x2019;), and trust that the infelicities may be explained as the result of a different violation (e.g., of anaphoricity).</p></fn>
<fn id="fn47"><label>47.</label><p id="P190">As the following contrast demonstrates, extending this account to logically complex consequents is not straightforward (we leave it to future work):
<table-wrap id="T58" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">(i)</td>
<td align="left" valign="top">If it hadn&#x2019;t rained, the grass would be dry or else the sprinkler would have been on. [<italic>False</italic>/#]</td>
</tr>
<tr>
<td align="left" valign="top">(ii)</td>
<td align="left" valign="top">If it hadn&#x2019;t rained, the grass would be dry or else the sprinkler would have to have been on. [<italic>True</italic>]</td>
</tr>
</tbody>
</table>
</table-wrap></p>
<p id="P191">We would like to explain the contrast by showing that the right disjunct of the consequent partially explains the antecedent or a member of the premise set (and hence cannot pair with an anti-abductive modal). However, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M281"><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula> is not an <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M119"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula>-ancestor of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M282"><mml:mrow><mml:mi>R</mml:mi></mml:mrow></mml:math></inline-formula>, and the premise set is empty&#x2014;the disjunctive consequent follows from the antecedent alone (i.e., <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M120"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>R</mml:mi><mml:msub><mml:mo>&#x22A9;</mml:mo><mml:mi mathvariant='script'>M</mml:mi></mml:msub><mml:mo>&#x00AC;</mml:mo><mml:mi>W</mml:mi><mml:mo>&#x2228;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>).</p>
<p id="P192">It may be that anti-abductivity is not correctly formulated. On the other hand, we could see what happens if the inference to each disjunct in the consequent is considered, and gauged for abductivity, separately. To infer a disjunct outright, we would need the negation of the other disjunct as an additional (hypothetical) premise (see <xref rid="R35" ref-type="bibr">Krahmer and Muskens 1994</xref> for a similar suggestion with independent motivation). The inference to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M283"><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula> from <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M121"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>R</mml:mi></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M122"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>W</mml:mi></mml:mrow></mml:math></inline-formula> is abductive, since, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M123"><mml:mrow><mml:mi>S</mml:mi><mml:msub><mml:mo>&#x227A;</mml:mo><mml:mi mathvariant='script'>M</mml:mi></mml:msub><mml:mi>W</mml:mi></mml:mrow></mml:math></inline-formula><italic>,</italic> but the inference to the other disjunct is not. Hence this would be a way to predict the pattern we see without needing to alter our definition of abduction.</p></fn>
<fn id="fn48"><label>48.</label><p id="P193">Cf. <xref rid="R32" ref-type="bibr">Kaufmann (2013</xref>: 1142). We have not made the same replacement in (a) because the antecedent is not required to be factual.</p></fn>
<fn id="fn49"><label>49.</label><p id="P194">Note that this requires that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M124"><mml:mrow><mml:mfenced close="}" open="{"><mml:mi>A</mml:mi></mml:mfenced><mml:mo>&#x222A;</mml:mo><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula> is consistent (otherwise every proposition would be a trivial consequence). We do not represent, in (30), any further constraint on the antecedent, beyond consistency with the premise set. In particular, we do not represent the requirement, contributed by the indicative mood, that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M284"><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:math></inline-formula> is not supposed false. Consult <xref rid="R57" ref-type="bibr">Starr (2014)</xref> for an analysis of indicative and counterfactual conditional antecedents in dynamic semantics.</p></fn>
<fn id="fn50"><label>50.</label><p id="P195">As we have noted (<xref rid="S5" ref-type="sec">&#x00A7;3.2</xref>), judgments pertaining to the abductivity of the supporting inference carry over from indicatives to the corresponding counterfactuals:
<table-wrap id="T59" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="2" align="left" valign="top">(i)</td>
<td align="left" valign="top">a.</td>
<td align="left" valign="top">If it has rained, the grass will be wet. [<italic>True</italic>]</td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top">If it hasn&#x2019;t rained, the sprinkler must have been on (since the grass is wet). [<italic>True</italic>]</td>
</tr>
<tr>
<td rowspan="2" align="left" valign="top">(ii)</td>
<td align="left" valign="top">a.</td>
<td align="left" valign="top">If it had rained, the grass would be wet. [<italic>True</italic>]</td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top">If it hadn&#x2019;t rained, the sprinkler would have to have been on (since the grass is wet). [<italic>True</italic>]</td>
</tr>
</tbody>
</table>
</table-wrap></p>
</fn>
<fn id="fn51"><label>51.</label><p id="P196">This is very rough. A better approximation would be to split the variable between triggering <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M125"><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>X</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and inhibiting <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M126"><mml:mrow><mml:msub><mml:msup><mml:mi>U</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mi>X</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> abnormalities, so that the equation becomes <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M127"><mml:mrow><mml:mi>W</mml:mi><mml:mo>=</mml:mo><mml:mfenced><mml:mrow><mml:mi>R</mml:mi><mml:mo>&#x2228;</mml:mo><mml:mi>S</mml:mi><mml:mo>&#x2228;</mml:mo><mml:msub><mml:mi>U</mml:mi><mml:mi>W</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mo>&#x2227;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:msup><mml:mi>U</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mi>W</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> (cf. <xref rid="R48" ref-type="bibr">Pearl 2009</xref>: 29).</p></fn>
<fn id="fn52"><label>52.</label><p id="P197">The discussion to follow is in line with <xref rid="R26" ref-type="bibr">Hobbs, Stickel, Appelt, and Martin (1993</xref>: 85&#x2013;87), who assume that normality claims will not be among the theorems of the knowledge base.</p></fn>
<fn id="fn53"><label>53.</label><p id="P198">Worse still, for an <italic>anaphoric</italic> modal such as <italic>must</italic>, the premise would need to be common ground.</p></fn>
<fn id="fn54"><label>54.</label><p id="P199">Note that something in the vicinity is what the felicity of certain &#x201C;Heim sequences&#x201D; turns on. See <xref rid="R46" ref-type="bibr">Moss (2012)</xref> and especially the discussion in <xref rid="R44" ref-type="bibr">Lewis (2018</xref>: 488&#x2013;89).</p></fn>
<fn id="fn55"><label>55.</label><p id="P200">Note that &#x201C;epistemic&#x201D; <italic>should</italic> and <italic>ought</italic> are anti-abductive:
<table-wrap id="T60" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">(i)</td>
<td align="left" valign="top">It ought to/should have rained, since the grass is wet. [<italic>False</italic>/#]</td>
</tr>
</tbody>
</table>
</table-wrap></p>
<p id="P201">Cf. <xref rid="R39" ref-type="bibr">Krzy&#x017C;anowska, Wenmackers, and Douven (2013)</xref>.</p></fn>
<fn id="fn56"><label>56.</label><p id="P202">See, e.g, <xref rid="R34" ref-type="bibr">Kment 2014</xref>, <xref rid="R55" ref-type="bibr">Sloman and Lagnado 2005</xref>.</p></fn>
<fn id="fn57"><label>57.</label><p id="P203">Boris Kment&#x2019;s proposal about the nature of metaphysical modality and modal reasoning is clearly inspired by the interventionist account of counterfactuals:
<disp-quote id="Q2">
<p id="P204">The function of modal thought is to facilitate a common type of thought experiment&#x2014;counterfactual reasoning&#x2014;that allows us to investigate explanatory connections and which is closely related to the controlled experiments of empirical science. Necessity is defined in terms of explanation, and modal facts often reflect underlying facts about explanatory relationships. The study of modal facts is important for philosophy, not because these facts are of much metaphysical interest in their own right, but largely because they provide evidence about explanatory connections. (<xref rid="R34" ref-type="bibr">Kment 2014</xref>: 1&#x2013;2)</p></disp-quote></p></fn>
<fn id="fn58"><label>58.</label><p id="P205">Here we follow <xref rid="R25" ref-type="bibr">Hiddleston 2005</xref>.</p></fn>
<fn id="fn59"><label>59.</label><p id="P206">If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M285"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> is not downstream of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M286"><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M128"><mml:mrow><mml:mi>A</mml:mi><mml:mo>&#x003E;</mml:mo><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> is only true if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M287"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> is (by option (b)). We can think of this case as dispensing with inferential support, or else (incorporating a bit more of the interventionist algorithm) as requiring exclusively forward inference (from the facts of the causal background responsible for bringing about <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M288"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula>).</p></fn>
<fn id="fn60"><label>60.</label><p id="P207">The background model (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M133A"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi></mml:mrow></mml:math></inline-formula>) relates three propositions&#x2014;<italic>the firework denonated</italic> (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M289"><mml:mrow><mml:mi>D</mml:mi></mml:mrow></mml:math></inline-formula>)<italic>, there was a flash</italic> (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M290"><mml:mrow><mml:mi>F</mml:mi></mml:mrow></mml:math></inline-formula>)<italic>, there was a bang</italic> (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M291"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula>)&#x2014;by the dependencies <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M129"><mml:mrow><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mi>F</mml:mi></mml:msub><mml:mo>&#x2261;</mml:mo><mml:mi>D</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M130"><mml:mrow><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mi>B</mml:mi></mml:msub><mml:mo>&#x2261;</mml:mo><mml:mi>D</mml:mi></mml:mrow></mml:math></inline-formula>. The truth-assignment (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M292"><mml:mrow><mml:mi>v</mml:mi></mml:mrow></mml:math></inline-formula>) is such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M131"><mml:mrow><mml:mi>v</mml:mi><mml:mfenced><mml:mi>D</mml:mi></mml:mfenced><mml:mo>=</mml:mo><mml:mi>v</mml:mi><mml:mfenced><mml:mi>F</mml:mi></mml:mfenced><mml:mo>=</mml:mo><mml:mi>v</mml:mi><mml:mfenced><mml:mi>B</mml:mi></mml:mfenced><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula>). By (38), the truth-value of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M132"><mml:mrow><mml:mi>F</mml:mi><mml:mo>&#x003E;</mml:mo><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M133"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi></mml:mrow></mml:math></inline-formula> corresponds to that of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M293"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M134"><mml:mrow><mml:msub><mml:mi mathvariant='script'>M</mml:mi><mml:mi>F</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M135"><mml:msup><mml:mi>v</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M136"><mml:mrow><mml:msup><mml:mi>v</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:msub><mml:mo>~</mml:mo><mml:mrow><mml:mfenced close="}" open="{"><mml:mrow><mml:mi>F</mml:mi><mml:mo>,</mml:mo><mml:mi>B</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:msub><mml:mi>v</mml:mi></mml:mrow></mml:math></inline-formula>. Now <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M137"><mml:mrow><mml:msup><mml:mi>v</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mfenced><mml:mi>D</mml:mi></mml:mfenced><mml:mo>=</mml:mo><mml:mi>v</mml:mi><mml:mfenced><mml:mi>D</mml:mi></mml:mfenced><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M138"><mml:mrow><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mi>B</mml:mi></mml:msub><mml:mo>&#x2261;</mml:mo><mml:mi>D</mml:mi></mml:mrow></mml:math></inline-formula> (this formula is unchanged) in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M139"><mml:mrow><mml:msub><mml:mi mathvariant='script'>M</mml:mi><mml:mi>F</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>. Hence <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M140"><mml:mrow><mml:msup><mml:mi>v</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mfenced><mml:mi>B</mml:mi></mml:mfenced><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula>.</p></fn>
<fn id="fn61"><label>61.</label><p id="P208">Commenting on <xref rid="R15" ref-type="bibr">Downing&#x2019;s (1959)</xref> example (below), Lewis notes (1979: 456&#x2013;57) that backtracking arguments are typically obscured by more straightforward ones; linguistic scaffolding is necessary to bring them into focus. For example, an immediate inference supports the consequent of (i), obscuring the backtracking inference to the opposite conclusion, until the necessary lemma (the common cause of the antecedent and the consequent of (iii)) is established by the intervening (abductive) counterfactual (ii):
<table-wrap id="T61" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="2" align="left" valign="top">(i)</td>
<td align="left" valign="top"><italic>Jim and Jack quarreled yesterday, and Jack is still hopping mad. We conclude that</italic></td>
</tr>
<tr>
<td align="left" valign="top">If Jim asked Jack for help today, Jack would not help him.</td>
</tr>
<tr>
<td rowspan="2" align="left" valign="top">(ii)</td>
<td align="left" valign="top"><italic>But wait: Jim is a prideful fellow. He never would ask for help after such a quarrel</italic>;</td>
</tr>
<tr>
<td align="left" valign="top">If Jim were to ask Jack for help today, there would have to have been no quarrel yesterday.</td>
</tr>
<tr>
<td rowspan="2" align="left" valign="top">(iii)</td>
<td align="left" valign="top"><italic>In that case Jack would be his usual generous self. So</italic></td>
</tr>
<tr>
<td align="left" valign="top">If Jim asked Jack for help today, Jack would help him after all.</td>
</tr>
</tbody>
</table>
</table-wrap></p>
</fn>
<fn id="fn62"><label>62.</label><p id="P209"><xref rid="R25" ref-type="bibr">Hiddleston (2005)</xref> develops a semantics that predicts the truth of (39) by relaxing interventionism&#x2019;s strict prohibition on abductive steps. However, he does so in a way that fails to distinguish abduction (&#x2018;backwards&#x2019;) from common cause (&#x2018;backtracking&#x2019;) inference. Whenever it is possible to infer <italic>via</italic> a common cause on his semantics, it is also possible to stop one step short and infer to that cause (i.e., abductively). His account, therefore, does not generate the empirical contour just described. The same criticism extends to more recent models that pursue the same approach of relaxing anti-abductivity to enable common cause inference, including <xref rid="R51" ref-type="bibr">Rips&#x2019;s (2010)</xref> minimal network model and <xref rid="R45" ref-type="bibr">Lucas and Kemp&#x2019;s (2015)</xref> extended structural model.</p></fn>
<fn id="fn63"><label>63.</label><p id="P210">See (3) in <xref rid="S2" ref-type="sec">&#x00A7;2</xref>, and the discussion (of clause (b)) in (28) and (30). See also <xref rid="R23" ref-type="bibr">Goodman (1947</xref>: 117&#x2013;19).</p></fn>
<fn id="fn64"><label>64.</label><p id="P211">See, e.g., <xref rid="R5" ref-type="bibr">Bennett (2003</xref>: 235) for an attempt.</p></fn>
<fn id="fn65"><label>65.</label><p id="P212">A random outcome cannot be inferred from the prior state of the universe. The alternatives are trivial inference (ruled out by nontriviality) and abductive inference (ruled out by anti-abductivity). This explains why <italic>would</italic>-counterfactuals whose consequents state a random outcome (as opposed to a nontrivial consequence of such an outcome) tend to be false.</p></fn>
<fn id="fn66"><label>66.</label><p id="P213">Further evidence that reasoning from the truth of the consequent is not permitted is that when the premise is explicit, the result is clearly infelicitous:
<table-wrap id="T62" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">(i)</td>
<td align="left" valign="top">#But even if it had not been raining, Jones would have been wearing his hat, since he is wearing his hat.</td>
</tr>
<tr>
<td align="left" valign="top">(ii)</td>
<td align="left" valign="top">#If Smith had tossed the coin instead of Jones, it would still have landed heads, since it landed heads.</td>
</tr>
</tbody>
</table>
</table-wrap></p>
<p id="P214">The same goes for reasoning from the falsity of the antecedent:
<table-wrap id="T63" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">(iii)</td>
<td align="left" valign="top">#But even if it had not been raining, Jones would have been wearing his hat, since it has been raining.</td>
</tr>
</tbody>
</table>
</table-wrap></p>
<p id="P215">Note that being explicit is fine in those cases where the judgment is <italic>true</italic>:
<table-wrap id="T64" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">(iv)</td>
<td align="left" valign="top">But even if it had not been raining, Jones would have been wearing his hat, since the coin landed heads. [<italic>True</italic>]</td>
</tr>
<tr>
<td align="left" valign="top">(v)</td>
<td align="left" valign="top">If Smith had rolled the dice instead of Jones, he would have been home, since they came up double six. [<italic>True</italic>]</td>
</tr>
</tbody>
</table>
</table-wrap></p>
</fn>
<fn id="fn67"><label>67.</label><p id="P216">This (correct) prediction rests on the assumption that the generalization has the wording in the text. If instead it is: &#x2018;Whenever it rains or the sprinkler is on, the grass is wet&#x2019;, then those predictions are reversed, since the alternative situation where the sprinkler is on and the grass is wet will be confirmatory instead. Kratzer&#x2019;s account therefore appears overly subtle. Whichever wording is used, it seems, we judge (13) true and (14) false/infelicitous.</p></fn>
<fn id="fn68"><label>68.</label><p id="P217">The case is borrowed from <xref rid="R7" ref-type="bibr">Bjorndahl and Snider (2015)</xref>.</p></fn>
<fn id="fn69"><label>69.</label><p id="P218">As opposed to the <italic>asymmetric</italic> structural equation <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M141a"><mml:mrow><mml:mi>B</mml:mi><mml:mo>=</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>A</mml:mi></mml:mrow></mml:math></inline-formula> (with dependent variable on the left). Here <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M294"><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:math></inline-formula> is <italic>Alice goes to the party</italic> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M295"><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> is <italic>Bob goes to the party</italic>.</p></fn>
<fn id="fn70"><label>70.</label><p id="P219">Kratzer&#x2019;s complete approach includes a further piece of apparatus, a relation between propositions she terms <italic>lumping</italic> (2012: 118). Suppose one day Paula paints a still life that includes some apples and some bananas. The proposition that Paula painted a still life (on that occasion) <italic>lumps</italic> (relative to the actual world) the proposition that she painted apples and the proposition that she painted bananas (2012: 113). The truth-makers of lumped propositions are not independent: the minimal situation that makes the proposition that she painted apples true is a part of the minimal situation that makes the proposition that she painted a still life true.</p>
<p id="P220">While lumping is not a causal notion, it is based on other (i.e., noncausal) relations of metaphysical dependency. Roughly speaking, whenever one proposition <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M296"><mml:mrow><mml:mi>P</mml:mi></mml:mrow></mml:math></inline-formula> lumps another <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M297"><mml:mrow><mml:mi>Q</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M298"><mml:mrow><mml:mi>P</mml:mi></mml:mrow></mml:math></inline-formula> depends (non-causally) on <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M299"><mml:mrow><mml:mi>Q</mml:mi></mml:mrow></mml:math></inline-formula>. In the case of Paula&#x2019;s still life, the metaphysical dependency is underwritten by the <italic>composition</italic> relation (<xref rid="R6" ref-type="bibr">Bennett 2017</xref>: 8). For our part, we agree with Kratzer that <italic>would</italic>-counterfactuals are sensitive to lumping, since we believe they are sensitive to noncausal metaphysical dependency (recall example (6)). (Note that for us, the specific relationship is the one set out in (24), which differs from Kratzer&#x2019;s own account. Note further that we would not necessarily agree with all of the applications of lumping in her 2012: at least some of the problem cases she considers are better explained as violations of <italic>nontriviality</italic>.) However, we <italic>also</italic> believe they are sensitive to <italic>causal</italic> dependency. We take both forms of sensitivity to spring from a general ban on abduction.</p></fn>
<fn id="fn71"><label>71.</label><p id="P221">We can either suppose that the king&#x2019;s departure resulted in the lights being turned off, or that the flag&#x2019;s staying up played a role in this too. Either way, the lights&#x2019; being off is not a causal ancestor of either premise.</p></fn>
<fn id="fn72"><label>72.</label><p id="P222">If the king is home (the conclusion of (46a)), then the lights must be on, not off. Compare the discussion of backtracking arguments in fn. (61).</p></fn>
<fn id="fn73"><label>73.</label><p id="P223">Kratzer, too, shows that the effect can be reversed (2012: 145). While we are sympathetic to her account in this case, we maintain that the approach fails to be general, and in particular does not suffice to explain the judgment in (14). Though (47) is true, a similar attempt to repair (14) by filling in the supplementary premise fails, as we have already noted:
<table-wrap id="T65" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">(i)</td>
<td align="left" valign="top">#If it hadn&#x2019;t rained, the sprinkler would have been on, since the grass is wet.</td>
</tr>
</tbody>
</table>
</table-wrap></p>
</fn>
<fn id="fn74"><label>74.</label><p id="P224">Reportative evidentials mark the former, inferential evidentials the latter. The broader category of indirect justification covers both (see <xref rid="R64" ref-type="bibr">Willett 1988</xref>).</p></fn>
<fn id="fn75"><label>75.</label><p id="P225">The self-talk is used to get around the anti-anaphoricity confound. The oddness persists if instead you are speaking to a companion who is blind and cannot read the sign.</p></fn>
<fn id="fn76"><label>76.</label><p id="P226">The story just told also predicts <italic>will</italic> to be bad in the following conditionals (since the improvement is wrought by the auxiliary <italic>would</italic>, rather than the conditional structure):
<table-wrap id="T66" position="anchor" orientation="portrait">
<table frame="hsides" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td rowspan="2" align="left" valign="top">(i)</td>
<td align="left" valign="top">a.</td>
<td align="left" valign="top">If there is a &#x2018;closed&#x2019; sign on the door, the library? will be/is closed.</td>
</tr>
<tr>
<td align="left" valign="top">b.</td>
<td align="left" valign="top">If the referee has blown the whistle, the game?? will be/is over.</td>
</tr>
</tbody>
</table>
</table-wrap></p>
<p id="P227">The judgments, though weaker in the (a) example, are in the expected direction of preference for the clause without <italic>will</italic>. Moreover, the contrast between <italic>will</italic> and <italic>would</italic> seems clear (<italic>would</italic> in (53) is impeccable).</p></fn>
<fn id="fn77"><label>77.</label><p id="P228">Recall (from fn. 3) that the consequent of a counterfactual (in contemporary English) is required to include a modal auxiliary.</p></fn>
<fn id="fn78"><label>78.</label><p id="P229">It is not clear that the analogy holds for the future sense, which may not (consistently) impose an evidential constraint (in which case it is <italic>a fortiori</italic> not anti-abductive). See fn. 8.</p></fn>
<fn id="fn79"><label>79.</label><p id="P230"><xref rid="R9" ref-type="bibr">Cariani and Santorio (2018)</xref> propose a modal (selection function) semantics for <italic>woll</italic> (and hence common to both <italic>will</italic> and <italic>would</italic>). However, as they spell out (2018: 147&#x2013;148) the selection function ends up being vacuous for unembedded <italic>will</italic>, and hence the account does not generate any substantial constraint in common for inferential <italic>will</italic> and counterfactual <italic>would</italic>.</p></fn>
<fn id="fn80"><label>80.</label><p id="P231"><xref rid="R13" ref-type="bibr">Dancygier and Mioduszewska (1984)</xref> come close with their category of &#x201C;consequential&#x201D; conditionals. They note many of the same empirical patterns, but neither they, nor Humberstone&#x2014;who contributes a further observation (2011: 943)&#x2014;put things together the way we do. Humberstone, in particular, downplays the importance of &#x201C;consequentiality&#x201D; (by comparison to counterfactuality), citing the sort of &#x201C;amalgamations&#x201D; we discuss in fn. 32.</p></fn>
</fn-group>
<ref-list>
<title>References</title>
<ref id="R1"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Abusch</surname>, <given-names>Dorit</given-names></string-name></person-group> (<year>1997</year>). <article-title>Sequence of Tense and Temporal de re.</article-title> <source>Linguistics and Philosophy</source>, <volume>20</volume>(<issue>1</issue>), <fpage>1</fpage>&#x2013;<lpage>50</lpage>.</mixed-citation></ref>
<ref id="R2"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Adams</surname>, <given-names>Ernest J.</given-names></string-name></person-group> (<year>1970</year>). <article-title>Subjunctive and Indicative Conditionals.</article-title> <source>Foundations of Language</source>, <volume>6</volume>(<issue>1</issue>), <fpage>89</fpage>&#x2013;<lpage>94</lpage>.</mixed-citation></ref>
<ref id="R3"><mixed-citation publication-type="thesis"><person-group person-group-type="author"><string-name><surname>Arregui</surname>, <given-names>Ana</given-names></string-name></person-group> (<year>2005</year>). <source>On the Accessibility of Possible Worlds: The Role of Tense and Aspect</source> (<comment>Unpublished doctoral dissertation</comment>). <collab>University of Massachusetts</collab>, <publisher-loc>Amherst</publisher-loc>.</mixed-citation></ref>
<ref id="R4"><mixed-citation publication-type="book"><person-group person-group-type="editor"><string-name><surname>Balke</surname>, <given-names>Alexander</given-names></string-name> and <string-name><given-names>Judea</given-names> <surname>Pearl</surname></string-name> <string-name><given-names>Barbara</given-names> <surname>Hayes-Roth</surname></string-name> and <string-name><given-names>Richard</given-names> <surname>Korf</surname></string-name></person-group> (Eds.), <source>Proceedings of the Twelfth National Conference on Artificial Intelligence</source> (<fpage>230</fpage>&#x2013;<lpage>37</lpage>).</mixed-citation></ref>
<ref id="R5"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Bennett</surname>, <given-names>Jonathan</given-names></string-name></person-group> (<year>2003</year>). <source><italic>A Philosophical Guide to Conditionals</italic>.</source> <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="R6"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Bennett</surname>, <given-names>Karen</given-names></string-name></person-group> (<year>2017</year>). <source><italic>Making Things Up</italic>.</source> <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="R7"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Bjorndahl</surname>, <given-names>Adam</given-names></string-name> and <string-name><given-names>Todd</given-names> <surname>Snider</surname></string-name></person-group> (<year>2015</year>). <chapter-title>Informative Counterfactuals.</chapter-title> In <person-group person-group-type="editor"><string-name><given-names>Sarah</given-names> <surname>D&#x2019;Antonio</surname></string-name>, <string-name><given-names>Mary</given-names> <surname>Moroney</surname></string-name>, and <string-name><given-names>Carol Rose</given-names> <surname>Little</surname></string-name></person-group> (Eds.), <source>Proceedings of SALT</source> <volume>25</volume> (<fpage>1</fpage>&#x2013;<lpage>17</lpage>).</mixed-citation></ref>
<ref id="R8"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Cariani</surname>, <given-names>Fabrizio</given-names></string-name></person-group> (<year>2020</year>). <article-title>On Predicting.</article-title> <source>Ergo</source>, <volume>7</volume>(<issue>11</issue>), <fpage>339</fpage>&#x2013;<lpage>61</lpage>.</mixed-citation></ref>
<ref id="R9"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Cariani</surname>, <given-names>Fabrizio</given-names></string-name> and <string-name><given-names>Paolo</given-names> <surname>Santorio</surname></string-name></person-group> (<year>2018</year>). <article-title><italic>Will</italic> Done Better: Selection Semantics, Future Credence, and Indeterminacy.</article-title> <source>Mind</source>, <volume>127</volume>(<issue>505</issue>), <fpage>129</fpage>&#x2013;<lpage>65</lpage>.</mixed-citation></ref>
<ref id="R10"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Chiang</surname>, <given-names>Ted</given-names></string-name></person-group> (<year>2002</year>). <source><italic>Stories of Your Life and Others</italic>.</source> <publisher-name>Tor Books</publisher-name>.</mixed-citation></ref>
<ref id="R11"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Chisholm</surname>, <given-names>Roderick M.</given-names></string-name></person-group> (<year>1946</year>). <article-title>The Contrary-to-Fact Conditional.</article-title> <source>Mind</source>, <volume>55</volume>(<issue>220</issue>), <fpage>289</fpage>&#x2013;<lpage>307</lpage>.</mixed-citation></ref>
<ref id="R12"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Condoravdi</surname>, <given-names>Cleo</given-names></string-name></person-group> (<year>2002</year>). <chapter-title>Temporal Interpretations of Modals: Modals for the Present and for the Past.</chapter-title> In <person-group person-group-type="editor"><string-name><given-names>David</given-names> <surname>Beaver</surname></string-name>, <string-name><given-names>Stefan</given-names> <surname>Kaufmann</surname></string-name>, <string-name><given-names>Brady</given-names> <surname>Clark</surname></string-name>, and <string-name><given-names>Luis</given-names> <surname>Casillas</surname></string-name></person-group> (Eds.), <source>The Construction of Meaning</source> (<fpage>59</fpage>&#x2013;<lpage>88</lpage>). <publisher-name>CSLI</publisher-name>.</mixed-citation></ref>
<ref id="R13"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Dancygier</surname>, <given-names>Barbara</given-names></string-name> and <string-name><given-names>Ewa</given-names> <surname>Mioduszewska</surname></string-name></person-group> (<year>1984</year><article-title>). Semanto-Pragmatic Classification of Conditionals.</article-title> <source>Studia Anglica Posnaniensia (An International Review of English Studies)</source>, <volume>17</volume>, <fpage>121</fpage>&#x2013;<lpage>33</lpage>.</mixed-citation></ref>
<ref id="R14"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Davis</surname>, <given-names>Wayne A.</given-names></string-name></person-group> (<year>1979</year>). <article-title>Indicative and Subjunctive Conditionals.</article-title> <source>Philosophical Review</source>, <volume>88</volume>(<issue>4</issue>), <fpage>544</fpage>&#x2013;<lpage>64</lpage>.</mixed-citation></ref>
<ref id="R15"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Downing</surname>, <given-names>P. B.</given-names></string-name></person-group> (<year>1959</year>). <article-title>Subjunctive Conditionals, Time Order, and Causation.</article-title> <source>Proceedings of the Aristotelian Society, New Series</source>, <volume>59</volume>, <fpage>125</fpage>&#x2013;<lpage>40</lpage>.</mixed-citation></ref>
<ref id="R16"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Dudman</surname>, <given-names>Victor H.</given-names></string-name></person-group> (<year>1988</year>). <article-title>Indicative and Subjunctive.</article-title> <source>Analysis</source>, <volume>48</volume>(<issue>3</issue>), <fpage>113</fpage>&#x2013;<lpage>22</lpage>.</mixed-citation></ref>
<ref id="R17"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Dudman</surname>, <given-names>Victor H.</given-names></string-name></person-group> (<year>2001</year>). <article-title>Three Twentieth-Century Commonplaces about &#x2018;If&#x2019;.</article-title> <source>History and Philosophy of Logic</source>, <volume>22</volume>, <fpage>119</fpage>&#x2013;<lpage>27</lpage>.</mixed-citation></ref>
<ref id="R18"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>von Fintel</surname>, <given-names>Kai</given-names></string-name> and <string-name><given-names>Anthony S.</given-names> <surname>Gillies</surname></string-name></person-group> (<year>2010</year>). <article-title>Must &#x2026; Stay &#x2026; Strong!</article-title> <source>Natural Language Semantics</source>, <volume>18</volume>(<issue>4</issue>), <fpage>351</fpage>&#x2013;<lpage>83</lpage>.</mixed-citation></ref>
<ref id="R19"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>von Fintel</surname>, <given-names>Kai</given-names></string-name> and <string-name><given-names>Sabine</given-names> <surname>Iatridou</surname></string-name></person-group> (<year>2008</year>). <chapter-title>How to Say Ought in Foreign: The Composition of Weak Necessity Modals.</chapter-title> In <person-group person-group-type="editor"><string-name><given-names>J.</given-names> <surname>Gu&#x00E9;ron</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Lecarne</surname></string-name></person-group> (Eds.), <source>Time and Modality: Vol. 2. Studies in Natural Language and Linguistic Theory</source> (<fpage>115</fpage>&#x2013;<lpage>41</lpage>). <publisher-name>Springer</publisher-name>.</mixed-citation></ref>
<ref id="R20"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Frank</surname>, <given-names>A.</given-names></string-name></person-group> (<year>1997</year>). <source>Context Dependence in Modal Constructions</source> (<comment>Unpublished doctoral dissertation</comment>). <publisher-name>University of Stuttgart</publisher-name>.</mixed-citation></ref>
<ref id="R21"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Gibbard</surname>, <given-names>Allan F.</given-names></string-name></person-group> (<year>1981</year>). <chapter-title>Two Recent Theories of Conditionals.</chapter-title> In <person-group person-group-type="editor"><string-name><given-names>William L.</given-names> <surname>Harper</surname></string-name>, <string-name><given-names>Robert C.</given-names> <surname>Stalnaker</surname></string-name>, and <string-name><given-names>G.</given-names> <surname>Pearce</surname></string-name></person-group> (Eds.), <source>Ifs: Conditionals, Beliefs, Decision, Chance, Time</source> (<fpage>211</fpage>&#x2013;<lpage>47</lpage>). <publisher-name>D. Reidel</publisher-name>.</mixed-citation></ref>
<ref id="R22"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Gibbard</surname>, <given-names>Allan F.</given-names></string-name> and <string-name><given-names>William L.</given-names> <surname>Harper</surname></string-name></person-group> (<year>1978</year>). <chapter-title>Counterfactuals and Two Kinds of Expected Utility.</chapter-title> In <person-group person-group-type="editor"><string-name><given-names>Clifford</given-names> <surname>Hooker</surname></string-name>, <string-name><given-names>James J.</given-names> <surname>Leach</surname></string-name>, and <string-name><given-names>Edward</given-names> <surname>McClennen</surname></string-name></person-group> (Eds.), <source>Foundations and Applications of Decision Theory</source> (<fpage>125</fpage>&#x2013;<lpage>62</lpage>). <publisher-name>D. Reidel</publisher-name>.</mixed-citation></ref>
<ref id="R23"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Goodman</surname>, <given-names>Nelson</given-names></string-name></person-group> (<year>1947</year>). <article-title>The Problem of Counterfactual Conditionals.</article-title> <source>The Journal of Philosophy</source>, <volume>44</volume>(<issue>5</issue>), <fpage>113</fpage>&#x2013;<lpage>18</lpage>.</mixed-citation></ref>
<ref id="R24"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Harper</surname>, <given-names>William L.</given-names></string-name></person-group> (<year>1981</year>). <chapter-title>A Sketch of Some Recent Developments in the Theory of Conditionals.</chapter-title> In <person-group person-group-type="editor"><string-name><given-names>William L.</given-names> <surname>Harper</surname></string-name>, <string-name><given-names>Robert C.</given-names> <surname>Stalnaker</surname></string-name>, and <string-name><given-names>G.</given-names> <surname>Pearce</surname></string-name></person-group> (Eds.), <source>Ifs: Conditionals, Beliefs, Decision, Chance, Time</source> (<fpage>3</fpage>&#x2013;<lpage>38</lpage>). <publisher-name>D. Reidel</publisher-name>.</mixed-citation></ref>
<ref id="R25"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Hiddleston</surname>, <given-names>Eric</given-names></string-name></person-group> (<year>2005</year>). <article-title>A Causal Theory of Counterfactuals.</article-title> <source>No&#x00FB;s</source>, <volume>39</volume>(<issue>4</issue>), <fpage>632</fpage>&#x2013;<lpage>57</lpage>.</mixed-citation></ref>
<ref id="R26"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Hobbs</surname>, <given-names>Jerry</given-names></string-name>, <string-name><given-names>Mark E.</given-names> <surname>Stickel</surname></string-name>, <string-name><given-names>Douglas E.</given-names> <surname>Appelt</surname></string-name>, and <string-name><given-names>Paul</given-names> <surname>Martin</surname></string-name></person-group> (<year>1993</year>). <article-title>Interpretation as Abduction.</article-title> <source>Artificial Intelligence</source>, <volume>63</volume>(<issue>1&#x2013;2</issue>), <fpage>69</fpage>&#x2013;<lpage>142</lpage>.</mixed-citation></ref>
<ref id="R27"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Humberstone</surname>, <given-names>Lloyd</given-names></string-name></person-group> (<year>2011</year>). <source><italic>The Connectives</italic>.</source> <publisher-name>MIT Press</publisher-name>.</mixed-citation></ref>
<ref id="R28"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ippolito</surname>, <given-names>Michela</given-names></string-name></person-group> (<year>2016</year>). <article-title>How Similar Is Similar Enough?</article-title> <source>Semantics and Pragmatics</source>, <volume>9</volume>(<issue>6</issue>), <fpage>1</fpage>&#x2013;<lpage>60</lpage>.</mixed-citation></ref>
<ref id="R29"><mixed-citation publication-type="thesis"><person-group person-group-type="author"><string-name><surname>Karawani</surname>, <given-names>Hadil</given-names></string-name></person-group> (<year>2014</year>). <source>The Real, the Fake, and the Fake Fake in Counterfactual Conditionals, Crosslinguistically</source> (<comment>Unpublished doctoral dissertation</comment>). <collab>University of Amsterdam</collab>.</mixed-citation></ref>
<ref id="R30"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Karttunen</surname>, <given-names>Lauri</given-names></string-name></person-group> (<year>1972</year>). <chapter-title>Possible and Must.</chapter-title> In <person-group person-group-type="editor"><string-name><given-names>John</given-names> <surname>Kimball</surname></string-name></person-group> (Ed.), <source>Syntax and Semantics</source> (Vol. <volume>1</volume>, <fpage>1</fpage>&#x2013;<lpage>20</lpage>). <publisher-name>Seminar</publisher-name>.</mixed-citation></ref>
<ref id="R31"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kaufmann</surname>, <given-names>Stefan</given-names></string-name></person-group> (<year>2005</year>). <article-title>Conditional Predictions.</article-title> <source>Linguistics and Philosophy</source>, <volume>28</volume>(<issue>2</issue>), <fpage>181</fpage>&#x2013;<lpage>231</lpage>.</mixed-citation></ref>
<ref id="R32"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kaufmann</surname>, <given-names>Stefan</given-names></string-name></person-group> (<year>2013</year>). <article-title>Causal Premise Semantics.</article-title> <source>Cognitive Science</source>, <volume>37</volume>(<issue>6</issue>), <fpage>1136</fpage>&#x2013;<lpage>70</lpage>.</mixed-citation></ref>
<ref id="R33"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Klecha</surname>, <given-names>Peter</given-names></string-name></person-group> (<year>2014</year>). <article-title>Diagnosing Modality in Predictive Expressions.</article-title> <source>Journal of Semantics</source>, <volume>31</volume>(<issue>3</issue>), <fpage>443</fpage>&#x2013;<lpage>55</lpage>.</mixed-citation></ref>
<ref id="R34"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Kment</surname>, <given-names>Boris</given-names></string-name></person-group> (<year>2014</year>). <source><italic>Modality and Explanatory Reasoning</italic>.</source> <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="R35"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Krahmer</surname>, <given-names>Emiel</given-names></string-name> and <string-name><given-names>Reinhard</given-names> <surname>Muskens</surname></string-name></person-group> (<year>1994</year>). <chapter-title>Umbrellas and Bathrooms.</chapter-title> In <person-group person-group-type="editor"><string-name><given-names>M.</given-names> <surname>Harvey</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Santelmann</surname></string-name></person-group> (Eds.), <source>Proceedings of SALT IV</source> (<fpage>179</fpage>&#x2013;<lpage>94</lpage>).</mixed-citation></ref>
<ref id="R36"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Kratzer</surname>, <given-names>Angelika</given-names></string-name></person-group> (<year>2012</year>). <source><italic>Modals and Conditionals</italic>.</source> <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="R37"><mixed-citation publication-type="thesis"><person-group person-group-type="author"><string-name><surname>Krawczyk</surname>, <given-names>Elizabeth A.</given-names></string-name></person-group> (<year>2012</year>). <source>Inferred Propositions and the Expression of the Evidence Relation in Natural Language Evidentiality in Central Alaskan Yup&#x2019;ik Eskimo and English</source> (<comment>Unpublished doctoral dissertation</comment>). <collab>Georgetown University</collab>.</mixed-citation></ref>
<ref id="R38"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Kripke</surname>, <given-names>Saul</given-names></string-name></person-group> (<year>1980</year>). <source>Naming and Necessity.</source> <publisher-name>Harvard University Press</publisher-name>.</mixed-citation></ref>
<ref id="R39"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Krzy&#x017C;anowska</surname>, <given-names>Karolina</given-names></string-name>, <string-name><given-names>Sylvia</given-names> <surname>Wenmackers</surname></string-name>, and <string-name><given-names>Igor</given-names> <surname>Douven</surname></string-name></person-group> (<year>2013</year>). <article-title>Inferential Conditionals and Evidentiality.</article-title> <source>Journal of Logic, Language and Information</source>, <volume>22</volume>(<issue>3</issue>), <fpage>315</fpage>&#x2013;<lpage>34</lpage>.</mixed-citation></ref>
<ref id="R40"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Leahy</surname>, <given-names>Brian</given-names></string-name></person-group> (<year>2018</year>). <article-title>Counterfactual Antecedent Falsity and the Epistemic Sensitivity of Counterfactuals.</article-title> <source>Philosophical Studies</source>, <volume>175</volume>, <fpage>45</fpage>&#x2013;<lpage>69</lpage>.</mixed-citation></ref>
<ref id="R41"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Lewis</surname>, <given-names>David K.</given-names></string-name></person-group> (<year>1973</year>). <source>Counterfactuals.</source> <publisher-name>Harvard University Press</publisher-name>.</mixed-citation></ref>
<ref id="R42"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Lewis</surname>, <given-names>David K.</given-names></string-name></person-group> (<year>1981</year>). <article-title>Ordering Semantics and Premise Semantics for Conditionals.</article-title> <source>Journal of Philosophical Logic</source>, <volume>10</volume>(<issue>2</issue>), <fpage>217</fpage>&#x2013;<lpage>34</lpage>.</mixed-citation></ref>
<ref id="R43"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Lewis</surname>, <given-names>David K.</given-names></string-name></person-group> (<year>1979</year>). <article-title>Counterfactual Dependence and Time&#x2019;s Arrow.</article-title> <source>No&#x00FB;s</source>, <volume>13</volume>(<issue>4</issue>), <fpage>455</fpage>&#x2013;<lpage>76</lpage>.</mixed-citation></ref>
<ref id="R44"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Lewis</surname>, <given-names>Karen</given-names></string-name></person-group> (<year>2018</year>). <article-title>Counterfactual Discourse in Context.</article-title> <source>No&#x00FB;s</source>, <volume>52</volume>(<issue>3</issue>), <fpage>481</fpage>&#x2013;<lpage>507</lpage>.</mixed-citation></ref>
<ref id="R45"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Lucas</surname>, <given-names>Christopher G.</given-names></string-name> and <string-name><given-names>Charles</given-names> <surname>Kemp</surname></string-name></person-group> (<year>2015</year>). <article-title>An Improved Probabilistic Account of Counterfactual Reasoning.</article-title> <source>Psychological Review</source>, <volume>122</volume>(<issue>4</issue>), <fpage>700</fpage>&#x2013;<lpage>734</lpage>.</mixed-citation></ref>
<ref id="R46"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Moss</surname>, <given-names>Sarah</given-names></string-name></person-group> (<year>2012</year>). <article-title>On the Pragmatics of Counterfactuals.</article-title> <source>No&#x00FB;s</source>, <volume>46</volume>(<issue>3</issue>), <fpage>561</fpage>&#x2013;<lpage>86</lpage>.</mixed-citation></ref>
<ref id="R47"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Pearl</surname>, <given-names>Judea</given-names></string-name></person-group> (<year>1996</year>). <chapter-title>Causation, Action, and Counterfactuals.</chapter-title> In <person-group person-group-type="editor"><string-name><given-names>Alexander</given-names> <surname>Gammerman</surname></string-name></person-group> (Ed.), <source>Computational Learning and Probabilistic Reasoning</source> (<fpage>103</fpage>&#x2013;<lpage>24</lpage>). <publisher-name>John Wiley and Sons</publisher-name>.</mixed-citation></ref>
<ref id="R48"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Pearl</surname>, <given-names>Judea</given-names></string-name></person-group> (<year>2009</year>). <source>Causality: Models, Reasoning, and Inference (Second Edition).</source> <publisher-name>Cambridge University Press</publisher-name>.</mixed-citation></ref>
<ref id="R49"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>Charles Sanders</given-names> <surname>Peirce</surname></string-name></person-group> (<year>1883</year>). <chapter-title>A Theory of Probable Inference.</chapter-title> In <person-group person-group-type="editor"><string-name><given-names>Charles Sanders</given-names> <surname>Peirce</surname></string-name></person-group> (Ed.), <source>Studies in Logic by Members of the Johns Hopkins University</source> (<fpage>126</fpage>&#x2013;<lpage>81</lpage>). <publisher-name>Little, Brown, and Co</publisher-name>.</mixed-citation></ref>
<ref id="R50"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Pollock</surname>, <given-names>John L.</given-names></string-name></person-group> (<year>1976</year>). <source><italic>Subjunctive Reasoning</italic>.</source> <publisher-name>D. Reidel</publisher-name>.</mixed-citation></ref>
<ref id="R51"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Rips</surname>, <given-names>Lance J.</given-names></string-name></person-group> (<year>2010</year>). <article-title>Two Causal Theories of Counterfactual Conditionals.</article-title> <source>Cognitive Science</source>, <volume>34</volume>(<issue>2</issue>), <fpage>175</fpage>&#x2013;<lpage>221</lpage>.</mixed-citation></ref>
<ref id="R52"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Rosen</surname>, <given-names>Gideon</given-names></string-name></person-group> (<year>2010</year>). <chapter-title>Metaphysical Dependence: Grounding and Reduction.</chapter-title> In <person-group person-group-type="editor"><string-name><given-names>Bob</given-names> <surname>Hale</surname></string-name> and <string-name><given-names>Aviv</given-names> <surname>Hoffmann</surname></string-name></person-group> (Eds.), <source>Modality: Metaphysics, Logic, and Epistemology</source> (<fpage>109</fpage>&#x2013;<lpage>35</lpage>). <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="R53"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Schaffer</surname>, <given-names>Jonathan</given-names></string-name></person-group> (<year>2016</year>). <article-title>Grounding in the Image of Causation.</article-title> <source>Philosophical Studies</source>, <volume>173</volume>, <fpage>49</fpage>&#x2013;<lpage>100</lpage>.</mixed-citation></ref>
<ref id="R54"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Schulz</surname>, <given-names>Katrin</given-names></string-name></person-group> (<year>2007</year>). <source>Minimal Models in Semantics and Pragmatics: Free Choice, Exhaustivity, and Conditionals</source> (<comment>Unpublished doctoral dissertation</comment>). <collab>ILLC</collab>, <publisher-loc>Amsterdam</publisher-loc>.</mixed-citation></ref>
<ref id="R55"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Sloman</surname>, <given-names>Steven A.</given-names></string-name> and <string-name><given-names>David A.</given-names> <surname>Lagnado</surname></string-name></person-group> (<year>2005</year>). <article-title>Do We &#x201C;Do&#x201D;?</article-title> <source>Cognitive Science</source>, <volume>29</volume>(<issue>1</issue>), <fpage>5</fpage>&#x2013;<lpage>39</lpage>.</mixed-citation></ref>
<ref id="R56"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Stalnaker</surname>, <given-names>Robert C.</given-names></string-name></person-group> (<year>1975</year>). <article-title>Indicative Conditionals.</article-title> <source>Philosophia</source>, <volume>5</volume>, <fpage>269</fpage>&#x2013;<lpage>86</lpage>.</mixed-citation></ref>
<ref id="R57"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Starr</surname>, <given-names>William B.</given-names></string-name></person-group> (<year>2014</year>). <article-title>A Uniform Theory of Conditionals.</article-title> <source>Journal of Philosophical Logic</source>, <volume>43</volume>(<issue>6</issue>), <fpage>1019</fpage>&#x2013;<lpage>64</lpage>.</mixed-citation></ref>
<ref id="R58"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Stone</surname>, <given-names>Matthew</given-names></string-name></person-group> (<year>1994</year>). <chapter-title>The Reference Argument of Epistemic Must.</chapter-title> In <person-group person-group-type="editor"><string-name><given-names>Harry</given-names> <surname>Bunt</surname></string-name>, <string-name><given-names>Reinhard</given-names> <surname>Muskens</surname></string-name>, and <string-name><given-names>Gerrit</given-names> <surname>Rentier</surname></string-name></person-group> (Eds.), <source>Proceedings of IWCS</source> <volume>1</volume> (<fpage>181</fpage>&#x2013;<lpage>90</lpage>).</mixed-citation></ref>
<ref id="R59"><mixed-citation publication-type="thesis"><person-group person-group-type="author"><string-name><surname>Tellings</surname>, <given-names>Jos</given-names></string-name></person-group> (<year>2016</year>). <source>Counterfactuality in Discourse</source> (<comment>Unpublished doctoral dissertation</comment>). <collab>University of California</collab>, <publisher-loc>Los Angeles</publisher-loc>.</mixed-citation></ref>
<ref id="R60"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Tich&#x00FD;</surname>, <given-names>Pavel</given-names></string-name></person-group> (<year>1976</year>). <article-title>A Counterexample to the Stalnaker-Lewis Analysis of Counterfactuals.</article-title> <source>Philosophical Studies</source>, <volume>29</volume>(<issue>4</issue>), <fpage>271</fpage>&#x2013;<lpage>73</lpage>.</mixed-citation></ref>
<ref id="R61"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Veltman</surname>, <given-names>Frank</given-names></string-name></person-group> (<year>2005</year>). <article-title>Making Counterfactual Assumptions.</article-title> <source>Journal of Semantics</source>, <volume>22</volume>(<issue>2</issue>), <fpage>159</fpage>&#x2013;<lpage>80</lpage>.</mixed-citation></ref>
<ref id="R62"><mixed-citation publication-type="thesis"><person-group person-group-type="author"><string-name><surname>Werner</surname>, <given-names>Thomas A.</given-names></string-name></person-group> (<year>2003</year>). <source>Deducing the Future and Distinguishing the Past: Temporal Interpretation in Modal Sentences in English</source> (<comment>Unpublished doctoral dissertation</comment>). <collab>Rutgers</collab>, <publisher-loc>The State University of New Jersey</publisher-loc>.</mixed-citation></ref>
<ref id="R63"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Werner</surname>, <given-names>Thomas A.</given-names></string-name></person-group> (<year>2006</year>). <article-title>Future and Non-Future Modal Sentences.</article-title> <source>Natural Language Semantics</source>, <volume>12</volume>, <fpage>235</fpage>&#x2013;<lpage>55</lpage>.</mixed-citation></ref>
<ref id="R64"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Willett</surname>, <given-names>Thomas</given-names></string-name></person-group> (<year>1988</year>). <article-title>A Cross-Linguistic Survey of the Grammaticalization of Evidentiality.</article-title> <source>Studies in Language</source>, <volume>12</volume>(<issue>1</issue>), <fpage>51</fpage>&#x2013;<lpage>97</lpage>.</mixed-citation></ref>
<ref id="R65"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Williamson</surname>, <given-names>Timothy</given-names></string-name></person-group> (<year>2007</year>). <source><italic>The Philosophy of Philosophy</italic>.</source> <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="R66"><mixed-citation publication-type="thesis"><person-group person-group-type="author"><string-name><surname>Winans</surname>, <given-names>Lauren</given-names></string-name></person-group> (<year>2016</year>). <source>Inferences of &#x201C;will&#x201D;</source> (<comment>Unpublished doctoral dissertation</comment>). <collab>University of California</collab>, <publisher-loc>Los Angeles</publisher-loc>.</mixed-citation></ref>
</ref-list>
</back>
</article>
