<?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="Research Article">
<front>
<journal-meta>
<journal-id journal-id-type="publisher">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">1119</article-id>
<article-id pub-id-type="manuscript">7_22/Mullins_Formalizing.docx</article-id>
<article-id pub-id-type="doi">10.3998/ergo.1119</article-id>
<title-group>
<article-title>Formalizing Reasons, Oughts, and Requirements</article-title>
<alt-title alt-title-type="running-head-verso">Robert Mullins</alt-title>
<alt-title alt-title-type="running-head-recto">Formalizing Reasons, Oughts, and Requirements</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes" equal-contrib="yes">
<name>
<surname>MULLINS</surname>
<given-names>ROBERT</given-names>
</name>
<email>robertlyonmullins@gmail.com</email>
<xref ref-type="aff" rid="aff1"/>
</contrib>
</contrib-group>
<aff id="aff1">
<institution>The University of Queensland</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>
<author-notes>
<p id="P1"><bold>Contact:</bold> Robert Mullins &#x003C;<email>robertlyonmullins@gmail.com</email>&#x003E;</p>
</author-notes>
<pub-date>
<day>30</day>
<month>06</month>
<year>2021</year>
</pub-date>
<volume>7</volume>
<issue>22</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="P2">Reasons-based accounts of our normative conclusions face difficulties in distinguishing between what ought to be done and what is required. This article addresses this problem from a formal perspective. I introduce a rudimentary formalization of a reasons-based account and demonstrate that that the model faces difficulties in accounting for the distinction between oughts and requirements. I briefly critique attempts to distinguish between oughts and requirements by appealing to a difference in strength or weight of reasons. I then present a formalized reasons-based account of permissions, oughts and requirements. The model exploits Joshua <xref rid="R7" ref-type="bibr">Gert (2004</xref>; <xref rid="R8" ref-type="bibr">2007</xref>) and <xref rid="R12" ref-type="bibr">Patricia Greenspan&#x2019;s (2005</xref>; <xref rid="R13" ref-type="bibr">2007</xref>; <xref rid="R14" ref-type="bibr">2010</xref>) suggestion that some reasons perform a purely justificatory function. I show that the model preserves the standard entailment relationships between requirements, oughts and permissions.</p>
</abstract>
<funding-group/>
<counts>
<fig-count count="0"/>
</counts>
<custom-meta-group>
<custom-meta id="competing-interest">
<meta-name></meta-name>
<meta-value></meta-value>
</custom-meta>
</custom-meta-group>
</article-meta>
</front>
<body>
<sec id="S1">
<label>1.</label><title>Introduction</title>
<p id="P3">Many philosophers accept that what we ought to do is explained by our practical reasons. Variants of this reasons-based view are held by <xref rid="R36" ref-type="bibr">T.M. Scanlon (1998)</xref>, <xref rid="R34" ref-type="bibr">Joseph Raz (1999a)</xref>, <xref rid="R5" ref-type="bibr">Jonathan Dancy (2004)</xref>, <xref rid="R38" ref-type="bibr">Mark Schroeder (2007)</xref>, and <xref rid="R30" ref-type="bibr">Derek Parfit (2011)</xref>. The development of formal models has made it possible to explore the relationship between reasons and conclusions about what we ought to do with greater precision (<xref rid="R22" ref-type="bibr">Horty 2012</xref>; <xref rid="R28" ref-type="bibr">Nair 2016</xref>; for a survey see <xref rid="R29" ref-type="bibr">Nair &amp; Horty 2018</xref>). The purpose of this article is to explore the merits of such a model if it is extended to a broader set of normative conclusions. In particular, I consider whether the model can be extended to distinguish between what is permissible, what we ought to do, and what is required.</p>
<p id="P4">Reasons-based accounts of our normative concepts face difficulties in distinguishing between what we ought to do and what is required or impermissible (see especially <xref rid="R1" ref-type="bibr">Bedke 2011</xref> and <xref rid="R42" ref-type="bibr">Snedegar 2016</xref>). A related challenge to reasons-based accounts emerges from what Raz refers to as the &#x2018;basic belief&#x2019; that in our practical lives it is often the case that many different options are rationally intelligible, so that it would be permissible to pursue them but it &#x2018;would not be against reason to avoid any one of them&#x2019; (<xref rid="R35" ref-type="bibr">1999b</xref>: 100). In some contexts, our reasons support the conclusion that certain actions are rationally intelligible but not required. Put in another way, there are some actions that we ought to perform but that it would not be impermissible for us not to perform. This sort of optionality threatens more straightforward attempts to offer reasons-based accounts of our normative conclusions. Perhaps unsurprisingly, formal approaches to modelling the relation between reasons, oughts and requirements face similar difficulties.</p>
<p id="P5">In order to address these problems from a formal perspective, in <xref rid="S2" ref-type="sec">Section 2</xref> I introduce a basic model of the relationship between reasons and normative conclusions. In <xref rid="S3" ref-type="sec">Section 3</xref> I explore its application to the idea that reasons explain statements of requirement and permission, as well as &#x2018;oughts&#x2019;.<sup><xref rid="fn1" ref-type="fn">1</xref></sup> In <xref rid="S7" ref-type="sec">Section 4</xref>, I briefly critique the idea that a difference in strength or weight of reasons can explain the difference between oughts and requirements. In <xref rid="S8" ref-type="sec">Section 5</xref>, I conclude by proposing a revised model that addresses these problems, based on <xref rid="R7" ref-type="bibr">Joshua Gert (2004</xref>; <xref rid="R8" ref-type="bibr">2007</xref>) and <xref rid="R13" ref-type="bibr">Patricia Greenspan&#x2019;s (2005</xref>; <xref rid="R13" ref-type="bibr">2007</xref>; <xref rid="R14" ref-type="bibr">2010</xref>) proposal that some reasons fulfil a purely justificatory function. The model provides a formal account of the relationship between reasons, permissions, oughts, and requirements. What we are required to do (and therefore what it would be impermissible for us not to do) is explained by our best requiring reasons. What we ought to do is explained by our best justifying reasons.</p>
</sec>
<sec id="S2">
<label>2.</label><title>The Basic Model: Reasons, Oughts, and Requirements</title>
<p id="P6">The basic model relied upon here to explore the relationship between reasons and requirements is rudimentary version of an &#x2018;imperatival&#x2019; or default-based model.<sup><xref rid="fn2" ref-type="fn">2</xref></sup> Variants of this model have been used to great effect by <xref rid="R22" ref-type="bibr">John Horty (2012)</xref> and <xref rid="R28" ref-type="bibr">Shyam Nair (2016)</xref> to explore the relationship between reasons and oughts.<sup><xref rid="fn3" ref-type="fn">3</xref></sup> I adopt this model only preliminarily, in order to illustrate some of its limitations. I will introduce the model in this section before exploring its limitations and possible revisions in subsequent sections. The model is only rudimentary, but I believe that it is sufficient to illustrate the different difficulties I will consider.<sup><xref rid="fn4" ref-type="fn">4</xref></sup></p>
<p id="P7">Before introducing the model, it will be helpful to say something about the language I will be using to describe requirements, and the distinction between requirements and oughts. Traditionally, philosophers have taken ought statements to be the paradigmatic statements of requirement. This assumption is prevalent in formal approaches to modelling the relationship between reasons and deontic conclusions, which follow traditional deontic logic in using the &#x2018;ought&#x2019; operator to express strong deontic necessity (e.g., <xref rid="R22" ref-type="bibr">Horty 2012</xref>; <xref rid="R11" ref-type="bibr">Goble 2013</xref>). Contemporary linguists and philosophers of language, however, have drawn attention to the distinction between weak necessity operators, like &#x2018;ought&#x2019; and &#x2018;should&#x2019;, and strong necessity modals like &#x2018;must&#x2019; and &#x2018;have to&#x2019; (<xref rid="R32" ref-type="bibr">Portner 2009</xref>: 79&#x2013;81; <xref rid="R40" ref-type="bibr">Silk 2015</xref>; 298&#x2013;303; <xref rid="R42" ref-type="bibr">Snedegar 2016</xref>: 158&#x2013;162). Ought statements, at least paradigmatically, do not express requirement. As <xref rid="R44" ref-type="bibr">Bernard Williams (1981</xref>: 126) puts it, &#x2018;not every <italic>ought</italic> is a <italic>must&#x2019;</italic>.</p>
<p id="P8">The distinction between weak and strong necessity is evident in the following two sentences:
<list list-type="order" id="L1">
<list-item><p id="P9">I ought to do give my money to charity but it&#x2019;s not as if I have to.</p></list-item>
<list-item><p id="P10">#I have to give my money to charity but it&#x2019;s not as if I ought to.</p></list-item>
</list></p>
<p id="P11">Where (1) is perfectly intelligible, (2) seems incoherent, at least if we interpret &#x2018;have to&#x2019; and &#x2018;ought&#x2019; relative to the same source of reasons or requirements. Similarly, the additional clause in sentence (4), below, appears redundant, where the addition in (3) does not.</p>
<list list-type="simple" id="L2">
<list-item><label>3.</label><p id="P12">I ought to do my homework, in fact I have to.</p></list-item>
<list-item><label>4.</label><p id="P13">#I have to do my homework, in fact I ought to.</p></list-item>
</list>
<p id="P14">As <xref rid="R42" ref-type="bibr">Justin Snedegar (2016</xref>: 160) notes, the corpus of linguistic evidence seems to support the conclusion that requirements entail oughts and that oughts entail permissions, but that the reverse entailments do not hold. If John must dance at the ball, then he ought to dance at the ball and he is permitted to do so. It is not the case, however, that oughts entail requirements, nor that permissions entail oughts. Even if John ought to dance at the ball, it is not necessarily the case that he must dance. And though it might be true that John is permitted to dance at the ball, it is not necessarily the case that he ought to dance.</p>
<p id="P15">One way of responding to this sort of linguistic evidence is to say that it is beside the point. When many philosophers use &#x2018;ought&#x2019;, they use it stipulatively to refer to what <xref rid="R2" ref-type="bibr">John Broome (2016)</xref> calls the &#x2018;central ought of normativity&#x2019;, which plays a distinguished role in practical philosophy, and which features in the identification of our rational requirements. But failure to pay attention to salient linguistic distinctions risks creating unnecessary philosophical confusion. Furthermore, the case for observing the difference between oughts and requirements is strengthened by the fact that the distinction in linguistic use tracks a similar set of distinctions in common-sense morality (<xref rid="R27" ref-type="bibr">McNamara 1996</xref>; <xref rid="R42" ref-type="bibr">Snedegar 2016</xref>: 161&#x2013;162). Sentence (1), for instance, seems to describe a familiar case of supererogation. Many accounts of supererogation associate it with cases in which I ought to do one thing but am permitted to do another (see, e.g., <xref rid="R33" ref-type="bibr">Raz 1975</xref>: 164&#x2013;165; <xref rid="R19" ref-type="bibr">Heyd 1982</xref> refers to this in terms of the &#x2018;good-ought tie-up&#x2019;). So long as &#x2018;ought&#x2019; is taken to express requirement, however, any model of the relationship between reasons and requirements will face difficulties in accounting for supererogation.</p>
<p id="P16">The basic model preserves the distinction between requirements, oughts, and permissions (as do the alternative models I consider below). In order to avoid confusion, I will use the operator <italic>Must</italic> in order to express requirement, and <italic>Ought</italic> to express a weaker sort of deontic necessity. I do not mean to rule out the possibility that common-sense morality is mistaken on these matters. Nevertheless, it would be regrettable if our account of practical reasoning were incompatible with these basic distinctions by stipulation. If proponents of the possibility of supererogation (for example) are making a mistake, it does not seem to me to be a logical or conceptual mistake about the relationship between reasons and requirements.</p>
<p id="P17">I assume a basic propositional language <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M1"><mml:mi mathvariant='script'>L</mml:mi></mml:math></inline-formula>. Sentences in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M2"><mml:mi mathvariant='script'>L</mml:mi></mml:math></inline-formula> will be denoted using capitalized letters <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M3"><mml:mrow><mml:mi>A</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x00A0;</mml:mo><mml:mi>B</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x00A0;</mml:mo><mml:mi>C</mml:mi></mml:mrow></mml:math></inline-formula> and so on. A <italic>reasoning context</italic> is a pair <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M4"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> involving a set <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M5"><mml:mi mathvariant='script'>R</mml:mi></mml:math></inline-formula> of reasons that obtain in a given context and an order <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M6"><mml:mo>&#x003C;</mml:mo></mml:math></inline-formula> over these reasons. Reasons are denoted <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>:</mml:mo><mml:mi>A</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:math></inline-formula> meaning that there is a reason <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M8"><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x00A0;</mml:mo></mml:mrow></mml:math></inline-formula> supporting the proposition expressed by the sentence <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M9"><mml:mi>A</mml:mi></mml:math></inline-formula>. A function <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M10"><mml:mi mathvariant='script'>C</mml:mi></mml:math></inline-formula> identifies the content of any reason with a sentence in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M11"><mml:mi mathvariant='script'>L</mml:mi></mml:math></inline-formula>. For the reason <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M12"><mml:mrow><mml:mi>r</mml:mi><mml:mo>:</mml:mo><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="M13"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mfenced><mml:mi>r</mml:mi></mml:mfenced><mml:mo>=</mml:mo><mml:mi>A</mml:mi></mml:mrow></mml:math></inline-formula>. The function can also be applied to any set of reasons, so that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M14"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:mo>{</mml:mo><mml:mi mathvariant='script'>C</mml:mi><mml:mo>(</mml:mo><mml:mi>r</mml:mi><mml:mo>)</mml:mo><mml:mo>:</mml:mo><mml:mi>r</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>}</mml:mo></mml:mrow></mml:math></inline-formula>. The turnstile <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M15"><mml:mo>&#x22A2;</mml:mo></mml:math></inline-formula> will represent classical logical consequence. The order <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M16"><mml:mo>&#x003C;</mml:mo></mml:math></inline-formula> is a strict partial order satisfying both the anti-reflexivity and transitivity axioms.<sup><xref rid="fn5" ref-type="fn">5</xref></sup> (Read <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M17"><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x003C;</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> as meaning that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M18"><mml:mrow><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> is greater in strength or weight than <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M19"><mml:mi>r</mml:mi></mml:math></inline-formula>).</p>
<p id="P18">The model treats reasons as &#x2018;austere&#x2019;; it does not allow for logical relations between or among reasons (<xref rid="R22" ref-type="bibr">Horty 2012</xref>: 41&#x2013;47). It could be extended to accommodate derivative reasons (cf. <xref rid="R28" ref-type="bibr">Nair 2016</xref>), but I will focus in this paper on the relationship between non-derivative reasons and all-things-considered requirements, oughts and permissions. A further limitation of the model is it takes the contents of reasons and the deontic operators that they support to be sentences, rather than actions. For the purposes of discussion we will put to one side the question of whether these resources are sufficient to represent agency.</p>
<p id="P19">The model exploits the idea of a maximal consistent subset of consequences of undefeated reasons. We define both the set of undefeated reasons and the concept of a maximal consistent subset of consequences as follows.</p>
<disp-quote id="Q1">
<p id="P20"><bold>Undefeated Reasons:</bold> For a reasoning context <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M20"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> set of undefeated reasons is defined as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M21"><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>:</mml:mo><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mo>&#x2009;</mml:mo><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mo>&#x2009;</mml:mo><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mo>&#x2009;</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>&#x2009;</mml:mo><mml:mi>s</mml:mi><mml:mi>u</mml:mi><mml:mi>c</mml:mi><mml:mi>h</mml:mi><mml:mo>&#x2009;</mml:mo><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x003C;</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2009;</mml:mo><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mo>&#x2009;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mi>i</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2009;</mml:mo><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x22A2;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
<p id="P21"><bold>Maximal Consistent Subset:</bold> A set of sentences <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M22"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> is a maximal consistent subset of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M23"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> just in case <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M24"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> is consistent, and there is no other subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M25"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M26"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> is consistent and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M27"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2282;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2286;</mml:mo><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote>
<p id="P22">In order to preserve the desired entailment between requirements, oughts and permissions, we must adopt what has come to be known as the &#x2018;disjunctive&#x2019; account of all-things-considered requirements (<xref rid="R22" ref-type="bibr">Horty 2012</xref>; <xref rid="R11" ref-type="bibr">Goble 2013</xref>). A proposition expressed by a sentence must obtain just in case it is entailed by every maximal consistent subset of conclusions of our undefeated reasons
<disp-quote id="Q2">
<p id="P23"><bold>Must:</bold></p>
<p id="P24"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M28"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> just in case <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M29"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula> for every maximal consistent subset <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> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M31"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote></p>
<p id="P25">We can then define these entailment operations over the other logical operators of negation, disjunction, and conjunction in the usual way. Permission is defined as the dual of requirement, as it is in standard deontic logic:
<disp-quote id="Q3">
<p id="P26"><bold>Permission:</bold></p>
<p id="P27"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M32"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> just in case it is not the case that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M33"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>X</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote></p>
<p id="P28">The proposition expressed by a sentence is permitted just in case it is not the case that the negation of that sentence is entailed as a requirement.</p>
<p id="P29">Against the background of this approach to the relationship between reasons, requirements and permissions, we can extend the basic model to accommodate a relationship between reasons and oughts. Oughts are explained in terms of reasons of undefeated strength. To say that I ought to do something is to say that the sentence expressing the corresponding proposition is entailed by <italic>some</italic> reason or set of reasons of undefeated strength (cf. <xref rid="R3" ref-type="bibr">Chisholm 1974</xref>: 125; <xref rid="R34" ref-type="bibr">Raz 1999a</xref>: 28&#x2013;32). If a proposition expressed by a sentence is entailed by some maximal set of undefeated reasons, then it ought to be the case.</p>
<disp-quote id="Q4">
<p id="P30"><bold>Ought:</bold></p>
<p id="P31"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M34"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> just in case <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M35"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula> for some maximal consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M36"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M37"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula></p>
</disp-quote>
<p id="P32">In essence, this model combines a so-called &#x2018;disjunctive&#x2019; account of requirements with what is known as the &#x2018;conflict&#x2019; account of ought statements. These accounts have previously only been considered as rival accounts of ought statements (cf. <xref rid="R22" ref-type="bibr">Horty 2012</xref>: ch. 3). Here the accounts are applied to requirements and oughts respectively. The apparent &#x2018;weakness&#x2019; of ought is captured by defining it in terms of existential, rather than universal, quantification over maximal consistent subsets of consequences of undefeated reasons.</p>
<p id="P33">It is easy to see that this account maintains the desired entailment relationship between requirements, oughts, and permissions.</p>
<disp-quote id="Q5">
<p id="P34"><bold>Observation 1:</bold> For any reasoning context <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M38"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M39"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M40"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
<p id="P35"><bold>Observation 2:</bold> For any reasoning context <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M41"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M42"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M43"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote>
<p id="P36">(I offer proofs of these observations, along with all of the observations that follow, in the <xref ref-type="app" rid="APP1">appendix</xref>.) Note that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M44"><mml:mrow><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mfenced><mml:mi>X</mml:mi></mml:mfenced></mml:mrow></mml:math></inline-formula> does not entail <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M45"><mml:mrow><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mfenced><mml:mi>X</mml:mi></mml:mfenced></mml:mrow></mml:math></inline-formula> in the same fashion, since the model allows for cases where we have two or more equally good but inconsistent sets of reasons. In these cases each set of reasons will entail an ought but not the equivalent requirement. In cases in which there are two or more inconsistent, undefeated sets of reasons, the reasons result in a disjunctive all things considered requirement.</p>
<p id="P37">These basic features of the model can be illustrated with any scenario in which an agent is faced with two undefeated reasons, the consequences of which are inconsistent. Consider, for example, <xref rid="R26" ref-type="bibr">Ruth Barcan Marcus&#x2019;s (1980</xref>: 125) &#x2018;Buridan case&#x2019; involving the lives of two identical twins in jeopardy, where tragic circumstances mean I can only save one. Suppose that both twins are drowning at different ends of a lake, so that if I save one I will be abandoning the other. Let <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M46"><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> express the proposition that I save the first twin and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M47"><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> the inconsistent proposition that I save the second twin. Our reasoning context <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M48"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> will be such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M49"><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:msub><mml:mi>T</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:msub><mml:mi>T</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> where the priority order <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M50"><mml:mo>&#x003C;</mml:mo></mml:math></inline-formula> is empty. Note that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M51"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>T</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, with two maximal consistent subsets <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M52"><mml:mrow><mml:mfenced close="}" open="{"><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M53"><mml:mrow><mml:mo>&#x007B;</mml:mo><mml:msub><mml:mi>T</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>&#x007D;</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x00A0;</mml:mo></mml:mrow></mml:math></inline-formula> and that therefore <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M54"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:msub><mml:mi>T</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x2228;</mml:mo><mml:msub><mml:mi>T</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> for both maximal consistent subsets of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M55"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. Therefore <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M56"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x2228;</mml:mo><mml:msub><mml:mi>T</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M57"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow> <mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M58"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. Since <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M59"><mml:mo>&#x22A2;</mml:mo></mml:math></inline-formula> is reflexive, we also have that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M60"><mml:mrow><mml:mfenced close="}" open="{"><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mfenced><mml:mo>&#x22A2;</mml:mo><mml:msub><mml:mi>T</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> for the first maximal consistent subset and that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M61"><mml:mrow><mml:mfenced close="}" open="{"><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:mfenced><mml:mo>&#x22A2;</mml:mo><mml:msub><mml:mi>T</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> for the second maximal consistent subset, meaning <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M62"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M63"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. I must save one of the two twins. I ought to save the first twin and I ought to save the second twin, and it would be permissible for me to do either. Unfortunately, I cannot do both. Moreover, since requirement and permission are duals, we have that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M64"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x2228;</mml:mo><mml:msub><mml:mi>T</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. It would not be permissible for me save neither twin.</p>
<p id="P38">This is, I concede, an attractive picture of the way in which reasons explain permissions, oughts and requirements. It allows us to distinguish our all-things-considered requirements from what we ought to do, and what we ought to do from what is simply permissible, and to do so in a relatively straightforward way. It offers an account of practical reasoning that is consistent with what appears to be the common belief that what we must do is explained by our strongest reasons for action.<sup><xref rid="fn6" ref-type="fn">6</xref></sup> It accommodates the distinction between requirements and oughts in a manner that preserves the standard entailments. Nonetheless the model faces difficulties in accommodating various intuitions from common-sense morality about the relationship between reasons, oughts and requirements.</p>
</sec>
<sec id="S3">
<label>3.</label><title>Optionality, Tragedy, and Supererogation</title>
<p id="P39">The basic model embeds the assumption that the function of all reasons, absent another reason of equal or greater strength, is to generate requirements and therefore to render it impermissible not to conform to them. For any reasoning context <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M65"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, if there is a reason <italic>r</italic> such that its conclusion is not inconsistent with the conclusion of any other set of reasons, it will be impermissible not to conform with it. The model therefore reflects the view that reasons, unless defeated or matched by a reason of equal strength, generate requirements (cf. <xref rid="R23" ref-type="bibr">Kagan 1989</xref>: 64&#x2013;70; <xref rid="R38" ref-type="bibr">Schroeder 2007</xref>: 130&#x2013;131). This is, admittedly, a common picture of the function of practical reasons.<sup><xref rid="fn7" ref-type="fn">7</xref></sup> But common-sense morality seems to present cases where we have undefeated reasons&#x2014;even apparently strong or weighty reasons&#x2014;which it is permissible for us not to act on. Below I discuss several such cases. The cases I consider present challenges that deserve to be considered in greater depth than they are here. My purpose in this section is to set out these problems and observe some possible responses open to those who wish to preserve the basic model. While I am critical of these responses, I do not think that my criticisms are decisive. I simply use them to motivate the further frameworks that are developed in <xref rid="S7" ref-type="sec">Sections 4</xref> and <xref rid="S8" ref-type="sec">5</xref> of the article.</p>
<sec id="S4">
<label>3.1.</label><title>Optionality</title>
<p id="P40">The problem of optionality begins with Raz&#x2019;s &#x2018;basic belief&#x2019; that at any point in time we may permissibly choose between any number of rationally attractive options. As I write this article, it would be permissible for me to do any number of things instead. I could, if I wished, take a break at any moment to have coffee with a colleague. I could begin to prepare for my teaching this afternoon, or I could pause for a moment and plan for my weekend. None of these actions would be contrary to reason, each of them and perhaps several other options are rationally intelligible, and conforming with any one of them would be rationally permissible. If the belief is as basic as Raz asserts, then it places an important constraint on our theorising about reasons: we must explain how it comes to be that, at any point in time, I can permissibly choose between a set of options without being required to perform any one of them. Put another way, some reasons seem to make actions rationally intelligible without making it impermissible not to perform them.</p>
<p id="P41">In order to accommodate optionality within the basic model I introduced in <xref rid="S2" ref-type="sec">Section 2</xref>, we need to posit widespread ties or incommensurability in the strength of reasons. The latter approach is favored by <xref rid="R35" ref-type="bibr">Raz (1999b)</xref>, who takes the basic belief to be a primary motivation for positing widespread incommensurability among reasons. Perhaps the best-known proponent of the former approach is <xref rid="R31" ref-type="bibr">Douglas Portmore (2013)</xref>, who has developed a sophisticated version of consequentialism that allows for ties in the strength of reasons, once our reasons for action are properly specified. The ability of the basic model to accommodate optionality in terms of ties or incommensurability in the strength of reasons can be illustrated with an example that I borrow from <xref rid="R35" ref-type="bibr">Raz (1999b</xref>: 102&#x2013;103). Mary has an option of going to the theatre this evening, but could also go to visit her mother. Her options are explained by the fact that she has at least two reasons of equal or incommensurable strength which apply to her, neither of which defeats the other. This makes it permissible for her to do one or the other. Raz&#x2019;s example can be illustrated with a simple reasoning context. Let Mary&#x2019;s reasoning context be represented as a structure <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M66"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M67"><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mi>M</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mi>T</mml:mi></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M68"><mml:mi>M</mml:mi></mml:math></inline-formula> is inconsistent with <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M69"><mml:mi>T</mml:mi></mml:math></inline-formula>. Suppose that neither her reason to go to the theatre, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M70"><mml:mrow><mml:mi>r</mml:mi><mml:mo>:</mml:mo><mml:mi>T</mml:mi></mml:mrow></mml:math></inline-formula>, nor her reason to visit her mother <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M71"><mml:mrow><mml:mi>r</mml:mi><mml:mo>:</mml:mo><mml:mi>M</mml:mi></mml:mrow></mml:math></inline-formula>, is stronger than the other, so that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M72"><mml:mo>&#x003C;</mml:mo></mml:math></inline-formula> is empty. It is easy to see that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M73"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msub><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>M</mml:mi><mml:mo>&#x2228;</mml:mo><mml:mi>T</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, Mary must to go to the theatre or visit her mother, as well as that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M74"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msub><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>M</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M75"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msub><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>T</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. It is, however, not permissible that she neither go to the theatre nor visit her mother <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M76"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msub><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>M</mml:mi><mml:mo>&#x2228;</mml:mo><mml:mi>T</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, since she must choose one of these two options. (Of course in real life we may face much larger sets of good and inconsistent options, and the basic model will accommodate these cases in terms of a longer disjunctive requirement.)</p>
<p id="P42">A great strength of this approach to optionality is that it does not require any departure from the relatively austere basic model introduced above. In fact, theories like those I have attributed to Raz and Portmore can be relatively easily accommodated within the basic model, which therefore allows for a parsimonious reasons-based explanation of optionality. It also seems to accord with a deontic interpretation of the standard decision-theoretic approach: provided that any member of a set of available options is not strictly dominated, it is rationally permissible to choose any one of them, but required to choose between them.</p>
<p id="P43">I will have little more to say here about the merits of either Raz or Portmore&#x2019;s proposals for accommodating optionality. The plausibility of their responses to the basic belief rests on substantive arguments, and consideration of both proposals is best left for another occasion. It is worth noting, though, that neither response to the problem of optionality is without philosophical cost. Discomfort with the kind of widespread incommensurability posited by Raz provides one motivation for departing from the view that all reasons play a requiring role (<xref rid="R7" ref-type="bibr">Gert 2004</xref>: 102&#x2013;105). Portmore&#x2019;s arguments for a version of consequentialism that accommodates the basic belief are nuanced and impressive. However, they do rely on assumptions about the relationship between rational and moral reasons that are somewhat controversial (cf. <xref rid="R31" ref-type="bibr">Portmore 2013</xref>: 440&#x2013;441) and about the plausibility of assessing our options indirectly, in respect of the different maximal options they comprise (cf. <xref rid="R10" ref-type="bibr">Gert 2014</xref>: 215&#x2013;216).</p>
</sec>
<sec id="S5">
<label>3.2.</label><title>Distinguishing Optionality from Tragic Conflicts</title>
<p id="P44">Even if we accept the basic model&#x2019;s account of optionality, we will face the further problem of distinguishing cases of optionality from cases of apparently tragic conflict, like the drowning twins scenario considered in <xref rid="S2" ref-type="sec">Section 2</xref>. Recall that in the drowning twins scenario the reasoning context supported the conclusion that rescuing one of the two twins was required: I ought to rescue the first twin and I ought to rescue the second twin, but failing to rescue one of them is permissible. Within the basic model, the deontic conclusions generated by the drowning twins scenario are structurally identical to Mary&#x2019;s choice between visiting her mother and going to the theatre. Mary must either visit her mother or go to the theatre, ought to go to the theatre and ought to visit her mother, but may permissibly fail to perform one of these options. Conflict between reasons that would otherwise generate requirements lends them a kind of optionality: conflicts like the drowning twins scenario are no different from a situation like Mary&#x2019;s where she was forced to choose between two good, undefeated options. Both cases involve situations in which we are able to conform to only one of two or more inconsistent reasons and may permissibly choose between them. But the drowning twins scenario seems different in a normatively significant way. We are not merely choosing between two goods, we are forced to make a tragic choice between two equally unattractive options (cf. <xref rid="R4" ref-type="bibr">Dancy 1993</xref>: 123). It appears as though an account of practical reasoning should be able to accommodate the difference between these two contexts. The basic model&#x2019;s method of distinguishing between oughts and requirements does not allow us to do so.</p>
<p id="P45">One way of accommodating tragic conflicts would be to depart from the assumption that requirements entail permissions in favor of an account that allows for conflicting all-things-considered requirements (<xref rid="R1" ref-type="bibr">Bedke 2011</xref>: 149&#x2013;151; <xref rid="R22" ref-type="bibr">Horty 2012</xref>: ch. 4). The tragedy of these cases could then be explained by their involving a choice between two impermissible options. I am sympathetic to the argument that any reasons-based account should be able to accommodate this sort of unresolved conflict between all-things-considered requirements. For the purposes of discussion, however, I will not explore this possibility, because I am interested in developing a model for practical reasoning that can preserve the standard inference relationship between reasons, oughts and permissions that I discussed in <xref rid="S2" ref-type="sec">Section 2</xref>. The intuitions underlying these entailments seem to be widely accepted, and it would be problematic if our framework of practical reasoning could not accommodate them. In any case, the problem of distinguishing between optionality and tragic conflicts will still arise for proponents of the possibility of conflicting all things considered requirements. Where the basic model treats tragic conflicts as cases of optionality, a version of the same model that allows for conflicting requirements will treat all cases of optionality as involving a tragic choice between two impermissible options.</p>
</sec>
<sec id="S6">
<label>3.3.</label><title>Supererogation and Justification</title>
<p id="P46">Various forms of supererogation also suggest the possibility of reasons that lack requiring force. Consider the situation of someone who decides to sacrifice their own life to save the lives of several others. Many people share the judgement that the person who sacrifices their life in this way has acted justifiably, in a way that is rationally permissible. We are, however, reluctant to classify this sort of self-sacrifice as the course of action that we <italic>must</italic> take. Within the basic model, if a reason is stronger than another inconsistent reason, the reason supports a statement of requirement. Suppose that I face a choice between saving the lives of several strangers by throwing myself on a grenade or simply running for safety in an attempt to save my own life. Let <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M77"><mml:mi>G</mml:mi></mml:math></inline-formula> express the proposition that I throw myself on the grenade, and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M78"><mml:mi>R</mml:mi></mml:math></inline-formula> the inconsistent proposition that I run for safety. Now suppose that we have a reasoning context <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M79"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow><mml:mn>3</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M80"><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mi>R</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mi>G</mml:mi></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M81"><mml:mrow><mml:mi>R</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>G</mml:mi></mml:mrow></mml:math></inline-formula> and where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M82"><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x003C;</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x00A0;</mml:mo></mml:mrow></mml:math></inline-formula> so that my reason to save the lives of others is stronger than my reason to run for safety. It is easy to see that in this context, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M83"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow><mml:mn>3</mml:mn></mml:msub><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M84"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow><mml:mn>3</mml:mn></mml:msub><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. The reasoning context supports the conclusion that I must save the lives of the strangers, and that it is impermissible for me to run for safety.</p>
<p id="P47">Cases of supererogation can be accommodated within the basic model by positing that they involve a conflict between different classes of reasons. <xref rid="R31" ref-type="bibr">Portmore (2013)</xref> suggests that supererogation arises because we can have greatest moral reason to act in a way that is inconsistent with our greatest non-moral reason. Such a response relies on the availability of a robust distinction between moral reasons and non-moral reasons. It also has difficulty with cases in which apparently weaker moral reasons appear to make it permissible not to act on a stronger reason (<xref rid="R10" ref-type="bibr">Gert 2014</xref>: 212). For instance, suppose I decide to give some proportion of my money to a moderately effective local charity rather than using it to fund very effective global malaria prevention efforts. Although my reason to give to the local charity is a weaker moral reason than my reason to fund malaria prevention, it still seems that I am justified in giving to the local charity.</p>
<p id="P48">Justifications for action that would normally be impermissible provide another, less dramatic example of a structurally similar phenomenon. Even when they have great strength, the reasons associated with justifications do not require us to act in accordance with the justification. If I strike someone in self-defence then I have acted justifiably, but it seems implausible to suggest that it would have been impermissible for me not to strike them. A reasons-based account of justifications ought to be able to distinguish what is merely permissible from what ought to occur, and what ought to occur from what is required. But, on the basic model, the only way to incorporate a justification with non-requiring strength is to postulate that the justifying reason is of equal or incomparable strength to another reason.</p>
<p id="P49">Following <xref rid="R33" ref-type="bibr">Raz (1975</xref>; <xref rid="R34" ref-type="bibr">1999a</xref>: 90&#x2013;96), we might seek to amend the basic model by appealing to the possibility of &#x2018;exclusionary permissions&#x2019;, which give us reasons not to act on otherwise good reasons, in order to accommodate supererogation and justification within the basic framework. My reason to strike someone in self-defence could be paired with an exclusionary permission not to act on my reason not to strike them. Similarly, my reason to act out of concern for my own life could be paired with a permission not to act on my reason to jump on the grenade (for a formal account of exclusionary reasons see <xref rid="R22" ref-type="bibr">Horty 2012</xref>: 122&#x2013;130). One problem with this form of explanation is that if my reason not to strike the assailant is excluded, we now lack an explanation of why it would nonetheless be permissible for me to fail to strike them, notwithstanding my remaining good reason to act in self-defence. If I act on my reason not to strike in retaliation, I have acted on a reason that I had good reason to exclude from deliberation. If the reason to exclude is unmatched or undefeated, then it would appear to require me to exclude my good reason not to strike my assailant. If I am not required to exclude this reason (cf. <xref rid="R34" ref-type="bibr">Raz 1999a</xref>: 90), then the proponent of exclusionary permissions must offer an explanation of the optional character of the reason to exclude. The problem of optionality reappears. In the case of supererogation, moreover, an appeal to exclusionary permissions raises formal difficulties about the relation between an exclusionary reason and the strength of the reasons that it excludes. How is it that my reason to sacrifice myself for others, although stronger than my reason to run for safety, comes to be excluded? One response would involve appealing to the problematic idea that weaker reasons for action can exclude or undercut weightier reasons (cf. <xref rid="R22" ref-type="bibr">Horty 2012</xref>: 135&#x2013;141; <xref rid="R43" ref-type="bibr">Tucker 2018</xref>: 959&#x2013;962). Another would be to posit that the exclusionary reason is weightier than my reason to sacrifice myself. The proponent of exclusionary permissions is then left with the problem of justifying the weight of this exclusionary reason. A proponent of exclusionary permissions is unlikely to regard these difficulties as insurmountable, but they suggest to me that alternative formal approaches are worth considering.</p>
</sec>
</sec>
<sec id="S7">
<label>4.</label><title>Appealing to Reasons&#x2019; Strength</title>
<p id="P50">A seemingly plausible response to these problems is to appeal to the strength of reasons in order to distinguish between reasons that possess justifying force and reasons that possess requiring force. It is tempting to suggest that some reasons are insufficiently strong to support requirements, and that while weaker reasons support oughts, only reasons that possess strength above a certain threshold will support requirements.<sup><xref rid="fn8" ref-type="fn">8</xref></sup></p>
<p id="P51"><xref rid="R36" ref-type="bibr">Scanlon (1998</xref>; <xref rid="R37" ref-type="bibr">2014</xref>), <xref rid="R38" ref-type="bibr">Schroeder (2007)</xref>, and <xref rid="R41" ref-type="bibr">Skorupski (2010)</xref> have all developed theories according to which reasons possess degrees of weight or strength, so appealing to a threshold degree of strength in this way seems plausible. In his more recent work, <xref rid="R37" ref-type="bibr">Scanlon (2014</xref>: 111, fn. 8) seems to develop an account of the distinction between requiring and non-requiring reasons by appealing to their relative weight. Scanlon follows Gert in distinguishing between reasons with justifying strength and reasons with requiring strength but argues that these are not different &#x2018;ways in which a consideration can count in favor of an action&#x2019; (<xref rid="R37" ref-type="bibr">2014</xref>: 111 fn. 8). According to Scanlon, the difference between requiring and non-requiring reasons is that requiring reasons are sufficiently strong that few reasons could justify my failure to conform to them.</p>
<p id="P52">The idea of appealing to strength of reasons to accommodate latitude can be sketched with a slight alteration of the model introduced above. Supposing that reasons are partially ordered in terms of priority or &#x2018;weight&#x2019;, we can then postulate a threshold value, above which the reasons in question have the quality of a deontic requirement, and below which conformity is optional. Reasons below threshold can support oughts, but not requirements.</p>
<p id="P53">Let a <italic>threshold reasoning context</italic> be a structure <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M85"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M86"><mml:mrow><mml:mo>&#x003C;</mml:mo><mml:mo>&#x00A0;</mml:mo></mml:mrow></mml:math></inline-formula> is a strict partial order over reasons, as above, except that it now contains the privileged value <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M87"><mml:mi>n</mml:mi></mml:math></inline-formula>, which acts as a threshold for the assignment of requiring force to any reason. Let <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M88"><mml:mrow><mml:msub><mml:mi mathvariant='script'>R</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> be the set of requiring reasons in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M89"><mml:mi mathvariant='script'>R</mml:mi></mml:math></inline-formula> above this threshold. We can then adopt an account of requirements that refers only to the subset of requiring reasons applicable in a given scenario, while still allowing for reasons below threshold to make actions rationally attractive or intelligible, and therefore to support ought statements.</p>
<p id="P54">More formally, we define a set of requiring reasons for a threshold reasoning context as follows:
<disp-quote id="Q6">
<p id="P55"><bold>Requiring Reasons:</bold> For a threshold reasoning context <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M90"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, a set of requiring reasons <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M91"><mml:mrow><mml:msub><mml:mi mathvariant='script'>R</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is defined as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M92"><mml:mrow><mml:msub><mml:mi mathvariant='script'>R</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>:</mml:mo><mml:mi>n</mml:mi><mml:mo>&#x003C;</mml:mo><mml:mi>r</mml:mi></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote></p>
<p id="P56">We then define our requirement operator as for the basic model, this time restricting our definition so that it quantifies only over those reasons that are above threshold.</p>
<disp-quote id="Q7">
<p id="P57"><bold>Must (Threshold Reasoning Context):</bold> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M93"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> just in case <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M94"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula> for every maximal consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M95"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M96"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant='script'>R</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote>
<p id="P58">The permission operator <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M149"><mml:mi>P</mml:mi></mml:math></inline-formula> is then defined as the dual of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M97"><mml:mrow><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:math></inline-formula> as before.</p>
<p id="P59">In order to accommodate oughts within this approach, I will stipulate that an act ought to be performed just in case it is supported by a maximal set of undefeated reasons that is consistent with one of our maximal consistent sets of requiring reasons. (Otherwise the account will allow for ought statements that are inconsistent with our requirements). In order to capture this idea in our definition of oughts, I will appeal to the notion of a maximal <italic>requirement consistent</italic> subset of undefeated reasons. A set of reasons will be requirement consistent just in case there is some maximal consistent subset of requiring reasons that is consistent with it.</p>
<disp-quote id="Q8">
<p id="P60"><bold>Requirement Consistency (Threshold Reasoning Contexts):</bold> Where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M98"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is a threshold reasoning context, a set of sentences <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M99"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> is requirement consistent just in case <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M100"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x222A;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> is consistent for some maximal consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M101"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M102"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant='script'>R</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote>
<p id="P61">We then stipulate that maximal requirement-consistent subsets of consequences of undefeated reasons support ought statements.</p>
<disp-quote id="Q9">
<p id="P62"><bold>Maximal Requirement Consistent Subset:</bold> A subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M103"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> of a set of consequences of reasons <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M104"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is a maximal requirement consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M105"><mml:mrow><mml:mo>&#x00A0;</mml:mo><mml:mtext>of</mml:mtext><mml:mo>&#x00A0;</mml:mo><mml:mi mathvariant='script'>C</mml:mi><mml:mfenced><mml:mi mathvariant='script'>R</mml:mi></mml:mfenced><mml:mo>&#x00A0;</mml:mo></mml:mrow></mml:math></inline-formula> just in case (i) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M106"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> is requirement consistent and (ii) there is no other subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M107"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M108"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> is requirement consistent and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M109"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2282;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2286;</mml:mo><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
<p id="P63"><bold>Ought (Threshold Reasoning Context):</bold> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M110"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> just in case <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M111"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula> for some maximal requirement-consistent subset <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> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M113"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote>
<p id="P64">Defining oughts in terms of requirement consistency ensures that the contents of an ought statement are never inconsistent with the contents of a requirement supported by the same reasoning context.</p>
<disp-quote id="Q10">
<p id="P65"><bold>Observation 3:</bold> Where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M114"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is any threshold reasoning context, if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M115"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M116"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>Y</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, then it is not the case that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M117"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>Y</mml:mi></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote>
<p id="P66">Appealing to requirement consistency in this way also ensures that threshold reasoning contexts preserve a number of important patterns of reasoning that result from the agglomeration of oughts with requirements. More formally, if a reasoning context supports the conclusion <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M118"><mml:mrow><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mfenced><mml:mi>X</mml:mi></mml:mfenced></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M119"><mml:mrow><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mfenced><mml:mi>Y</mml:mi></mml:mfenced></mml:mrow></mml:math></inline-formula>, then it also supports the conclusion <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M120"><mml:mrow><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mfenced><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mi>Y</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>. This allows threshold reasoning contexts to preserve some attractive patterns of inference. I discuss this aspect of the model further in the <xref ref-type="app" rid="APP1">appendix</xref>.</p>
<p id="P67">It is also easy to see that this account preserves the same entailments as the basic model. If a threshold reasoning context supports a requirement then it supports a corresponding ought statement, but not vice versa.</p>
<disp-quote id="Q11">
<p id="P68"><bold>Observation 4:</bold> For any threshold reasoning context <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M121"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M122"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M123"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
<p id="P69"><bold>Observation 5:</bold> For any threshold reasoning context <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M124"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M125"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M126"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote>
<p id="P70">The model allows us to distinguish cases of optionality from cases of tragic conflict by appealing to reasons of non-requiring strength. Suppose that Mary&#x2019;s scenario, where she has good reason to go to the theatre or to visit her mother, is now represented by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M127"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> a threshold reasoning context such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M128"><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mi>M</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mi>T</mml:mi></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> where both <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M129"><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x003C;</mml:mo><mml:mi>n</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="M130"><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>&#x003C;</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:math></inline-formula>, so that Mary&#x2019;s reason to see her mother and her reason to go to the theatre are below threshold. The context <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M131"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> supports the conclusions <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M132"><mml:mrow><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mfenced><mml:mi>M</mml:mi></mml:mfenced></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M133"><mml:mrow><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mfenced><mml:mi>T</mml:mi></mml:mfenced></mml:mrow></mml:math></inline-formula>, but not the conclusion <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M134"><mml:mrow><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mfenced><mml:mrow><mml:mi>M</mml:mi><mml:mo>&#x2228;</mml:mo><mml:mi>T</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>. Therefore, it supports the conclusions <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M135"><mml:mrow><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>M</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M136"><mml:mrow><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>T</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. Mary ought to visit her mother and ought to go the theatre, but it is permissible for Mary to do neither.</p>
<p id="P71">Appealing to threshold strengths seems to hold some promise for accommodating optionality, in particular. When used to augment the basic model in the manner suggested, it allows us to distinguish tragic cases like the drowning twins scenario from cases in which someone must merely choose between two good options, and so it allows us to remedy one of the principal drawbacks for the basic model that I outlined above.</p>
<p id="P72">However, I doubt that the difference between the requiring and recommending force of reasons can be captured through an appeal to strength alone. To begin with, whether or not reasons play a requiring or justifying role does not seem to track their apparent strength. It seems plausible that some reasons can possess a great deal of strength without acquiring deontic or requiring force. Suppose that I have nothing to do this weekend, and that going to the cinema or to the beach may bring me a great deal of pleasure, far more than if I choose to stay at home. I think it would nonetheless not be impermissible or irrational for me to fail to go to the beach or cinema. My reasons to go out to the beach or cinema are strong, but they do not seem to require conformity.</p>
<p id="P73">The distinction between the strength of a reason and its requiring force is apparent when we consider cases of supererogation (<xref rid="R7" ref-type="bibr">Gert 2004</xref>: 88&#x2013;92; <xref rid="R42" ref-type="bibr">Snedegar 2016</xref>: 163). Recall the example of the person who has the option of sacrificing their own life in order to save the lives of many others. Their reasons for self-sacrifice in these situations seem particularly strong&#x2014;far stronger, certainly, than their reason to preserve their own life. Someone who did sacrifice their own life in this way would certainly have acted justifiably. Regardless of the strength of this reason, however, it does not seem to require self-sacrifice. Proponents of the threshold approach need to give some account of why these apparently stronger reasons fail to acquire requiring strength, even though they apparently defeat or match other reasons of requiring strength. Cases in which reasons justify what would normally be impermissible seem to have a similar structure. For instance, my reason to act in self-defence seems to have far greater strength than my reason to allow someone else to strike me, but in spite of its strength it does not make it impermissible for me to allow someone else to strike me. The person who turns the other cheek does not seem to make any rational or moral error. In spite of its apparent strength, our reason to act in self-defence does not acquire any requiring force.</p>
<p id="P74">I do not mean to dismiss the prospects of a strength-based approach to the distinction between oughts and requirements outright. I have only sketched a very crude version of such a model here, and it may well be that a more plausible version of the model can be developed. However, to the extent that we want to accommodate the possibility of justifications and supererogation within reasons-based account, these cases give us reason to doubt that appealing to reasons&#x2019; strength in order to distinguish between reasons&#x2019; justifying and requiring roles will be sufficient. Instead, I will propose that we modify our models in order to accommodate the fact that reasons can have differing degrees of justifying and requiring strength.</p>
</sec>
<sec id="S8">
<label>5.</label><title>Distinguishing Reasons&#x2019; Justifying and Requiring Roles</title>
<p id="P75">Various authors have been attracted to the idea that it is necessary to postulate a class of reasons that possess non-requiring force. For instance, <xref rid="R5" ref-type="bibr">Jonathan Dancy (2004)</xref>, Ulrike <xref rid="R18" ref-type="bibr">Heuer (2004)</xref>, Margaret Little and Colleen Macnamara (<xref rid="R24" ref-type="bibr">Little 2013</xref>; <xref rid="R25" ref-type="bibr">Macnamara &amp; Little 2017</xref>) have suggested that it is necessary to postulate a separate class of &#x2018;enticing&#x2019;, &#x2018;optional&#x2019;, or &#x2018;commendatory&#x2019; reasons that recommend an action without making it impermissible not to pursue that action. <xref rid="R7" ref-type="bibr">Joshua Gert (2004</xref>; <xref rid="R8" ref-type="bibr">2007</xref>) and <xref rid="R12" ref-type="bibr">Patricia Greenspan (2005</xref>; <xref rid="R13" ref-type="bibr">2007</xref>; <xref rid="R14" ref-type="bibr">2010</xref>) make the related suggestion that some reasons function to justify actions without requiring conformity. As Gert puts it, some reasons are &#x2018;purely justifying reasons&#x2019;, in that they have a strong justificatory function without having any requiring force (<xref rid="R7" ref-type="bibr">2004</xref>: 23). The model I develop in this section is based on Gert and Greenspan&#x2019;s insights, though it is not intended to be entirely faithful to either author&#x2019;s views.</p>
<p id="P76">As Gert notes (2016: 158), it is philosophically uncontroversial that reasons can occupy both justifying and requiring roles. Advocates of the basic model do not deny this. Accounts that appeal to &#x2018;favoring&#x2019; or &#x2018;justifying&#x2019; reasons differ from the basic model in allowing that reasons can occupy a justifying role without possessing any requiring force (cf. <xref rid="R8" ref-type="bibr">Gert 2007</xref>: 534&#x2013;537; <xref rid="R14" ref-type="bibr">Greenspan 2010</xref>: 190). Unlike the strength-based approaches discussed in the previous section, advocates of what I will call &#x2018;dual-role&#x2019; approaches allow that reasons&#x2019; strength need not correspond to any requiring role in a given context. Even strong reasons can play a justificatory role without playing any requiring role. For instance, suppose that I decide to break my promise to meet someone for lunch because I am unwell. My reason to keep my promise plays a requiring role&#x2014;it ordinarily supports a requirement to perform the promised act. The fact that I am feeling unwell, on the other hand, gives me a purely justificatory reason of sufficient strength not to comply with my promise and to stay at home and rest. My reason to stay at home and convalesce defeats my reason to keep my promise. Nonetheless, my reason to stay at home does not play any requiring role. It would be rationally permissible for me to stay at home and convalesce, but it is not the case that I <italic>must</italic> stay at home. On the other hand, where a requiring reason outweighs or defeat a reason with only justifying strength it can make what would otherwise be a rationally justified option rationally impermissible. If drinking a cup of coffee would make me feel unwell, my reason not to drink the coffee has sufficient strength to defeat my reason to drink the coffee, even though my reason to drink the coffee would normally render it permissible for me to do so (<xref rid="R8" ref-type="bibr">Gert 2007</xref>: 537).</p>
<p id="P77">These insights can be used to fashion an extension of the basic model that allocates to each reason a justifying or requiring role (or both). In order to accommodate both dimensions of strength, we will postulate <italic>dual-role reasoning contexts <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M137"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula></italic>. The two sets <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M138"><mml:mi mathvariant='script'>D</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M139"><mml:mi mathvariant='script'>J</mml:mi></mml:math></inline-formula> identify all reasons <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M140"><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant='script'>R</mml:mi></mml:mrow></mml:math></inline-formula> that occupy requiring and justifying roles, respectively. The priority order <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M141"><mml:mo>&#x003C;</mml:mo></mml:math></inline-formula> is, as for our basic reasoning contexts, a strict partial order reflecting reasons&#x2019; weight or strength, regardless of the roles that a reason occupies.<sup><xref rid="fn9" ref-type="fn">9</xref></sup></p>
<p id="P78">Within these models, requirements are generated by reasons of undefeated strength that occupy the requiring role. Only those reasons that play a requiring role and have undefeated strength support requirements. I will describe such reasons as <italic>undefeated requiring reasons</italic>.</p>
<disp-quote id="Q12">
<p id="P79"><bold>Undefeated Requiring Reasons:</bold> For a dual-role reasoning context <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M142"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, a set of undefeated requiring reasons is defined as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M143"><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>:</mml:mo><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mo>&#x2009;</mml:mo><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mo>&#x2009;</mml:mo><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mo>&#x2009;</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>&#x2009;</mml:mo><mml:mi>s</mml:mi><mml:mi>u</mml:mi><mml:mi>c</mml:mi><mml:mi>h</mml:mi><mml:mo>&#x2009;</mml:mo><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mo>&#x2009;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x003C;</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2009;</mml:mo><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mo>&#x2009;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>ii</mml:mtext></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x22A2;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote>
<p id="P80">Essentially, a requiring reason is undefeated just in case there is no other inconsistent reason in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M144"><mml:mi mathvariant='script'>R</mml:mi></mml:math></inline-formula> of greater priority (regardless of whether that other reason also occupies the requiring role). A proposition expressed by a sentence will be required if it is supported by some maximal consistent subset of reasons with undefeated requiring strength.</p>
<disp-quote id="Q13">
<p id="P81"><bold>Must (Dual-Role Reasoning Contexts):</bold> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M145"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> just in case <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M146"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula> for every maximal consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M147"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M148"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote>
<p id="P82">Where the permission operator <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M149"><mml:mi>P</mml:mi></mml:math></inline-formula> is again defined as the dual of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M150"><mml:mrow><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:math></inline-formula>.</p>
<p id="P83">On this approach, a reason can occupy only a justifying role and nonetheless defeat a requiring reason when it has greater strength. The purely justificatory reason will not support a requirement, but will still be sufficient to defeat a weaker requiring reason. In its current form, however, this model lacks any account of the relationship between reasons and oughts. For this reason both <xref rid="R1" ref-type="bibr">Matt Bedke (2011</xref>: 134) and <xref rid="R42" ref-type="bibr">Snedegar (2016</xref>: 169&#x2013;172) criticise Gert&#x2019;s approach for lacking an account of the relationship between reasons and what we ought to do. The model certainly requires us to depart from the simple idea that we ought to do what we have most reason to do. It does, however, allow us to offer an account of ought in terms of our best justifying reasons. On the particular interpretation I favor, we ought to conform to one of our strongest compatible sets of justifying reasons (cf. <xref rid="R10" ref-type="bibr">Gert 2014</xref>: 209). In other words, a dual-role reasoning context will support an ought just in case it is supported by some maximal consistent subset of undefeated justifying reasons. In order to develop this account of oughts, we first define a set of undefeated justifying reasons.</p>
<disp-quote id="Q14">
<p id="P84"><bold>Undefeated Justifying Reasons:</bold> For a dual-role reasoning context <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M151"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> a set of undefeated justifying reasons is defined as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M152"><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>:</mml:mo><mml:mtext>there</mml:mtext><mml:mo>&#x2009;</mml:mo><mml:mtext>is</mml:mtext><mml:mo>&#x2009;</mml:mo><mml:mtext>no</mml:mtext><mml:mo>&#x2009;</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>&#x2009;</mml:mo><mml:mtext>such</mml:mtext><mml:mo>&#x2009;</mml:mo><mml:mtext>that</mml:mtext><mml:mo>&#x2009;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mtext>i</mml:mtext><mml:mo>)</mml:mo></mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x003C;</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2009;</mml:mo><mml:mtext>and</mml:mtext><mml:mo>&#x2009;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mi>i</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x22A2;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote>
<p id="P85">As with our threshold reasoning contexts, we also need to stipulate that any maximal set of justifying reasons that supports an ought will need to be requirement consistent, otherwise the standard entailments will not be preserved.<sup><xref rid="fn10" ref-type="fn">10</xref></sup> To do so, we first alter the definition of requirement consistency for a dual-role reasoning context:
<disp-quote id="Q15">
<p id="P86"><bold>Requirement Consistency (Dual-Role Reasoning Context):</bold> Where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M153"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is a dual-role reasoning context, a set of sentences <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M154"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> is requirement consistent just in case <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M155"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x222A;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> is consistent for some consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M156"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M157"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote></p>
<p id="P87">We then define oughts in terms of maximal requirement consistent subsets, as before:
<disp-quote id="Q16">
<p id="P88"><bold>Ought (Dual-Role Reasoning Contexts):</bold> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M158"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> just in case <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M159"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula> for some maximal requirement consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M160"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M161"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote></p>
<p id="P89">On this account of our practical reasoning, we first identify our undefeated requiring reasons, in order to determine what is required or impermissible. Oughts are then supported by our best justifying reasons, provided the consequences of their conclusions are consistent with some maximal subset of requiring reasons. As for our threshold reasoning contexts, invoking requirement consistency prevents our models from generating requirements and oughts with inconsistent contents.</p>
<disp-quote id="Q17">
<p id="P90"><bold>Observation 6:</bold> Where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M162"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is any dual-role reasoning context, if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M163"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M164"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>Y</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, then it is not the case that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M165"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>Y</mml:mi></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote>
<p id="P91">As I note in the <xref ref-type="app" rid="APP1">appendix</xref>, introduction of requirement consistency also allows for the agglomeration of oughts with requirements (just as it did for the threshold reasoning contexts), thereby preserving attractive patterns of inference.</p>
<p id="P92">Dual-role reasoning contexts are able to accommodate the problematic cases we noted for the basic model in <xref rid="S3" ref-type="sec">Section 3</xref>, as I demonstrate below. However, as <xref rid="R42" ref-type="bibr">Snedegar (2016</xref>: 170&#x2013;171) notes in his discussion of Gert&#x2019;s approach, unamended it is unable to accommodate the standard entailment between requirements and oughts. Since a reason could occupy the requiring role without occupying a justifying role, it follows that a reason could fail to belong to the set of undefeated justifying reasons, and therefore fail to support an ought. Consider, for example, a dual-role reasoning context <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M166"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, an interpretation of the drowning twins scenario, where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M167"><mml:mrow><mml:mi mathvariant='script'>D</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:msub><mml:mi>T</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:msub><mml:mi>T</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> but where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M168"><mml:mrow><mml:mi mathvariant='script'>J</mml:mi><mml:mo>=</mml:mo><mml:mo>&#x2205;</mml:mo></mml:mrow></mml:math></inline-formula>. The reason to save either twin occupies a requiring role but not a justifying one. It is easy to see that this context will generate the conclusion <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M169"><mml:mrow><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mfenced><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x2228;</mml:mo><mml:msub><mml:mi>T</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> but not the conclusion <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M170"><mml:mrow><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mfenced><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x2228;</mml:mo><mml:msub><mml:mi>T</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula>, since neither <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M171"><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> nor <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M172"><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> are in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M173"><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
<p id="P93">Fortunately it can be shown that, granted a plausible constraint on their structure, dual-role reasoning contexts preserve the desired entailments between requirements, oughts and permissions. Provided we impose the constraint on our contexts that any reason that occupies a requiring role also occupies a justifying role, then any set of reasons supporting the conclusion <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M174"><mml:mrow><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mfenced><mml:mi>X</mml:mi></mml:mfenced></mml:mrow></mml:math></inline-formula> will also support the conclusion <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M175"><mml:mrow><mml:mo>&#x00A0;</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mfenced><mml:mi>X</mml:mi></mml:mfenced></mml:mrow></mml:math></inline-formula>. More formally, we stipulate that for any reasoning context <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M176"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M177"><mml:mrow><mml:mi mathvariant='script'>D</mml:mi><mml:mo>&#x2286;</mml:mo><mml:mi mathvariant='script'>J</mml:mi></mml:mrow></mml:math></inline-formula>. This stipulation seems plausible, since it would be odd for a reason that occupies the requiring role not to also occupy the justifying role (<xref rid="R14" ref-type="bibr">Greenspan 2010</xref>: 189).<sup><xref rid="fn11" ref-type="fn">11</xref></sup> Any reason that can requires us to perform an action can also provide us with justification for the same action.</p>
<disp-quote id="Q18">
<p id="P94"><bold>Observation 7:</bold> Suppose <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M178"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is any dual-role reasoning context such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M179"><mml:mrow><mml:mi mathvariant='script'>D</mml:mi><mml:mo>&#x2286;</mml:mo><mml:mi mathvariant='script'>J</mml:mi></mml:mrow></mml:math></inline-formula>. If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M180"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M181"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote>
<p id="P95">Moreover, once this stipulation is made, any set of reasons that supports the conclusion <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M182"><mml:mrow><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mfenced><mml:mi>X</mml:mi></mml:mfenced></mml:mrow></mml:math></inline-formula> will also support the conclusion <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M183"><mml:mrow><mml:mi>P</mml:mi><mml:mfenced><mml:mi>X</mml:mi></mml:mfenced></mml:mrow></mml:math></inline-formula>.</p>
<disp-quote id="Q19">
<p id="P96"><bold>Observation 8:</bold> Where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M184"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is any dual-role reasoning context, if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M185"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M186"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote>
<p id="P97">Unsurprisingly given the motivations for developing the model, dual-role reasoning contexts generate plausible conclusions in the cases of optionality, supererogation and justification that presented problems for the basic model. Latitude emerges whenever there are undefeated reasons that do not occupy a requiring role (<xref rid="R14" ref-type="bibr">Greenspan 2010</xref>: 188&#x2013;189). Consider the case of Mary, introduced above, in which it appears as though she has two good, non-requiring options to go to the theatre or to see her mother. Let our reasoning context be <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M187"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, where as before <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M188"><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mi>M</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mi>T</mml:mi></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, but where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M189"><mml:mrow><mml:mi mathvariant='script'>D</mml:mi><mml:mo>=</mml:mo><mml:mo>&#x2205;</mml:mo></mml:mrow></mml:math></inline-formula>, and where as before <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M190"><mml:mi>T</mml:mi></mml:math></inline-formula> is consistent with <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M191"><mml:mi>M</mml:mi></mml:math></inline-formula>. It is easy to see that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M192"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mi>M</mml:mi><mml:mo>,</mml:mo><mml:mi>T</mml:mi></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> but that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M193"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mo>&#x2205;</mml:mo></mml:mrow></mml:math></inline-formula>. Therefore we have that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M194"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msub><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>T</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M195"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msub><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>M</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> as well as that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M196"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msub><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#x2228;</mml:mo><mml:mi>M</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. Mary ought to go to the theatre and ought to see her mother, but it is permissible for her to do neither.</p>
<p id="P98">Cases of supererogation similarly arise in contexts where the supererogatory options occupy a justificatory role and have greater strength than other options, but where they do not have any requiring force and therefore do not support a requirement. For instance, consider a dual-role reasoning context <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M197"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow><mml:mn>3</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M198"><mml:mrow><mml:mi mathvariant='script'>J</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mi>G</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mi>R</mml:mi></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, where as before <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M199"><mml:mi>G</mml:mi></mml:math></inline-formula> expresses the proposition that I save the lives of several strangers by jumping on a grenade, and where sentence <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M200"><mml:mi>R</mml:mi></mml:math></inline-formula> expresses the inconsistent proposition that I run away. The priority order is such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M201"><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>2</mml:mn>
</mml:msub><mml:mo>&#x003C;</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow></mml:math></inline-formula>, my reason to run away is weaker than my reason to save others&#x2019; lives. In this reasoning context we have <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M202"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow><mml:mn>3</mml:mn></mml:msub><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, but not <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M203"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow><mml:mn>3</mml:mn></mml:msub><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. It therefore supports the further conclusion <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M204"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow><mml:mn>3</mml:mn></mml:msub><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. I ought to jump on the grenade to save the lives of several strangers, since that would be consistent with my best justifying reasons, but it is permissible for me to attempt to save myself by running away.</p>
<p id="P99">Finally, the revised model provides the resources to distinguish cases of optionality from cases of tragic conflict. In dual-role reasoning contexts, tragic conflict arises when there are two or more conflicting and undefeated requiring reasons, as opposed to two or more conflicting purely justificatory reasons. We can interpret the drowning twins scenario in terms of a dual-role context <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M205"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow><mml:mn>4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M206"><mml:mrow><mml:mi mathvariant='script'>D</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:msub><mml:mi>T</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:msub><mml:mi>T</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, as before, and where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M207"><mml:mo>&#x003C;</mml:mo></mml:math></inline-formula> is again empty. Since both reasons are undefeated in the requiring role, we have that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M208"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow><mml:mn>4</mml:mn></mml:msub><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x2228;</mml:mo><mml:msub><mml:mi>T</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and therefore that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M209"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow><mml:mn>4</mml:mn></mml:msub><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>P</mml:mi><mml:mo>&#x00AC;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x2228;</mml:mo><mml:msub><mml:mi>T</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. This is to be contrasted with a context, like Mary&#x2019;s case considered above and represented in the dual-role reasoning context <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M210"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, in which we merely choose between two good options which are undefeated justifying reasons, but which do not function as requiring reasons.</p>
<p id="P100">I have presented this model as an interpretation of Gert and Greenspan&#x2019;s suggestion that some reasons perform a justifying role without having any requiring force. I do not mean to suggest that either Gert or Greenspan would endorse the model as I have developed it. For instance, the definition of oughts I have adopted allows the model to accommodate the idea that we ought to conform to one of our best justifying reasons. This aspect of the model allows us to offer an account of the relationship between justifying reasons and oughts. Gert would likely reject this particular aspect of the model, since he rejects the idea that what we ought to do is in any way associated with our strongest reasons as misconceived (<xref rid="R8" ref-type="bibr">2007</xref>: 548&#x2013;552).<sup><xref rid="fn12" ref-type="fn">12</xref></sup> Rather than attempting to capture Gert and Greenspan&#x2019;s particular frameworks, I have provided a more generic approach that exploits their insight that reasons perform either or both justifying and requiring roles in a given context. As we have seen, the model can accommodate the cases that are most problematic for the basic model.</p>
</sec>
<sec id="S9">
<label>6.</label><title>Conclusion</title>
<p id="P101">My focus in this article has been on developing simple reasons-based models that accommodate the various problems from common-sense morality that I noted in <xref rid="S3" ref-type="sec">Section 3</xref>, while also preserving the desired entailment relationship between requirements, oughts and permissions. Focussing on these issues has constrained the scope of my discussion in a number of ways. The models are only rudimentary. There are plausible extensions of the threshold and dual-role models that I have not considered. Both models could be amended to accommodate familiar forms of reasoning about the priorities or roles that are assigned to other reasons in a given context (cf. <xref rid="R22" ref-type="bibr">Horty 2012</xref>; <xref rid="R43" ref-type="bibr">Tucker 2018</xref>). For instance, whether a given reason occupies a requiring role in a given context could itself be the subject of further reasoning that is represented within the model. Similarly, while there are plausible variants of the models that allow for conflicting all-things-considered requirements, I have not discussed them.</p>
<p id="P102">I have also not discussed some important alternative approaches to addressing the problems I identified in <xref rid="S3" ref-type="sec">Section 3</xref>. Two forms of alternative response seem to me to be particularly important from a reasons-based perspective. First, <xref rid="R1" ref-type="bibr">Bedke (2011)</xref> proposes a &#x2018;Millian inversion&#x2019; by which requirements and permissions are explained in terms of what we have most reason to respond to with speech acts or actions requiring or permitting certain behaviour. However, since this response requires us to give up on the standard entailment relationships (<xref rid="R42" ref-type="bibr">Snedegar 2016</xref>, 165&#x2013;167), I have not explored its merits here. Second there is the possibility, which I only briefly critiqued in <xref rid="S3" ref-type="sec">Section 3</xref>, of using <xref rid="R33" ref-type="bibr">Raz&#x2019;s (1975</xref>; <xref rid="R34" ref-type="bibr">1999a</xref>) account of exclusionary permissions to account for some of the cases that presented problems for the basic model. I do not think that invoking exclusionary reasons provides a straightforward solution to these problems, but the approach is certainly deserving of further consideration. The relation between exclusionary reasons and the distinction between justifying and requiring reasons merits lengthier discussion, and I hope to revisit it in future work.</p>
<p id="P103">There are philosophical problems with the dual-role approach to reasons that cannot be addressed by any formal model. Most obviously, it complicates the simple and attractive idea that the function of a practical reason is to &#x2018;count in favour&#x2019; of an action (<xref rid="R36" ref-type="bibr">Scanlon 1998</xref>: 17). I suspect, for this reason, that many proponents of the basic model will be unmoved by my motivations for developing an alternative account. Nonetheless, the models developed here allow us to identify some points of disagreement between proponents of the basic model and its critics with greater precision. More significantly, they show that a coherent model of the dual-role approach to practical reasoning is available&#x2014;one that is consistent with a conventional understanding of the relationship between reasons, oughts and requirements.</p>
</sec>
</body>
<back>
<ack id="S10">
<title>Acknowledgements</title>
<p id="P104">I would like to thank my referees for very helpful comments on earlier versions of the paper. I am particularly grateful to Shyam Nair, who not only provided me with extensive, thoughtful comments on previous versions of the manuscript, but corrected several errors in previous proofs and encouraged me to make important amendments. All remaining errors are my own.</p>
</ack>
<fn-group>
<fn id="fn1"><label>1.</label><p id="P143">I will follow what is now the standard philosophical practice of using the nominalization &#x2018;ought&#x2019; (and its plural &#x2018;oughts&#x2019;) to refer to conclusions about what ought to occur.</p></fn>
<fn id="fn2"><label>2.</label><p id="P144">The approach has its origins in <xref rid="R6" ref-type="bibr">van Fraassen (1973)</xref>. <xref rid="R16" ref-type="bibr">J&#x00F6;rg Hansen (2004</xref>; <xref rid="R17" ref-type="bibr">2005</xref>) develops his models as an interpretation of the relationship between commands or imperatives and deontic conclusions. <xref rid="R21" ref-type="bibr">Horty (2003</xref>; <xref rid="R22" ref-type="bibr">2012</xref>) develops a deontic interpretation of Reiter&#x2019;s default logic in terms of reasons, relating his approach back to van Fraasen&#x2019;s initial proposal. For a logical overview of these approaches see <xref rid="R11" ref-type="bibr">Goble (2013</xref>: &#x00A7;&#x00A7; 4.4, 6.3).</p></fn>
<fn id="fn3"><label>3.</label><p id="P145">The model developed in <xref rid="S2" ref-type="sec">Section 2</xref> is equivalent to the version of Horty&#x2019;s model used by <xref rid="R28" ref-type="bibr">Nair (2016</xref>: Appendix 2) to illustrate the relation between reasons and oughts, although I use the operator <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M211"><mml:mrow><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:math></inline-formula> rather than <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M212"><mml:mrow><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mo>&#x00A0;</mml:mo></mml:mrow></mml:math></inline-formula> to express requirement.</p></fn>
<fn id="fn4"><label>4.</label><p id="P146">In brief, the logic ignores: (i) the antecedent conditions of reasons (it lacks any account of reasons as a dyadic relationship of the form &#x2018;A is a reason for B&#x2019;); (ii) exclusionary or undercutting reasons; (iii) defeat of a reason by a set of inconsistent reasons; and (iv) reasons for varying the priority of other reasons. For logics that accommodate these features, see <xref rid="R22" ref-type="bibr">Horty (2012)</xref> and <xref rid="R43" ref-type="bibr">Tucker (2018)</xref>.</p></fn>
<fn id="fn5"><label>5.</label><p id="P147">That is (i) if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M213"><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x003C;</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M214"><mml:mrow><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x003C;</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mrow><mml:mo>&#x2032;</mml:mo><mml:mo>&#x2032;</mml:mo></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M215"><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x003C;</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mrow><mml:mo>&#x2032;</mml:mo><mml:mo>&#x2032;</mml:mo></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> and (ii) it is not the case that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M216"><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x003C;</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M217"><mml:mrow><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x003C;</mml:mo><mml:mi>r</mml:mi></mml:mrow></mml:math></inline-formula>.</p></fn>
<fn id="fn6"><label>6.</label><p id="P148">For an explicit defence of this idea see <xref rid="R31" ref-type="bibr">Portmore (2013)</xref>.</p></fn>
<fn id="fn7"><label>7.</label><p id="P149"><xref rid="R7" ref-type="bibr">Gert (2004</xref>: 19, fn. 3) assembles a list of philosophers who have explicitly or tacitly endorsed this view.</p></fn>
<fn id="fn8"><label>8.</label><p id="P150">Both <xref rid="R7" ref-type="bibr">Gert (2004</xref>: 92&#x2013;101) and <xref rid="R42" ref-type="bibr">Snedegar (2016</xref>: 162&#x2013;163) also suggest, and then reject, proposals of this sort.</p></fn>
<fn id="fn9"><label>9.</label><p id="P151">Gert sometimes invokes the idea that that the same reason can possess different &#x2018;degrees&#x2019; of justifying and requiring strength, where one reason can possess more justifying strength than another reason possesses requiring strength (e.g., <xref rid="R8" ref-type="bibr">2007</xref>: 546&#x2013;548). This suggests the possibility of cross-scalar comparison. On the account I offer here, however, a reason&#x2019;s strength carries across into whatever role it occupies. Like <xref rid="R12" ref-type="bibr">Greenspan (2005</xref>: 390, fn. 1), I regard the characterization of a reason&#x2019;s strength as entirely separate from its occupation of either a justifying or requiring role.</p></fn>
<fn id="fn10"><label>10.</label><p id="P152">Consider the model <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M218"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow><mml:mn>5</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M219"><mml:mrow><mml:mi mathvariant='script'>D</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mi>A</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mi>B</mml:mi></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M220"><mml:mrow><mml:mi mathvariant='script'>J</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mi>A</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mi>B</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mi>C</mml:mi></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M221"><mml:mrow><mml:mo>&#x003C;</mml:mo></mml:mrow></mml:math></inline-formula> is empty, and where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M222"><mml:mrow><mml:mi>A</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>D</mml:mi></mml:mrow></mml:math></inline-formula> and where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M223"><mml:mrow><mml:mi>B</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mi>C</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mi>D</mml:mi></mml:mrow></mml:math></inline-formula>. We have that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M224"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mi>A</mml:mi><mml:mo>,</mml:mo><mml:mi>B</mml:mi></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M225"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mi>A</mml:mi><mml:mo>,</mml:mo><mml:mi>B</mml:mi><mml:mo>,</mml:mo><mml:mi>C</mml:mi></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. In this dual-rolecontextwe have that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M226"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow><mml:mn>5</mml:mn></mml:msub><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>D</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> but that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M227"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mi mathvariant='script'>D</mml:mi></mml:mrow></mml:math></inline-formula> for some maximal consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M228"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M229"><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, and therefore that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M230"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow><mml:mn>5</mml:mn></mml:msub><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>D</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p></fn>
<fn id="fn11"><label>11.</label><p id="P153">As a reviewer notes, this stipulation makes the separate set <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M231"><mml:mi mathvariant='script'>J</mml:mi></mml:math></inline-formula> of justifying reasons redundant. The same results could be achieved with a model <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M232"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, which distinguished between ordinary reasons and requiring reasons. However, I retain a distinct set of justifying reasons for the purposes of exposition.</p></fn>
<fn id="fn12"><label>12.</label><p id="P154">In more recent work, <xref rid="R9" ref-type="bibr">Gert (2012</xref>: 616&#x2013;617) seems sympathetic to the view that, in addition to occupying requiring and justifying roles, reasons might also perform a merit-conferring role (this view is defended in <xref rid="R20" ref-type="bibr">Horgan &amp; Timmons 2010</xref>).</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>Bedke</surname>, <given-names>Matt</given-names></string-name></person-group> (<year>2011</year>). <article-title>Passing the Deontic Buck.</article-title> <source>Oxford Studies in Metaethics</source>, <volume>6</volume>, <fpage>128</fpage>.</mixed-citation></ref>
<ref id="R2"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Broome</surname>, <given-names>John</given-names></string-name></person-group> (<year>2016</year>). <article-title>A Linguistic Turn in the Philosophy of Normativity?</article-title> <source>Analytic Philosophy</source>, <volume>57</volume>(<issue>1</issue>), <fpage>1</fpage>&#x2013;<lpage>14</lpage>.</mixed-citation></ref>
<ref id="R3"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Chisholm</surname>, <given-names>Roderick M.</given-names></string-name></person-group> (<year>1974</year>). <chapter-title>Practical Reason and the Logic of Requirement.</chapter-title> In <person-group person-group-type="editor"><string-name><surname>Korner</surname>, <given-names>Stephan</given-names></string-name></person-group> (Ed.), <source>Practical Reason</source> (<fpage>1</fpage>&#x2013;<lpage>17</lpage>). <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="R4"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Dancy</surname>, <given-names>Jonathan</given-names></string-name></person-group> (<year>1993</year>). <source>Moral Reasons.</source> <publisher-name>Blackwell</publisher-name>.</mixed-citation></ref>
<ref id="R5"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Dancy</surname>, <given-names>Jonathan</given-names></string-name></person-group> (<year>2004</year>). <chapter-title>Enticing Reasons.</chapter-title> In <person-group person-group-type="editor"><string-name><surname>Jay Wallace</surname>, <given-names>R.</given-names></string-name></person-group>, <person-group person-group-type="editor"><string-name><surname>Pettit</surname>, <given-names>Philip</given-names></string-name></person-group>, <person-group person-group-type="editor"><string-name><surname>Scheffler</surname>, <given-names>Samuel</given-names></string-name></person-group>, and <person-group person-group-type="editor"><string-name><surname>Smith</surname>, <given-names>Michael</given-names></string-name></person-group> (Eds.), <source>Reason and Value: Themes from the Moral Philosophy of Joseph Raz</source> (<fpage>91</fpage>&#x2013;<lpage>118</lpage>). <publisher-name>Clarendon Press</publisher-name>.</mixed-citation></ref>
<ref id="R6"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>van Fraassen</surname>, <given-names>Bas C.</given-names></string-name></person-group> (<year>1973</year>). <article-title>Values and the Heart&#x2019;s Command.</article-title> <source>Journal of Philosophy</source>, <volume>70</volume>(<issue>1</issue>), <fpage>5</fpage>&#x2013;<lpage>19</lpage>.</mixed-citation></ref>
<ref id="R7"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Gert</surname>, <given-names>Joshua</given-names></string-name></person-group> (<year>2004</year>). <source>Brute Rationality: Normativity and Human Action.</source> <publisher-name>Cambridge University Press</publisher-name>.</mixed-citation></ref>
<ref id="R8"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Gert</surname>, <given-names>Joshua</given-names></string-name></person-group> (<year>2007</year>). <article-title>Normative Strength and the Balance of Reasons.</article-title> <source>Philosophical Review</source>, <volume>116</volume>(<issue>4</issue>), <fpage>533</fpage>&#x2013;<lpage>562</lpage>.</mixed-citation></ref>
<ref id="R9"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Gert</surname>, <given-names>Joshua</given-names></string-name></person-group> (<year>2012</year>). <article-title>Moral Worth, Supererogation, and the Justifying/Requiring Distinction.</article-title> <source>Philosophical Review</source>, <volume>121</volume>(<issue>4</issue>), <fpage>611</fpage>&#x2013;<lpage>618</lpage>.</mixed-citation></ref>
<ref id="R10"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Gert</surname>, <given-names>Joshua</given-names></string-name></person-group> (<year>2014</year>). <article-title>Perform a Justified Option.</article-title> <source>Utilitas</source>, <volume>26</volume>(<issue>2</issue>), <fpage>206</fpage>&#x2013;<lpage>217</lpage>.</mixed-citation></ref>
<ref id="R11"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Goble</surname>, <given-names>Lou</given-names></string-name></person-group> (<year>2013</year>). <chapter-title>Prima Facie Norms, Normative Conflicts, and Dilemmas.</chapter-title> In <person-group person-group-type="editor"><string-name><surname>Gabbay</surname>, <given-names>Dov</given-names></string-name></person-group>, <person-group person-group-type="editor"><string-name><surname>Parent</surname>, <given-names>Xavier</given-names></string-name></person-group>, <person-group person-group-type="editor"><string-name><surname>van der Mayden</surname>, <given-names>Ron</given-names></string-name></person-group>, and <person-group person-group-type="editor"><string-name><surname>van der Torre</surname>, <given-names>Leendert</given-names></string-name></person-group> (Eds.), <source>Handbook of Deontic Logic and Normative Systems</source> (<fpage>241</fpage>&#x2013;<lpage>352</lpage>). <publisher-name>College Publications</publisher-name>.</mixed-citation></ref>
<ref id="R12"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Greenspan</surname>, <given-names>Patricia</given-names></string-name></person-group> (<year>2005</year>). <chapter-title>Asymmetrical Practical Reasons.</chapter-title> In <person-group person-group-type="editor"><string-name><surname>Reicher</surname>, <given-names>M. E.</given-names></string-name></person-group> and <person-group person-group-type="editor"><string-name><surname>Marek</surname>, <given-names>J. C.</given-names></string-name></person-group> (Eds.) <source>Experience and Analysis: Proceedings of the 27th International Wittgenstein Symposium</source> (<fpage>387</fpage>&#x2013;<lpage>394</lpage>). <publisher-name>&#x00D6;bv &amp; hpt</publisher-name>.</mixed-citation></ref>
<ref id="R13"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Greenspan</surname>, <given-names>Patricia</given-names></string-name></person-group> (<year>2007</year>). <chapter-title>Practical Reasons and Moral &#x2018;Ought&#x2019;.</chapter-title> In <person-group person-group-type="editor"><string-name><surname>Shafer-Landau</surname>, <given-names>Russ</given-names></string-name></person-group> (Ed.), <source>Oxford Studies in Metaethics</source> (Vol. <volume>2</volume>, <fpage>172</fpage>&#x2013;<lpage>194</lpage>). <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="R14"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Greenspan</surname>, <given-names>Patricia</given-names></string-name></person-group> (<year>2010</year>). <article-title>Making Room for Options: Moral Reasons, Imperfect Duties, and Choice.</article-title> <source>Social Philosophy and Policy</source>, <volume>27</volume>(<issue>2</issue>), <fpage>181</fpage>&#x2013;<lpage>205</lpage>.</mixed-citation></ref>
<ref id="R15"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Hampton</surname>, <given-names>Jean</given-names></string-name></person-group> (<year>1998</year>). <source>The Authority of Reason.</source> <publisher-name>Cambridge University Press</publisher-name>.</mixed-citation></ref>
<ref id="R16"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Hansen</surname>, <given-names>J&#x00F6;rg</given-names></string-name></person-group> (<year>2004</year>). <article-title>Problems and Results for Logics about Imperatives.</article-title> <source>Journal of Applied Logic</source>, <volume>2</volume>(<issue>1</issue>), <fpage>39</fpage>&#x2013;<lpage>61</lpage>.</mixed-citation></ref>
<ref id="R17"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Hansen</surname>, <given-names>J&#x00F6;rg</given-names></string-name></person-group> (<year>2005</year>). <article-title>Conflicting Imperatives and Dyadic Deontic Logic.</article-title> <source>Journal of Applied Logic</source>, <volume>3</volume>(<issue>3&#x2013;4</issue>), <fpage>484</fpage>&#x2013;<lpage>511</lpage>.</mixed-citation></ref>
<ref id="R18"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Heuer</surname>, <given-names>Ulrike</given-names></string-name></person-group> (<year>2004</year>). <chapter-title>Raz on Values and Reasons.</chapter-title> In <person-group person-group-type="editor"><string-name><surname>Jay Wallace</surname>, <given-names>R.</given-names></string-name></person-group>, <person-group person-group-type="editor"><string-name><surname>Pettit</surname>, <given-names>Philipp</given-names></string-name></person-group>, <person-group person-group-type="editor"><string-name><surname>Scheffler</surname>, <given-names>Samuel</given-names></string-name></person-group>, and <person-group person-group-type="editor"><string-name><surname>Smith</surname>, <given-names>Michael</given-names></string-name></person-group> (Eds.), <source>Reason and Value: Themes from the Philosophy of Joseph Raz</source> (<fpage>129</fpage>&#x2013;<lpage>152</lpage>). <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="R19"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Heyd</surname>, <given-names>David</given-names></string-name></person-group> (<year>1982</year>). <source>Supererogation: Its Status in Ethical Theory.</source> <publisher-name>Cambridge University Press</publisher-name>.</mixed-citation></ref>
<ref id="R20"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Horgan</surname>, <given-names>Terry</given-names></string-name></person-group>, and <person-group person-group-type="author"><string-name><surname>Timmons</surname>, <given-names>Mark</given-names></string-name></person-group> (<year>2010</year>). <article-title>Untying a Knot from the Inside Out: Reflections on the &#x2018;Paradox&#x2019; of Supererogation.</article-title> <source>Social Philosophy and Policy</source>, <volume>27</volume>(<issue>2</issue>), <fpage>29</fpage>&#x2013;<lpage>63</lpage>.</mixed-citation></ref>
<ref id="R21"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Horty</surname>, <given-names>John</given-names></string-name></person-group> (<year>2003</year>). <article-title>Reasoning with Moral Conflicts.</article-title> <source>No&#x00FB;s</source>, <volume>37</volume>(<issue>4</issue>), <fpage>557</fpage>&#x2013;<lpage>605</lpage>.</mixed-citation></ref>
<ref id="R22"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Horty</surname>, <given-names>John</given-names></string-name></person-group> (<year>2012</year>). <source>Reasons as Defaults.</source> <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="R23"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Kagan</surname>, <given-names>Shelly</given-names></string-name></person-group> (<year>1989</year>). <source>The Limits of Morality.</source> <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="R24"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Little</surname>, <given-names>Margaret</given-names></string-name></person-group> (<year>2013</year>). <chapter-title>In Defence of Non-Deontic Reasons.</chapter-title> In <person-group person-group-type="editor"><string-name><surname>Bakhurst</surname>, <given-names>David</given-names></string-name></person-group>, <person-group person-group-type="editor"><string-name><surname>Little</surname>, <given-names>Margaret</given-names></string-name></person-group>, and <person-group person-group-type="editor"><string-name><surname>Hooker</surname>, <given-names>Brad</given-names></string-name></person-group> (Eds.), <source>Thinking About Reasons: Themes From the Philosophy of Jonathan Dancy</source> (<fpage>112</fpage>&#x2013;<lpage>136</lpage>). <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="R25"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Macnamara</surname>, <given-names>Coleen</given-names></string-name> and <string-name><surname>Little</surname>, <given-names>Margaret</given-names></string-name></person-group> (<year>2017</year>). <chapter-title>For Better or Worse: Commendatory Reasons and Latitude.</chapter-title> In <person-group person-group-type="editor"><string-name><surname>Timmons</surname>, <given-names>Mark</given-names></string-name></person-group> (Ed.) <source>Oxford Studies in Normative Ethics</source> (Vol. <volume>7</volume>, <fpage>138</fpage>&#x2013;<lpage>160</lpage>). <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="R26"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Marcus</surname>, <given-names>Ruth Barcan</given-names></string-name></person-group> (<year>1980</year>). <article-title>Moral Dilemmas and Consistency.</article-title> <source>Journal of Philosophy</source>, <volume>77</volume>(<issue>3</issue>), <fpage>121</fpage>&#x2013;<lpage>136</lpage>.</mixed-citation></ref>
<ref id="R27"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>McNamara</surname>, <given-names>Paul</given-names></string-name></person-group> (<year>1996</year>). <chapter-title>Must I Do What I Ought (Or Will the Least I Can Do Do)?</chapter-title> In <person-group person-group-type="editor"><string-name><surname>Brown</surname>, <given-names>Mark</given-names></string-name></person-group> and <person-group person-group-type="editor"><string-name><surname>Carmo</surname>, <given-names>Jos&#x00E9;</given-names></string-name></person-group> (Eds.), <source>Deontic Logic, Agency and Normative Systems</source>, (<fpage>154</fpage>&#x2013;<lpage>173</lpage>). <publisher-name>Springer-Verlag</publisher-name>.</mixed-citation></ref>
<ref id="R28"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Nair</surname>, <given-names>Shyam</given-names></string-name></person-group> (<year>2016</year>). <article-title>Conflicting Reasons, Unconflicting &#x2018;Oughts.&#x2019;</article-title> <source>Philosophical Studies</source>, <volume>173</volume>(<issue>3</issue>), <fpage>629</fpage>&#x2013;<lpage>663</lpage>.</mixed-citation></ref>
<ref id="R29"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Nair</surname>, <given-names>Shyam</given-names></string-name> and <string-name><surname>Horty</surname>, <given-names>John</given-names></string-name></person-group> (<year>2018</year>). The Logic of Reasons. In <person-group person-group-type="editor"><string-name><surname>Star</surname>, <given-names>Daniel</given-names></string-name></person-group> (Ed.) <source>The Oxford Handbook of Reasons and Normativity</source> (<fpage>67</fpage>&#x2013;<lpage>83</lpage>). <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="R30"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Parfit</surname>, <given-names>Derek</given-names></string-name></person-group> (<year>2011</year>). <source>On What Matters.</source> <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="R31"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Portmore</surname>, <given-names>Douglas W.</given-names></string-name></person-group> (<year>2013</year>). <article-title>Perform Your Best Option.</article-title> <source>Journal of Philosophy</source>, <volume>110</volume>(<issue>8</issue>), <fpage>436</fpage>&#x2013;<lpage>459</lpage>.</mixed-citation></ref>
<ref id="R32"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Portner</surname>, <given-names>Paul</given-names></string-name></person-group> (<year>2009</year>). <source>Modality.</source> <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="R33"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Raz</surname>, <given-names>Joseph</given-names></string-name></person-group> (<year>1975</year>). <article-title>Permissions and Supererogation.</article-title> <source>American Philosophical Quarterly</source>, <volume>12</volume>(<issue>2</issue>), <fpage>161</fpage>&#x2013;<lpage>168</lpage>.</mixed-citation></ref>
<ref id="R34"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Raz</surname>, <given-names>Joseph</given-names></string-name></person-group> (<year>1999a</year>). <source>Practical Reason and Norms</source> (<edition>2nd</edition> ed.). <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>Raz</surname>, <given-names>Joseph</given-names></string-name></person-group> (<year>1999b</year>). <source>Engaging Reason: On the Theory of Value and Action.</source> <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="R36"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Scanlon</surname>, <given-names>T. M.</given-names></string-name></person-group> (<year>1998</year>). <source>What We Owe to Each Other.</source> <publisher-name>Harvard University Press</publisher-name>.</mixed-citation></ref>
<ref id="R37"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Scanlon</surname>, <given-names>T. M.</given-names></string-name></person-group> (<year>2014</year>). <source>Being Realistic About Reasons.</source> <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="R38"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Schroeder</surname>, <given-names>Mark</given-names></string-name></person-group> (<year>2007</year>). <source>Slaves of the Passions.</source> <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="R39"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Schroeder</surname>, <given-names>Mark</given-names></string-name></person-group> (<year>2011</year>). <article-title>Holism, Weight and Undercutting.</article-title> <source>No&#x00FB;s</source>, <volume>45</volume>(<issue>2</issue>), <fpage>328</fpage>&#x2013;<lpage>344</lpage>.</mixed-citation></ref>
<ref id="R40"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Silk</surname>, <given-names>Alex</given-names></string-name></person-group> (<year>2015</year>). <chapter-title>What Normative Terms Mean and Why It Matters for Ethical Theory.</chapter-title> In <person-group person-group-type="editor"><string-name><surname>Timmons</surname>, <given-names>Mark</given-names></string-name></person-group> (Ed.) <source>Oxford Studies in Normative Ethics</source> (Vol. <volume>5</volume>, <fpage>296</fpage>&#x2013;<lpage>325</lpage>). <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="R41"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Skorupski</surname>, <given-names>John</given-names></string-name></person-group> (<year>2010</year>). <source>The Domain of Reasons.</source> <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="R42"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Snedegar</surname>, <given-names>Justin</given-names></string-name></person-group> (<year>2016</year>). <chapter-title>Reasons, Oughts, and Requirements.</chapter-title> <source>Oxford Studies in Metaethics</source> (Vol. <volume>11</volume>, <fpage>155</fpage>&#x2013;<lpage>181</lpage>). <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="R43"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Tucker</surname>, <given-names>Dustin</given-names></string-name></person-group> (<year>2018</year>). <article-title>Variable Priorities and Exclusionary Reasons in Input/Output Logic.</article-title> <source>Journal of Philosophical Logic</source>, <volume>47</volume>(<issue>6</issue>), <fpage>947</fpage>&#x2013;<lpage>964</lpage>.</mixed-citation></ref>
<ref id="R44"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Williams</surname>, <given-names>Bernard</given-names></string-name></person-group> (<year>1981</year>). <source>Moral Luck: Philosophical Papers 1973&#x2013;1980.</source> <publisher-name>Cambridge University Press</publisher-name>.</mixed-citation></ref>
</ref-list>
<app-group>
<label>Appendix:</label>
<title>Properties of the Models</title>
<app id="APP1">
<label>A1.</label><title>The Basic Model</title>
<p id="P105"><bold>Observation 1:</bold> Where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M233"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is any reasoning context, if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M234"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M235"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
<p id="P106"><bold>Proof:</bold> If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M236"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M237"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula> for all maximal consistent subsets <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M238"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M239"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. So clearly <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M240"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x22A2;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula> for some maximal consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M241"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M242"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. Thus <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M243"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
<p id="P107"><bold>Observation 2:</bold> Where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M244"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is any reasoning context, if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M245"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M246"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
<p id="P108"><bold>Proof:</bold> If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M247"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M248"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula> for some maximal consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M249"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M250"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M251"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mi>X</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="M252"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:menclose notation='updiagonalstrike'><mml:mo>&#x22A2;</mml:mo></mml:menclose><mml:mo>&#x00AC;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula>. Thus it is not the case that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M253"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>X</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. Thus <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M254"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
</app>
<app id="APP2">
<label>A2.</label><title>Threshold Reasoning Contexts</title>
<p id="P109">Several proofs below invoke the following intermediate observations, which I prove separately.</p>
<p id="P110"><bold>Observation*:</bold> Where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M255"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is any threshold reasoning context, every maximal consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M256"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M257"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant='script'>R</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is a requirement consistent subset of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M258"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
<p id="P111"><bold>Proof:</bold> Suppose <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M259"><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant='script'>R</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. For any other <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M260"><mml:mrow><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant='script'>R</mml:mi></mml:mrow></mml:math></inline-formula>, either <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M261"><mml:mrow><mml:mi>n</mml:mi><mml:mo>&#x003C;</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> or not. If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M262"><mml:mrow><mml:mi>n</mml:mi><mml:mo>&#x003C;</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>,</mml:mo><mml:mo>&#x00A0;</mml:mo></mml:mrow></mml:math></inline-formula> then, since <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M263"><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant='script'>R</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, by definition it is either not the case that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M264"><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x003C;</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> or not the case that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M265"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x22A2;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>r</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. If it is not the case that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M266"><mml:mrow><mml:mi>n</mml:mi><mml:mo>&#x003C;</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula>, then since <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M267"><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant='script'>R</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> it cannot be the case that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M268"><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x003C;</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula>, since <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M269"><mml:mrow><mml:mi>n</mml:mi><mml:mo>&#x003C;</mml:mo><mml:mi>r</mml:mi></mml:mrow></mml:math></inline-formula> and by transitivity we would have that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M270"><mml:mrow><mml:mi>n</mml:mi><mml:mo>&#x003C;</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>,</mml:mo><mml:mo>&#x00A0;</mml:mo></mml:mrow></mml:math></inline-formula> contradicting our assumption. Thus in either case for any <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M271"><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant='script'>R</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> there is no <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M272"><mml:mrow><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant='script'>R</mml:mi></mml:mrow></mml:math></inline-formula> such that both (i) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M273"><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x003C;</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> and (ii) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M274"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x22A2;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>r</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. Therefore for any <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M275"><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant='script'>R</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M276"><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. Therefore <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M277"><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant='script'>R</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2286;</mml:mo><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M278"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant='script'>R</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2286;</mml:mo><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. Thus for any maximal consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M279"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2286;</mml:mo><mml:mtext>&#x2009;of&#x2009;</mml:mtext><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant='script'>R</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, it is also the case that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M280a"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2286;</mml:mo><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. Clearly every maximal consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M281"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M282"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant='script'>R</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is also requirement consistent. Therefore every maximal consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M283"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M284"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant='script'>R</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is a requirement consistent subset of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M285"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
<p id="P112"><bold>Observation**:</bold> Where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M286"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is any threshold reasoning context, for every maximal consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M287"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M288"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> there is some maximal requirement consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M289"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M290"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant='script'>R</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M291"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2286;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula>.</p>
<p id="P113"><bold>Proof:</bold> Suppose for the sake of the contradiction that it is not the case that for every maximal requirement consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M292"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M293"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> there is some maximal consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M294"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M295"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant='script'>R</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M296"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2286;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula>. That is, suppose there is some maximal requirement consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M297"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M298"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> for which every maximal consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M299"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M300"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant='script'>R</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></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="M301"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:munder accentunder='true'><mml:mo>&#x2284;</mml:mo><mml:mo stretchy='true'>_</mml:mo></mml:munder><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula>. Since <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M302"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> is requirement consistent, there must be some maximal consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M303"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M304"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant='script'>R</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M305"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x222A;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> is consistent. It follows from <bold>Observation*</bold> that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M306"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> is also a requirement consistent subset of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M307"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. Thus, since <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M308"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> is also requirement consistent subset of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M309"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> by stipulation, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M310"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup><mml:mo>&#x222A;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> is a requirement consistent subset of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M311"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. Clearly <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M312"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2286;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup><mml:mo>&#x222A;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, and, since <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M313"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup><mml:munder accentunder='true'><mml:mo>&#x2284;</mml:mo><mml:mo stretchy='true'>_</mml:mo></mml:munder><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula>. <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M314"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup><mml:mo>&#x222A;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2260;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula>. But this contradicts our assumption that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M315"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> is a maximal requirement consistent subset of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M316"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, because we have another requirement consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M317"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup><mml:mo>&#x222A;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula>, such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M318"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2286;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup><mml:mo>&#x222A;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2286;</mml:mo><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. Therefore it must be that for every maximal requirement consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M319"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M320"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> there is some maximal consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M321"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M322"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant='script'>R</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M323"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2286;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula>.</p>
<p id="P114"><bold>Observation 3:</bold> Where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M324"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is any threshold reasoning context, if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M325"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M326"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>Y</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, then it is not the case that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M327"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>Y</mml:mi></mml:mrow></mml:math></inline-formula>.</p>
<p id="P115"><bold>Proof:</bold> If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M328"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>Y</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M329"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mi>Y</mml:mi></mml:mrow></mml:math></inline-formula> for some maximal requirement consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M330"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M331"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. Since <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M332"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> is requirement consistent, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M333"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x222A;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> is consistent for some maximal consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M334"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M335"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant='script'>R</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M336"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M337"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x22A2;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula>. Now suppose for contradiction that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M338"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>Y</mml:mi></mml:mrow></mml:math></inline-formula>. Then, by the transitivity of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M339"><mml:mrow><mml:mo>&#x22A2;</mml:mo></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M340"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x22A2;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>Y</mml:mi></mml:mrow></mml:math></inline-formula>. But then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M341"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mi>Y</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="M342"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x22A2;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>Y</mml:mi></mml:mrow></mml:math></inline-formula>, contradiciting our assumption that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M343"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x222A;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> is consistent. Therefore it is not the case that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M344"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>Y</mml:mi></mml:mrow></mml:math></inline-formula>.</p>
<p id="P116"><bold>Observation 4</bold>: Where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M345"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is any threshold reasoning context, if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M346"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M347"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
<p id="P117"><bold>Proof</bold>: If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M348"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M349"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x22A2;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula> for every maximal consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M350"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M351"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant='script'>R</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. Let <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M352"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> be some such maximal consistent subset of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M353"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant='script'>R</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. It follows from <bold>Observation*</bold> that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M354"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> is also a requirement consistent subset of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M355"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. Either <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M356"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> is a maximal requirement consistent subset of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M357"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> or not. If it is, then, since <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M358"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x22A2;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M359"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. If not, then there is some maximal requirement consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M360"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M361"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M362"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2282;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula>. In which case, since <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M363"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2282;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M364"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x22A2;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula>, it follows by the monotonicity of first order logic that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M365"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x22A2;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula> and therefore <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M366"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. Thus <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M367"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
<p id="P118"><bold>Observation 5:</bold> Where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M368"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is any threshold reasoning context, if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M369"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M370"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
<p id="P119"><bold>Proof:</bold> If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M371"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M372"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x22A2;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula> for some maximal requirement consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M373"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M374"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. Since <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M375"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> is requirement consistent, there is some maximal consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M376"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M377"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant='script'>R</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M378"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x222A;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> is consistent. Thus there is some maximal consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M379"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M380"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant='script'>R</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M381"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:menclose notation='updiagonalstrike'><mml:mo>&#x22A2;</mml:mo></mml:menclose><mml:mo>&#x00AC;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula>. Therefore it is not the case that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M382"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. Thus <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M383"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
</app>
<app id="APP3">
<label>A3.</label><title>Dual-Role Reasoning Contexts</title>
<p id="P120">Several proofs below invoke the following intermediate observations, which I again prove separately.</p>
<p id="P121"><bold>Observation</bold><sup><bold>&#x2020;</bold></sup>: Suppose that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M384"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is a dual-role reasoning context such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M385"><mml:mrow><mml:mi mathvariant='script'>D</mml:mi><mml:mo>&#x2286;</mml:mo><mml:mi mathvariant='script'>J</mml:mi></mml:mrow></mml:math></inline-formula>. Every maximal consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M386"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M387"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is also a requirement consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M388"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M389"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
<p id="P122"><bold>Proof:</bold> First, note that for any <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M390"><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M391"><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant='script'>D</mml:mi></mml:mrow></mml:math></inline-formula> and therefore,since <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M392"><mml:mrow><mml:mi mathvariant='script'>D</mml:mi><mml:mo>&#x2286;</mml:mo><mml:mi mathvariant='script'>J</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M393"><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant='script'>J</mml:mi></mml:mrow></mml:math></inline-formula>. Second, for any <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M394"><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, by definition there is no other <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M395"><mml:mrow><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant='script'>R</mml:mi></mml:mrow></mml:math></inline-formula> such that (i) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M396"><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x003C;</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> and (ii) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M397"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x22A2;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>r</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. Thus for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M398"><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M399"><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. So <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M400"><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2286;</mml:mo><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M401"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2286;</mml:mo><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. Thus for any maximal consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M402"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2286;</mml:mo><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M403"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2286;</mml:mo><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. Clearly any maximal consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M404"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2286;</mml:mo><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is also requirement consistent. Therefore any maximal consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M405"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M406"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is a requirement consistent of subset of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M407"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
<p id="P123"><bold>Observation</bold><sup><bold>&#x2020;&#x2020;</bold></sup>: Suppose that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M408"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is a dual-role reasoning context such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M409"><mml:mrow><mml:mi mathvariant='script'>D</mml:mi><mml:mo>&#x2286;</mml:mo><mml:mi mathvariant='script'>J</mml:mi></mml:mrow></mml:math></inline-formula>. For every maximal requirement consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M410"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M411"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, there is some maximal consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M412"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M413"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M414"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2286;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula>.</p>
<p id="P124"><bold>Proof:</bold> Assume for the sake of contradiction that it is not the case that for every maximal requirement consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M415"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M416"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, there is some maximal consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M417"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M418"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M419"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2286;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula>. That is, suppose there is some maximal requirement consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M420"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M421"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> for which every maximal requirement consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M422"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M423"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></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="M424"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:munder accentunder='true'><mml:mo>&#x2284;</mml:mo><mml:mo stretchy='true'>_</mml:mo></mml:munder><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula>. Since <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M425"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> is requirement consistent, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M426"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x222A;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> is consistent for some maximal consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M427"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M428"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. From <bold>Observation</bold><sup><bold>&#x2020;</bold></sup> it follows that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M429"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> is also a requirement consistent subset of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M430"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. Thus, since <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M431"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> is also a requirement consistent subset of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M432"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> by stipulation, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M433"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup><mml:mo>&#x222A;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> is a requirement consistent subset of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M434"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. Clearly <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M435"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2286;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup><mml:mo>&#x222A;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, and, since <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M436"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup><mml:munder accentunder='true'><mml:mo>&#x2284;</mml:mo><mml:mo stretchy='true'>_</mml:mo></mml:munder><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula>. <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M437"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup><mml:mo>&#x222A;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2260;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula>. But this contradicts our assumption that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M438"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> is a maximal requirement consistent subset of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M439"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, since there is another set <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M440"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup><mml:mo>&#x222A;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M441"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2286;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup><mml:mo>&#x222A;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2286;</mml:mo><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. Therefore it must be that for any maximal requirement consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M442"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M443"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> there is some maximal consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M444"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M445"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> <italic>such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M446"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2286;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula></italic>.</p>
<p id="P125"><bold>Observation 6:</bold> Where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M447"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is any dual &#x2013; role reasoning context, if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M448"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M449"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>Y</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, then it is not the case that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M450"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>Y</mml:mi></mml:mrow></mml:math></inline-formula>.</p>
<p id="P126"><bold>Proof:</bold> If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M451"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>Y</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M452"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mi>Y</mml:mi></mml:mrow></mml:math></inline-formula> for some maximal requirement consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M453"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M454"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. Since <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M455"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> is requirement consistent, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M456"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x222A;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> is consistent for some maximal consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M457"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M458"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M459"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M460"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x22A2;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula>. Now suppose for contradiction that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M461"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>Y</mml:mi></mml:mrow></mml:math></inline-formula>. By the transitivity of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M462"><mml:mo>&#x22A2;</mml:mo></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M463"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x22A2;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>Y</mml:mi></mml:mrow></mml:math></inline-formula>. But then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M464"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mi>Y</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="M465"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x22A2;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>Y</mml:mi></mml:mrow></mml:math></inline-formula>, contradicting our assumption that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M466"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x222A;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> is consistent. Therefore it is not the case that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M467"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>Y</mml:mi></mml:mrow></mml:math></inline-formula>.</p>
<p id="P127"><bold>Observation 7:</bold> Suppose that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M468"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is a dual &#x2013; role reasoning context such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M469"><mml:mrow><mml:mi mathvariant='script'>D</mml:mi><mml:mo>&#x2286;</mml:mo><mml:mi mathvariant='script'>J</mml:mi></mml:mrow></mml:math></inline-formula>. If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M470"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M471"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
<p id="P128"><bold>Proof:</bold> If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M472"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M473"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula> for all maximal consistent subsets <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M474"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M475"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. Let <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M476"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> be some such maximal consistent subset of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M477"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. It follows from <bold>Observation</bold><sup><bold>&#x2020;</bold></sup> that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M478"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> is a requirement consistent subset of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M479"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> Either <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M480"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> is a maximal requirement consistent subsets of or it is not. If it is, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M481"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x22A2;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula> and thus <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M482"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. If it is not, then there is some maximal requirement consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M483"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M484"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M485"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2282;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula>. In which case, since <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M486"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x22A2;</mml:mo><mml:mi>X</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="M487"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2282;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula>, it follows from the monotonicity of first order logic that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M488"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup><mml:mo>&#x22A2;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula> and thus <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M489"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. Thus <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M490"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
<p id="P129"><bold>Observation 8:</bold> Where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M491"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is any dual-role reasoning context. If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M492"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M493"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula></p>
<p id="P128a"><bold>Proof:</bold> If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M494"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M495"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula> for some maximal requirement consistent subject of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M496"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M497"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. Since <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M498"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> is requirement consistent, there is some maximal consistent subsets <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M499"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M500"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M501"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x222A;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> is consistent. Thus there is some maximal consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M502"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M503"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M504"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:menclose notation='updiagonalstrike'><mml:mo>&#x22A2;</mml:mo></mml:menclose><mml:mo>&#x00AC;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula>. Therefore it is not the case that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M505"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>X</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. Thus <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M506"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
</app>
<app id="APP4">
<label>A4.</label><title>Ought-Requirement Agglomeration</title>
<p id="P130">For any reasoning context <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M507"><mml:mrow><mml:mtext>&#x2206;</mml:mtext></mml:mrow></mml:math></inline-formula>, the principle of ought-requirement agglomeration applies just in case if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M508"><mml:mrow><mml:mtext>&#x0394;&#x00A0;</mml:mtext><mml:mo>&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mo>&#x00A0;</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mfenced><mml:mi>X</mml:mi>
</mml:mfenced><mml:mo>&#x00A0;</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M509"><mml:mrow><mml:mo>&#x00A0;</mml:mo><mml:mtext>&#x0394;&#x00A0;</mml:mtext><mml:mo>&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mo>&#x00A0;</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mfenced><mml:mi>Y</mml:mi>
</mml:mfenced></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M510"><mml:mrow><mml:mtext>&#x0394;&#x00A0;</mml:mtext><mml:mo>&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mo>&#x00A0;</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mfenced><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mi>Y</mml:mi></mml:mrow>
</mml:mfenced></mml:mrow></mml:math></inline-formula>. This principle holds some appeal in its own right. Suppose that in a given reasoning context <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M511"><mml:mtext>&#x0394;</mml:mtext></mml:math></inline-formula> I am required to go to the beach, so that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M512"><mml:mrow><mml:mtext>&#x0394;&#x00A0;</mml:mtext><mml:mo>&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mo>&#x00A0;</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mfenced><mml:mi>B</mml:mi>
</mml:mfenced></mml:mrow></mml:math></inline-formula>. Further suppose that in that same reasoning context I ought to buy myself an ice &#x2013; cream, so that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M513"><mml:mrow><mml:mtext>&#x0394;&#x00A0;</mml:mtext><mml:mo>&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mo>&#x00A0;</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mfenced><mml:mi>I</mml:mi>
</mml:mfenced></mml:mrow></mml:math></inline-formula>. Ought-requirement agglomeration supports the further conclusion <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M514"><mml:mrow><mml:mtext>&#x0394;&#x00A0;</mml:mtext><mml:mo>&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mo>&#x00A0;</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mfenced><mml:mrow><mml:mi>B</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mi>I</mml:mi></mml:mrow>
</mml:mfenced></mml:mrow></mml:math></inline-formula>, that I ought to go to the beach and buy myself an ice-cream, which seems plausible. However, ought-requirement agglomeration is particularly attractive in light of the fact that, when combined with the closure of oughts under logical consequence, it preserves other attractive patterns of inference (cf. <xref rid="R22" ref-type="bibr">Horty 2012</xref>: 87&#x2013;89).</p>
<p id="P131">Two scenarios illustrate the attractiveness of combining the principle of ought-requirement agglomeration with the closure of oughts under logical consequence. First suppose that in a given reasoning context <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M515"><mml:mtext>&#x0394;</mml:mtext></mml:math></inline-formula>, John ought to fight in the army or serve his country in some other way (by serving as a hospital volunteer, for instance), so that we have that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M516"><mml:mrow><mml:mtext>&#x0394;&#x00A0;</mml:mtext><mml:mo>&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mo>&#x00A0;</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>F</mml:mi><mml:mo>&#x2228;</mml:mo><mml:mi>S</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>. John is not required to flight or serve, but he ought to in the circumstances. Now suppose that John is required not to flight because his religion forbids it, so that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M517"><mml:mrow><mml:mtext>&#x0394;</mml:mtext><mml:mo>&#x00A0;</mml:mo><mml:mo>&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mo>&#x00A0;</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mfenced><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>F</mml:mi></mml:mrow>
</mml:mfenced></mml:mrow></mml:math></inline-formula>. From ought-requirement agglomeration, we can conclude that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M518"><mml:mrow><mml:mtext>&#x0394;&#x00A0;</mml:mtext><mml:mo>&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mo>&#x00A0;</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mfenced><mml:mrow><mml:mfenced><mml:mrow><mml:mi>F</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:mi>F</mml:mi></mml:mrow>
</mml:mfenced></mml:mrow></mml:math></inline-formula>. Since <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M519"><mml:mrow><mml:mfenced><mml:mrow><mml:mi>F</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:mi>F</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>, the closure of ought under logical consequence then allows us to reach the conclusion <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M520"><mml:mrow><mml:mtext>&#x0394;&#x00A0;</mml:mtext><mml:mo>&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mo>&#x00A0;</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mfenced><mml:mi>S</mml:mi>
</mml:mfenced></mml:mrow></mml:math></inline-formula>, that John ought to serve his country in some other way, which seems to be the correct result in this reasoning context.</p>
<p id="P132">Second, suppose that in a different given reasoning context <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M521"><mml:mrow><mml:msup><mml:mtext>&#x0394;</mml:mtext><mml:mi>&#x02B9;</mml:mi></mml:msup><mml:mo>&#x00A0;</mml:mo></mml:mrow></mml:math></inline-formula> a student has two sets of homework he could finish this evening: his math homework, which is due first thing in the morning, and his English homework, which is not due until the following day. Because it is due first thing, he student is required to finish his math, so that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M522"><mml:mrow><mml:msup><mml:mtext>&#x0394;</mml:mtext><mml:mi>&#x02B9;</mml:mi></mml:msup><mml:mo>&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mfenced><mml:mi>M</mml:mi>
</mml:mfenced></mml:mrow></mml:math></inline-formula>. Suppose, however, that he really ought to finish his English homework to free up time tomorrow evening, so that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M523"><mml:mrow><mml:msup><mml:mtext>&#x0394;</mml:mtext><mml:mi>&#x02B9;</mml:mi></mml:msup><mml:mo>&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mfenced><mml:mi>E</mml:mi>
</mml:mfenced></mml:mrow></mml:math></inline-formula>. Suppose further that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M524"><mml:mrow><mml:mi>M</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mi>E</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>H</mml:mi><mml:mo>.</mml:mo><mml:mo>&#x00A0;</mml:mo></mml:mrow></mml:math></inline-formula> If the student finishes both his math and English homework, then he will have no more homework to complete at the end of evening. Ought-requirement agglomeration allows us to conclude that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M525"><mml:mrow><mml:msup><mml:mtext>&#x0394;</mml:mtext><mml:mi>&#x02B9;</mml:mi></mml:msup><mml:mo>&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mfenced><mml:mrow><mml:mi>M</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mi>E</mml:mi></mml:mrow>
</mml:mfenced></mml:mrow></mml:math></inline-formula>. The student ought to finish his math and his English homework. Ought Closure then allows us to conclude <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M526"><mml:mrow><mml:msup><mml:mtext>&#x0394;</mml:mtext><mml:mi>&#x02B9;</mml:mi></mml:msup><mml:mo>&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mfenced><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>H</mml:mi></mml:mrow>
</mml:mfenced></mml:mrow></mml:math></inline-formula>, that the student ought to have no more homework to complete at the end of the evening. Again, this seems like the correct result in this reasoning context.</p>
<p id="P133">To begin with, we note that both threshold and dual-role reasoning contexts preserve the closure of ought under logical consequence.</p>
<p id="P134"><bold>Observation 9</bold>: Where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M527"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is any threshold reasoning context, if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M528"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M529"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mi>Y</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="M530"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>Y</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
<p id="P135"><bold>Proof:</bold> If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M531"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M532"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula> for some maximal requirement consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M533"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M534"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. So <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M535"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mi>X</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="M536"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mi>Y</mml:mi></mml:mrow></mml:math></inline-formula> and thus, by the transitivity of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M537"><mml:mo>&#x22A2;</mml:mo></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M538"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mi>Y</mml:mi></mml:mrow></mml:math></inline-formula>. Therefore <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M539"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>Y</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
<p id="P136"><bold>Observation 10:</bold> Where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M540"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is any dual-role reasoning context, if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M541"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <italic>X</italic> &#x22A2; <italic>Y</italic> then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M542"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>Y</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
<p id="P137"><bold>Proof:</bold> If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M543"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M544"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula> for some maximal requirement consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M545"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M546"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. So <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M547"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula> and <italic>X</italic> &#x22A2; <italic>Y</italic> and thus, by the transitivity of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M548"><mml:mo>&#x22A2;</mml:mo></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M549"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mi>Y</mml:mi></mml:mrow></mml:math></inline-formula>. Therefore <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M550"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>Y</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
<p id="P138">Both threshold and dual-role reasoning contexts also both preserve ought-requirement agglomeration.</p>
<p id="P139"><bold>Observation 11:</bold> Where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M551"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is any threshold reasoning context, if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M552"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M553"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>Y</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M554"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mi>Y</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
<p id="P140"><bold>Proof:</bold> If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M555"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>Y</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M556"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x22A2;</mml:mo><mml:mi>Y</mml:mi></mml:mrow></mml:math></inline-formula> for some maximal requirement consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M557"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M558"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. It follows from <bold>Observation**</bold> that there is some maximal consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M559"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M560"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant='script'>R</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M561"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2286;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula>. If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M562"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M563"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula>. Since <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M564"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2286;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M565"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula> it follows by the monotonicity of first order logic that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M566"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x22A2;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula>. So <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M567"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x22A2;</mml:mo><mml:mi>X</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="M568"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x22A2;</mml:mo><mml:mi>Y</mml:mi></mml:mrow></mml:math></inline-formula> and therefore <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M569"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x22A2;</mml:mo><mml:mi>X</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mi>Y</mml:mi></mml:mrow></mml:math></inline-formula>. Therefore <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M570"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mi>Y</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
<p id="P141"><bold>Observation 12:</bold> Suppose that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M571"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is a dual-role reasoning context such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M572"><mml:mrow><mml:mi mathvariant='script'>D</mml:mi><mml:mo>&#x2286;</mml:mo><mml:mi mathvariant='script'>J</mml:mi></mml:mrow></mml:math></inline-formula>. If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M573"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M574"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>Y</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M575"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mi>Y</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
<p id="P142"><bold>Proof:</bold> If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M576"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>Y</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M577"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x22A2;</mml:mo><mml:mi>Y</mml:mi></mml:mrow></mml:math></inline-formula> for some maximal requirement consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M578"><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M579"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. It follows from <bold>Observation</bold><sup><bold>&#x2020;&#x2020;</bold></sup> that there is some maximal consistent subset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M580"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M581"><mml:mrow><mml:mi mathvariant='script'>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>U</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M582"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2286;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula>. If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M583"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M584"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula>. Since <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M585"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2286;</mml:mo><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M586"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x22A2;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula> it follows by the monotonicity of first order logic that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M587"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x22A2;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:math></inline-formula>. So <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M588"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x22A2;</mml:mo><mml:mi>X</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="M589"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x22A2;</mml:mo><mml:mi>Y</mml:mi></mml:mrow></mml:math></inline-formula> and therefore <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M590"><mml:mrow><mml:msup><mml:mi mathvariant='script'>M</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x22A2;</mml:mo><mml:mi>X</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mi>Y</mml:mi></mml:mrow></mml:math></inline-formula>. Thus <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M591"><mml:mrow><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mrow><mml:mi mathvariant='script'>R</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='script'>J</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x003C;</mml:mo></mml:mrow><mml:mo>&#x232A;</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>~</mml:mo><mml:mi>O</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mi>Y</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
</app>
</app-group>
</back>
</article>
