<?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">1122</article-id>
<article-id pub-id-type="manuscript">7_25/CTD_Solution.png,7_25/diagram_Chisholm.png,7_25/Diagram_Simple1.png,7_25/Diagram_Simple2.png,7_25/diagram_three.png,7_25/Dynamic_update.png,7_25/NewDiagram_1.png,7_25/NewDiagram_2.png,7_25/temp1.png,7_25/Won_CPR.pdf,7_25/Won_CPR.tex</article-id>
<article-id pub-id-type="doi">10.3998/ergo.1122</article-id>
<title-group>
<article-title>Chisholm&#x2019;s Paradox Revisited: Puzzles regarding Contrary-to-Duty Obligations and a Dynamic Solution</article-title>
<alt-title alt-title-type="running-head-verso">Yuna Won</alt-title>
<alt-title alt-title-type="running-head-recto">Chisholm&#x2019;s Paradox Revisited</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes" equal-contrib="yes">
<name>
<surname>WON</surname>
<given-names>YUNA</given-names>
</name>
<email>yunawon0@gmail.com</email>
<xref ref-type="aff" rid="aff1"/>
</contrib>
</contrib-group>
<aff id="aff1">
<institution>Indiana University, Bloomington</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>
<corresp id="CR1"><bold>Contact:</bold> Yuna Won &#x003C;<email>yunawon@iu.edu</email>&#x003E;</corresp>
</author-notes>
<pub-date>
<day>30</day>
<month>06</month>
<year>2021</year>
</pub-date>
<volume>7</volume>
<issue>25</issue>
<history>
<date date-type="received">
<day></day>
<month></month>
<year></year>
</date>
<date date-type="rev-recd">
<day></day>
<month></month>
<year></year>
</date>
<date date-type="accepted">
<day></day>
<month></month>
<year></year>
</date>
</history>
<permissions>
<license><license-p>CC BY-NC-ND 4.0</license-p></license>
</permissions>
<abstract id="ABS1">
<p id="P1">A contrary-to-duty obligation (CTD obligation) is a type of conditional obligation that tells us what to do when a primary duty is violated. Chisholm&#x2019;s Paradox is one of the most famous deontic puzzles about CTD obligations. It is widely believed that Chisholm&#x2019;s Paradox does not arise for ordering semantics, today&#x2019;s orthodox semantics for modals and conditionals. In this paper, I propose a new puzzle, <italic>the CTD Trilemma</italic>, to show that ordering semantics still has difficulties in adequately representing natural reasoning with CTD obligations. I argue that to solve the CTD Trilemma a formal account must attend to two different functions played by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M1"><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:mrow></mml:math></inline-formula>-statements in our normative reasoning and discourse: <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M2"><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:mrow></mml:math></inline-formula>-statements as normative rules and normative judgments. To formally capture this distinction I develop a new dynamic account of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M3"><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:mrow></mml:math></inline-formula>-statements and normative reasoning inspired by Frank Veltman&#x2019;s update semantics for default reasoning. Finally, I show how my update semantics for normative reasoning provides a simple and elegant solution to the CTD Trilemma and explains seemingly inconsistent data about inferences using <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M4"><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:mrow></mml:math></inline-formula>-statements in normative reasoning.</p>
</abstract>
<funding-group/>
<counts>
<fig-count count="4"/>
</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="P2">A contrary-to-duty obligation (CTD obligation) is a type of conditional obligation that tells us what to do when a primary obligation is violated. Consider the following pair of sentences.</p>
<table-wrap id="T10" position="anchor" orientation="portrait">
<table frame="void" rules="none">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="middle">(p1)</td>
<td align="left" valign="middle">You ought to keep your promise.</td>
</tr>
<tr>
<td align="left" valign="middle">(p2)</td>
<td align="left" valign="middle">If you do not keep your promise, you ought to apologize.</td>
</tr>
</tbody>
</table>
</table-wrap>
<p id="P5">(p2) expresses a CTD obligation, when paired with the non-conditional obligation expressed by (p1). This CTD obligation generates a new obligation to apologize for a person who has violated the primary obligation expressed by (p1). CTD obligations are not only used routinely by ordinary speakers, but also indispensable across moral, social and legal discourses. This familiar concept gives rise to one of the most difficult puzzles for Standard Deontic Logic, called <italic>Chisholm&#x2019;s Paradox</italic>. Here&#x2019;s <xref rid="R7" ref-type="bibr">Chisholm&#x2019;s (1963)</xref> original example.</p>
<sec id="S2">
<title>The Chisholm Set</title>
<table-wrap id="T11" position="anchor" orientation="portrait">
<table frame="void" rules="none">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="middle">(c1)</td>
<td align="left" valign="middle">It ought to be that Jones goes to help his neighbors.</td>
</tr>
<tr>
<td align="left" valign="middle">(c2)</td>
<td align="left" valign="middle">It ought to be that if he does go he tells them he is coming.</td>
</tr>
<tr>
<td align="left" valign="middle">(c3)</td>
<td align="left" valign="middle">If he does not go then he ought not to tell them he is coming.</td>
</tr>
</tbody>
</table>
</table-wrap>
<p id="P10">It is not hard to imagine Jones&#x2019;s normative predicament described by this set of statements. In Standard Deontic Logic, however, the Chisholm set is either inconsistent or informationally redundant. In particular, the Chisholm set is inconsistent because the following two inferences are valid in Standard Deontic Logic: (c3) and (c4) entail (c5) by Factual Detachment, and (c1) and (c2) entail (c6) by Deontic Detachment.</p>
<table-wrap id="T12" position="anchor" orientation="portrait">
<table frame="void" rules="none">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="middle">(c5)</td>
<td align="left" valign="middle">Jones ought not to tell his neighbors he is coming.</td>
</tr>
<tr>
<td align="left" valign="middle">(c6)</td>
<td align="left" valign="middle">Jones ought to tell his neighbors he is coming.</td>
</tr>
</tbody>
</table>
</table-wrap>
<p id="P13">Apparently, (c5) and (c6) express two incompatible obligations. This is why Chisholm&#x2019;s Paradox is often interpreted as a puzzle revealing the difficulty of having both detachment rules for conditional obligations, and motivates many attempts to devise a formal system that validates only one detachment rule, or validates both without the paradoxical results. Thus, it has been widely believed that ordering semantics, which does not validate both detachment rules, is free from Chisholm&#x2019;s Paradox, and thus Chisholm&#x2019;s Paradox has not been discussed much in the ordering semantic framework.</p>
<p id="P14">In this paper, I challenge this mainstream diagnosis and widely held belief about Chisholm&#x2019;s Paradox. Given the Chisholm set, the most natural interpretation of Jones&#x2019;s normative predicament is this: he violates his primary duty to go help his neighbors, since he does not go, and thus he ought not to tell them he is coming. By proposing a new puzzle, <italic>the CTD Trilemma</italic>, I will show that ordering semantics cannot adequately capture Jones&#x2019;s normative predicament and that the real challenge raised by Chisholm&#x2019;s example is not the choice between Factual Detachment and Deontic Detachment.</p>
<p id="P15">I argue that accurately understanding two different ways of using normative <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M5"><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:mrow></mml:math></inline-formula>-statements is not only the key to solving the CTD Trilemma, but also the first step to developing an adequate formal semantics for normative reasoning and discourse. Based on the two principal observations about our normative reasoning and discourse using <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M6"><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:mrow></mml:math></inline-formula>-statements, I motivate and develop a version of <italic>dynamic semantics</italic>, update semantics for normative reasoning. Finally, I show that my dynamic system solves the CTD Trilemma and adequately explains our seemingly inconsistent data about inference patterns using conditional and unconditional <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M7"><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:mrow></mml:math></inline-formula>-statements and why the different readings of Chisholm&#x2019;s example are possible.</p>
<p id="P16">In sum, this paper aims at making the following contributions:
<list list-type="order" id="L4">
<list-item><p id="P17">To appreciate the real challenge raised by CTD obligations by constructing a new puzzle, the CTD Trilemma;</p></list-item>
<list-item><p id="P18">To critically evaluate the ordering semantic account of deontic <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M8"><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:mrow></mml:math></inline-formula>-statements and conditional obligations by using the CTD Trilemma;</p></list-item>
<list-item><p id="P19">To recognize that (i) normative rules and normative judgments play distinct roles in our normative reasoning, and (ii) both are expressed by using <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M9"><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:mrow></mml:math></inline-formula>-statements;</p></list-item>
<list-item><p id="P20">To develop a new dynamic semantics that adequately captures two different semantic functions of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M10"><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:mrow></mml:math></inline-formula>-statements in normative discourse and reasoning, and thereby to solve the CTD Trilemma.</p></list-item>
</list></p>
<p id="P21">In the next two sections, I briefly introduce the original puzzle, Chisholm&#x2019;s Paradox for Standard Deontic Logic, and show why ordering semantics is free from this classic puzzle.</p>
</sec>
</sec>
<sec id="S3">
<label>2.</label><title>Standard Deontic Logic (SDL) and Chisholm&#x2019;s Paradox</title>
<p id="P22">Chisholm&#x2019;s Paradox is one of the most serious challenges to Standard Deontic Logic (SDL). SDL is a normal modal logic with a deontic necessity operator &#x2018;<bold>OB</bold>&#x2019; for obligations, and axiomatized as follows.</p>
<table-wrap id="T1" position="anchor" orientation="portrait">
<table frame="void" rules="none">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="middle">A1</td>
<td align="left" valign="middle">All tautologies</td>
<td align="left" valign="middle"></td>
</tr>
<tr>
<td align="left" valign="middle">A2</td>
<td align="left" valign="middle"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M11"><mml:mrow><mml:mi mathvariant='bold'>OB</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x2E27;</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>)</mml:mo><mml:mo>&#x2E27;</mml:mo><mml:mo>(</mml:mo><mml:mi mathvariant='bold'>OB</mml:mi><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x2E27;</mml:mo><mml:mi mathvariant='bold'>OB</mml:mi><mml:mi>&#x03C8;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td align="left" valign="middle"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M12"><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='bold'>OB</mml:mi><mml:mtext>-</mml:mtext><mml:mtext>K</mml:mtext><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="middle">A3</td>
<td align="left" valign="middle"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M13"><mml:mrow><mml:mi mathvariant='bold'>OB</mml:mi><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x2E27;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi mathvariant='bold'>OB</mml:mi><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula></td>
<td align="left" valign="middle"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M14"><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='bold'>OB</mml:mi><mml:mtext>-</mml:mtext><mml:mtext>Dual</mml:mtext><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="middle">R1</td>
<td align="left" valign="middle">If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M15"><mml:mrow><mml:mtext>h</mml:mtext><mml:mo>&#x22A2;</mml:mo><mml:mi>&#x03D5;</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="M16"><mml:mrow><mml:mo>&#x22A2;</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x2E27;</mml:mo><mml:mi>&#x03C8;</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="M17"><mml:mrow><mml:mo>&#x22A2;</mml:mo><mml:mi>&#x03C8;</mml:mi></mml:mrow></mml:math></inline-formula>.</td>
<td align="left" valign="middle"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M18"><mml:mrow><mml:mo>(</mml:mo><mml:mtext>MP</mml:mtext><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="middle">R2</td>
<td align="left" valign="middle">If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M19"><mml:mrow><mml:mtext>h</mml:mtext><mml:mo>&#x22A2;</mml:mo><mml:mi>&#x03D5;</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="M20"><mml:mrow><mml:mo>&#x22A2;</mml:mo><mml:mi mathvariant='bold'>OB</mml:mi><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>.</td>
<td align="left" valign="middle"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M21"><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='bold'>OB</mml:mi><mml:mtext>-</mml:mtext><mml:mtext>Nec</mml:mtext><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
</table-wrap>
<p id="P23">Since in SDL ordinary <italic>if</italic>-statements are expressed by material conditionals, there are two possible combinations of a material conditional and a deontic necessity operator to express conditional obligations: <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M22"><mml:mrow><mml:mi mathvariant='bold'>OB</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x2E27;</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>)</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="M23"><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x2E27;</mml:mo><mml:mi mathvariant='bold'>OB</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. Therefore, the most straightforward way of representing Chisholm&#x2019;s example is the following.</p>
<table-wrap id="T2" position="anchor" orientation="portrait">
<table frame="void" rules="none">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top"></td>
<td align="left" valign="top"><bold>The Chisholm Set</bold></td>
<td align="left" valign="top"></td>
</tr>
<tr>
<td align="left" valign="top">(c1)</td>
<td align="left" valign="top">It ought to be that Jones goes to help his neighbors.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M24"><mml:mrow><mml:mi mathvariant='bold'>OB</mml:mi><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top">(c2)</td>
<td align="left" valign="top">It ought to be that if he does go he tells them he is coming.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M25"><mml:mrow><mml:mi mathvariant='bold'>OB</mml:mi><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x2E27;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top">(c3)</td>
<td align="left" valign="top">If he does not go then he ought not to tell them he is coming.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M26"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x2E27;</mml:mo><mml:mi mathvariant='bold'>OB</mml:mi><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top">(c4)</td>
<td align="left" valign="top">He does not go.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M27"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
</table-wrap>
<p id="P24">We can easily imagine the situation where Jones has duties and obligations expressed by (c1)&#x2013;(c3), but fails to meet his primary obligation (c1). In such a case, all four statements of the Chisholm set are true, and each provides independent information about his situation. However, this formal representation of the Chisholm set in SDL leads to a contradiction. Here is a simple proof. (c3) and (c4) entail (c5) by (MP), and (c1) and (c2) entail (c6) by (<bold>OB</bold>-K) and (MP).</p>
<table-wrap id="T3" position="anchor" orientation="portrait">
<table frame="void" rules="none">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">(c5)</td>
<td align="left" valign="top">Jones ought not to tell them he is coming.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M28"><mml:mrow><mml:mi mathvariant='bold'>OB</mml:mi><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top">(c6)</td>
<td align="left" valign="top">Jones ought to tell them he is coming.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M29"><mml:mrow><mml:mi mathvariant='bold'>OB</mml:mi><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
</table-wrap>
<p id="P25">Since (<bold>OB</bold>-Dual) holds, (c6) is equivalent to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M30"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi mathvariant='bold'>OB</mml:mi><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, which contradicts (c5). Therefore, (c1)&#x2013;(c4) is <italic>inconsistent</italic>, in the sense that Jones has two mutually incompatible obligations.</p>
<p id="P26">Even if (c2) and (c3) are read as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M31"><mml:mrow><mml:mi>h</mml:mi><mml:mo>&#x2E27;</mml:mo><mml:mi mathvariant='bold'>OB</mml:mi><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</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="M32"><mml:mrow><mml:mi mathvariant='bold'>OB</mml:mi><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x2E27;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> respectively, SDL does not faithfully represent the Chisholm set. Since <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M33"><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x2E27;</mml:mo><mml:mi>&#x03C8;</mml:mi></mml:mrow></mml:math></inline-formula> is equivalent to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M34"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x2228;</mml:mo><mml:mi>&#x03C8;</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="M35"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula> entails <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M36"><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x2E27;</mml:mo><mml:mi>&#x03C8;</mml:mi></mml:mrow></mml:math></inline-formula>, (c4) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M37"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula> entails (c2&#x02B9;) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M38"><mml:mrow><mml:mi>h</mml:mi><mml:mo>&#x2E27;</mml:mo><mml:mi mathvariant='bold'>OB</mml:mi><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, and (c1) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M39"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mi mathvariant='bold'>B</mml:mi><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> entails (c3&#x02B9;) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M40"><mml:mrow><mml:mi mathvariant='bold'>OB</mml:mi><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x2E27;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. In these cases, the Chisholm set turns out to be <italic>informationally redundant</italic> in that one of the conditional obligations is entailed by one of the non-conditional statements in the Chisholm set. As we can see in the following table, each possible combination of a material conditional and a deontic modal operator in SDL is either inconsistent or informationally redundant.</p>
<table-wrap id="T4" position="anchor" orientation="portrait">
<table frame="box" rules="all">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">A</td>
<td align="left" valign="top">B</td>
<td align="left" valign="top">C</td>
<td align="left" valign="top">D</td>
</tr>
<tr>
<td align="left" valign="top">(c1) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M41"><mml:mrow><mml:mi mathvariant='bold'>OB</mml:mi><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula><break/>(c2) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M42"><mml:mrow><mml:mi mathvariant='bold'>OB</mml:mi><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x2E27;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula><break/>(c3) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M43"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x2E27;</mml:mo><mml:mi mathvariant='bold'>OB</mml:mi><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula><break/>(c4) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M44"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula></td>
<td align="left" valign="top">(c1) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M45"><mml:mrow><mml:mi mathvariant='bold'>OB</mml:mi><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula><break/>(c2&#x2032;) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M46"><mml:mrow><mml:mi>h</mml:mi><mml:mo>&#x2E27;</mml:mo><mml:mi mathvariant='bold'>OB</mml:mi><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula><break/>(c3) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M47"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x2E27;</mml:mo><mml:mi mathvariant='bold'>OB</mml:mi><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula><break/>(c4) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M48"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula></td>
<td align="left" valign="top">(c1) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M49"><mml:mrow><mml:mi mathvariant='bold'>OB</mml:mi><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula><break/>(c2) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M50"><mml:mrow><mml:mi mathvariant='bold'>OB</mml:mi><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x2E27;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula><break/>(c3&#x2032;) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M51"><mml:mrow><mml:mi mathvariant='bold'>OB</mml:mi><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x2E27;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula><break/>(c4) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M52"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula></td>
<td align="left" valign="top">(c1) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M53"><mml:mrow><mml:mi mathvariant='bold'>OB</mml:mi><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula><break/>(c2&#x2032;) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M54"><mml:mrow><mml:mi>h</mml:mi><mml:mo>&#x2E27;</mml:mo><mml:mi mathvariant='bold'>OB</mml:mi><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula><break/>(c3&#x2032;) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M55"><mml:mrow><mml:mi mathvariant='bold'>OB</mml:mi><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x2E27;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula><break/>(c4) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M56"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top"><bold>Inconsistent:</bold><break/>(c1) and (c2) entails <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M57"><mml:mrow><mml:mi mathvariant='bold'>OB</mml:mi><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>; (c3) and (c4) entails <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M58"><mml:mrow><mml:mi mathvariant='bold'>OB</mml:mi><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mtext>t</mml:mtext><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>.</td>
<td align="left" valign="top"><bold>Informationally Redundant:</bold><break/>(c4) entails (c2&#x2032;).</td>
<td align="left" valign="top"><bold>Informationally Redundant:</bold><break/>(c1) entails (c3&#x2032;).</td>
<td align="left" valign="top"><bold>Informationally Redundant:</bold><break/>(c1) entails (c3&#x2032;); (c4) entails (c2&#x2032;).</td>
</tr>
</tbody>
</table>
</table-wrap>
<p id="P27">Here&#x2019;s the paradoxical result with Chisholm&#x2019;s example in SDL.</p>
<disp-quote id="Q1">
<p id="P28"><bold>Chisholm&#x2019;s Paradox (for Standard Deontic Logic)</bold></p>
<p id="P29">Intuitively, the Chisholm set is consistent, and each statement in the set tells us independent information. However, the Chisholm set is either inconsistent or informationally redundant in Standard Deontic Logic.</p>
</disp-quote>
<p id="P30">The derivation of a new obligation from a conditional obligation and a factual statement, such as the inference of (c5) from (c3) and (c4), is called <italic>Factual Detachment</italic>. On the other hand, the derivation of a new obligation from a conditional obligation and a non-conditional obligation, such as the derivation of (c6) from (c1) and (c2), is called <italic>Deontic Detachment</italic>. Many proposed solutions of Chisholm&#x2019;s Paradox focus on resolving the tension between these two detachment rules to avoid inconsistency.<sup><xref rid="fn1" ref-type="fn">1</xref></sup> However, I will challenge this widely accepted interpretation of Chisholm&#x2019;s Paradox by showing that ordering semantics that does not validate Factual Detachment still fails to adequately represent Jones&#x2019;s normative predicament given the Chisholm set.</p>
</sec>
<sec id="S4">
<label>3.</label><title>Ordering Semantics and Chisholm&#x2019;s Paradox</title>
<sec id="S5">
<label>3.1.</label><title>The Ordering Semantic Account of If and Ought</title>
<p id="P31">Ordering semantics is a broad family of semantic accounts that interpret conditionals and modals by using quantification over possible worlds and orderings over possible worlds. Ordering semantics is now an orthodox semantics in linguistics and philosophy of language, most famously developed by Angelika Kratzer and David Lewis.<sup><xref rid="fn2" ref-type="fn">2</xref></sup> The basic idea of ordering semantics is to understand modal claims as descriptions of the possibilities that are relevant in a given conversational context, and of how these possibilities are ranked relative to a given purpose.</p>
<p id="P32">In Kratzer&#x2019;s ordering semantics, the set of accessible possible worlds and a preference ordering on them are determined by two contextual parameters: a <italic>modal base</italic>, a function <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M59"><mml:mrow><mml:mi>f</mml:mi></mml:mrow></mml:math></inline-formula> mapping an index world <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M60"><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:math></inline-formula> to a set of propositions, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M61"><mml:mrow><mml:mi>f</mml:mi><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, and an <italic>ordering source</italic>, a function mapping <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M62"><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:math></inline-formula> to a set of propositions, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M63"><mml:mrow><mml:mi>g</mml:mi><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, that determines which possible worlds are regarded as ideal as far as that conversational context is concerned. Conditionals in ordering semantics are also modal claims. An <italic>if</italic>-clause plays the role of restricting the set of accessible possible worlds. A deontic modal claim like an <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M64"><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:mrow></mml:math></inline-formula>-statement describes what is the case in the deontologically best possible worlds among the accessible possible worlds. Naturally, a conditional <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M65"><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:mrow></mml:math></inline-formula>-statement describes what is the case in the deontically ideal worlds in the set of possible worlds that is restricted by the conditional&#x2019;s antecedent.<sup><xref rid="fn3" ref-type="fn">3</xref></sup></p>
<p id="P33">Roughly, &#x201C;it ought to be that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M66"><mml:mrow><mml:mi>&#x03C8;</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="M67"><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>&#x201D; is true if and only if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M68"><mml:mrow><mml:mi>&#x03C8;</mml:mi></mml:mrow></mml:math></inline-formula> holds in the deontically ideal worlds among accessible <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M69"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>-worlds in the given context.<sup><xref rid="fn4" ref-type="fn">4</xref></sup> Here is the formal presentation of the truth condition of a conditional obligation <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M70"><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> in Kratzer semantics.<sup><xref rid="fn5" ref-type="fn">5</xref></sup></p>
<p id="P34">For a language <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M71"><mml:mi mathvariant='script'>L</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M72"><mml:mrow><mml:mi mathvariant='script'>M</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi mathvariant='script'>W</mml:mi><mml:mo>,</mml:mo><mml:mi>f</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mo>&#x2009;</mml:mo></mml:mfenced></mml:mrow></mml:mrow></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula>,
<disp-formula id="FD1">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M73">
<mml:mrow><mml:msubsup><mml:mrow><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mrow><mml:mtext mathvariant="bold">O</mml:mtext><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfenced></mml:mrow></mml:mrow><mml:mi>i</mml:mi><mml:mrow><mml:mi>f</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2009;</mml:mo><mml:mtext>iff</mml:mtext><mml:mrow><mml:mfenced close="}" open="{"><mml:mrow><mml:mi>w</mml:mi><mml:mo>:</mml:mo><mml:mi>w</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mo>&#x2229;</mml:mo><mml:msup><mml:mi>f</mml:mi><mml:mo>+</mml:mo></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2227;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mo>&#x2203;</mml:mo><mml:mi>v</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mo>&#x2229;</mml:mo><mml:msup><mml:mi>f</mml:mi><mml:mo>+</mml:mo></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>:</mml:mo><mml:mi>v</mml:mi><mml:msub><mml:mo>&#x227A;</mml:mo><mml:mrow><mml:mi>g</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msub><mml:mi>w</mml:mi></mml:mrow></mml:mfenced></mml:mrow><mml:mo>&#x2286;</mml:mo><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>&#x03C8;</mml:mi></mml:mfenced></mml:mrow><mml:mo>,</mml:mo></mml:mrow>
</mml:math>
</disp-formula>
where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M74"><mml:mrow><mml:mo>&#x2229;</mml:mo><mml:msup><mml:mi>f</mml:mi><mml:mo>+</mml:mo></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mfenced close="}" open="{"><mml:mrow><mml:mi>w</mml:mi><mml:mo>:</mml:mo><mml:mi>w</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mo>&#x2229;</mml:mo><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2227;</mml:mo><mml:mi>w</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>&#x03D5;</mml:mi></mml:mfenced></mml:mrow></mml:mrow></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula>.<sup><xref rid="fn6" ref-type="fn">6</xref></sup></p>
<p id="P35">This definition reads: a conditional obligation &#x201C;it ought to be that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M75"><mml:mrow><mml:mi>&#x03C8;</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="M76"><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>&#x201D; is true at an index world <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M77"><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:math></inline-formula> if and only if in the subset of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M78"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>-worlds accessible from <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M79"><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:math></inline-formula> the closest possible worlds to the deontic ideality determined by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M80"><mml:mrow><mml:mo>g</mml:mo><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> are <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M81"><mml:mrow><mml:mi>&#x03C8;</mml:mi></mml:mrow></mml:math></inline-formula>-worlds. For the sake of convenience, let&#x2019;s use the following simplified gloss:
<disp-quote id="Q2">
<p id="P36"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M82"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is true in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M83"><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:math></inline-formula> iff the deontically best worlds among <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M84"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>-worlds accessible from <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M85"><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:math></inline-formula> are <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M86"><mml:mrow><mml:mi>&#x03C8;</mml:mi></mml:mrow></mml:math></inline-formula>-worlds.</p>
</disp-quote></p>
</sec>
<sec id="S6">
<label>3.2.</label><title>Ordering Semantics and Chisholm&#x2019;s Paradox</title>
<p id="P37">Given the ordering semantic account of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M87"><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:mrow></mml:math></inline-formula> and <italic>if</italic>, (c1)&#x2013;(c3) in the Chisholm set have the following truth conditions as deontic modal statements.</p>
<table-wrap id="T13" position="anchor" orientation="portrait">
<table frame="void" rules="none">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="middle">(c1)</td>
<td align="left" valign="middle"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M88"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is true iff the deontically best worlds are <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M89"><mml:mrow><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula>-worlds.</td>
</tr>
<tr>
<td align="left" valign="middle">(c2)</td>
<td align="left" valign="middle"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M90"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>/</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is true iff the deontically best worlds among <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M91"><mml:mrow><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula>-worlds are <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M92"><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:math></inline-formula>-worlds.</td>
</tr>
<tr>
<td align="left" valign="middle">(c3)</td>
<td align="left" valign="middle"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M93"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>/</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is true iff the deontically best worlds among <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M94"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula>-worlds are <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M95"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:math></inline-formula>-worlds.</td>
</tr>
</tbody>
</table>
</table-wrap>
<p id="P41">It is obvious that in ordering semantics each statement of the Chisholm set provides independent information: <italic>no informational redundancy</italic>. More importantly, there is <italic>no inconsistency</italic> in this understanding of the Chisholm set. (c1) and (c2) entail <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M96"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, whereas (c3) and (c4) do not entail <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M97"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, because Deontic Detachment is valid, but Factual Detachment is <italic>not valid</italic> in this model.</p>
<disp-quote id="Q3">
<p id="P42"><bold>Deontic Detachment</bold> for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M98"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> : <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M99"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo><mml:mo>&#x2227;</mml:mo><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo><mml:mo>&#x22A8;</mml:mo><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></p>
<p id="P43"><bold>Factual Detachment</bold> for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M100"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> : <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M101"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo><mml:mo>&#x2227;</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x22A8;</mml:mo><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></p>
</disp-quote>
<p id="P44">When <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M102"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</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="M103"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> are true, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M104"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> cannot be false in this system. Suppose that the deontically best worlds are <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M105"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>-worlds and among <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M106"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>-worlds the deontically best worlds are <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M107"><mml:mrow><mml:mi>&#x03C8;</mml:mi></mml:mrow></mml:math></inline-formula>-worlds. Then, the deontically best worlds are <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M108"><mml:mrow><mml:mi>&#x03C8;</mml:mi></mml:mrow></mml:math></inline-formula>-worlds as well. Thus, Deontic Detachment, the inference from <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M109"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</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="M110"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M111"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, is valid in ordering semantics. The validity of Deontic Detachment has intuitive appeal. It is natural to infer a new obligation (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M112"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>) from a conditional obligation (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M113"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>) when its antecedent is obligatory (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M114"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>).</p>
<p id="P45">On the other hand, Factual Detachment is not valid for deontic modals. When it comes to deontic modals, it is obvious that an index world, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M115"><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:math></inline-formula>, is not one of the deontically best possible worlds. For example, in the actual world that we live in, filicide is morally and legally forbidden, and people ought not to commit filicide; however, the actual world is not completely free of it. The actual world is not an ideal world from a moral and legal perspective. Thus it is better not to make the assumption, called <italic>Weak Centering</italic> for deontic modals, according to which the index world <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M116"><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:math></inline-formula> is always one of the best worlds in a relevant sense.<sup><xref rid="fn7" ref-type="fn">7</xref></sup> Without Weak Centering, the fact that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M117"><mml:mrow><mml:mi>&#x03D5;</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="M118"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> hold in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M119"><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:math></inline-formula> does not guarantee that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M120"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> holds in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M121"><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:math></inline-formula>&#x2014;it is possible that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M122"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is false in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M123"><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:math></inline-formula>. Therefore, Factual Detachment is invalid in ordering semantics. As a result, (c5) does not follow from (c3) and (c4), whereas (c6) does follow from (c1) and (c2). There is no inconsistency in the Chisholm set.</p>
<table-wrap id="T5" position="anchor" orientation="portrait">
<table frame="void" rules="none">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="center" valign="top">(c5)</td>
<td align="left" valign="top">Jones ought not to tell them he is coming.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M124"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="center" valign="top">(c6)</td>
<td align="left" valign="top">Jones ought to tell them he is coming</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M125"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
</table-wrap>
<p id="P46">In sum, ordering semantics is free from the paradoxical results of the Chisholm set that we saw in SDL thanks to its new understanding of the meaning of conditionals and the invalidity of Factual Detachment.</p>
</sec>
</sec>
<sec id="S7">
<label>4.</label><title>The CTD Trilemma : The New Puzzle</title>
<p id="P47">Chisholm&#x2019;s four sentences entail (c6), not (c5), in ordering semantics. That means, Jones ought to tell his neighbors he is coming when he does not go. This result is deeply unsatisfactory. The faithful formal representation of Jones&#x2019;s predicament in Chisholm&#x2019;s example seems to require more than just presenting Chisholm&#x2019;s four sentences without inconsistency and redundancy.</p>
<p id="P48">To identify the real challenge raised by Chisholm&#x2019;s example, I am going to examine three types of situations the Chisholm set can naturally call to mind and their characteristic features: the According-to-Duty (ATD) Situation, the Overriding Situation, and the CTD Situation. Noting that there are three different ways of interpreting Jones&#x2019;s predicament in Chisholm&#x2019;s example, we will be able to get clear on the constraints and desiderata of a satisfactory account of CTD obligations and normative reasoning.</p>
<sec id="S8">
<label>4.1.</label><title>Three Interpretations of Chisholm&#x2019;s Example</title>
<p id="P49">First, the According-to-Duty (ATD) Situation of the Chisholm&#x2019;s example is a situation in which Jones has not gone help his neighbors yet, but it is still practically possible for him to go help them. Suppose, for example, that Jones is out of town and knows that his weekend will be well-spent if he goes help his neighbors move tomorrow. Imagine that he can still go help them tomorrow if he catches the train back to town tonight. In this situation, what he ought to do is to go help his neighbors and let them know he is coming. In the ATD situation, (c1)&#x2013;(c4) hold and the derived ought-statement (c6) holds, but not (c5).</p>
<p id="P50">Second, the Overriding Situation is a situation where it would be a good thing for him to go help his neighbors, but it is outside his ability; so it is not the case that he ought to go help them. For example, suppose that Jones is out of town and knows that his neighbors need his help tomorrow, but he has already missed all trains back to town (or, there&#x2019;s no train back to town due to the bad weather); so he won&#x2019;t be there to help them in time. Given Jones&#x2019;s predicament it cannot be said that Jones ought to go help his neighbors; he ought not to tell them he is coming. In the Overriding Situation, (c2)&#x2013;(c5) hold in this situation, but (c1) does not. It is easy to see that the critical feature that distinguishes the ATD Situation and the Overriding Situation is Jones&#x2019;s practical ability to go help his neighbors.</p>
<p id="P51">Third, the CTD Situation is a situation in which Jones violates his duty and his CTD obligation takes effect. That means he ought not to tell them he is coming, but the duty he has failed to fulfill is still there as his duty. Imagine, for example, that Jones has a duty to help his neighbors as a community member or as part of his job (e.g., as a firefighter) and his neighbors need his help. However, Jones missed the last train that would get him back to town in time. He won&#x2019;t be able to help his neighbors. So he ought not to tell them he is coming. However, it is true at the same time that he ought to go help his neighbors since that&#x2019;s his duty. Although (c1) and (c2) express Jones&#x2019;s duties and obligations, we should not infer that Jones ought to tell his neighbors he is coming. Therefore, (c1)&#x2013;(c5) hold in the CTD Situation, but not (c6).</p>
<p id="P52">The CTD Situation is importantly different from the Overriding Situation in that (c1) is read as expressing Jones&#x2019;s duty or obligation in the CTD Situation, which persists regardless of his practical ability of fulfilling the duty in the current circumstance. The Overriding Situation is the interpretation of the Chisholm set when reading (c1) as a judgment that tells Jones which act or course of action is the best thing to do in a relevant sense given his current situation, like recommendation or advice. And, that is why (c1) stops holding when (c4) is true.</p>
<p id="P53">Clarifying these three possible interpretations of Chisholm&#x2019;s example permits us to see that depending of how we interpret Jones&#x2019;s normative predicament Chisholm&#x2019;s example presents different challenges with different sets of statements to work on in a formal account.</p>
<table-wrap id="T6" position="anchor" orientation="portrait">
<table frame="box" rules="groups">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<thead>
<tr>
<th align="left" valign="top">The ATD Situation</th>
<th align="left" valign="top">The Overriding Situation</th>
<th align="left" valign="top">The CTD Situation</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" valign="top">(c1) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M126"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td align="left" valign="top"></td>
<td align="left" valign="top">(c1) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M127"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top">(c2) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M128"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mtext>t</mml:mtext><mml:mo>/</mml:mo><mml:mtext>h</mml:mtext><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td align="left" valign="top">(c2) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M129"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>/</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td align="left" valign="top">(c2) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M130"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>/</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top">(c3) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M131"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>/</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td align="left" valign="top">(c3) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M132"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>/</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td align="left" valign="top">(c3) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M133"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>/</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top">(c4) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M134"><mml:mrow><mml:mi>&#x00AC;</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula></td>
<td align="left" valign="top">(c4) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M135"><mml:mrow><mml:mi>&#x00AC;</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula></td>
<td align="left" valign="top">(c4) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M136"><mml:mrow><mml:mi>&#x00AC;</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top">(c6) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M137"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td align="left" valign="top">(c5) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M138"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td align="left" valign="top">(c5) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M139"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
</table-wrap>
<p id="P54">There have been many attempts to deal with Chisholm&#x2019;s Paradox by carefully attending to temporal or agential components of the example. These attempts, roughly, argue that since it is time-sensitive whether Jones can fulfill (c1), what Jones ought to do is different before and after a certain critical point of time that determines whether he can go help his neighbors or not: the ATD Situation before this point and the Overriding Situation after the point. Therefore, Jones&#x2019;s predicament in Chisholm&#x2019;s example is either the According-To-Duty (ATD) Situation or the Overriding Situation.</p>
<p id="P55">Given this dichotomic interpretation of Chisholm&#x2019;s example, neither the clash between (c5) and (c6) nor the tension between (c1) and (c5) arise, because they simply do not hold at the same time for Jones. If this interpretation of Chisholm&#x2019;s example is correct, formal frameworks for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M140"><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:mrow></mml:math></inline-formula>s and <italic>if</italic> s are lifted from the burden of reconciling Factual Detachment and Deontic Detachment, and the challenge raised by Chisholm&#x2019;s example is to devise a formal system that is sensitive to such temporal aspects or agent&#x2019;s abilities and can capture both the ATD and Overriding Situations.</p>
<p id="P56">Proponents of ordering semantics would welcome this interpretation of Chisholm&#x2019;s example, since the relation between the truth of (c1) and Jones&#x2019;s ability to go is easy to capture using the ordering semantic framework. Here&#x2019;s how that goes. It is a logical truth that either Jones can go help his neighbors, or Jones cannot go help his neighbors: <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M141"><mml:mrow><mml:mo>&#x22C4;</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x2228;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mo>&#x22C4;</mml:mo><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula>. According to the standard ordering semantic account of modals and conditionals, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M142"><mml:mrow><mml:mo>&#x22C4;</mml:mo><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula> is true at <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M143"><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:math></inline-formula> iff there is at least one <italic>h</italic>-possible world accessible from <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M144"><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:math></inline-formula>. On the other hand, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M145"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mo>&#x22C4;</mml:mo><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula> is true at <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M146"><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:math></inline-formula> iff there is no <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M147"><mml:mrow><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula>-world among all the possible worlds accessible from <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M148"><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:math></inline-formula>. Therefore, the two possible situations are captured by different modal bases: <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M149"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x2209;</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M150"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, respectively. Suppose that the relevant ordering source is <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M151"><mml:mrow><mml:mi>g</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mfenced close="}" open="{"><mml:mrow><mml:mi>h</mml:mi><mml:mo>,</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x2283;</mml:mo><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x2283;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula>. In the situation where Jones can go <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M152"><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mo>&#x22C4;</mml:mo><mml:mi>h</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, the relevant contextual parameters are <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M153"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M154"><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:math></inline-formula>. Given <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M155"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M156"><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:math></inline-formula>, there are some <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M157"><mml:mrow><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula>-worlds in the relevant domain, and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M158"><mml:mrow><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula>-worlds are the deontically best worlds. Therefore, Jones ought to go help his neighbors and tell them he is coming : (c1) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M159"><mml:mrow><mml:mo>&#x2227;</mml:mo></mml:mrow></mml:math></inline-formula> (c6). On the other hand, in the situation where Jones cannot go to help his neighbors <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M160"><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mo>&#x22C4;</mml:mo><mml:mi>h</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, the relevant contextual parameters are <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M161"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M162"><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:math></inline-formula>. Given <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M163"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>2</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M164"><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:math></inline-formula>, there are no <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M165"><mml:mrow><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula>-worlds in the relevant domain. Among <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M166"><mml:mrow><mml:mi>&#x00AC;</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula>-worlds, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M167"><mml:mrow><mml:mi>&#x00AC;</mml:mi><mml:mi>h</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:math></inline-formula> -worlds are better than <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M168"><mml:mrow><mml:mi>&#x00AC;</mml:mi><mml:mi>h</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:math></inline-formula>-worlds. Therefore, Jones ought not to tell them he is coming (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M169"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>); but, importantly, it is not the case that he still has an obligation to go help his neighbors (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M170"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>).<sup><xref rid="fn8" ref-type="fn">8</xref></sup></p>
<p id="P57">Although the dichotomic interpretation is possible for Chisholm&#x2019;s example, it is easy to construct examples of Chisholm&#x2019;s Paradox without temporal and agential components. Here&#x2019;s <xref rid="R29" ref-type="bibr">Prakken and Sergot&#x2019;s (1996)</xref> example:</p>
<table-wrap id="T14" position="anchor" orientation="portrait">
<table frame="void" rules="none">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="middle">(d1)</td>
<td align="left" valign="middle">There ought to be no dog.</td>
</tr>
<tr>
<td align="left" valign="middle">(d2)</td>
<td align="left" valign="middle">If there is no dog, there ought to be no warning signs.</td>
</tr>
<tr>
<td align="left" valign="middle">(d3)</td>
<td align="left" valign="middle">If there is a dog, there ought to be a warning sign.</td>
</tr>
<tr>
<td align="left" valign="middle">(d4)</td>
<td align="left" valign="middle">There is a dog.</td>
</tr>
</tbody>
</table>
</table-wrap>
<p id="P62">Unlike (c1) in the Overriding Situation, (d1) is neither defeated nor overridden in this timeless example. From (d1)&#x2013;(d4) it follows that there ought to be a warning sign, but (d1) still holds as a holiday cottage regulation. Regardless of whether or not a dog can be removed, (d1) holds as a holiday cottage regulation, and (d1) is violated given the truth of (d4). It seems that the most natural reading of (d1)&#x2013;(d4) is the CTD Situation. So we should conclude that the real puzzle invoked by Chisholm&#x2019;s example is not about temporal or agential components in normative discourse.</p>
<p id="P63">Moreover, both the ATD Situation and the Overriding Situation lack the characteristic twofold mechanism of a CTD obligation: the violation of a primary obligation and the generation of a new obligation upon the violation. In the ATD Situation, the CTD obligation does not take effect. In the Overriding Situation, there is no violation of Jones&#x2019;s primary obligation or duty since (c1) stops being relevant as being overridden by (c4), in other words, the situation where (c4) is an exceptional situation for (c1), where (c1) does not hold. However, the situation in which a CTD obligation takes effect is a sub-ideal situation, not an exceptional circumstance. In other words, when his CTD obligation takes effect, Jones&#x2019;s primary obligation is violated, not replaced by some other new obligation. Among the three interpretations of Chisholm&#x2019;s example, the CTD Situation is the only interpretation that captures the characteristic twofold mechanism of our reasoning with a CTD obligation. Let&#x2019;s take a close look at the CTD Situation.</p>
</sec>
<sec id="S9">
<label>4.2.</label><title>The CTD Situation and The CTD Trilemma</title>
<p id="P64">Here are three characteristic features of the CTD Situation: (I) and (II) are the two features that distinguish the CTD Situation from the ATD Situation and the Overriding Situation, and (III) says that the CTD Situation is not an aberrant normative situation like a dilemma situation.</p>
<disp-quote id="Q4">
<p id="P65"><bold>I. Violation of a Primary Obligation</bold></p>
<p id="P66">In the CTD Situation, the relevant agent&#x2019;s primary obligation holds, but it is violated: <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M171"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo><mml:mo>&#x2227;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote>
<disp-quote id="Q5">
<p id="P67"><bold>II. Inference of a New <italic>Ought</italic>-Statement</bold></p>
<p id="P68">In the CTD Situation, a new <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M172"><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:mrow></mml:math></inline-formula>-statement that tells the agent what to do in her current circumstance is derived from a CTD obligation and factual statement: <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M173"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> from <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M174"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</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="M175"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote>
<disp-quote id="Q6">
<p id="P69"><bold>III. No Tension among <italic>Ought</italic>-Statements</bold></p>
<p id="P70">Conditional and unconditional <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M176"><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:mrow></mml:math></inline-formula>-statements in the CTD Situation do not generate contradictory or difficult normative choices for the agent; the agent in the CTD Situation does not face a practically difficult choice.</p>
</disp-quote>
<p id="P71">These three characteristic features of the CTD Situation are also the three requirements a satisfactory formal account of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M177"><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:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M178"><mml:mrow><mml:mi>i</mml:mi><mml:mi>f</mml:mi></mml:mrow></mml:math></inline-formula> must meet: (I) the Violation Requirement, (II) the New <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M179"><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:mrow></mml:math></inline-formula>-Statement Requirement and (III) the No Tension Requirement. In Chisholm&#x2019;s example, together with the first two requirements, (III) the No Tension Requirement put constraint on what we should not infer from the Chisholm set in the CTD Situation.</p>
<list list-type="roman-lower" id="L7">
<list-item><p id="P72">(c6) does not follow from (c1) and (c2), or even if (c6) follows from (c1) and (c2), it is not the case that Jones ought to <italic>tell</italic> and <italic>not tell</italic> he is coming;</p></list-item>
<list-item><p id="P73">(c1) and (c5) hold, but it is not the case that Jones ought to <italic>go help</italic> and <italic>not tell</italic> them he is coming.</p></list-item>
</list>
<p id="P74">Let&#x2019;s call the challenge of meeting all three features of the CTD Situation <italic>the CTD Trilemma</italic>. Meeting all three of them amounts to representing Jones&#x2019;s CTD situation as the situation in which (c1)&#x2013;(c5) hold but (c6)&#x2013;(c8) do not hold. Let&#x2019;s call this set of statements (c1)-(c5) that represent Jones&#x2019;s CTD Situation, <italic>the Extended Chisholm set</italic>.</p>
<table-wrap id="T7" position="anchor" orientation="portrait">
<table frame="void" rules="none">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top"></td>
<td align="left" valign="top">(c1)</td>
<td align="left" valign="top">It ought to be that Jones goes to help his neighbors.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M180"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top"></td>
<td align="left" valign="top">(c2)</td>
<td align="left" valign="top">It ought to be that if he does go he tells them he is coming.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M181"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>/</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top"></td>
<td align="left" valign="top">(c3)</td>
<td align="left" valign="top">If he does not go then he ought not to tell them he is coming.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M182"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x00AC;</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula>)</td>
</tr>
<tr>
<td align="left" valign="top"></td>
<td align="left" valign="top">(c4)</td>
<td align="left" valign="top">He does not go.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M183"><mml:mrow><mml:mi>&#x00AC;</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top"></td>
<td align="left" valign="top">(c5)</td>
<td align="left" valign="top">He ought not to tell them he is coming.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M184"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top">#</td>
<td align="left" valign="top">(c6)</td>
<td align="left" valign="top">Jones ought to tell them he is coming.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M185"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top">#</td>
<td align="left" valign="top">(c7)</td>
<td align="left" valign="top">Jones ought to go help his neighbors and not to tell them he is coming.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M186"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top">#</td>
<td align="left" valign="top">(c8)</td>
<td align="left" valign="top">Jones ought to and ought not to tell them he is coming.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M187"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
</table-wrap>
<p id="P75">The CTD Trilemma specifies the three desiderata a formal account of normative language must meet. They strongly suggest the validity of Factual Detachment and the invalidity of Deontic Detachment and Agglomeration of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M188"><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:mrow></mml:math></inline-formula>-statements. Any satisfactory formal account must be able to explain these puzzling data points and formally incorporate them. Now the question is whether this new puzzle can solved in the ordering semantic framework.</p>
<p id="P76">First, a version of ordering semantics that rejects Weak Centering can express the violation of Jones&#x2019;s primary obligation by using the conjunction <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M189"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo><mml:mo>&#x2227;</mml:mo><mml:mi>&#x00AC;</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula>. However, the rejection of Weak Centering results in the invalidity of Factual Detachment as we have seen in Section <xref ref-type="sec" rid="S6">3.2</xref>.<sup><xref rid="fn9" ref-type="fn">9</xref></sup> Thus, this version of ordering semantics has difficulty in explaining why it is natural to infer the new <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M190"><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:mrow></mml:math></inline-formula>-statement (c5) in the CTD Situation. Therefore, this approach meets (I) the Violation Requirement and (III) the No Tension Requirement, but fails to meet (II) the New <italic>Ought</italic>-Statement Requirement.</p>
<p id="P77">Second, a version of ordering semantics that assumes Weak Centering for deontic modals runs a different risk. This version of ordering semantics validates Factual Detachment since it assumes that the actual world is one of the ideal possible worlds when evaluating deontic modals. So it meets (II).<sup><xref rid="fn10" ref-type="fn">10</xref></sup> However, the conjunction <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M191"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo><mml:mo>&#x2227;</mml:mo><mml:mi>&#x00AC;</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula> is not possible in this system, since the truth of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M192"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> entails the truth of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M193"><mml:mrow><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula> in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M194"><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:math></inline-formula> given Weak Centering. Therefore, this version of ordering semantics with Weak Centering meet (II) and (III) but fail to meet (I). In sum, whether or not Weak Centering is assumed, ordering semantics faces unwanted results: if Weak Centering is assumed, then it fails to meet (I) the Violation Requirement; and if not, it fails to meet (II) the New <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M195"><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:mrow></mml:math></inline-formula>-Statement Requirement.</p>
<p id="P78">Since the rejection of Weak Centering entails the invalidity of Factual Detachment, it would look like a problem of how to make sense of Factual Detachment in the ordering semantic framework without giving up on our strong intuition that the actual world is not a deontically ideal world. Let&#x2019;s check this route. Inspired by <xref rid="R35" ref-type="bibr">Stalnaker (1975)</xref>, one might argue that Factual Detachment is technically invalid, but <italic>pragmatically valid</italic> in that the inference of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M196"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> from the assertions of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M197"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</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="M198"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula> is <italic>reasonable</italic>.<sup><xref rid="fn11" ref-type="fn">11</xref></sup> Since Deontic Detachment is valid in ordering semantics, the pragmatic validity of Factual Detachment brings the familiar tension between (c5) and (c6) back. At least, this approach must explain why (c5) guides Jones&#x2019;s action, while (c6) does not.</p>
<p id="P79">Maybe we can concoct a version of ordering semantic account for <italic>ought</italic>s and <italic>if</italic>s that invalidates Deontic Detachment but validates Factual Detachment, and get the positive data right: (c5) follows from (c1)&#x2013;(c4), but not (c6). This will meet both (I) and (II). Unfortunately, even this contrived system cannot meet (III). Just (c1) and (c5) together generate a tension in an ordering semantic framework, which does not exist in our intuitive understanding of the CTD Situation. To say that both (c1) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M199"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and (c5) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M200"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> are true means that in the deontically ideal possible worlds Jones <italic>goes help</italic> his neighbors but <italic>does not tell</italic> them he is coming in the ordering semantic framework. Although (c1) and (c5) are not logically inconsistent with each other, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M201"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> does not hold in the CTD Situation given that (c1) and (c2) hold in the CTD Situation; according to (c1) and (c2), ideally Jones is supposed to go help his neighbors and tell them he is coming. <xref rid="R29" ref-type="bibr">Prakken and Sergot (1996</xref>; <xref rid="R30" ref-type="bibr">1997</xref>) call this puzzling result in ordering semantics <italic>Pragmatic Oddity</italic>. <xref rid="R31" ref-type="bibr">Saint-Croix and Thomason (2016)</xref> also draw attention to the tension between (c1) and (c5) in Chisholm&#x2019;s example. They argue that with or without conditional <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M202"><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:mrow></mml:math></inline-formula>-statements in the Chisholm set (c1) and (c5) generate a puzzle; both (c1) and (c5) hold in Chisholm&#x2019;s example, but the conjunction of them, (c7), &#x201C;is clearly false&#x201D; (<xref rid="R31" ref-type="bibr">Saint-Croix &amp; Thomason 2016</xref>: 193). They call this puzzle, <italic>an unconditional version of Chisholm&#x2019;s Paradox</italic>.<sup><xref rid="fn12" ref-type="fn">12</xref></sup></p>
<p id="P80">In sum, the three characteristic features of the CTD Situation generate the following trilemma for ordering semantics:
<disp-quote id="Q7">
<p id="P81"><bold>The CTD Trilemma</bold></p>
<p id="P82">The ordering semantic account of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M203"><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:mrow></mml:math></inline-formula>s and <italic>ifs</italic> can meet two of the three features of the CTD Situation, but not all three of them. Therefore, it fails to provide a faithful formal representation of the CTD Situation.</p>
</disp-quote></p>
<p id="P83">The discussion so far and the exploration of possible solutions to the CTD Trilemma in the ordering semantic framework naturally prompts us to suspect that (c1) and (c5) are different types of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M204"><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:mrow></mml:math></inline-formula>-statements and nudge us to explore alternative approaches.</p>
</sec>
</sec>
<sec id="S13">
<label>5.</label><title>The New Approach</title>
<p id="P84">To solve the CTD Trilemma I propose a new approach employing the following two observations about our normative reasoning and the dual nature of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M205"><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:mrow></mml:math></inline-formula>-statements in our normative discourse.</p>
<list list-type="roman-lower" id="L8">
<list-item><p id="P85">Normative rules and normative judgments have different functions in our normative reasoning. Accepted normative rules are prescriptive in that they define which acts or states of affairs an agent prefers or regards as more desirable than the others. On the other hand, a normative judgment describes which course of action or state of affairs is most desirable or preferred among alternatives in the given circumstance.</p></list-item>
<list-item><p id="P86">In our normative discourse, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M206"><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:mrow></mml:math></inline-formula>-statements can be used to express both normative rules and normative judgements.</p></list-item>
</list>
<p id="P87">I will first explain each observation and how they help us explain the seemingly inconsistent linguistic data on the CTD Situation in the CTD Trilemma.</p>
<sec id="S14">
<label>5.1.</label><title>Normative Rules and Normative Judgements</title>
<p id="P88">The distinction between normative rules and normative judgments is straight-forward. By normative rules, I mean regulative rules in our lives that offer guidance for judgments about what to do in various circumstances. Moral, civil, or legal duties and obligations, requirements of etiquette and social norms all are considered normative rules. On the other hand, a normative judgment is a practical judgment inferred from a set of normative rules and facts telling us which course of action is most desirable in the given circumstance.</p>
<p id="P89">Normative rules are prescriptive in that they generate commitments and expectations to perform, avoid, or permit certain types of acts. A set of normative rules that are accepted by an agent forms a preference pattern regarding which courses of action or states of affairs are most desirable. For example, for those who have learned and internalized a set of dinner manners, eating asparagus with their fingers is considered more desirable than eating asparagus with a knife and fork. For Kantian deontologists, being completely honest is always morally preferable to lying.</p>
<p id="P90">Normative rules are importantly different from empirical rules that express causal or empirical regularities. A case that does not conform to a certain empirical rule challenges or even disproves the empirical rule, but a particular case that does not conform to a normative rule is a violation of the rule and does not weaken the rule. For example, the observation of white ravens would challenge the empirical rule that all ravens are black; on the other hand, lying to a murderer outside your door to disallow him entrance into your home would be a violation of the moral principle not to lie but does not challenge or disprove it.<sup><xref rid="fn18" ref-type="fn">13</xref></sup></p>
<p id="P91">The contrast between normative rules and empirical rules reveals another important attribute of normative rules. Normative rules remain relevant as regulative rules even when an agent violates them, unless an agent is exempted from them or stops being the subject of the rules. As a legally recognized subject of her country, for example, Jane has an obligation to serve on a jury when called. Suppose that Jane was called. &#x201C;Jane ought to serve on a jury&#x201D; as a normative rule holds, and does so even when she fails to show up for the duty. She can be exempt from her jury service if she meets certain conditions, but that exemption does not dissolve her duty as a citizen.<sup><xref rid="fn19" ref-type="fn">14</xref></sup></p>
<p id="P92">In contrast to a normative rule, a normative judgment tells us what action or state of affairs is more desirable than its alternative. Normative judgments as practical judgments are sensitive to the agent&#x2019;s contingent circumstances and her practical abilities in a given situation and guide her actions, and can change as the circumstances change. An agent makes a normative judgment based on her factual judgments (what is known) about her current circumstance and the conditional and unconditional normative rules accepted by her. A devoted utilitarian would make a normative judgment &#x201C;I ought to give more money to charity&#x201D; from a combination of his moral principles and the facts regarding his income and necessary living expenses. When I fail to keep my promise to my partner, &#x201C;I ought to apologize to my partner&#x201D; is the normative judgment I infer from a given set of normative rules I accept and the fact that I failed to keep my promise.</p>
<p id="P93">Now we have an intuitive model of a simple normative reasoning using normative rules, normative judgments, and factual judgments. Conditional or unconditional normative rules structure the pattern of preferences by imposing obligations, granting permissions, and forbidding certain types of actions, and facts (or what is known) about the given circumstance determines what are practically feasible choices in the circumstance. A normative judgment is made by using both the pattern of preferences defined by normative rules and the set of choices limited by what is known about the given circumstance. For example, my moral duty to keep my promise to my partner generates the preference ranking over two states: keeping my promise over not keeping my promise. My conditional obligation to apologize when failing to keep my promise articulates the preference ranking further in the following order : 1) keeping my promise; 2) failing to keep my promise and apologizing for it, and 3) failing to keep my promise and not apologizing. When keeping my promise is still a possibility, I ought to keep my promise. When I fail to keep my promise, I have only two options: apologizing for it or not apologizing for it. And, my normative judgment has to be: &#x201C;I ought to apologize.&#x201D; Even in this sub-ideal situation, my duty to keep my promise holds. In other words, my primary moral duty &#x201C;I ought to keep my promise&#x201D; holds.</p>
<p id="P94">Now is the time to talk about the second principle of this approach: even though they serve different functions in our normative reasoning, both normative rules and judgments can be expressed by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M207"><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:mrow></mml:math></inline-formula>-statements in our normative discourse.<sup><xref rid="fn20" ref-type="fn">15</xref></sup> Imagine Jane is called for jury duty, and suppose it turns out that she was a victim in a similar crime and knows that it will be hard for her to maintain objectivity. In this case, she can reasonably make a normative judgment &#x201C;I ought not to serve on a jury,&#x201D; although this judgment is opposed to the relevant normative rule, which also could be stated in a form of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M208"><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:mrow></mml:math></inline-formula>-statement: &#x201C;Jane ought to serve on a jury.&#x201D;</p>
<p id="P95">Here I argue that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M209"><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:mrow></mml:math></inline-formula>-statements used in normative discourse that are commonly believed to be homogeneous are actually of two kinds: one expressing normative rules and the other expressing normative judgments. And their functions in our normative discourse and reasoning are distinct enough to be taken into our semantic account of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M210"><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:mrow></mml:math></inline-formula>-statements. The question of how to disambiguate two meanings of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M211"><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:mrow></mml:math></inline-formula>-statements in normative discourse in various contexts is beyond the scope of this paper. For the purposes of my project, I am going to presume this ambiguity is resolved at the pragmatic level and focus on analyzing their semantic contents. From now I am going to use two different operators, one for <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:mrow></mml:math></inline-formula>-statements expressing normative rules (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M213"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>) and the other for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M214"><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:mrow></mml:math></inline-formula>-statements for normative judgments (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M215"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>). In texts, I will use the subscripts to indicate different kinds of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M216"><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:mrow></mml:math></inline-formula>s: &#x201C;<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M217"><mml:mrow><mml:msub><mml:mtext>ought</mml:mtext><mml:mi>R</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>&#x201D; and &#x201C;<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M218"><mml:mrow><mml:msub><mml:mtext>ought</mml:mtext><mml:mi>J</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>.&#x201D;</p>
</sec>
<sec id="S15">
<label>5.2.</label><title>A Sketch for a New Solution to the CTD Trilemma</title>
<p id="P96">Using the three components of normative reasoning and the dual nature of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M219"><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:mrow></mml:math></inline-formula>-statements we can give a natural explanation of Jones&#x2019;s normative predicament in the CTD Situation. In the CTD Situation, (c1)&#x2013;(c3) are the normative rules for Jones. (c1) expresses Jones&#x2019;s duty as a community member; (c2) expresses Jones&#x2019;s conditional obligation stemming from common etiquette; and (c3) expresses Jones&#x2019;s CTD obligation related to a general obligation not to to lie or deceive others. (c4) is the factual judgment about Jones&#x2019;s contingent situation. (c5) is the normative judgment derived from his CTD obligation and factual judgment, (c3) and (c4).<sup><xref rid="fn21" ref-type="fn">16</xref></sup> So the Extended Chisholm Set describing Jones&#x2019;s normative predicament in the CTD Situation actually consists of the three different types of statements as follows:
<table-wrap id="T8" position="anchor" orientation="portrait">
<table frame="void" rules="none">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">(c1<sub><italic>R</italic></sub>)</td>
<td align="left" valign="top">It <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M220"><mml:mrow><mml:msub><mml:mtext mathvariant='italic'>ought</mml:mtext><mml:mi>R</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> to be that Jones goes to help his neighbors.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M221"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top">(c2<sub><italic>R</italic></sub>)</td>
<td align="left" valign="top">It <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M222"><mml:mrow><mml:msub><mml:mi mathvariant='italic'>ought</mml:mi><mml:mi>R</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> to be that if he does go he tells them he is coming.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M223"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>/</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top">(c3<sub><italic>R</italic></sub>)</td>
<td align="left" valign="top">If he does not go then he <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M224"><mml:mrow><mml:msub><mml:mi mathvariant='italic'>ought</mml:mi><mml:mi>R</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> not to tell them he is coming.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M225"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub></mml:mrow><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x00AC;</mml:mi><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top">(c4)</td>
<td align="left" valign="top">He does not go.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M226"><mml:mrow><mml:mi>&#x00AC;</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top">(c5<sub><italic>J</italic></sub>)</td>
<td align="left" valign="top">He <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M227"><mml:mrow><mml:msub><mml:mi mathvariant='italic'>ought</mml:mi><mml:mi>J</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> not to tell them he is coming.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M228"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
</table-wrap></p>
<p id="P97">We can informally illustrate how the normative rules, the factual statement and the normative judgments in the CTD Situation interact in the CTD Situation with diagrams. The three normative rules, (c1)&#x2013;(c3), define Jones&#x2019;s normative preference over possible worlds (or possible states of affair) as follows: (Solid-line circles represent possible worlds that are not ruled out, while dashed-line circles represent possible worlds ruled out by what is known; the arrow connecting two circles or boxes indicates which possibility is preferred; what an arrow is pointing to is the preferred possibility between two possibilities that the arrow connects.)</p>
<graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="ergo.1122-f0001.jpg"/>
<p id="P98">The factual statement (c4) defines what are practically possible options for Jones in his current predicament by ruling out all <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M229"><mml:mrow><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula>-worlds from the set of possible worlds as in the following diagram.</p>
<graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="ergo.1122-f0002.jpg"/>
<p id="P99">Given (c1)&#x2013;(c4), the normative judgment (c5) &#x201C;Jones <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M230"><mml:mrow><mml:msub><mml:mi mathvariant='italic'>ought</mml:mi><mml:mi>J</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> not to tell them he is coming&#x201D; accurately describes the best Jones can do in the given circumstance. This new reading of the Extended Chisholm set suggests an intuitive solution to the CTD Trilemma. The simple conjunction of (c1) and (c4), <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M231"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo><mml:mo>&#x2227;</mml:mo><mml:mi>&#x00AC;</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula>, expresses the violation of Jones&#x2019;s primary obligation to help his neighbors. The normative judgment <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M232"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> follows from the Chisholm set in that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M233"><mml:mrow><mml:mi>&#x00AC;</mml:mi><mml:mi>h</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:math></inline-formula>-worlds are the most preferred worlds when (c4) holds, as in the diagram. Finally, the normative rule (c1) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M234"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and the normative judgment (c5) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M235"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> are not in conflict and thus can be true in the same situation. As we have seen, what is expected by a normative rule does not always coincide with the best we can do in a particular situation, and a normative rule holds even when violated.</p>
<p id="P100">This new approach provides a simple intuitive explanation of why (c6)&#x2013;(c8) all are false normative judgments.</p>
<table-wrap id="T9" position="anchor" orientation="portrait">
<table frame="void" rules="none">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="top">#</td>
<td align="left" valign="top">(c6<sub><italic>J</italic></sub>)</td>
<td align="left" valign="top">Jones <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M236"><mml:mrow><mml:msub><mml:mi mathvariant='italic'>ought</mml:mi><mml:mi>J</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> to tell them he is coming.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M237"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top">#</td>
<td align="left" valign="top">(c7<sub><italic>J</italic></sub>)</td>
<td align="left" valign="top">Jones <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M238"><mml:mrow><mml:msub><mml:mi mathvariant='italic'>ought</mml:mi><mml:mi>J</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> to go help his neighbors and not to tell them he is coming.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M239"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="top">#</td>
<td align="left" valign="top">(c8<sub><italic>J</italic></sub>)</td>
<td align="left" valign="top">Jones <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M240"><mml:mrow><mml:msub><mml:mi mathvariant='italic'>ought</mml:mi><mml:mi>J</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> to and ought<sub>J</sub> not to tell them he is coming.</td>
<td align="left" valign="top"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M241"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
</table-wrap>
<p id="P101">From the normative rules (c1)&#x2013;(c3) and the factual judgment (c4), the normative judgment (c6) simply does not follow and is neither one of Jones&#x2019;s normative rules nor an adequate normative judgment in the CTD Situation. Since (c1) is a normative rule and (c5) is a normative judgment, we cannot, using Agglomeration, combine them into one <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M242"><mml:mrow><mml:mi mathvariant='italic'>ought</mml:mi></mml:mrow></mml:math></inline-formula>-statement, which explains the falsity of (c7) without invalidating Agglomeration.</p>
<p id="P102">In addition to this natural, intuitive account of the CTD Situation, this new reading can explain why different interpretations of Chisholm&#x2019;s example are possible. In particular, when Chisholm&#x2019;s example is read as the Overriding Situation, we read (c1) as a normative judgment overridden by a newly derived normative judgment (c5), because a normative judgment is sensitive to a factual judgment. As a situation changes, an adequate normative judgment may change.</p>
<p id="P103">In this section, above, I have proposed a new reading of the Extended Chisholm set and a new approach to the CTD Trilemma, using two key observations: (i) normative rules and normative judgments have distinct functions in our normative reasoning and (ii) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M243"><mml:mrow><mml:mi mathvariant='italic'>ought</mml:mi></mml:mrow></mml:math></inline-formula>-statements can express both normative rules and judgments in our normative discourse. With these two principles, we can provide a natural explanation of the CTD Situation and meet the three desiderata of the CTD Trilemma in a natural and unforced manner. In the next section, I will develop a new semantic account for normative reasoning that formally captures these principles, thus solving the CTD Trilemma.</p>
</sec>
</sec>
<sec id="S16">
<label>6.</label><title>Dynamic Semantics for Normative Reasoning</title>
<p id="P104">The new account I sketch here is a dynamic semantics formally inspired by <xref rid="R39" ref-type="bibr">Veltman&#x2019;s (1996)</xref> update semantics for default reasoning. Here are two reasons that I build a new semantic account for normative reasoning using Veltman&#x2019;s update semantics: (i) as a dynamic semantics it allows us to define the way normative rules contribute to normative discourse and keep track of them even when they are violated or cannot be fulfilled; and (ii) there is a clear structural parallelism between default reasoning and normative reasoning, which permits a formal adaptation of the update semantics for default reasoning to normative reasoning. I will first informally introduce Veltman&#x2019;s update semantics for default reasoning and show that some of the key features common in default reasoning and normative reasoning. Then, I will formally sketch a new update semantics for normative reasoning.</p>
<sec id="S17">
<label>6.1.</label><title>Veltman&#x2019;s Update Semantics</title>
<p id="P105">The core idea of dynamic semantics is that the meaning of a sentence is how it changes the context or what is believed or accepted by its participants. This context or conversational common ground is called an <italic>information state</italic>, which is formally represented by a set of possible worlds.<sup><xref rid="fn22" ref-type="fn">17</xref></sup> In static systems, to know the meaning of &#x201C;it&#x2019;s raining&#x201D; is to know when &#x201C;it&#x2019;s raining&#x201D; is true. In the dynamic framework, to know the meaning of &#x201C;it&#x2019;s raining&#x201D; is to know what kind of changes it brings to a relevant agent&#x2019;s information state who accepts the information conveyed by the sentence. Since what is believed or accepted as true is a central part of a context, the dynamic semantic meaning of a sentence is often called a &#x201C;context change potential&#x201D; (CCP), which is a function from one information state to another.<sup><xref rid="fn23" ref-type="fn">18</xref></sup></p>
<p id="P106">Without much formalism, we can easily understand how update semantics defines the meaning of simple statements (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M244"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>) and epistemic <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M245"><mml:mrow><mml:mi mathvariant='italic'>might</mml:mi></mml:mrow></mml:math></inline-formula>-statements <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M246"><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mo>&#x22C4;</mml:mo><mml:mi>e</mml:mi></mml:msub><mml:mi>&#x03D5;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and introduce some core concepts of dynamic semantics. Suppose Ben is wondering if it&#x2019;s snowing outside and naturally says &#x201C;it might be snowing outside <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M247"><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mo>&#x22C4;</mml:mo><mml:mi>e</mml:mi></mml:msub><mml:mi>p</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.&#x201D; Abby tells him &#x201C;it&#x2019;s not snowing (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M248"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>).&#x201D; Her utterance changes what Ben believes in that Ben stops believing what is incompatible with what he has learned. So after accepting Abby&#x2019;s utterance it is inadequate for him to say or accept &#x201C;it might be snowing outside <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M249"><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mo>&#x22C4;</mml:mo><mml:mi>e</mml:mi></mml:msub><mml:mi>p</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.&#x201D; This process of incorporating new information into a current information state to evolve a new information state is called an <italic>update</italic>. When a certain information state (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M250"><mml:mrow><mml:mo>&#x03C3;</mml:mo></mml:mrow></mml:math></inline-formula>) is already compatible with <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M251"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M252"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula> <italic>is accepted in</italic> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M253"><mml:mrow><mml:mo>&#x03C3;</mml:mo></mml:mrow></mml:math></inline-formula> (or, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M254"><mml:mrow><mml:mo>&#x03C3;</mml:mo></mml:mrow></mml:math></inline-formula> <italic>supports</italic> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M255"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>). In this example,&#x201C;it might be snowing outside&#x201D; was accepted in Ben&#x2019;s information state before Abby&#x2019;s utterance of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M256"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>, but not after the update with <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M257"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>. This change shows that the process of updating new information is not monotonic. While accepting Abby&#x2019;s utterance &#x201C;it&#x2019;s not snowing (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M258"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>)&#x201D; amounts to ruling out the possibilities of snowing (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M259"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>) from Ben&#x2019;s information state, accepting an epistemic <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M260"><mml:mrow><mml:mi mathvariant='italic'>might</mml:mi></mml:mrow></mml:math></inline-formula>-statement does not require a change in the information state. The utterance of &#x201C;it might be snowing <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M261"><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mo>&#x22C4;</mml:mo><mml:mi>e</mml:mi></mml:msub><mml:mi>p</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>&#x201D; would be accepted only when the possibility of snowing is not completely rules out. The different behaviors of simple statements and epistemic <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M262"><mml:mrow><mml:mi mathvariant='italic'>might</mml:mi></mml:mrow></mml:math></inline-formula>-statements reveal the important distinction between two kinds of updates in a dynamic account: &#x201C;additive propositional <italic>updates</italic> and non-classical <italic>tests</italic>&#x201D; (<xref rid="R39" ref-type="bibr">Veltman 1996</xref>: 5). An utterance of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M263"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula> in a discourse requires updating the relevant information state with <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M264"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula> by ruling out the possibilities incompatible with it, while an utterance of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M265"><mml:mrow><mml:mi mathvariant='italic'>might</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is an invitation to perform a test on the information state, checking whether the information state is compatible with the possibility of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M266"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>.<sup><xref rid="fn24" ref-type="fn">19</xref></sup></p>
<p id="P107">Here is a formal presentation of this basic update semantics for simple statements and epistemic <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M267"><mml:mrow><mml:mi mathvariant='italic'>might</mml:mi></mml:mrow></mml:math></inline-formula>-statements.</p>
<p id="P108"><bold>Definition 1 (Languages,</bold> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M268"><mml:mrow><mml:msubsup><mml:mi>L</mml:mi><mml:mn>0</mml:mn><mml:mi mathvariant='script'>A</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula> <bold>and</bold> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M269"><mml:mrow><mml:msubsup><mml:mi>L</mml:mi><mml:mn>1</mml:mn><mml:mi mathvariant='script'>A</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula><bold>)</bold> Let <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M270"><mml:mi mathvariant='script'>A</mml:mi></mml:math></inline-formula> be a set of atomic sentences, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M271"><mml:mrow><mml:mi>p</mml:mi><mml:mo>,</mml:mo><mml:mi>q</mml:mi><mml:mo>,</mml:mo><mml:mi>r</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo></mml:mrow></mml:math></inline-formula>. The language <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M272"><mml:mrow><mml:msubsup><mml:mi>L</mml:mi><mml:mn>0</mml:mn><mml:mi mathvariant='script'>A</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula> has <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M273"><mml:mi mathvariant='script'>A</mml:mi></mml:math></inline-formula> as its non-logical vocabulary and the logical operators, such as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M274"><mml:mrow><mml:mo>&#x00AC;</mml:mo></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M275"><mml:mrow><mml:mo>&#x2228;</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="M276"><mml:mrow><mml:mo>&#x2227;</mml:mo></mml:mrow></mml:math></inline-formula>, and parentheses,) and (, as its basic logical vocabulary.</p>
<p id="P109">A string of symbols <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M277"><mml:mrow><mml:mi>&#x03C7;</mml:mi></mml:mrow></mml:math></inline-formula> is a sentence of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M278"><mml:mrow><mml:msubsup><mml:mi>L</mml:mi><mml:mn>0</mml:mn><mml:mi mathvariant='script'>A</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula> iff
<list list-type="roman-lower" id="L9">
<list-item><p id="P110">for some atomic sentence <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M279"><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant='script'>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="M280"><mml:mrow><mml:mi>&#x03C7;</mml:mi><mml:mo>=</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>;</p></list-item>
<list-item><p id="P111">for some sentence <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M281"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></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:msubsup><mml:mi>L</mml:mi><mml:mn>0</mml:mn><mml:mi mathvariant='script'>A</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M283"><mml:mrow><mml:mi>&#x03C7;</mml:mi><mml:mo>=</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>;</p></list-item>
<list-item><p id="P112">for some sentences <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M284"><mml:mrow><mml:mi>&#x03D5;</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="M285"><mml:mrow><mml:mi>&#x03C8;</mml:mi></mml:mrow></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M286"><mml:mrow><mml:msubsup><mml:mi>L</mml:mi><mml:mn>0</mml:mn><mml:mi mathvariant='script'>A</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M287"><mml:mrow><mml:mi>&#x03C7;</mml:mi><mml:mo>=</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mi>&#x03C8;</mml:mi></mml:mrow></mml:math></inline-formula>;</p></list-item>
<list-item><p id="P113">for some sentences <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M288"><mml:mrow><mml:mi>&#x03D5;</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="M289"><mml:mrow><mml:mi>&#x03C8;</mml:mi></mml:mrow></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:msubsup><mml:mi>L</mml:mi><mml:mn>0</mml:mn><mml:mi mathvariant='script'>A</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M291"><mml:mrow><mml:mi>&#x03C7;</mml:mi><mml:mo>=</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x2228;</mml:mo><mml:mi>&#x03C8;</mml:mi></mml:mrow></mml:math></inline-formula>.</p></list-item>
</list></p>
<p id="P114">A language <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M292"><mml:mrow><mml:msubsup><mml:mi>L</mml:mi><mml:mn>1</mml:mn><mml:mi mathvariant='script'>A</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula> has <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M293"><mml:mi mathvariant='script'>A</mml:mi></mml:math></inline-formula> and its logical vocabulary and an additional unary operator <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M294"><mml:mrow><mml:msub><mml:mo>&#x22C4;</mml:mo><mml:mi>e</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M295"><mml:mrow><mml:mi mathvariant='italic'>might</mml:mi></mml:mrow></mml:math></inline-formula>.</p>
<disp-quote id="Q8">
<p id="P115">A string of symbols <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M296"><mml:mrow><mml:mi>&#x03C7;</mml:mi></mml:mrow></mml:math></inline-formula> is a sentence of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M297"><mml:mrow><mml:msubsup><mml:mi>L</mml:mi><mml:mn>1</mml:mn><mml:mi mathvariant='script'>A</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula> iff for some sentence <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M298"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M299"><mml:mrow><mml:msubsup><mml:mi>L</mml:mi><mml:mn>0</mml:mn><mml:mi mathvariant='script'>A</mml:mi></mml:msubsup><mml:mo>&#x2009;</mml:mo><mml:mi>&#x03C7;</mml:mi><mml:mo>=</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula> or <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M300"><mml:mrow><mml:mi>&#x03C7;</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mo>&#x22C4;</mml:mo><mml:mi>e</mml:mi></mml:msub><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula></p>
</disp-quote>
<p id="P116"><bold>Definition 2 (The Space of Possible Worlds,</bold> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M301"><mml:mrow><mml:mi mathvariant='bold-italic'>W</mml:mi></mml:mrow></mml:math></inline-formula><bold>)</bold> Let <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M302"><mml:mrow><mml:mi>W</mml:mi></mml:mrow></mml:math></inline-formula> be the set of all possible worlds, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M303"><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:math></inline-formula>. Each possible world <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M304"><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:math></inline-formula> is an atomic valuation, a function from every atomic sentence in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M305"><mml:mi mathvariant='script'>A</mml:mi></mml:math></inline-formula> to one truth value <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M306"><mml:mrow><mml:mo>(</mml:mo><mml:mn mathvariant='bold'>1</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant='bold'>0</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>.</p>
<p id="P117"><bold>Definition 3 (Truth Sets/Propositions)</bold> For <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M307"><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant='script'>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="M308"><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>p</mml:mi></mml:mfenced></mml:mrow></mml:mrow><mml:mi>M</mml:mi></mml:msup><mml:mo>=</mml:mo><mml:mrow><mml:mfenced close="}" open="{"><mml:mrow><mml:mi>w</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>W</mml:mi><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mi>w</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>p</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula>. <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M309"><mml:mrow><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>p</mml:mi></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula> is a set of possible worlds in which <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M310"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula> is true. (A model <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M311"><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:math></inline-formula> will be omitted for simplicity.)</p>
<p id="P118"><bold>Definition 4 (Information State)</bold> (i) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M312"><mml:mrow><mml:mo>&#x03C3;</mml:mo></mml:mrow></mml:math></inline-formula> is an <italic>information state</italic> iff <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M313"><mml:mrow><mml:mi>&#x03C3;</mml:mi><mml:mo>&#x2286;</mml:mo><mml:mi>W</mml:mi></mml:mrow></mml:math></inline-formula>; (ii) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M314"><mml:mrow><mml:mi mathvariant='bold'>0</mml:mi></mml:mrow></mml:math></inline-formula>, <italic>the minimal state</italic>, is the information state given by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M315"><mml:mrow><mml:mi>W</mml:mi></mml:mrow></mml:math></inline-formula>; (iii) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M316"><mml:mrow><mml:mi mathvariant='bold'>1</mml:mi></mml:mrow></mml:math></inline-formula>, <italic>the absurd state</italic>, is the information state given by the empty set.</p>
<p id="P119">For any sentence <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M317"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M318"><mml:mrow><mml:mi mathvariant='bold'>1</mml:mi><mml:mo>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>]</mml:mo><mml:mo>=</mml:mo><mml:mi mathvariant='bold'>1</mml:mi></mml:mrow></mml:math></inline-formula>. That means, in the absurd state every sentence is accepted, but no sentence is acceptable.</p>
<p id="P120"><bold>Definition 5 (Update System)</bold> An update system is a triple <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M319"><mml:mrow><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi>L</mml:mi><mml:mo>,</mml:mo><mml:mi>&#x03A3;</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mo>&#x2217;</mml:mo><mml:mo>]</mml:mo></mml:mrow></mml:mrow></mml:mfenced></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="M320"><mml:mrow><mml:mi>L</mml:mi></mml:mrow></mml:math></inline-formula> is a language, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M321"><mml:mi>&#x03A3;</mml:mi></mml:math></inline-formula> is a set of information states, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M322"><mml:mrow><mml:mo>&#x03C3;</mml:mo></mml:mrow></mml:math></inline-formula>, each of which is a subset of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M323"><mml:mrow><mml:mi>W</mml:mi></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M324"><mml:mrow><mml:mo>[</mml:mo><mml:mo>*</mml:mo><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> is an update function. For any system <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M325"><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:math></inline-formula>, an update function <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M326"><mml:mrow><mml:mo>[</mml:mo><mml:mo>*</mml:mo><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> is a function from a sentence of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M327"><mml:mrow><mml:mi>L</mml:mi></mml:mrow></mml:math></inline-formula> to functions from information states to information states in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M328"><mml:mi>&#x03A3;</mml:mi></mml:math></inline-formula>.</p>
<p id="P121"><bold>Definition 6 (Update Function)</bold> For <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M329"><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant='script'>A</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="M330"><mml:mrow><mml:mi>&#x03D5;</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="M331"><mml:mrow><mml:mi>&#x03C8;</mml:mi></mml:mrow></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M332"><mml:mrow><mml:msubsup><mml:mi>L</mml:mi><mml:mn>0</mml:mn><mml:mi mathvariant='script'>A</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula>, any sentence <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M333"><mml:mrow><mml:mi>&#x03C7;</mml:mi></mml:mrow></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M334"><mml:mrow><mml:msubsup><mml:mi>L</mml:mi><mml:mn>1</mml:mn><mml:mi mathvariant='script'>A</mml:mi></mml:msubsup></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="M335"><mml:mrow><mml:mi>&#x03C7;</mml:mi><mml:mo>=</mml:mo><mml:mi>p</mml:mi><mml:mo>;</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>;</mml:mo><mml:mo>=</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>;</mml:mo><mml:mo>=</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x2228;</mml:mo><mml:mi>&#x03C8;</mml:mi></mml:mrow></mml:math></inline-formula>; or <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M336"><mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mo>&#x22C4;</mml:mo><mml:mi>e</mml:mi></mml:msub><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>. For any <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M337"><mml:mrow><mml:mi>&#x03C7;</mml:mi></mml:mrow></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M338"><mml:mrow><mml:msubsup><mml:mi>L</mml:mi><mml:mn>1</mml:mn><mml:mi mathvariant='script'>A</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula> and an information state <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M339"><mml:mrow><mml:mo>&#x03C3;</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:mo>&#x03C3;</mml:mo><mml:mo>[</mml:mo><mml:mi>&#x03C7;</mml:mi><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> is determined as follows:
<disp-formula id="FD2"><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M341">
<mml:mrow><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mi>p</mml:mi><mml:mo>]</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mo>&#x2229;</mml:mo><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>p</mml:mi></mml:mfenced></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant='script'>A</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="FD3">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M342">
<mml:mrow><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>]</mml:mo></mml:mrow></mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="FD4">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M343">
<mml:mrow><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mi>&#x03C8;</mml:mi></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>]</mml:mo></mml:mrow></mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="FD5">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M344">
<mml:mrow><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x2228;</mml:mo><mml:mi>&#x03C8;</mml:mi></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>]</mml:mo></mml:mrow><mml:mo>&#x222A;</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>]</mml:mo></mml:mrow></mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="FD6">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M345">
<mml:mrow><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mo>&#x22C4;</mml:mo><mml:mi>e</mml:mi></mml:msub><mml:mi>&#x03D5;</mml:mi></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable columnalign='left'><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mi>&#x03C3;</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x2009;</mml:mo><mml:mtext>if</mml:mtext><mml:mo>&#x2009;</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>]</mml:mo></mml:mrow><mml:mo>&#x2260;</mml:mo><mml:mtext>1</mml:mtext><mml:mo>;</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mtext>1</mml:mtext><mml:mo>,</mml:mo><mml:mo>&#x2009;</mml:mo><mml:mtext>if</mml:mtext><mml:mo>&#x2009;</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>]</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mtext>1</mml:mtext><mml:mo>.</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:mrow>
</mml:math>
</disp-formula></p>
<p id="P122">While updating the information state <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M346"><mml:mrow><mml:mo>&#x03C3;</mml:mo></mml:mrow></mml:math></inline-formula> with <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M347"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula> has the effect of excluding all <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M348"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>-worlds from <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M349"><mml:mrow><mml:mo>&#x03C3;</mml:mo></mml:mrow></mml:math></inline-formula>, the function of epistemic modal statement behaves like a test. Updating <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M350"><mml:mrow><mml:mo>&#x03C3;</mml:mo></mml:mrow></mml:math></inline-formula> with <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M351"><mml:mrow><mml:msub><mml:mo>&#x22C4;</mml:mo><mml:mi>e</mml:mi></mml:msub><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula> returns <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M352"><mml:mrow><mml:mo>&#x03C3;</mml:mo></mml:mrow></mml:math></inline-formula>, if there is at least one <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M353"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>-world in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M354"><mml:mrow><mml:mo>&#x03C3;</mml:mo></mml:mrow></mml:math></inline-formula>; otherwise, it is an absurd state, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M355"><mml:mrow><mml:mi mathvariant='bold'>1</mml:mi></mml:mrow></mml:math></inline-formula>, given by the empty set.</p>
<p id="P123">Another central idea of a dynamic framework is the notion of acceptance. <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M356"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula> is accepted in an information state <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M357"><mml:mrow><mml:mo>&#x03C3;</mml:mo></mml:mrow></mml:math></inline-formula> when updating <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M358"><mml:mrow><mml:mo>&#x03C3;</mml:mo></mml:mrow></mml:math></inline-formula> with <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M359"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula> does not change <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M360"><mml:mrow><mml:mo>&#x03C3;</mml:mo></mml:mrow></mml:math></inline-formula>: <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M361"><mml:mrow><mml:mo>&#x03C3;</mml:mo><mml:mo>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>]</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x03C3;</mml:mo></mml:mrow></mml:math></inline-formula>. In other words, such <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M362"><mml:mrow><mml:mo>&#x03C3;</mml:mo></mml:mrow></mml:math></inline-formula> supports <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M363"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>; <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M364"><mml:mrow><mml:mo>&#x03C3;</mml:mo></mml:mrow></mml:math></inline-formula> is called <italic>the fixed point</italic> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M365"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>.</p>
<p id="P124"><bold>Definition 7 (Acceptance)</bold>
<disp-formula id="FD7">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M366">
<mml:mrow><mml:mi>&#x03C3;</mml:mi><mml:mo>&#x22A9;</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x2009;</mml:mo><mml:mtext>iff</mml:mtext><mml:mo>&#x2009;</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>]</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>&#x03C3;</mml:mi></mml:mrow>
</mml:math>
</disp-formula></p>
<p id="P125">Consequence in a dynamic system can be defined in terms of acceptance as follows.</p>
<p id="P126"><bold>Definition 8 (Dynamic Consequence)</bold></p>
<disp-formula id="FD8">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M367">
<mml:mrow><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>&#x22A8;</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>&#x2009;</mml:mo><mml:mtext>iff</mml:mtext><mml:mo>&#x2009;</mml:mo><mml:mo>&#x2200;</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>&#x03A3;</mml:mi><mml:mo>:</mml:mo><mml:mo>&#x2009;</mml:mo><mml:mtext>if</mml:mtext><mml:mo>&#x2009;</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>&#x2026;</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>]</mml:mo><mml:mo>=</mml:mo><mml:mi>&#x03C3;</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2009;</mml:mo><mml:mtext>then</mml:mtext><mml:mo>&#x2009;</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>]</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mo>.</mml:mo></mml:mrow>
</mml:math>
</disp-formula>
<p id="P127a">This dynamic definition of consequence means that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M368"><mml:mrow><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>&#x22A8;</mml:mo><mml:mi>&#x03C8;</mml:mi></mml:mrow></mml:math></inline-formula>, just in case every state of information which is a fixed point of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M369"><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>]</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>[</mml:mo><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> also supports <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M370"><mml:mrow><mml:mi>&#x03C8;</mml:mi></mml:mrow></mml:math></inline-formula>. The dynamic notion of consequence as the preservation of acceptance is non-monotonic in that it is sensitive to the order of premises.</p>
</sec>
<sec id="S18">
<label>6.2.</label><title>Default Reasoning and Normative Reasoning</title>
<p id="P128"><xref rid="R39" ref-type="bibr">Veltman (1996)</xref> expands this simple model of update semantics to analyze default reasoning with <italic>default rules</italic> expressed by &#x201C;normally (or usually) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M371"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>&#x201D; and <italic>expectations</italic> expressed by &#x201C;presumably <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M372"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>.&#x201D; Default rules, such as &#x201C;normally, ravens are black&#x201D; and &#x201C;normally, cold sores heal in a week by themselves,&#x201D; are descriptive rules that serve to express empirical regularities. They help us get to reasonable expectations or guesses about what will happen. For example, &#x201C;presumably, Julia&#x2019;s new pet raven is black&#x201D;; and &#x201C;presumably, Jake&#x2019;s cold sore will heal in a week.&#x201D; Restricted default rules expressed in the conditional form allow us to make more precise expectations or guesses; for example, &#x201C;if the patients do not get enough lysine from their diet, cold sore remedies normally take more than a week.&#x201D;</p>
<p id="P129">Suppose that <italic>normally</italic> the campus bookstore is busy in the afternoon. Given this knowledge, it is reasonable for one to conclude that <italic>presumably</italic> the campus bookstore is busy this afternoon. Suppose that you have found that it&#x2019;s pretty empty this afternoon. Still you can say, &#x201C;normally, the campus bookstore is busy in the afternoon,&#x201D; but once seeing it&#x2019;s not busy, it is not apt anymore to say, &#x201C;presumably, the campus bookstore is busy.&#x201D; This example instantiates the following characteristic inference patterns between &#x201C;<italic>normally</italic> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M373"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>,&#x201D; &#x201C;<italic>presumably</italic> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M374"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>&#x201D; and &#x201C;<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M375"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>.&#x201D;</p>
<table-wrap id="T15" position="anchor" orientation="portrait">
<table frame="void" rules="none">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="middle">(d1)</td>
<td align="left" valign="middle"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M376"><mml:mrow><mml:mi mathvariant='italic'>Normally</mml:mi><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x22A8;</mml:mo><mml:mi mathvariant='italic'>Presumably</mml:mi><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="middle">(d2)</td>
<td align="left" valign="middle"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M377"><mml:mrow><mml:mi mathvariant='italic'>Normally</mml:mi><mml:mi>&#x03D5;</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x2009;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x22AD;</mml:mo><mml:mi mathvariant='italic'>Presumably</mml:mi><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="middle">(d3)</td>
<td align="left" valign="middle"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M378"><mml:mrow><mml:mi mathvariant='italic'>Normally</mml:mi><mml:mi>&#x03D5;</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x2009;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x22A8;</mml:mo><mml:mi mathvariant='italic'>Normally</mml:mi><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
</table-wrap>
<p id="P133">Suppose that the following conditional default rule holds about the campus bookstore as well: &#x201C;if the campus bookstore is not busy in the afternoon, <italic>normally</italic> there is a school event.&#x201D; You have found that the bookstore is not busy this afternoon. Given these default rules and finding, you can infer: &#x201C;presumably, there is a school event.&#x201D; Again, the default rule, &#x201C;Normally, the campus bookstore is busy in the afternoon&#x201D; holds. The following utterance is true and felicitous to utter:
<disp-quote id="Q9">
<p id="P134">&#x201C;The bookstore is not busy this afternoon. Presumably, there is a school event. However, normally, the campus bookstore is busy in the afternoon.&#x201D;</p>
</disp-quote></p>
<p id="P135">Thus, the following inferences regarding non-conforming cases and conditional default rules are warranted in default reasoning.</p>
<table-wrap id="T16" position="anchor" orientation="portrait">
<table frame="void" rules="none">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" valign="middle">(d4)</td>
<td align="left" valign="middle"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M379"><mml:mrow><mml:mi mathvariant='italic'>Normally</mml:mi><mml:mi>&#x03D5;</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M380"><mml:mrow><mml:mi mathvariant='italic'>Normally</mml:mi><mml:mi>&#x03C8;</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="M381"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x22A8;</mml:mo></mml:mrow></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M382"><mml:mrow><mml:mi mathvariant='italic'>Presumably</mml:mi><mml:mi>&#x03C8;</mml:mi></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left" valign="middle">(d5)</td>
<td align="left" valign="middle"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M383"><mml:mrow><mml:mi mathvariant='italic'>Normally</mml:mi><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M384"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M385"><mml:mrow><mml:mi mathvariant='italic'>Normally</mml:mi><mml:mi>&#x03C8;</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="M386"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x22A8;</mml:mo><mml:mi mathvariant='italic'>Normally</mml:mi><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
</table-wrap>
<p id="P138">The interplay among default rules, expectations and factual judgments in default reasoning is parallel to the one among normative rules, normative judgments and factual judgments in normative reasoning. Accepted default rules generate a pattern of expectations regarding what will more likely happen. Likewise, accepted normative rules generate a pattern of preferences regarding what actions or state of affairs is more desirable. A default rule holds even when a particular occasion or circumstance diverges from what the default rule predicts. Similarly, a normative rule holds even when it is violated on a particular occasion.</p>
<p id="P139">The following inferences using normative rules, normative judgments and factual judgments are naturally warranted in normative reasoning.</p>
<disp-formula id="FD9">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M387">
<mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>n</mml:mtext><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2003;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x22A8;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>J</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="FD10">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M388">
<mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>n2</mml:mtext></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2003;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2009;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x22AD;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>J</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="FD11">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M389">
<mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>n</mml:mtext><mml:mn>3</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2003;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2009;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x22A8;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<disp-formula id="FD12">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M390">
<mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>n</mml:mtext><mml:mn>4</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2003;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2009;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x2009;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x22A8;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>J</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="FD13">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M391">
<mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>n</mml:mtext><mml:mn>5</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2003;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2009;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x2009;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x22A8;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow>
</mml:math>
</disp-formula>
<p id="P140">These two sets of inferences, (d1)&#x2013;(d5) and (n1)&#x2013;(n5), manifest the structural parallelism between default reasoning and normative reasoning and show why it is natural to adapt Veltman&#x2019;s update semantics for default reasoning to model normative reasoning using normative rules and normative judgments.</p>
</sec>
<sec id="S19">
<label>6.3.</label><title>The Dynamic Meanings of Ought-Statements</title>
<p id="P141">To formally represent the distinctive functions of two kinds of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M392"><mml:mrow><mml:mi mathvariant='italic'>ought</mml:mi></mml:mrow></mml:math></inline-formula>-statements in dynamic semantics, we need a <italic>structured</italic> information state that can capture two things: what an agent knows and an agent&#x2019;s normative preference pattern over possibilities. These two attributes of a structured information state can be modeled by a set of possible worlds and a preference ordering pattern over the possible worlds. Now we can articulate the meanings of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M393"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</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="M394"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> in terms of how they contribute to a structured information state <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M395"><mml:mrow><mml:mo>&#x03C3;</mml:mo></mml:mrow></mml:math></inline-formula>. The meaning of a normative rule expressed by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M396"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is its potential to change the preference ordering of possible worlds in the set of all <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M397"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>-worlds of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M398"><mml:mrow><mml:mo>&#x03C3;</mml:mo></mml:mrow></mml:math></inline-formula> in a way that all <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M399"><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>&amp;</mml:mo><mml:mi>&#x03C8;</mml:mi></mml:mrow></mml:math></inline-formula>-worlds are preferred over (or ranked higher than) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M400"><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>&amp;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03C8;</mml:mi></mml:mrow></mml:math></inline-formula>-worlds. On the other hand, the meaning of a normative judgment expressed by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M401"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is its potential to test whether all <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M402"><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>&amp;</mml:mo><mml:mi>&#x03C8;</mml:mi></mml:mrow></mml:math></inline-formula>-worlds are preferred over <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M403"><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>&amp;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03C8;</mml:mi></mml:mrow></mml:math></inline-formula>-worlds in the current information state <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M404"><mml:mrow><mml:mi>&#x03C3;</mml:mi></mml:mrow></mml:math></inline-formula>.</p>
<p id="P142">Before presenting formal definitions let me illustrate what their updates would look like with a diagram.</p>
<fig id="F1" position="float">
<label>Figure 1</label>
<caption>
<title></title>
</caption>
<graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="ergo.1122-f0003.jpg"/>
</fig>
<p id="P143">Suppose that a structured information set <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M405"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> is represented by a set of all possible worlds <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M406"><mml:mrow><mml:mi>W</mml:mi></mml:mrow></mml:math></inline-formula> and no preference ordering. Updating <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M407"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> with a normative rule <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M408"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and a conditional normative rule <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M409"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:math></inline-formula> in order has the effect of generating the preference pattern as in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M410"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, and updating <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M411"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula> has the effect of ruling out all <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M412"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>-worlds as in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M413"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>3</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>. (Again, in diagrams solid-line circles represent sets of possible worlds; the circle an arrow points to is a preferred possibility; and gray dashed-line circles are the sets of possibilities that are ruled by propositional updates.)</p>
<p id="P144">We can easily understand the different types of updates by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M414"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M415"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</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="M416"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula> in this diagram. Updating with a conditional normative rule <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M417"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> generates a new preference pattern in the set of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M418"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>-worlds. These information statements support different normative judgments; in other words, different normative judgments hold as the information state changes. Both <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M419"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M420"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> support <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M421"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, but not <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M422"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>3</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>. Both <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M423"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M424"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>3</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> support the conditional normative judgment <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M425"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>; <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M426"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>3</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> even supports the unconditional normative judgment <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M427"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> because <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M428"><mml:mrow><mml:mi>&#x03C8;</mml:mi></mml:mrow></mml:math></inline-formula>-worlds are the best worlds in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M429"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>3</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>. That means an agent in an information state <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M430"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> or <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M431"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> makes a normative judgment that it ought to be that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M432"><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>); however, an agent in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M433"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>3</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> does not make the normative judgment because the possibility of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M434"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula> is ruled out by what is known (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M435"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>). While adequate normative judgments change as the information state evolves, the normative rule <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M436"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> remains accepted in the information state; that is, all three information states <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M437"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M438"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M439"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>3</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> support <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M440"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>.</p>
<p id="P145">In the next subsection, I will formally present my update semantics for normative reasoning that captures the dynamic meanings of the three types of statements and their interplay summarized in (n1)&#x2013;(n5). The formal strategy of my update semantics for normative reasoning largely follows Veltman&#x2019;s approach with some stylistic modification and simplification because in this paper I do not deal with rules with exceptions.</p>
</sec>
<sec id="S20">
<label>6.4.</label><title>Update Semantics for Normative Reasoning</title>
<p id="P146">The major work we need to do to expand the simple update semantics into update semantics for normative reasoning is to construct a structured information state that can keep track of the changes by both normative rules and factual statements. With a structured information state, we will be able to define the two new operators <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M441"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</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="M442"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> in a way that captures their meanings illustrated with the diagrams and the inference patterns (n1)&#x2013;(n5).</p>
<p id="P147"><bold>Definition 9 (Normative Language</bold> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M443"><mml:mrow><mml:msubsup><mml:mi>L</mml:mi><mml:mn>2</mml:mn><mml:mi mathvariant='script'>A</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula>) Let <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M444"><mml:mi mathvariant='script'>A</mml:mi></mml:math></inline-formula> be a set of atomic sentences, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M445"><mml:mrow><mml:mi>p</mml:mi><mml:mo>,</mml:mo><mml:mi>q</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo></mml:mrow></mml:math></inline-formula>. The language <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M446"><mml:mrow><mml:msubsup><mml:mi>L</mml:mi><mml:mn>0</mml:mn><mml:mi mathvariant='script'>A</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula> has <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M447"><mml:mi mathvariant='script'>A</mml:mi></mml:math></inline-formula>, as its non-logical vocabulary and the logical operators, such as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M448"><mml:mrow><mml:mo>&#x00AC;</mml:mo></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M449"><mml:mrow><mml:mo>&#x2228;</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="M450"><mml:mrow><mml:mo>&#x2227;</mml:mo></mml:mrow></mml:math></inline-formula>, and parentheses,) and (, as its basic logical vocabulary.</p>
<p id="P148">A string of symbols <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M451"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula> is a sentence of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M452"><mml:mrow><mml:msubsup><mml:mi>L</mml:mi><mml:mn>0</mml:mn><mml:mi mathvariant='script'>A</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula> iff
<list list-type="roman-lower" id="L12">
<list-item><p id="P149">for some atomic sentence <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M453"><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant='script'>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="M454"><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>=</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>;</p></list-item>
<list-item><p id="P150">for some sentence <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M455"><mml:mrow><mml:mi>&#x03C8;</mml:mi></mml:mrow></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M456"><mml:mrow><mml:msubsup><mml:mi>L</mml:mi><mml:mn>0</mml:mn><mml:mi mathvariant='script'>A</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M457"><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>=</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03C8;</mml:mi></mml:mrow></mml:math></inline-formula>;</p></list-item>
<list-item><p id="P151">for some sentences <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M458"><mml:mrow><mml:mi>&#x03C8;</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="M459"><mml:mrow><mml:mi>&#x03C7;</mml:mi></mml:mrow></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M460"><mml:mrow><mml:msubsup><mml:mi>L</mml:mi><mml:mn>0</mml:mn><mml:mi mathvariant='script'>A</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M461"><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>=</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mi>&#x03C7;</mml:mi></mml:mrow></mml:math></inline-formula>;</p></list-item>
<list-item><p id="P152">for some sentences <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M462"><mml:mrow><mml:mi>&#x03C8;</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="M463"><mml:mrow><mml:mi>&#x03C7;</mml:mi></mml:mrow></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M464"><mml:mrow><mml:msubsup><mml:mi>L</mml:mi><mml:mn>0</mml:mn><mml:mi mathvariant='script'>A</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M465"><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>=</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>&#x2228;</mml:mo><mml:mi>&#x03C7;</mml:mi></mml:mrow></mml:math></inline-formula>.</p></list-item>
</list></p>
<p id="P153">A language <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M466"><mml:mrow><mml:msubsup><mml:mi>L</mml:mi><mml:mn>2</mml:mn><mml:mi mathvariant='script'>A</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula> has two additional dyadic operators: <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M467"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>(&#x2212;/&#x2212;) and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M468"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> (&#x2212;/&#x2212;).</p>
<disp-quote id="Q10">
<p id="P154">A string of symbols <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M469"><mml:mrow><mml:mi>&#x03C7;</mml:mi></mml:mrow></mml:math></inline-formula> is a sentence of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M470"><mml:mrow><mml:msubsup><mml:mi>L</mml:mi><mml:mn>2</mml:mn><mml:mi mathvariant='script'>A</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula> iff for sentences <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M471"><mml:mrow><mml:mi>&#x03D5;</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="M472"><mml:mrow><mml:mi>&#x03C8;</mml:mi></mml:mrow></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M473"><mml:mrow><mml:msubsup><mml:mi>L</mml:mi><mml:mn>0</mml:mn><mml:mi mathvariant='script'>A</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula>, (i) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M474"><mml:mrow><mml:mi>&#x03C7;</mml:mi><mml:mo>=</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>; or (ii) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M475"><mml:mrow><mml:mi>&#x03C7;</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> or <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M476"><mml:mrow><mml:mi>&#x03C7;</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote>
<p id="P155">In order to introduce a structured information state, we need to define two formal devices: a frame <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M477"><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:math></inline-formula> on <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M478"><mml:mrow><mml:mi>W</mml:mi></mml:mrow></mml:math></inline-formula> and a preference pattern <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M479"><mml:mrow><mml:mi>N</mml:mi><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> on <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M480"><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:math></inline-formula>.</p>
<p id="P156"><bold>Definition 10 (Frame)</bold> Let <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M481"><mml:mrow><mml:mi>W</mml:mi></mml:mrow></mml:math></inline-formula> be the power set of the set <italic>A</italic> of atomic sentences. A frame <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M482"><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:math></inline-formula> on <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M483"><mml:mrow><mml:mi>W</mml:mi></mml:mrow></mml:math></inline-formula> is a function assigning a preference pattern <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M484"><mml:mrow><mml:mi>N</mml:mi><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> on <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M485"><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:math></inline-formula> for every <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M486"><mml:mrow><mml:mi>d</mml:mi><mml:mo>&#x2286;</mml:mo><mml:mi>W</mml:mi></mml:mrow></mml:math></inline-formula>.</p>
<p id="P157"><bold>Definition 11 (Preference Pattern)</bold> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M487"><mml:mrow><mml:mi>N</mml:mi><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is a preference pattern on <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M488"><mml:mrow><mml:mi>d</mml:mi><mml:mo>&#x2286;</mml:mo><mml:mi>W</mml:mi></mml:mrow></mml:math></inline-formula> iff <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M489"><mml:mrow><mml:mi>N</mml:mi><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is a reflexive and transitive relation on <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M490"><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:math></inline-formula>.</p>
<p id="P158">A non-trivial normative preference pattern <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M491"><mml:mrow><mml:mi>N</mml:mi><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> on <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M492"><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:math></inline-formula> systematically encodes the accepted normative rules relevant to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M493"><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:math></inline-formula>. The accepted normative rules relevant to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M494"><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:math></inline-formula> gives a set of propositions that determines the preference ranking over possible worlds in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M495"><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:math></inline-formula> like an ordering source <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M496"><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:math></inline-formula> does in ordering semantics. The set of relevant normative rules to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M497"><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:math></inline-formula> includes all normative rules regarding the supersets of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M498"><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:math></inline-formula>. Consider a normative preference pattern <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M499"><mml:mrow><mml:mi>N</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>&#x03D5;</mml:mi></mml:mfenced><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> on <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M500"><mml:mrow><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>&#x03D5;</mml:mi></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula> which is determined by the set of accepted normative rules relevant to situations where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M501"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula> holds. The set of normative rules that are relevant to the situation where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M502"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula> holds are: <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M503"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mi>&#x03C8;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>/</mml:mo><mml:mi>&#x03C7;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M504"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mi>&#x03C8;</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>/</mml:mo><mml:mi>&#x03C7;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, &#x2026;, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M505"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mi>&#x03C8;</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>/</mml:mo><mml:mi>&#x03C7;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> for any <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M506"><mml:mrow><mml:mi>&#x03C7;</mml:mi></mml:mrow></mml:math></inline-formula> such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M507"><mml:mrow><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>&#x03C7;</mml:mi></mml:mfenced></mml:mrow><mml:mo>&#x2287;</mml:mo><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>&#x03D5;</mml:mi></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula>. For example, both Sue&#x2019;s moral duty not to lie and her conditional obligation to apologize if she breaks a promise are the relevant normative rules to the situation where she breaks her promise.</p>
<p id="P159"><bold>Definition 12 (Normative Preference Pattern on</bold> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M508"><mml:mrow><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>&#x03D5;</mml:mi></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula>) For <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M509"><mml:mrow><mml:mi>&#x03C7;</mml:mi></mml:mrow></mml:math></inline-formula> such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M510"><mml:mrow><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>&#x03C7;</mml:mi></mml:mfenced></mml:mrow><mml:mo>&#x2287;</mml:mo><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>&#x03D5;</mml:mi></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M511"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mi>&#x03C8;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>/</mml:mo><mml:mi>&#x03C7;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M512"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mi>&#x03C8;</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>/</mml:mo><mml:mi>&#x03C7;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, &#x2026;, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M513"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mi>&#x03C8;</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>/</mml:mo><mml:mi>&#x03C7;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> are the normative rules applied to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M514"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula> -situations. Let <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M515"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>&#x03D5;</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> be the set of all propositions that are expected to be fulfilled given the normative rules relevant to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M516"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>-situations: <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M517"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>&#x03D5;</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mo>{</mml:mo><mml:msub><mml:mi>&#x03C8;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03C8;</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:msub><mml:mi>&#x03C8;</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>}</mml:mo></mml:mrow></mml:math></inline-formula>.</p>
<disp-quote id="Q11">
<p id="P160"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M518"><mml:mrow><mml:mi>N</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>&#x03D5;</mml:mi></mml:mfenced></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mfenced close="}" open="{"><mml:mrow><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mrow></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula> for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M519"><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>&#x03D5;</mml:mi></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula>, every proposition in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M520"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>&#x03D5;</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> that holds in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M521"><mml:mrow><mml:mi>v</mml:mi></mml:mrow></mml:math></inline-formula> also holds in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M522"><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:math></inline-formula>}</p>
</disp-quote>
<p id="P161">A preference pattern <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M523"><mml:mrow><mml:mi>N</mml:mi><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is defined by a set of pairs of possible words; when <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M524"><mml:mrow><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi></mml:mrow></mml:mfenced></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:mi>N</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>, let&#x2019;s write <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M525"><mml:mrow><mml:mi>w</mml:mi><mml:msub><mml:munder accentunder='true'><mml:mo>&#x227A;</mml:mo><mml:mo>_</mml:mo></mml:munder><mml:mrow><mml:mi>N</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msub><mml:mi>v</mml:mi></mml:mrow></mml:math></inline-formula>. It reads: <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M526"><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:math></inline-formula> fulfills as many relevant normative rules as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M527"><mml:mrow><mml:mi>v</mml:mi></mml:mrow></mml:math></inline-formula> does.</p>
<p id="P162"><bold>Definition 13 (Structured Information State</bold> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M528"><mml:mrow><mml:mi mathvariant='bold'>&#x03C3;</mml:mi></mml:mrow></mml:math></inline-formula><bold>)</bold> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M529"><mml:mrow><mml:mo>&#x03C3;</mml:mo></mml:mrow></mml:math></inline-formula> is a structured information state defined by a pair of a frame <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M530"><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:math></inline-formula> and a set of possible worlds, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M531"><mml:mrow><mml:mi>s</mml:mi><mml:mo>&#x2286;</mml:mo><mml:mi>W</mml:mi></mml:mrow></mml:math></inline-formula>: <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M532"><mml:mrow><mml:mi>&#x03C3;</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi>N</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
<list list-type="roman-lower" id="L13">
<list-item><p id="P163">An information state <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M533"><mml:mrow><mml:mi>&#x03C3;</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi>N</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula> is coherent, where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M534"><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:math></inline-formula> is a non-empty subset set of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M535"><mml:mrow><mml:mi>W</mml:mi></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M536"><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:math></inline-formula> is a coherent frame on <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M537"><mml:mrow><mml:mi>W</mml:mi></mml:mrow></mml:math></inline-formula>;</p></list-item>
<list-item><p id="P164">The minimal state <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M538"><mml:mrow><mml:mn mathvariant='bold'>0</mml:mn><mml:mo>=</mml:mo><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mi>W</mml:mi></mml:mrow></mml:mfenced></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="M539"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mfenced close="}" open="{"><mml:mrow><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi></mml:mrow></mml:mfenced></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>d</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula> for every <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M540"><mml:mrow><mml:mi>d</mml:mi><mml:mo>&#x2286;</mml:mo><mml:mi>W</mml:mi></mml:mrow></mml:math></inline-formula>;</p></list-item>
<list-item><p id="P165">The absurd state <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M541"><mml:mrow><mml:mn mathvariant='bold'>1</mml:mn><mml:mo>=</mml:mo><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x00D8;</mml:mo></mml:mrow></mml:mfenced></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="M542"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mfenced close="}" open="{"><mml:mrow><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>w</mml:mi></mml:mrow></mml:mfenced></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mi>w</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>d</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula> for every <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M543"><mml:mrow><mml:mi>d</mml:mi><mml:mo>&#x2286;</mml:mo><mml:mi>W</mml:mi></mml:mrow></mml:math></inline-formula>.<sup><xref rid="fn25" ref-type="fn">20</xref></sup></p></list-item>
</list>
<p id="P166">Interestingly, the notion of a structured information state in my update semantics is comparable to the way that ordering semantics uses two contextual parameters. In this system, an information state <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M544"><mml:mrow><mml:mo>&#x03C3;</mml:mo></mml:mrow></mml:math></inline-formula> is defined by a pair of a preference frame <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M545"><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:math></inline-formula> and a set of accessible possible worlds <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M546"><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:math></inline-formula>: <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M547"><mml:mrow><mml:mi>&#x03C3;</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi>N</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula>. <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M548"><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:math></inline-formula> is comparable to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M549"><mml:mrow><mml:mo>&#x2229;</mml:mo><mml:mi>f</mml:mi><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and the role of a preference frame <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M550"><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:math></inline-formula> is comparable to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M551"><mml:mrow><mml:mi>g</mml:mi><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> in ordering semantics.</p>
<p id="P167"><bold>Definition 14 (Refinement of Preference Pattern)</bold> Let <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M552"><mml:mrow><mml:mi>N</mml:mi><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mo>)</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="M553"><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x2032;</mml:mo><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> be preference patterns on <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M554"><mml:mrow><mml:mi>d</mml:mi><mml:mo>&#x2286;</mml:mo><mml:mi>W</mml:mi></mml:mrow></mml:math></inline-formula>.</p>
<list list-type="roman-lower" id="L14">
<list-item><p id="P168"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M555"><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x2032;</mml:mo><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is a refinement of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M556"><mml:mrow><mml:mi>N</mml:mi><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> iff <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M557"><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x2032;</mml:mo><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mo>)</mml:mo><mml:mo>&#x2286;</mml:mo><mml:mi>N</mml:mi><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>;</p></list-item>
<list-item><p id="P169"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M558"><mml:mrow><mml:mi>N</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2218;</mml:mo><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>p</mml:mi></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula> is a refinement of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M559"><mml:mrow><mml:mi>N</mml:mi><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> with the proposition <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M560"><mml:mrow><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>p</mml:mi></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula>;</p>
<p id="P170"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M561"><mml:mrow><mml:mi>N</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2218;</mml:mo><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>p</mml:mi></mml:mfenced></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mfenced close="}" open="{"><mml:mrow><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi></mml:mrow></mml:mfenced></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:mi>N</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mtext>if</mml:mtext><mml:mo>&#x2009;</mml:mo><mml:mi>v</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>p</mml:mi></mml:mfenced></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2009;</mml:mo><mml:mtext>then</mml:mtext><mml:mo>&#x2009;</mml:mo><mml:mi>w</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>p</mml:mi></mml:mfenced></mml:mrow></mml:mrow></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula>.</p></list-item>
</list>
<p id="P171">The notion of refinement allows us to capture the change in a preference pattern when accepting a normative rule expressed by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M562"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. Consider, for example, Sue&#x2019;s moral duty to keep her promise (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M563"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>p</mml:mi><mml:mo>/</mml:mo><mml:mo>&#x22A4;</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>) and her conditional moral duty to apologize if she does not keep her promise (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M564"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>a</mml:mi><mml:mo>/</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>p</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>). Accepting <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M565"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>p</mml:mi><mml:mo>/</mml:mo><mml:mo>&#x22A4;</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> has the effect of ranking all <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M566"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>-worlds over <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M567"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>-worlds. Accepting <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M568"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>a</mml:mi><mml:mo>/</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>p</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> has the effect of ranking all <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M569"><mml:mrow><mml:mi>a</mml:mi><mml:mo>&amp;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>-worlds over <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M570"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>a</mml:mi><mml:mo>&amp;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>-worlds. These effects on a preference pattern by accepting normative rules are expressed in terms of the refinements of a preference pattern.</p>
<disp-quote id="Q12">
<p id="P172">Accepting <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M571"><mml:mrow><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mo>/</mml:mo><mml:mo>&#x22A4;</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>:</mml:mo><mml:mi>N</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>W</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2218;</mml:mo><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>p</mml:mi></mml:mfenced></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mfenced close="}" open="{"><mml:mrow><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi></mml:mrow></mml:mfenced></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:mi>N</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>W</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>&#x2009;</mml:mo><mml:mtext>if</mml:mtext><mml:mo>&#x2009;</mml:mo><mml:mi>v</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>p</mml:mi></mml:mfenced></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2009;</mml:mo><mml:mi>w</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>p</mml:mi></mml:mfenced></mml:mrow></mml:mrow></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
<p id="P173">Accepting <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M572"><mml:mrow><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi>a</mml:mi><mml:mo>/</mml:mo><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>:</mml:mo><mml:mi>N</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2218;</mml:mo><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>a</mml:mi></mml:mfenced></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mfenced close="}" open="{"><mml:mrow><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi></mml:mrow></mml:mfenced></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:mi>N</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo stretchy="false">&#x007C;</mml:mo><mml:mo>&#x2009;</mml:mo><mml:mtext>if</mml:mtext><mml:mo>&#x2009;</mml:mo><mml:mi>v</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>a</mml:mi></mml:mfenced></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2009;</mml:mo><mml:mi>w</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>a</mml:mi></mml:mfenced></mml:mrow></mml:mrow></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote>
<p id="P174">We can also define the notion of refinement of a frame and its coherence as follows.</p>
<p id="P175"><bold>Definition 15 (Refinement of Frame)</bold> Let <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M573"><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M574"><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x2032;</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="M575"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>&#x03C8;</mml:mi></mml:msub><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula> be frames on <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M576"><mml:mrow><mml:mi>W</mml:mi></mml:mrow></mml:math></inline-formula>.</p>
<list list-type="roman-lower" id="L15">
<list-item><p id="P176">The frame <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M577"><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x2032;</mml:mo></mml:mrow></mml:math></inline-formula> is a refinement of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M578"><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:math></inline-formula> iff <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M579"><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x2032;</mml:mo><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mo>)</mml:mo><mml:mo>&#x2286;</mml:mo><mml:mi>N</mml:mi><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> for every <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M580"><mml:mrow><mml:mi>d</mml:mi><mml:mo>&#x2286;</mml:mo><mml:mi>W</mml:mi></mml:mrow></mml:math></inline-formula>.</p></list-item>
<list-item><p id="P177">The frame <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M581"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>&#x03C8;</mml:mi></mml:msub><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula> is the refinement of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M582"><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:math></inline-formula> such that for any <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M583"><mml:mrow><mml:mi>d</mml:mi><mml:mo>&#x2286;</mml:mo><mml:mi>W</mml:mi></mml:mrow></mml:math></inline-formula>,
<list list-type="alpha-lower" id="L16">
<list-item><p id="P178">If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M584"><mml:mrow><mml:mi>d</mml:mi><mml:mo>&#x2260;</mml:mo><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>&#x03D5;</mml:mi></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M585"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>&#x03C8;</mml:mi></mml:msub><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula> assigns <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M586"><mml:mrow><mml:mi>N</mml:mi><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M587"><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:math></inline-formula>; and</p></list-item>
<list-item><p id="P179">If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M588"><mml:mrow><mml:mi>d</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>&#x03D5;</mml:mi></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M589"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>&#x03C8;</mml:mi></mml:msub><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula> assigns <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M590"><mml:mrow><mml:mi>N</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>&#x03D5;</mml:mi></mml:mfenced></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2218;</mml:mo><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>&#x03C8;</mml:mi></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula> to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M591"><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:math></inline-formula>.</p></list-item>
</list></p></list-item>
</list>
<p id="P180"><bold>Definition 16 (Ideal and Optimal Worlds)</bold></p>
<list list-type="roman-lower" id="L17">
<list-item><p id="P181"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M592"><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:math></inline-formula> is an <italic>ideal</italic> world in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M593"><mml:mrow><mml:mi>&#x03C3;</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi>N</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula>, iff <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M594"><mml:mrow><mml:mi>w</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>W</mml:mi></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M595"><mml:mrow><mml:mi>w</mml:mi><mml:msub><mml:mo>&#x227C;</mml:mo><mml:mrow><mml:mi>N</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>w</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msub><mml:mi>v</mml:mi></mml:mrow></mml:math></inline-formula> for every <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M596"><mml:mrow><mml:mi>v</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>W</mml:mi></mml:mrow></mml:math></inline-formula>.</p></list-item>
<list-item><p id="P182"><bold><italic>Ideal</italic></bold> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M597"><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi>N</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is the set of all ideal worlds in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M598"><mml:mrow><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi>N</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula>.</p></list-item>
<list-item><p id="P183"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M599"><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:math></inline-formula> is a <italic>optimal</italic> world in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M600"><mml:mrow><mml:mi>&#x03C3;</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi>N</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula> iff <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M601"><mml:mrow><mml:mi>w</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:math></inline-formula> and there is no <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M602"><mml:mrow><mml:mi>v</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:math></inline-formula> such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M603"><mml:mrow><mml:mi>v</mml:mi><mml:msub><mml:mo>&#x227A;</mml:mo><mml:mrow><mml:mi>N</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>s</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msub><mml:mi>w</mml:mi></mml:mrow></mml:math></inline-formula>.</p></list-item>
<list-item><p id="P184"><bold><italic>Optimal</italic></bold> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M604"><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi>N</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is the set of all optimal worlds in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M605"><mml:mrow><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi>N</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula>.</p></list-item>
</list>
<p id="P185"><bold>Definition 17 (Coherence)</bold> Let <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M606"><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:math></inline-formula> be a frame on <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M607"><mml:mrow><mml:mi>W</mml:mi></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M608"><mml:mrow><mml:mi>d</mml:mi><mml:mo>&#x2286;</mml:mo><mml:mi>W</mml:mi></mml:mrow></mml:math></inline-formula>.</p>
<list list-type="roman-lower" id="L18">
<list-item><p id="P186"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M609"><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:math></inline-formula> is a <italic>best</italic> world in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M610"><mml:mrow><mml:mi>N</mml:mi><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> iff <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M611"><mml:mrow><mml:mi>w</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>d</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="M612"><mml:mrow><mml:mi>w</mml:mi><mml:msub><mml:mo>&#x227C;</mml:mo><mml:mrow><mml:mi>N</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msub><mml:mi>v</mml:mi></mml:mrow></mml:math></inline-formula> for every <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M613"><mml:mrow><mml:mi>v</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>d</mml:mi></mml:mrow></mml:math></inline-formula>.</p></list-item>
<list-item><p id="P187"><bold><italic>Best</italic></bold> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M614"><mml:mrow><mml:mo>(</mml:mo><mml:mi>N</mml:mi><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mo>)</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is the set of all best worlds in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M615"><mml:mrow><mml:mi>N</mml:mi><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>.</p></list-item>
<list-item><p id="P188"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M616"><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:math></inline-formula> is <italic>coherent</italic> iff for every non-empty <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M617"><mml:mrow><mml:mi>d</mml:mi><mml:mo>&#x2286;</mml:mo><mml:mi>W</mml:mi></mml:mrow></mml:math></inline-formula>, <bold><italic>Best</italic></bold> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M618"><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>N</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2260;</mml:mo><mml:mo>&#x2205;</mml:mo></mml:mrow></mml:math></inline-formula>.</p></list-item>
</list>
<p id="P189">Using these new devices now we can define the dynamic meanings of sentences in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M619"><mml:mrow><mml:msubsup><mml:mi>L</mml:mi><mml:mn>2</mml:mn><mml:mi mathvariant='script'>A</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula>.</p>
<p id="P190"><bold>Definition 18 (Update Function for Structured Information States)</bold> Any sentence <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M620"><mml:mrow><mml:mi>&#x03C7;</mml:mi></mml:mrow></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M621"><mml:mrow><mml:msubsup><mml:mi>L</mml:mi><mml:mn>2</mml:mn><mml:mi mathvariant='script'>A</mml:mi></mml:msubsup></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="M622"><mml:mrow><mml:mi>&#x03C7;</mml:mi><mml:mo>=</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>;</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo><mml:mo>;</mml:mo></mml:mrow></mml:math></inline-formula> or <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M623"><mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M624"><mml:mrow><mml:mi>&#x03D5;</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="M625"><mml:mrow><mml:mi>&#x03C8;</mml:mi></mml:mrow></mml:math></inline-formula> in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M626"><mml:mrow><mml:msubsup><mml:mi>L</mml:mi><mml:mn>0</mml:mn><mml:mi mathvariant='script'>A</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula>. For every sentence <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M627"><mml:mrow><mml:mi>&#x03C7;</mml:mi></mml:mrow></mml:math></inline-formula> of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M628"><mml:mrow><mml:msubsup><mml:mi>L</mml:mi><mml:mn>2</mml:mn><mml:mi mathvariant='script'>A</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula> and an information state <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M629"><mml:mrow><mml:mi>&#x03C3;</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi>N</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M630"><mml:mrow><mml:mo>&#x03C3;</mml:mo><mml:mo>[</mml:mo><mml:mi>&#x03C7;</mml:mi><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> is determined as follows:
<list list-type="roman-lower" id="L19">
<list-item><p id="P191">If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M631"><mml:mrow><mml:mi>&#x03C7;</mml:mi><mml:mo>=</mml:mo><mml:mi>&#x03D5;</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="M632"><mml:mrow><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03C7;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi>N</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mi>&#x03C7;</mml:mi><mml:mo>]</mml:mo></mml:mrow></mml:mrow></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula>, provided that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M633"><mml:mrow><mml:mi>s</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mi>&#x03C7;</mml:mi><mml:mo>]</mml:mo></mml:mrow><mml:mo>&#x2260;</mml:mo><mml:mo>&#x2205;</mml:mo></mml:mrow></mml:math></inline-formula>.</p></list-item>
<list-item><p id="P192">If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M634"><mml:mrow><mml:mi>&#x03C7;</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M635"><mml:mrow><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>[</mml:mo> <mml:mi>&#x03C7;</mml:mi> <mml:mo>]</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"> <mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mrow><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mi>s</mml:mi></mml:mrow> </mml:mfenced></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="M636"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>&#x03C8;</mml:mi></mml:msub><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula> is coherent and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M637"><mml:mrow><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>&#x03D5;</mml:mi></mml:mfenced></mml:mrow><mml:mo>&#x2229;</mml:mo><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>&#x03C8;</mml:mi></mml:mfenced></mml:mrow><mml:mo>&#x2260;</mml:mo><mml:mo>&#x2205;</mml:mo></mml:mrow></mml:math></inline-formula>; <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M638"><mml:mrow><mml:mn mathvariant='bold'>1</mml:mn></mml:mrow></mml:math></inline-formula>, otherwise.<sup><xref rid="fn26" ref-type="fn">21</xref></sup></p></list-item>
<list-item><p id="P193">If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M639"><mml:mrow><mml:mi>&#x03C7;</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M640"><mml:mrow><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mi>&#x03C7;</mml:mi><mml:mo>]</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable columnalign='left'><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mi>&#x03C3;</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:mtd><mml:mtd columnalign='left'><mml:mrow><mml:mtext>if</mml:mtext><mml:mo>&#x2009;</mml:mo><mml:mi mathvariant='bold-italic'>Optimal</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi>N</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>]</mml:mo></mml:mrow></mml:mrow></mml:mfenced></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2286;</mml:mo><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>&#x03C8;</mml:mi></mml:mfenced></mml:mrow><mml:mo>;</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mtext>1</mml:mtext><mml:mo>,</mml:mo></mml:mrow></mml:mtd><mml:mtd columnalign='left'><mml:mrow><mml:mtext>otherwise</mml:mtext></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula></p></list-item>
</list></p>
<p id="P194">Note that updating <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M641"><mml:mrow><mml:mi>&#x03C3;</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi>N</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula> with <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M642"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> amounts to refining the frame <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M643"><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:math></inline-formula>. Updating <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M644"><mml:mrow><mml:mo>&#x03C3;</mml:mo></mml:mrow></mml:math></inline-formula> with <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M645"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> amounts to testing whether the optimal worlds (most preferred worlds) in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M646"><mml:mrow><mml:mi>s</mml:mi><mml:mo>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> given <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M647"><mml:mrow><mml:mi>N</mml:mi><mml:mo>(</mml:mo><mml:mi>s</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> are <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M648"><mml:mrow><mml:mi>&#x03C8;</mml:mi></mml:mrow></mml:math></inline-formula>-worlds. The update semantics is designed to capture an information state <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M649"><mml:mrow><mml:mi>&#x03C3;</mml:mi></mml:mrow></mml:math></inline-formula> changes when an agent in an information state <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M650"><mml:mrow><mml:mi>&#x03C3;</mml:mi></mml:mrow></mml:math></inline-formula> accepts <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M651"><mml:mrow><mml:mi>&#x03D5;</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="M652"><mml:mrow><mml:mo>&#x03C3;</mml:mo><mml:mo>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>]</mml:mo><mml:mo>&#x2260;</mml:mo><mml:mn mathvariant='bold'>1</mml:mn></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M653"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula> is acceptable in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M654"><mml:mrow><mml:mo>&#x03C3;</mml:mo></mml:mrow></mml:math></inline-formula>; if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M655"><mml:mrow><mml:mo>&#x03C3;</mml:mo><mml:mo>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>]</mml:mo><mml:mo>=</mml:mo><mml:mn mathvariant='bold'>1</mml:mn></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M656"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula> is not acceptable in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M657"><mml:mrow><mml:mo>&#x03C3;</mml:mo></mml:mrow></mml:math></inline-formula>. Likewise, a normative rule <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M658"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03C7;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is acceptable only when the resulting refinement of a frame <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M659"><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:math></inline-formula> is coherent.<sup><xref rid="fn27" ref-type="fn">22</xref></sup></p>
<p id="P195">If an agent is in the information state <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M660"><mml:mrow><mml:mo>&#x03C3;</mml:mo><mml:mo>[</mml:mo><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>q</mml:mi><mml:mo>/</mml:mo><mml:mi>p</mml:mi><mml:mo>)</mml:mo><mml:mo>]</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x03C3;</mml:mo></mml:mrow></mml:math></inline-formula>, it is adequate for the agent to accept or make the normative judgment that it ought to be the case that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M661"><mml:mrow><mml:mi>q</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="M662"><mml:mrow><mml:mi>p</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>q</mml:mi><mml:mo>/</mml:mo><mml:mi>p</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>). If an agent is in the information state <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M663"><mml:mrow><mml:mo>&#x03C3;</mml:mo><mml:mo>[</mml:mo><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>q</mml:mi><mml:mo>/</mml:mo><mml:mi>p</mml:mi><mml:mo>)</mml:mo><mml:mo>]</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x03C3;</mml:mo></mml:mrow></mml:math></inline-formula>, it is adequate for the agent to accept or utter a normative rule can be expressed by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M664"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>q</mml:mi><mml:mo>/</mml:mo><mml:mi>p</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>.</p>
<p id="P196">Acceptance, Consequence and Consistency for a structured information state <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M665"><mml:mrow><mml:mo>&#x03C3;</mml:mo></mml:mrow></mml:math></inline-formula> are defined similarly as before.</p>
<p id="P197"><bold>Definition 19 (Acceptance/Support)</bold>
<disp-formula id="FD14">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M666">
<mml:mrow><mml:mi>&#x03C3;</mml:mi><mml:mo>&#x22A9;</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x2009;</mml:mo><mml:mtext>iff</mml:mtext><mml:mo>&#x2009;</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>]</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>&#x03C3;</mml:mi></mml:mrow>
</mml:math>
</disp-formula></p>
<p id="P198"><bold>Definition 20 (Dynamic Consequence)</bold></p>
<p id="P199"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M667"><mml:mrow><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>&#x22A8;</mml:mo><mml:mi>&#x03C8;</mml:mi></mml:mrow></mml:math></inline-formula> iff <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M668"><mml:mrow><mml:mo>&#x2200;</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>&#x03A3;</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="M669"><mml:mrow><mml:mo>&#x03C3;</mml:mo><mml:mo>[</mml:mo><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>]</mml:mo><mml:mo>[</mml:mo><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>]</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>[</mml:mo><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>]</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x03C3;</mml:mo></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M670"><mml:mrow><mml:mo>&#x03C3;</mml:mo><mml:mo>[</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>]</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x03C3;</mml:mo></mml:mrow></mml:math></inline-formula>.</p>
<p id="P200"><bold>Definition 21 (Consistency)</bold></p>
<p id="P201">A sequence of sentences, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M671"><mml:mrow><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is consistent iff <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M672"><mml:mrow><mml:mo>&#x2203;</mml:mo><mml:mo>&#x03C3;</mml:mo><mml:mo>:</mml:mo><mml:mo>&#x03C3;</mml:mo><mml:mo>[</mml:mo><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>]</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>[</mml:mo><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mn>n</mml:mn></mml:msub><mml:mo>]</mml:mo><mml:mo>&#x2260;</mml:mo><mml:mn mathvariant='bold'>1</mml:mn></mml:mrow></mml:math></inline-formula>.</p>
<p id="P202">This updated semantics for normative reasoning licenses the the characteristic inferences in normative reasoning (n1)&#x2013;(n5). This can be shown as follows using acceptance: (n1*)&#x2013;(n5*).</p>
<disp-formula id="FD15">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M673">
<mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>n</mml:mtext><mml:msup><mml:mn>1</mml:mn><mml:mo>&#x2217;</mml:mo></mml:msup></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2009;</mml:mo><mml:mtext mathvariant="bold">O</mml:mtext><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>&#x22A9;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>j</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="FD16">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M674">
<mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>n</mml:mtext><mml:msup><mml:mn>2</mml:mn><mml:mo>&#x2217;</mml:mo></mml:msup></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2009;</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:menclose notation='updiagonalstrike'><mml:mo>&#x22A9;</mml:mo></mml:menclose><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>J</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="FD17">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M675">
<mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>n</mml:mtext><mml:msup><mml:mn>3</mml:mn><mml:mo>&#x2217;</mml:mo></mml:msup></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2009;</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>&#x22A9;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="FD18">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M676">
<mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>n</mml:mtext><mml:msup><mml:mn>4</mml:mn><mml:mo>&#x2217;</mml:mo></mml:msup></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2009;</mml:mo><mml:mtext mathvariant="bold">O</mml:mtext><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>&#x22A9;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>J</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="FD19">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M677">
<mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>n</mml:mtext><mml:msup><mml:mn>5</mml:mn><mml:mo>&#x2217;</mml:mo></mml:msup></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>&#x22A9;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow>
</mml:math>
</disp-formula>
<p id="P203">These inferences show that acceptance is non-monotonic with normative and factual judgments, while normative rules are not sensitive to propositional updates.</p>
<p id="P204">The proposed update semantics validates some versions of Factual Detachment and Deontic Detachment for a coherent information state &#x03C3; that allow us to infer new normative judgments, while new normative rules are not derived from either detachment rules.</p>
<p id="P205"><bold>Factual Detachment</bold>
<disp-formula id="FD20">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M678">
<mml:mrow><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>J</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2009;</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x22A8;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>J</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="FD21">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M679">
<mml:mrow><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2009;</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:menclose notation='updiagonalstrike'><mml:mo>&#x22A8;</mml:mo></mml:menclose><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>J</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow>
</mml:math>
</disp-formula></p>
<p id="P206"><bold>Deontic Detachment</bold>
<disp-formula id="FD22">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M680">
<mml:mrow><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>J</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2009;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>J</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x22A8;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>J</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="FD23">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M681">
<mml:mrow><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2009;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:menclose notation='updiagonalstrike'><mml:mo>&#x22A8;</mml:mo></mml:menclose><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>J</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="FD24">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M682">
<mml:mrow><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2009;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:menclose notation='updiagonalstrike'><mml:mo>&#x22A8;</mml:mo></mml:menclose><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="FD25">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M683">
<mml:mrow><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>J</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2009;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>J</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:menclose notation='updiagonalstrike'><mml:mo>&#x22A8;</mml:mo></mml:menclose><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow>
</mml:math>
</disp-formula></p>
<p id="P207">Agglomeration does not generally hold, but a conjunction of normative judgments is inferable in limited occasions.</p>
<p id="P208"><bold>Agglomeration</bold>
<disp-formula id="FD26">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M684">
<mml:mrow><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>J</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2009;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>J</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x22A8;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>J</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mi>&#x03C8;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="FD27">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M685">
<mml:mrow><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2009;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:menclose notation='updiagonalstrike'><mml:mo>&#x22A8;</mml:mo></mml:menclose><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mi>&#x03C8;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="FD28">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M686">
<mml:mrow><mml:mtext mathvariant="bold">O</mml:mtext><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>&#x22A9;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>J</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mi>&#x03C8;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow>
</mml:math>
</disp-formula></p>
<p id="P209">The two kinds of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M687"><mml:mrow><mml:mi mathvariant='italic'>ought</mml:mi></mml:mrow></mml:math></inline-formula>s in this update semantics for normative reasoning play a critical role in explaining conflicting intuitions about normative inferences. There is no general inference pattern in normative reasoning that allows us to derive new normative rules, while Factual Detachment, Deontic Detachment, and Limited Agglomeration allow us to infer new normative judgments. This result makes sense because an agent can infer what she practically ought to do from a given set of accepted normative rules and what is known, but an agent does not acquire new rules from what is already known to or accepted by her.</p>
<p id="P210">So far I have sketched a simple version of the update semantics for normative reasoning.<sup><xref rid="fn28" ref-type="fn">23</xref></sup> There are some details left to be filled in, but the basic picture of this dynamic approach must be clear enough to illustrate the intuitive and natural distinction between normative rules and normative judgments and solve the CTD Trilemma.</p>
</sec>
<sec id="S21">
<label>6.5.</label><title>A Dynamic Solution to the CTD Trilemma</title>
<p id="P211">Let&#x2019;s see how the update semantics for normative reasoning handles Chisholm&#x2019;s example and solves the CTD Trilemma. We have seen that Jones&#x2019;s predicament in the CTD Situation is most naturally illustrated by the following five statements.</p>
<disp-formula id="FD29">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M688">
<mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>c</mml:mtext><mml:msub><mml:mn>1</mml:mn><mml:mi>R</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2003;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi>h</mml:mi><mml:mo>/</mml:mo><mml:mo>&#x22A4;</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<disp-formula id="FD30">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M689">
<mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>c</mml:mtext><mml:msub><mml:mn>2</mml:mn><mml:mi>R</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2003;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>/</mml:mo><mml:mi>h</mml:mi></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="FD31">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M690">
<mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>c</mml:mtext><mml:msub><mml:mn>3</mml:mn><mml:mi>R</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2003;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mo>/</mml:mo><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="FD32">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M691">
<mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>c</mml:mtext><mml:mn>4</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2003;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi></mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="FD33">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M692">
<mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>c</mml:mtext><mml:msub><mml:mn>5</mml:mn><mml:mi>J</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2003;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>J</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mo>/</mml:mo><mml:mo>&#x22A4;</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow>
</mml:math>
</disp-formula>
<p id="P212">In the update semantics for normative reasoning, accepting the normative rules (c1)&#x2013;(c3) and the factual statement (c4) in the Chisholm set brings about the changes illustrated in the following diagram.</p>
<graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="ergo.1122-f0004.jpg"/>
<p id="P213">In this diagram, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M693"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> is the minimal state <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M694"><mml:mrow><mml:mtext mathvariant="bold">0</mml:mtext><mml:mo>=</mml:mo><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mi>W</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula>. <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M695"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> is the resulting information state of updating (c1)&#x2013;(c4) in the CTD situation:
<disp-formula id="FD34">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M696">
<mml:mrow><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi>h</mml:mi><mml:mo>/</mml:mo><mml:mo>&#x22A4;</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>/</mml:mo><mml:mi>h</mml:mi></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mo>/</mml:mo><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mi>t</mml:mi><mml:mo>]</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mn>4</mml:mn></mml:msub><mml:mo>.</mml:mo></mml:mrow>
</mml:math>
</disp-formula></p>
<p id="P214">The resulting information state <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M697"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> supports not only (c1)&#x2013;(c4), but also (c5) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M698"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M699"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>4</mml:mn></mml:msub><mml:mo>[</mml:mo><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo><mml:mo>]</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> since <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M700"><mml:mrow><mml:mi mathvariant='bold-italic'>Optimal</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mn>4</mml:mn></mml:msub><mml:mo>)</mml:mo><mml:mo>&#x2286;</mml:mo><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula>.<sup><xref rid="fn29" ref-type="fn">24</xref></sup> However, (c6) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M701"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, (c7) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M702"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and (c8) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M703"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> are not supported by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M704"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>. For <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M705"><mml:mrow><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mn>4</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi>N</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M706"><mml:mrow><mml:mi mathvariant='bold-italic'>Optimal</mml:mi><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi>N</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:mfenced></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:menclose notation='updiagonalstrike'><mml:mo>&#x2286;</mml:mo></mml:menclose><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>t</mml:mi></mml:mfenced><mml:mo>,</mml:mo><mml:menclose notation='updiagonalstrike'><mml:mo>&#x2286;</mml:mo></mml:menclose><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mrow><mml:mi>h</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:mfenced></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="M707"><mml:mrow><mml:menclose notation='updiagonalstrike'><mml:mo>&#x2286;</mml:mo></mml:menclose><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
<disp-formula id="FD35">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M708">
<mml:mrow><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mn>4</mml:mn></mml:msub><mml:mo>&#x22A9;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2009;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>/</mml:mo><mml:mi>h</mml:mi></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2009;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mo>/</mml:mo><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2009;</mml:mo><mml:mtext>and</mml:mtext><mml:mo>&#x2009;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi></mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="FD36">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M709">
<mml:mrow><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mn>4</mml:mn></mml:msub><mml:mo>&#x22A9;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>J</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mo>/</mml:mo><mml:mo>&#x22A4;</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="FD37">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M710">
<mml:mrow><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mn>4</mml:mn></mml:msub><mml:menclose notation='updiagonalstrike'><mml:mo>&#x22A9;</mml:mo></mml:menclose><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>J</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2009;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>J</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>h</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2009;</mml:mo><mml:mtext>and</mml:mtext><mml:mo>&#x2009;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>J</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow>
</mml:math>
</disp-formula>
<p id="P215">The structured information state <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M711"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, which is the result of updating the minimal state with (c1)&#x2013;(c4), adequately represents Jones&#x2019;s predicament in the CTD Situation and meets all three desiderata of the CTD Trilemma. Jones&#x2019;s violation of his duty to go to help is expressed by the conjunction <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M712"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo><mml:mo>&#x2227;</mml:mo><mml:mi>&#x00AC;</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula>; and this conjunction is supported by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M713"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>: <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M714"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>4</mml:mn></mml:msub><mml:mo>[</mml:mo><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo><mml:mo>]</mml:mo><mml:mo>[</mml:mo><mml:mi>&#x00AC;</mml:mi><mml:mi>h</mml:mi><mml:mo>]</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>. Second, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M715"><mml:mrow><mml:mo>&#x03C3;</mml:mo><mml:mn>4</mml:mn></mml:mrow></mml:math></inline-formula> supports <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M716"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> since <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M717"><mml:mrow><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>]</mml:mo></mml:mrow><mml:mo>&#x22A9;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>J</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.<sup><xref rid="fn30" ref-type="fn">25</xref></sup> Finally, it is clear why (c6) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M718"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is not supported by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M719"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> and why conjoining <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M720"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</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="M721"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is not legitimate in the update semantics for normative reasoning.</p>
<p id="P216">This dynamic account nicely explains why different normative judgments hold before and after accepting <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M722"><mml:mrow><mml:mi>&#x00AC;</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula>. Using this non-monotonic feature of the update semantics, we can give the temporal and agential explanations to Chisholm&#x2019;s Paradox in the dynamic semantic framework. Before being updated with <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M723"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M724"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>3</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> supports <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M725"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M726"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</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="M727"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. But <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M728"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>4</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>3</mml:mn></mml:msub><mml:mo>[</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> supports none of these three normative judgments. Rather, it supports <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M729"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</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="M730"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x00AC;</mml:mi><mml:mi>h</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. Using this non-monotonic feature of the update semantics, we can also explain why (c1) as a normative judgment <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M731"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>/</mml:mo><mml:mo>&#x22A4;</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is overridden in the Overriding Situation. Suppose an information state <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M732"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>6</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> that supports <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M733"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>/</mml:mo><mml:mo>&#x22A4;</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>: <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M734"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>6</mml:mn></mml:msub><mml:mo>[</mml:mo><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>/</mml:mo><mml:mo>&#x22A4;</mml:mo><mml:mo>)</mml:mo><mml:mo>]</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>6</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>. This information state <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M735"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>6</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> stops supporting <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M736"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>/</mml:mo><mml:mo>&#x22A4;</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> once it is updated with <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M737"><mml:mrow><mml:mi>&#x00AC;</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula>.</p>
<disp-formula id="FD38">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M738">
<mml:mrow><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mn>6</mml:mn></mml:msub><mml:mo>&#x22A9;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>J</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi>h</mml:mi><mml:mo>/</mml:mo><mml:mo>&#x22A4;</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="FD39">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M739">
<mml:mrow><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mn>6</mml:mn></mml:msub><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:menclose notation='updiagonalstrike'><mml:mo>&#x22A9;</mml:mo></mml:menclose><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>J</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi>h</mml:mi><mml:mo>/</mml:mo><mml:mo>&#x22A4;</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow>
</mml:math>
</disp-formula>
<p id="P217">In the Overriding Situation (c1) is read as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M740"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and thus overridden by (c4).</p>
<p id="P218">Unlike normative judgments, the accepted normative rules in an information state are not affected by additional propositional updates. They stay the same as we can see with <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M741"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>3</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M742"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> unlike factual and normative judgments.</p>
<disp-formula id="FD40">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M743">
<mml:mrow><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mo>&#x22A9;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi>h</mml:mi><mml:mo>/</mml:mo><mml:mo>&#x22A4;</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="FD41">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M744">
<mml:mrow><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>&#x22A9;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi>h</mml:mi><mml:mo>/</mml:mo><mml:mo>&#x22A4;</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="FD42">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M745">
<mml:mrow><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:menclose notation='updiagonalstrike'><mml:mo>&#x22A9;</mml:mo></mml:menclose><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>J</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi>h</mml:mi><mml:mo>/</mml:mo><mml:mo>&#x22A4;</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow>
</mml:math>
</disp-formula>
<p id="P219">Finally, the information state <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M746"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> also supports some alternative readings of the CTD Situation. So far I have read all three <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M747"><mml:mrow><mml:mi mathvariant='italic'>ought</mml:mi></mml:mrow></mml:math></inline-formula>-statements (c1)&#x2013;(c3) in the CTD Situation as normative rules. But it is possible to read (c2) and (c3) as normative judgments: <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M748"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>/</mml:mo><mml:mi>h</mml:mi><mml:mo>)</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="M749"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x00AC;</mml:mi><mml:mi>h</mml:mi><mml:mo>)</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="M750"><mml:mrow><mml:msub><mml:mo>&#x03C3;</mml:mo><mml:mn>4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> supports these two normative judgments as well. The critical feature of the CTD Situation is that (c1) is a normative rule, and (c5) is a normative judgment following from (c3) and (c4). Maybe a slight hesitation in reading (c2) as a normative judgment would come from this formal result: the information state that supports <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M751"><mml:mrow><mml:mi>&#x00AC;</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula> supports <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M752"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>/</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> vacuously in that for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M753"><mml:mrow><mml:mi>&#x03C3;</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi>N</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M754"><mml:mrow><mml:mi mathvariant='bold'>Optimal</mml:mi><mml:mo>(</mml:mo><mml:mrow><mml:mi>s</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mi>h</mml:mi><mml:mo>]</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2286;</mml:mo><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> holds vacuously. Nevertheless, both readings of conditional <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M755"><mml:mrow><mml:mi mathvariant='italic'>ought</mml:mi></mml:mrow></mml:math></inline-formula>-statements (c2) and (c3) are permitted in the CTD Situation, and our observations about the CTD Situation remain the same in either case.</p>
</sec>
<sec id="S22">
<label>6.6.</label><title>Comparisons</title>
<p id="P220">The key move of my update semantics for normative reasoning is in understanding the meanings of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M756"><mml:mrow><mml:mi mathvariant='italic'>ought</mml:mi></mml:mrow></mml:math></inline-formula>-statements in normative discourse through the distinct functions of normative rules and judgments in normative reasoning. The prescriptive nature of normative rules and the descriptive nature of normative judgments are captured in two types of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M757"><mml:mrow><mml:mi mathvariant='italic'>ought</mml:mi></mml:mrow></mml:math></inline-formula>-statements in this dynamic semantics. And this two-<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M758"><mml:mrow><mml:mi mathvariant='italic'>ought</mml:mi></mml:mrow></mml:math></inline-formula> account offers the most straightforward solution to the tension between (c1) and (c5) in Chisholm&#x2019;s example. The solution to the CTD Trilemma is not <italic>ad hoc</italic>. It not only captures the positive data (c1)&#x2013;(c5), but also explains the negative data (c6)&#x2013;(c8) systematically. With the dynamic meanings of the two types of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M759"><mml:mrow><mml:mi mathvariant='italic'>ought</mml:mi></mml:mrow></mml:math></inline-formula>-statements <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M760"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</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="M761"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, we can gain both Factual Detachment and Deontic Detachment without generating a contradiction with Chisholm&#x2019;s example.</p>
<p id="P221">Before closing this paper, let me compare my new approach with two recently proposed solutions to Chisholm&#x2019;s Paradox that share my observations about Chisholm&#x2019;s example: <xref rid="R31" ref-type="bibr">Saint-Croix and Thomason&#x2019;s (2016</xref>; S&amp;T hereafter) contextualist solution and <xref rid="R45" ref-type="bibr">Willer&#x2019;s (2014)</xref> dynamic solution. Specifically, they both aim to explain that (c1)&#x2013;(c5) hold, but not (c6); and both (c1) and (c5) hold, but not (c7).</p>
<p id="P222">S&amp;T (2016) present an unconditional version of Chisholm&#x2019;s Paradox, highlighting the oddity in the conjunction of (c1) and (c5). In Chisholm&#x2019;s example, both (c1) and (c5) are true, but the conjunction of (c1) and (c5) &#x201C;is clearly false&#x201D; (S&amp;T 2016: 193). They solve this puzzling phenomenon by appealing to the context-sensitivity of conditionals and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M762"><mml:mrow><mml:mi mathvariant='italic'>ought</mml:mi></mml:mrow></mml:math></inline-formula>-statements in the ordering semantic framework. They claim that for the <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M763"><mml:mrow><mml:mi mathvariant='italic'>ought</mml:mi></mml:mrow></mml:math></inline-formula>-statements (c1)&#x2013;(c3) and (c5) to be non-vacuously true and felicitous they must be evaluated against different contexts. The context we assign to (c1) and the one we assign to (c5) are different and thus &#x201C;cannot be unified into a single one&#x201D; (S&amp;T 2016: 206). The agglomeration of (c1) and (c5) is therefore not warranted. This radical contextualist approach concludes that &#x201C;there is no single context that satisfies them all [(c1)&#x2013;(c5)] appropriately&#x201D; (S&amp;T 2016: 205). It is a puzzling outcome given that (c1)&#x2013;(c5) altogether faithfully describe Jones&#x2019;s predicament in the CTD Situation accurately at the same time. S&amp;T justify the context-shifts in reading (c1)&#x2013;(c5) by appealing to two pragmatic phenomena known as Lewis&#x2019;s Accommodation (<xref rid="R24" ref-type="bibr">1979</xref>) and <xref rid="R36" ref-type="bibr">Stalnaker&#x2019;s Assertion (1978)</xref>. Another kink in this approach is the invalidity of Factual Detachment. The contextualist treatment of each sentence of the Chisholm set has nothing to do with explaining why Factual Detachment seems to be valid in Chisholm&#x2019;s example. To deal with the invalidity of Factual Detachment in ordering semantics, S&amp;T appeal to the notion of pragmatic validity, concluding that Factual Detachment is invalid in ordering semantics, but pragmatically valid; so (c5) is pragmatically derived from (c3) and (c4). Since this result brings back the familiar tension between (c5) and (c6), contextualists again must explain why (c5) and (c6) are not in conflict and explain why (c5) guides Jones&#x2019;s action but (c6) does not.<sup><xref rid="fn31" ref-type="fn">26</xref></sup></p>
<p id="P223">Now let&#x2019;s turn to Willer&#x2019;s dynamic semantics for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M764"><mml:mrow><mml:mi mathvariant='italic'>ought</mml:mi></mml:mrow></mml:math></inline-formula>-statements. <xref rid="R45" ref-type="bibr">Willer (2014)</xref> proposes a version of update semantics for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M765"><mml:mrow><mml:mi mathvariant='italic'>ought</mml:mi></mml:mrow></mml:math></inline-formula>-statements to solve Chisholm&#x2019;s Paradox without giving up on either Factual Detachment or Deontic Detachment. Willer constructs his semantic account of deontic necessity modal <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M766"><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mo>&#x25A1;</mml:mo><mml:mi>d</mml:mi></mml:msub><mml:mi>&#x03D5;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> using update semantics as well, but his account is quite different from mine in that it does not see the two kinds of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M767"><mml:mrow><mml:mi mathvariant='italic'>ought</mml:mi></mml:mrow></mml:math></inline-formula>-statements in Chisholm&#x2019;s example. In his dynamic semantics there is only one type of deontic <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M768"><mml:mrow><mml:mi mathvariant='italic'>ought</mml:mi></mml:mrow></mml:math></inline-formula>-statement <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M769"><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mo>&#x25A1;</mml:mo><mml:mi>d</mml:mi></mml:msub><mml:mi>&#x03D5;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, which is comparable to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M770"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>/</mml:mo><mml:mo>&#x22A4;</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> in my account.</p>
<disp-formula id="FD43">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M771">
<mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mo>&#x25A1;</mml:mo><mml:mi>d</mml:mi></mml:msub><mml:mi>&#x03D5;</mml:mi></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mfenced close="}" open="{"><mml:mrow><mml:mi>w</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mo>:</mml:mo><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mi>d</mml:mi></mml:msub><mml:mo>&#x22A8;</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mrow>
</mml:math>
</disp-formula>
<p id="P224">This reads: <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M772"><mml:mrow><mml:msub><mml:mo>&#x25A1;</mml:mo><mml:mi>d</mml:mi></mml:msub><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula> is accepted in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M773"><mml:mrow><mml:mo>&#x03C3;</mml:mo></mml:mrow></mml:math></inline-formula> given <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M774"><mml:mrow><mml:mi>d</mml:mi></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="M775"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula> is accepted by the subset of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M776"><mml:mrow><mml:mo>&#x03C3;</mml:mo></mml:mrow></mml:math></inline-formula>, which is the set of deontically ideal possible worlds in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M777"><mml:mrow><mml:mo>&#x03C3;</mml:mo></mml:mrow></mml:math></inline-formula> given <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M778"><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:math></inline-formula>. Willer&#x2019;s non-monotonic update semantics validates both Factual Detachment and Deontic Detachment and thus explains why (c6) follows from (c1) and (c2), but not from (c1)&#x2013;(c4); instead, (c5) follows from (c1)&#x2013;(c4).</p>
<disp-formula id="FD44">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M779">
<mml:mrow><mml:msub><mml:mo>&#x25A1;</mml:mo><mml:mi>d</mml:mi></mml:msub><mml:mi>h</mml:mi><mml:mo>,</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x21D2;</mml:mo><mml:msub><mml:mo>&#x25A1;</mml:mo><mml:mi>d</mml:mi></mml:msub><mml:mi>t</mml:mi><mml:mo>&#x22A8;</mml:mo><mml:msub><mml:mo>&#x25A1;</mml:mo><mml:mi>d</mml:mi></mml:msub><mml:mi>t</mml:mi></mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="FD45">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M780">
<mml:mrow><mml:msub><mml:mo>&#x25A1;</mml:mo><mml:mi>d</mml:mi></mml:msub><mml:mi>h</mml:mi><mml:mo>,</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x21D2;</mml:mo><mml:msub><mml:mo>&#x25A1;</mml:mo><mml:mi>d</mml:mi></mml:msub><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x21D2;</mml:mo><mml:msub><mml:mo>&#x25A1;</mml:mo><mml:mi>d</mml:mi></mml:msub><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi><mml:menclose notation='updiagonalstrike'><mml:mo>&#x22A8;</mml:mo></mml:menclose><mml:msub><mml:mo>&#x25A1;</mml:mo><mml:mi>d</mml:mi></mml:msub><mml:mi>t</mml:mi></mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="FD46">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M781">
<mml:mrow><mml:msub><mml:mo>&#x25A1;</mml:mo><mml:mi>d</mml:mi></mml:msub><mml:mi>h</mml:mi><mml:mo>,</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x21D2;</mml:mo><mml:msub><mml:mo>&#x25A1;</mml:mo><mml:mi>d</mml:mi></mml:msub><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x21D2;</mml:mo><mml:msub><mml:mo>&#x25A1;</mml:mo><mml:mi>d</mml:mi></mml:msub><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x22A8;</mml:mo><mml:msub><mml:mo>&#x25A1;</mml:mo><mml:mi>d</mml:mi></mml:msub><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi></mml:mrow>
</mml:math>
</disp-formula>
<p id="P225">However, this simple update semantics for deontic <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M782"><mml:mrow><mml:mi mathvariant='italic'>ought</mml:mi></mml:mrow></mml:math></inline-formula>-statements has a problem with the persistent nature of (c1). The information state updated with (c1)&#x2013;(c4) supports (c5), but not (c1) anymore due to its non-monotonocity.</p>
<disp-formula id="FD47">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M783">
<mml:mrow><mml:msub><mml:mo>&#x25A1;</mml:mo><mml:mi>d</mml:mi></mml:msub><mml:mi>h</mml:mi><mml:mo>,</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x21D2;</mml:mo><mml:msub><mml:mo>&#x25A1;</mml:mo><mml:mi>d</mml:mi></mml:msub><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x21D2;</mml:mo><mml:msub><mml:mo>&#x25A1;</mml:mo><mml:mi>d</mml:mi></mml:msub><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi><mml:menclose notation='updiagonalstrike'><mml:mo>&#x22A8;</mml:mo></mml:menclose><mml:msub><mml:mo>&#x25A1;</mml:mo><mml:mi>d</mml:mi></mml:msub><mml:mi>h</mml:mi></mml:mrow>
</mml:math>
</disp-formula>
<p id="P226">To address this undesired result, Willer introduces a formal device <italic>downdating</italic> and proposes a revised updating rule for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M784"><mml:mrow><mml:msub><mml:mo>&#x25A1;</mml:mo><mml:mi>d</mml:mi></mml:msub><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>.</p>
<disp-formula id="FD48">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" id="M785">
<mml:mrow><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mo>&#x25A1;</mml:mo><mml:mi>d</mml:mi></mml:msub><mml:mi>&#x03D5;</mml:mi></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mfenced close="}" open="{"><mml:mrow><mml:mi>w</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mo>:</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mi>d</mml:mi></mml:msub><mml:mo>&#x2193;</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x2193;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mi>d</mml:mi></mml:msub><mml:mo>&#x22A8;</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mrow>
</mml:math>
</disp-formula>
<p id="P227">Basically, downdating (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M786"><mml:mrow><mml:mo>&#x2193;</mml:mo></mml:mrow></mml:math></inline-formula>) forces an information state to make a necessary expansion to include both <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M787"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>- and &#x00AC;<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M788"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula> -worlds in order to test whether <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M789"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula> is accepted by the set of deontically ideal possible worlds in the expanded <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M790"><mml:mrow><mml:mo>&#x03C3;</mml:mo></mml:mrow></mml:math></inline-formula> given <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M791"><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:math></inline-formula>. To justify this revision using downdating, Willer claims that sentences such as the following conditional should not be trivially true in a formal account: &#x201C;If Jones goes to help his neighbors, then he ought to help his neighbors.&#x201D; Given this update rule, it is possible for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M792"><mml:mrow><mml:mo>&#x03C3;</mml:mo><mml:mo>[</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> to support <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M793"><mml:mrow><mml:msub><mml:mo>&#x25A1;</mml:mo><mml:mi>d</mml:mi></mml:msub><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>. Therefore, there is a consistent information state that supports all (c1)&#x2013;(c5): <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M794"><mml:mrow><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mo>&#x25A1;</mml:mo><mml:mi>d</mml:mi></mml:msub><mml:mi>h</mml:mi></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mi>h</mml:mi><mml:mo>&#x21D2;</mml:mo><mml:msub><mml:mo>&#x25A1;</mml:mo><mml:mi>d</mml:mi></mml:msub><mml:mi>t</mml:mi></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x21D2;</mml:mo><mml:msub><mml:mo>&#x25A1;</mml:mo><mml:mi>d</mml:mi></mml:msub><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>&#x22A8;</mml:mo><mml:msub><mml:mo>&#x25A1;</mml:mo><mml:mi>d</mml:mi></mml:msub><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:math></inline-formula>. With this revision using downdating, this account gets the positive data right and validates both Factual Detachment and Deontic Detachment.</p>
<p id="P228">A contextualist approach seems to be the best one can do to formally represent (c1)&#x2013;(c5) without inconsistency in the ordering semantic framework, but at the price of theoretical elegance. Presenting (c1)&#x2013;(c5) as true statements in the CTD situation and validating Factual Detachment do not seem to be two separate issues. But the contextualist treatment of individual <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M795"><mml:mrow><mml:mi mathvariant='italic'>ought</mml:mi></mml:mrow></mml:math></inline-formula>-statements has nothing to do with the intuitive validity of Factual Detachment, and they have to be handled separately in the ordering semantic framework.</p>
<p id="P229">On the other hand, in Willer&#x2019;s non-monotonic account of deontic modals the validity of both Factual Detachment and Deontic Detachment is naturally explained in terms of the update function of deontic modals and the dynamic consequence. And the validty of both detachment rules does not generate a contradiction with Chisholm&#x2019;s example in this system. Due to its non-monotonocity, Willer&#x2019;s dynamic account needs a major revision with the update function of deontic modals in order to capture the truth of (c1) in the CTD Situation. It seems that the consequences of using downdating may need to be more carefully examined. <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M796"><mml:mrow><mml:mi mathvariant='italic'>Ought</mml:mi></mml:mrow></mml:math></inline-formula>-statements one might utter as a last resort such as &#x201C;I ought to stay put because there are no options&#x201D; seem to be simply false given the revised update function.<sup><xref rid="fn32" ref-type="fn">27</xref></sup></p>
<p id="P230">The update semantics for normative reasoning presented in this paper does not require some further device to explain why (c1) holds when (c4) holds because the persistent nature of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M797"><mml:mrow><mml:mi mathvariant='italic'>ought</mml:mi></mml:mrow></mml:math></inline-formula> -statements as normative rules is well encoded in the definition of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M798"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> in my account. Moreover, the introduction of two <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M799"><mml:mrow><mml:mi mathvariant='italic'>ought</mml:mi></mml:mrow></mml:math></inline-formula>-statements in my update semantics are well-motivated by the natural understanding of how normative rules and judgments in our normative reasoning interplay. Finally, here are a couple of interesting theoretical implications of the update semantics for normative reasoning. My update semantics for normative reasoning can be seen as a dynamic implementation of the ordering semantic account of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M800"><mml:mrow><mml:mi mathvariant='italic'>ought</mml:mi></mml:mrow></mml:math></inline-formula>s and <italic>if</italic>s. As an information state <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M801"><mml:mrow><mml:mo>&#x03C3;</mml:mo></mml:mrow></mml:math></inline-formula> in my expansion is formally represented by a set of possible worlds and preference ordering over them in the dynamic semantic framework, it is comparable to a context in ordering semantics defined by a pair of modal base and ordering source: <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M802"><mml:mrow><mml:mo>&#x2329;</mml:mo><mml:mi>f</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi><mml:mo>&#x232A;</mml:mo></mml:mrow></mml:math></inline-formula>. With that in mind, we can see that my account explains the mechanism through which a preference ordering changes as a discourse evolves. Any version of ordering semantics or dynamic semantics using the notion of ordering source like Willer&#x2019;s dynamic account are silent about how to form an ordering source and how it grows. The evolution of the ordering source is part of my update semantics, and the way <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M803"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> refines a frame <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M804"><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:math></inline-formula> is more fine-grained than simply adding <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M805"><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x2283;</mml:mo><mml:mi>&#x03C8;</mml:mi></mml:mrow></mml:math></inline-formula> into <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M806"><mml:mrow><mml:mi>g</mml:mi><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>.</p>
</sec>
</sec>
<sec id="S23">
<label>7.</label><title>Conclusion</title>
<p id="P231">There have been many interpretations of Chisholm&#x2019;s example and discussions on what exactly are the problems in the example. In this paper, I have devised a new puzzle I call the CTD Trilemma focusing on the function of CTD obligations in our normative reasoning. This new puzzle not only reveals the limitations of the ordering semantic account of normative <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M807"><mml:mrow><mml:mi mathvariant='italic'>ought</mml:mi></mml:mrow></mml:math></inline-formula>-statements but also guides us to a novel semantic account for normative reasoning. The CTD Situation where a CTD obligation takes effect is the situation where both the violated duty and a new obligation hold. So it turns out that a faithful representation of our reasoning in the CTD Situation requires not only an accurate account of conditional <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M808"><mml:mrow><mml:mi mathvariant='italic'>ought</mml:mi></mml:mrow></mml:math></inline-formula>-statements, but also an acknowledgment of the dual nature of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M809"><mml:mrow><mml:mi mathvariant='italic'>ought</mml:mi></mml:mrow></mml:math></inline-formula>-statements in our normative reasoning. The update semantics for normative reasoning formally captures the two functions of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M810"><mml:mrow><mml:mi mathvariant='italic'>ought</mml:mi></mml:mrow></mml:math></inline-formula>-statements in a simple, unforced manner and handles the seemingly inconsistent observations about Chisholm&#x2019;s example. As a result, it provides a seamless formal account of the meaning of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M811"><mml:mrow><mml:mi mathvariant='italic'>ought</mml:mi></mml:mrow></mml:math></inline-formula>-statements and valid inferences in normative reasoning.</p>
<p id="P232">Some might think that the departure from the mainstream static semantics to a dynamic semantics is a big leap. But the proposed update semantics for normative reasoning preserves the core ideas in the ordering semantic account of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M812"><mml:mrow><mml:mi mathvariant='italic'>ought</mml:mi></mml:mrow></mml:math></inline-formula>s and <italic>if</italic>s; that means it can be seen as a dynamic implementation of ordering semantics. More importantly, the theoretical benefits of my new formal approach and its intuitive framework should not be overlooked. Update semantics for normative reasoning has the potential to solve other deontic puzzles, like <xref rid="R10" ref-type="bibr">Forrester&#x2019;s (1984)</xref> Paradox of Gentle Murder, Sartre&#x2019;s Dilemma (<xref rid="R21" ref-type="bibr">Lemmon 1962</xref>), and <xref rid="R14" ref-type="bibr">J&#x00F6;rgensen&#x2019;s (1937)</xref> Dilemma. In addition, the significance of dynamic approach deserves to be evaluated in the larger context of linguistic data, moral theories, and metaethics. It is widely recognized that the normative use of language demonstrates both prescriptive and descriptive features. Given this dual nature of normative language, a dynamic approach is an ideal semantic framework for normative language in general.</p>
</sec>
</body>
<back>
<ack id="S24">
<title>Acknowledgements</title>
<p id="P233">I thank Will Starr for reading numerous drafts of this paper, discussing many earlier ideas and various related topics with me and providing astute feedback on them. I also thank Janice Dowell, Matti Eklund, Julia Markovits, and Ergo&#x2019;s two anonymous referees for their extremely helpful feedback and suggestions that helped this paper take its current shape. Early ideas and ancestral versions of this paper were shared in many different forms. I would like to extend my gratitude to my friends, colleagues, commentators and audiences of workshops and conferences for their constructive feedback and discussion with me: Ana Arregui, Cory Brown, Mark Brown, Eric Epstein, Harold Hodes, Teresa Kouri, Thomas McKay, Ted Sider, Bokai Yao and the audiences at Cornell Semantics Group, ESSLLI 2015 Student Session, Cornell Philosophy Department Workshop, Logic Colloquium 2016, Conference on Contemporary Philosophy in East Asia 2016, &#x201C;Logic and Language&#x201D; Graduate Conference 2016 at University of Calgary and &#x201C;Colloquium: Paradox&#x201D; at Pacific APA 2017. Special thanks to Ted for all of his support.</p>
</ack>
<fn-group>
<fn id="fn1"><label>1.</label><p id="P234"><xref rid="R2" ref-type="bibr">&#x00C5;qvist (1984)</xref> calls this the dilemma on commitment and detachment. This interpretation of Chisholm&#x2019;s Paradox motivates the attempts to devise deontic logic systems that validate Factual Detachment without paradoxical results. <xref rid="R1" ref-type="bibr">Al-Hibri (1978)</xref> and <xref rid="R27" ref-type="bibr">Mott (1973)</xref> independently develop formal systems in which Factual Detachment is valid while Deontic Detachment is not. <xref rid="R3" ref-type="bibr">Arregui (2008)</xref> proposes a new account of deontic <italic>should</italic>-conditionals that validates Factual Detachment in the ordering semantic framework by carefully attending to the contrast between <italic>should</italic> and <italic>should have</italic> and thereby solves the <italic>should</italic> version of Chisholm&#x2019;s Paradox. <xref rid="R26" ref-type="bibr">Loewer and Belzer (1983)</xref> propose a system with both detachment rules without contradiction by introducing temporal elements. <xref rid="R38" ref-type="bibr">Stra&#x00DF;er (2014)</xref> develops an adaptive logic validating both detachment rules by introducing different notions of obligations. <xref rid="R33" ref-type="bibr">Silk (2014)</xref> validates both detachment rules without tensions by understanding an <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M813"><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:mrow></mml:math></inline-formula> in a conditional statements relative to a contextually salient ordering source. <xref rid="R45" ref-type="bibr">Willer (2014)</xref> proposes a dynamic solution to Chisholm&#x2019;s Paradox that validates both detachment rules in his non-monotonic system.</p></fn>
<fn id="fn2"><label>2.</label><p id="P235">Different versions of ordering semantics have independently been developed by many linguists and philosophers to deal with different flavors of modals and conditionals: <xref rid="R18" ref-type="bibr">Kratzer (1977</xref>; <xref rid="R19" ref-type="bibr">1981</xref>; <xref rid="R20" ref-type="bibr">1991</xref>), <xref rid="R22" ref-type="bibr">Lewis (1973</xref>; <xref rid="R23" ref-type="bibr">1974</xref>; <xref rid="R25" ref-type="bibr">1981</xref>), <xref rid="R34" ref-type="bibr">Stalnaker (1968)</xref>, von Wright (<xref rid="R41" ref-type="bibr">1951</xref>; <xref rid="R43" ref-type="bibr">1970</xref>; <xref rid="R42" ref-type="bibr">1965</xref>), <xref rid="R12" ref-type="bibr">Hansson (1969)</xref> and <xref rid="R9" ref-type="bibr">F&#x00F8;llesdal and Hilpinen (1971)</xref>.</p></fn>
<fn id="fn3"><label>3.</label><p id="P236">Here I assume the standard, simplified ordering semantic account of conditional <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M814"><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:mrow></mml:math></inline-formula>-statements. On Kratzer semantics, the semantic function of the antecedent of a conditional is to restrict the domain of the covert modal in the consequent. However, this account is not free of controversy. Alternatively, some argue that a covert epistemic necessity modal takes scope over the deontic modal in order to deal with the Miner&#x2019;s Paradox and the trivial truth of &#x201C;if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M815"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>, then Ought(<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M816"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>)&#x201D; in Kratzer semantics (<xref rid="R17" ref-type="bibr">Kolodny and MacFarlane 2010</xref>; see also <xref rid="R5" ref-type="bibr">Bronfman and Dowell 2018</xref>; <xref rid="R6" ref-type="bibr">Carr 2014</xref>).</p></fn>
<fn id="fn4"><label>4.</label><p id="P237">Following the convention of dyadic deontic logic, I will represent a conditional <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M817"><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:mrow></mml:math></inline-formula>-sentence with a two-place deontic operator &#x2018;<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M818"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>&#x2019; and ignore the stylistic difference between &#x201C;it ought to be that if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M819"><mml:mrow><mml:mi>&#x03D5;</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="M820"><mml:mrow><mml:mi>&#x03C8;</mml:mi></mml:mrow></mml:math></inline-formula>&#x201D; and &#x201C;if <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M821"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula> then it ought to be that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M822"><mml:mrow><mml:mi>&#x03C8;</mml:mi></mml:mrow></mml:math></inline-formula>&#x201D; in a natural language. An unconditional <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M823"><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:mrow></mml:math></inline-formula>-statement, &#x2018;<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M824"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>&#x2019; is an abbreviation for &#x2018;<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M825"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>/</mml:mo><mml:mo>&#x22A4;</mml:mo><mml:mo>)</mml:mo><mml:mo>&#x2019;</mml:mo><mml:mo>&#x2014;</mml:mo><mml:mo>&#x22A4;</mml:mo></mml:mrow></mml:math></inline-formula> stands for a tautology.</p></fn>
<fn id="fn5"><label>5.</label><p id="P238">For the sake of simplicity, I make the Limit Assumption throughout this paper, according to which there are always some closest possible worlds to the deontic ideal. Without the Limit Assumption, the truth condition of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M826"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is given as follows: <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M827"><mml:mrow><mml:msubsup><mml:mrow><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mrow><mml:mtext mathvariant="bold">O</mml:mtext><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfenced></mml:mrow></mml:mrow><mml:mi>i</mml:mi><mml:mrow><mml:mi>f</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> iff for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M828"><mml:mrow><mml:mi>u</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M829"><mml:mrow><mml:mi>v</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M830"><mml:mrow><mml:mi>z</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mo>&#x2229;</mml:mo><mml:msup><mml:mi>f</mml:mi><mml:mo>+</mml:mo></mml:msup><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M831"><mml:mrow><mml:mo>&#x2200;</mml:mo><mml:mi>u</mml:mi><mml:mo>&#x2203;</mml:mo><mml:mi>v</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mi>v</mml:mi><mml:msub><mml:mo>&#x227C;</mml:mo><mml:mrow><mml:mi>g</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msub><mml:mi>u</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mo>&#x2200;</mml:mo><mml:mi>z</mml:mi><mml:mo>:</mml:mo><mml:mo>&#x2009;</mml:mo><mml:mtext>if</mml:mtext><mml:mo>&#x2009;</mml:mo><mml:mi>z</mml:mi><mml:msub><mml:mo>&#x227C;</mml:mo><mml:mrow><mml:mi>g</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msub><mml:mi>v</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x2009;</mml:mo><mml:mtext>then</mml:mtext><mml:mo>&#x2009;</mml:mo><mml:mi>z</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>&#x03C8;</mml:mi></mml:mfenced></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. Here <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M832"><mml:mrow><mml:mo>&#x2229;</mml:mo><mml:msup><mml:mi>f</mml:mi><mml:mo>+</mml:mo></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mfenced close="}" open="{"><mml:mrow><mml:mi>w</mml:mi><mml:mo>:</mml:mo><mml:mi>w</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mo>&#x2229;</mml:mo><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2227;</mml:mo><mml:mi>w</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>&#x03D5;</mml:mi></mml:mfenced></mml:mrow></mml:mrow></mml:mfenced></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="M833"><mml:mrow><mml:mi>w</mml:mi><mml:msub><mml:mo>&#x227C;</mml:mo><mml:mrow><mml:mi>g</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msub><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> means that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M834"><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:math></inline-formula> is at least as good as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M835"><mml:mrow><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x02B9;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> given <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M836"><mml:mrow><mml:mi>g</mml:mi><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>; in other words, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M837"><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:math></inline-formula> meets at least as many propositions in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M838"><mml:mrow><mml:mi>g</mml:mi><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M839"><mml:mrow><mml:mi>w</mml:mi><mml:mo>&#x02B9;</mml:mo></mml:mrow></mml:math></inline-formula> does.</p></fn>
<fn id="fn6"><label>6.</label><p id="P239">A model <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M840"><mml:mi mathvariant='script'>M</mml:mi></mml:math></inline-formula> for a language <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M841"><mml:mi mathvariant='script'>L</mml:mi></mml:math></inline-formula> is a quadruple, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M842"><mml:mrow><mml:mrow><mml:mfenced close="&#x232A;" open="&#x2329;"><mml:mrow><mml:mi>W</mml:mi><mml:mo>,</mml:mo><mml:mi>f</mml:mi><mml:mo>,</mml:mo><mml:mi>g</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mo>&#x2009;</mml:mo></mml:mfenced></mml:mrow></mml:mrow></mml:mfenced></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="M843"><mml:mrow><mml:mi mathvariant='script'>W</mml:mi></mml:mrow></mml:math></inline-formula> is a non-empty set of possible worlds, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M844"><mml:mrow><mml:mi>f</mml:mi></mml:mrow></mml:math></inline-formula> is a function from the index world, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M845"><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:math></inline-formula>, to a set of propositions, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M846"><mml:mrow><mml:msub><mml:mo>&#x227C;</mml:mo><mml:mrow><mml:mi>g</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> orders possible worlds given the set of propositions, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M847"><mml:mrow><mml:mi>g</mml:mi><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, and a valuation function <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M848"><mml:mrow><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mo>&#x2009;</mml:mo></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula> from a well-formed sentence to a set possible worlds; the truth of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M849"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula> at <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M850"><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:math></inline-formula> is represented by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M851"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>p</mml:mi></mml:mfenced></mml:mrow></mml:mrow><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>. <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M852"><mml:mrow><mml:mo>&#x2229;</mml:mo><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is a set of possible worlds which satisfy the propositions in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M853"><mml:mrow><mml:mi>f</mml:mi><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M854"><mml:mrow><mml:mi>g</mml:mi><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is a set of the propositions describing the deontic ideality. <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M855"><mml:mrow><mml:mi>w</mml:mi><mml:mo>&#x227A;</mml:mo><mml:mi>w</mml:mi><mml:mo>&#x2032;</mml:mo></mml:mrow></mml:math></inline-formula> means that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M856"><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:math></inline-formula> is strictly better than <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M857"><mml:mrow><mml:mi>w</mml:mi><mml:mo>&#x2032;</mml:mo></mml:mrow></mml:math></inline-formula>.</p></fn>
<fn id="fn7"><label>7.</label><p id="P240">Formally, Weak Centering amounts to the following assumption about an ordering source <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M858"><mml:mrow><mml:mi>g</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>:</mml:mo><mml:mi>i</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mfenced close="}" open="{"><mml:mrow><mml:mi>w</mml:mi><mml:mo>:</mml:mo><mml:mi>w</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mo>&#x2229;</mml:mo><mml:msup><mml:mi>f</mml:mi><mml:mo>+</mml:mo></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2227;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mo>&#x2203;</mml:mo> <mml:mi>v</mml:mi> <mml:mi>&#x2208;</mml:mi><mml:mo>&#x2229;</mml:mo><mml:msup><mml:mi>f</mml:mi><mml:mo>+</mml:mo></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>:</mml:mo><mml:mi>v</mml:mi><mml:msub><mml:mo>&#x227A;</mml:mo><mml:mrow><mml:mi>g</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msub><mml:mi>w</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mrow></mml:math></inline-formula>.</p></fn>
<fn id="fn8"><label>8.</label><p id="P241">This modal solution to Chisholm&#x2019;s Paradox in the ordering semantic framework is given and briefly discussed in P<xref rid="R28" ref-type="bibr">ortner (2009</xref>: Ch. 3). Apparently, the modal solution is closely related to classic temporal solutions to Chisholm&#x2019;s Paradox. For such temporal approaches to solving Chisholm&#x2019;s Paradox, see <xref rid="R8" ref-type="bibr">Feldman (1986)</xref> and <xref rid="R26" ref-type="bibr">Loewer and Belzer (1983)</xref>.</p></fn>
<fn id="fn9"><label>9.</label><p id="P242">The rejection of Weak Centering means that the actual world (or an index world) is not always one of the ideal possible worlds; thus, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M859"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> could be true in the actual world, where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M860"><mml:mrow><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula> does not hold.</p></fn>
<fn id="fn10"><label>10.</label><p id="P243">When Jones does not go (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M861"><mml:mrow><mml:mi>&#x00AC;</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula>) and his CTD obligation (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M862"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>/</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>) holds, he ought not to tell them he is coming (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M863"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>), because the actual world is one of the deontically ideal possible worlds in which <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M864"><mml:mrow><mml:mi>&#x00AC;</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula> holds when Weak Centering is assumed.</p></fn>
<fn id="fn11"><label>11.</label><p id="P244">In the same vein, <xref rid="R17" ref-type="bibr">Kolodny and Macfarlane (2010)</xref> argue that the inference from <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M865"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</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="M866"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula> to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M867"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is not valid, but <italic>quasi-valid</italic> in that it is a reliable inference when <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M868"><mml:mrow><mml:mi mathvariant='bold'>O</mml:mi><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</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="M869"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula> are <italic>known</italic> to be true. <xref rid="R31" ref-type="bibr">Saint-Croix and Thomason (2016)</xref> argues that Factual Detachment is pragmatically valid to explain the inference of (c5) from (c3) and (c4).</p></fn>
<fn id="fn12"><label>12.</label><p id="P245">Although I agree with their observation, I don&#x2019;t think that the reason that (c7) sounds marked has nothing to do with the conditional obligations in the Chisholm&#x2019;s example. (c7) is false or infelicitous to utter because both (c1) and (c2) hold for Jones in the CTD Situation. Since (c2) holds for Jones in the CTD Situation, the conjunction of (c1) and (c5) does not hold. Consider the following example:
<disp-quote id="Q13">
<p id="P246">(j1) Jones ought to look after his child.</p>
<p id="P247">(j3) If Jones does not look after his child, he ought to hire a nanny.</p>
<p id="P248">(j4) But he will not.</p>
<p id="P249">(j5) So he ought to hire a nanny.</p>
</disp-quote></p>
<p id="P250">The conjunction of (j1) and (j5) is not &#x201C;clearly false&#x201D; as Saint-Croix &amp; Thomason argue. It sounds perfectly fine to say in Jones&#x2019;s normative predicament described by (j3)&#x2013;(j5) and (j1): Jones ought to look after his child and hire a nanny. There is not even pragmatic oddity without the corresponding ATD obligation (j2) &#x201C;If Jones looks after his child, then he ought not to hire a nanny.&#x201D; So it seems that an unconditional version of Chisholm&#x2019;s Paradox is not a general recipe for the puzzle Saint-Croix &amp; Thomason put forward.</p></fn>
<fn id="fn18"><label>13.</label><p id="P251">For more discussions on the nature of normative rules and their explanatory roles, see <xref rid="R32" ref-type="bibr">Sayre-McCord (1992)</xref>.</p></fn>
<fn id="fn19"><label>14.</label><p id="P252">Note that being exempt from a duty or obligation is different from failing to meet or violating one&#x2019;s duty or obligation. In this example, Jane would be free of her duty if she is qualified or her circumstance meets some pre-established conditions, such as being a student or a non-citizen.</p></fn>
<fn id="fn20"><label>15.</label><p id="P253">This principle seems to hold for other deontic modal auxiliary verbs, like <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M870"><mml:mrow><mml:mi>s</mml:mi><mml:mi>h</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>l</mml:mi><mml:mi>d</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="M871"><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></fn>
<fn id="fn21"><label>16.</label><p id="P254">Alternatively, we can read (c1) as Jones&#x2019;s duty and (c2) and (c3) as conditional normative judgments in the CTD Situation. The preference pattern for which such (c1)&#x2013;(c3) hold is the same as the preference pattern defined by (c1)&#x2013;(c3) as normative rules. Therefore, these readings will be represented by the same preference pattern of an information state. I will return to this point after articulating the technical distinctions between normative rules and normative judgments.</p></fn>
<fn id="fn22"><label>17.</label><p id="P255">An information state models what is believed or accepted by a relevant agent(s), relevant discourse participants, or a loosely define relevant social group. For the sake of argument, I will leave the notion of information state as an abstract and idealized concept, like a context in ordering semantics, and will not consider the questions on the nature of information states in the dynamic semantic framework.</p></fn>
<fn id="fn23"><label>18.</label><p id="P256">The origin of this dynamic understanding of meaning traces back to Stalnaker&#x2019;s work on presupposition and assertion (<xref rid="R36" ref-type="bibr">1978</xref>). The core idea of dynamic semantics is endorsed and developed by many authors to provide a better explanation of various linguistic phenomena: <xref rid="R15" ref-type="bibr">Kamp&#x2019;s (1988</xref>, <xref rid="R16" ref-type="bibr">2011</xref>) Discourse Representation Theory, <xref rid="R11" ref-type="bibr">Groenendijk and Stokhof&#x2019;s (1991)</xref> Dynamic Predicate Logic, <xref rid="R13" ref-type="bibr">Heim&#x2019;s (1983)</xref> File Change Semantics, <xref rid="R39" ref-type="bibr">Veltman&#x2019;s (1996)</xref> Update Semantics, and recent dynamic approaches such as <xref rid="R4" ref-type="bibr">Beaver (2001)</xref>, <xref rid="R40" ref-type="bibr">von Fintel and Gillies (2007)</xref>, <xref rid="R37" ref-type="bibr">Starr (2016)</xref>, and <xref rid="R44" ref-type="bibr">Willer (2013</xref>; <xref rid="R45" ref-type="bibr">2014</xref>).</p></fn>
<fn id="fn24"><label>19.</label><p id="P257">In this paper it is assumed that all utterances are sincere and felicitously made. Also, this paper sets aside the important issues regarding acceptability and assertability that could be relative to information states.</p></fn>
<fn id="fn25"><label>20.</label><p id="P258">Here <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M872"><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:math></inline-formula><sub><italic>1</italic></sub> is an incoherent frame. See the definition of Coherence below.</p></fn>
<fn id="fn26"><label>21.</label><p id="P259">Given the definition of refinement, when <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M873"><mml:mrow><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>&#x03D5;</mml:mi></mml:mfenced></mml:mrow><mml:mo>&#x2229;</mml:mo><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>&#x03C8;</mml:mi></mml:mfenced></mml:mrow><mml:mo>&#x2260;</mml:mo><mml:mo>&#x2205;</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x2009;</mml:mo><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mrow><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is vacuously coherent given that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M874"><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:math></inline-formula> is coherent. Also, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M875"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>(<italic>&#x03C8;</italic>/<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M876"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>) does not make much sense when <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M877"><mml:mrow><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>&#x03D5;</mml:mi></mml:mfenced></mml:mrow><mml:mo>&#x2229;</mml:mo><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>&#x03C8;</mml:mi></mml:mfenced></mml:mrow><mml:mo>&#x2260;</mml:mo><mml:mo>&#x2205;</mml:mo></mml:mrow></mml:math></inline-formula>.</p></fn>
<fn id="fn27"><label>22.</label><p id="P260">This does not mean that the agent in &#x03C3; must reject new information <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M878"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula> when &#x03C3;[<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M879"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>] = <bold>1</bold> and reject a new normative rule <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M880"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> (<italic>&#x03C8;</italic> /<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M881"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>) when the refinement of the frame with <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M882"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> (<italic>&#x03C8;</italic> /<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M883"><mml:mrow><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:math></inline-formula>) is not coherent. For the purpose of this paper and the sake of simplicity, however, accommodation in update semantics will not be discussed in this paper.</p></fn>
<fn id="fn28"><label>23.</label><p id="P261">This is a simple version because it is a semantics for a limited language that does not deal with compound <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M884"><mml:mrow><mml:mi mathvariant='italic'>ought</mml:mi></mml:mrow></mml:math></inline-formula>-statements. Also, it lacks some formal apparatus to deal with normative rules for exceptions. In this paper, this technical complication is suppressed since CTD obligations are not rules for exceptions. However, this system is easily expandable to deal with normative rules for exceptions. The relevant technical details are fully developed and discussed regarding default rules for exceptions in <xref rid="R39" ref-type="bibr">Veltman (1996)</xref>.</p></fn>
<fn id="fn29"><label>24.</label><p id="P262">As we have stipulated before, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M885"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</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="M886"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> are abbreviations for dyadic notations <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M887"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>/</mml:mo><mml:mo>&#x22A4;</mml:mo><mml:mo>)</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="M888"><mml:mrow><mml:msub><mml:mi mathvariant='bold'>O</mml:mi><mml:mi>J</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>/</mml:mo><mml:mo>&#x22A4;</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>.</p></fn>
<fn id="fn30"><label>25.</label><p id="P263">In this system, both versions of Factual Detachments using normative rules and judgments are licensed for &#x03C3; = &#x27E8;<italic>N, s</italic>&#x27E9; such that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M889"><mml:mrow><mml:mi>s</mml:mi><mml:mo>&#x2229;</mml:mo><mml:mrow><mml:mfenced close="&#x301B;" open="&#x301A;"><mml:mi>&#x03D5;</mml:mi></mml:mfenced></mml:mrow><mml:mo>&#x2260;</mml:mo><mml:menclose notation='updiagonalstrike'><mml:mn>0</mml:mn></mml:menclose></mml:mrow></mml:math></inline-formula>: <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M890"><mml:mrow><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>R</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2009;</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x22A8;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>J</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03C8;</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="M891"><mml:mrow><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>J</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi>&#x03C8;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x03D5;</mml:mi></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="M892"><mml:mrow><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x22A8;</mml:mo><mml:msub><mml:mtext mathvariant="bold">O</mml:mtext><mml:mi>J</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p></fn>
<fn id="fn31"><label>26.</label><p id="P264">These issues are not discussed by S&amp;T, but it is not hard to conjecture contextualist explanations for them.</p></fn>
<fn id="fn32"><label>27.</label><p id="P265">Another technical concern I have about downdating is that it seems that this revision invites a problem with conditional <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M893"><mml:mrow><mml:mi mathvariant='italic'>ought</mml:mi></mml:mrow></mml:math></inline-formula>-statements expressing exceptions. Consider, for example, this set of statements: (f1) Jones ought to go help his neighbors; (f2) If Jones has the flu, he ought not to go help his neighbors, and (f3) Jones has the flu. Given his revised update rule, there is neither an information state that supports all (f1)&#x2013;(f3) nor an information state updated with these three statements that supports &#x201C;Jones ought not to help his neighbors.&#x201D;</p></fn>
</fn-group>
<ref-list>
<title>References</title>
<ref id="R1"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Al-hibri</surname>, <given-names>Azizah Y.</given-names></string-name></person-group> (<year>1978</year>). <source>Deontic Logic: A Comprehensive Appraisal and a New Proposal.</source> <publisher-name>University Press of America</publisher-name>.</mixed-citation></ref>
<ref id="R2"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>&#x00C5;qvist</surname>, <given-names>Lennart</given-names></string-name></person-group> (<year>1984</year>). <chapter-title>Deontic Logic.</chapter-title> In <person-group person-group-type="editor"><string-name><surname>Gabbay</surname>, <given-names>Dov M.</given-names></string-name></person-group> and <person-group person-group-type="editor"><string-name><surname>Guenthner</surname>, <given-names>Franz</given-names></string-name></person-group> (Eds.), <source>Handbook of Philosophical Logic. Volume II: Extensions of Classical Logic</source> (<fpage>605</fpage>&#x2013;<lpage>714</lpage>). <publisher-name>Springer Netherlands</publisher-name>.</mixed-citation></ref>
<ref id="R3"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Arregui</surname>, <given-names>Ana</given-names></string-name></person-group> (<year>2008</year>). <chapter-title>Chisholm&#x2019;s Paradox in &#x201C;Should&#x201D;-Conditionals.</chapter-title> In <person-group person-group-type="editor"><string-name><surname>Friedman</surname>, <given-names>Tova</given-names></string-name></person-group> and <person-group person-group-type="editor"><string-name><surname>Ito</surname>, <given-names>Satoshi</given-names></string-name></person-group> (Eds.), <source>Proceedings of SALT 18</source> (<fpage>55</fpage>&#x2013;<lpage>72</lpage>). <publisher-name>Linguistic Society of America</publisher-name>.</mixed-citation></ref>
<ref id="R4"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Beaver</surname>, <given-names>David I.</given-names></string-name></person-group> (<year>2001</year>). <source>Presupposition and Assertion in Dynamic Semantics</source> (Vol. <volume>16</volume>). <publisher-name>CSLI</publisher-name>.</mixed-citation></ref>
<ref id="R5"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Bronfman</surname>, <given-names>Aaron</given-names></string-name> and <string-name><surname>Dowell</surname>, <given-names>J. L.</given-names></string-name></person-group> (<year>2018</year>). <chapter-title>The Language of &#x201C;Ought,&#x201D; and Reasons.</chapter-title> In <person-group person-group-type="editor"><string-name><surname>Star</surname>, <given-names>Daniel</given-names></string-name></person-group> (Ed.), <source>Oxford Handbook of Reasons and Normativity</source> (<fpage>85</fpage>&#x2013;<lpage>112</lpage>). <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="R6"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Carr</surname>, <given-names>Jennifer</given-names></string-name></person-group> (<year>2014</year>). <article-title>The If P, Ought P Problem.</article-title> <source>Pacific Philosophical Quarterly</source>, <volume>95</volume>(<issue>4</issue>), <fpage>555</fpage>&#x2013;<lpage>583</lpage>.</mixed-citation></ref>
<ref id="R7"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Chisholm</surname>, <given-names>Roderick M.</given-names></string-name></person-group> (<year>1963</year>). <article-title>Contrary-to-Duty Imperatives and Deontic Logic.</article-title> <source>Analysis</source>, <volume>24</volume>(<issue>2</issue>), <fpage>33</fpage>&#x2013;<lpage>36</lpage>.</mixed-citation></ref>
<ref id="R8"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Feldman</surname>, <given-names>Fred</given-names></string-name></person-group> (<year>1986</year>). <source>Doing the Best We Can: An Essay in Informal Deontic Logic.</source> <publisher-name>D. Reidel</publisher-name>.</mixed-citation></ref>
<ref id="R9"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>F&#x00F8;Llesdal</surname>, <given-names>Dagfinn</given-names></string-name> and <string-name><surname>Hilpinen</surname>, <given-names>Risto</given-names></string-name></person-group> (<year>1971</year>). <source>Deontic Logic: An Introduction.</source> <publisher-name>Springer</publisher-name>.</mixed-citation></ref>
<ref id="R10"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Forrester</surname>, <given-names>James William</given-names></string-name></person-group> (<year>1984</year>). <article-title>Gentle Murder, or the Adverbial Samaritan.</article-title> <source>The Journal of Philosophy</source>, <volume>81</volume>(<issue>4</issue>), <fpage>193</fpage>&#x2013;<lpage>197</lpage>.</mixed-citation></ref>
<ref id="R11"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Groenendijk</surname>, <given-names>Jeroen</given-names></string-name> and <string-name><surname>Stokhof</surname>, <given-names>Martin</given-names></string-name></person-group> (<year>1991</year>). <article-title>Dynamic Predicate Logic.</article-title> <source>Linguistics and Philosophy</source>, <volume>14</volume>(<issue>1</issue>), <fpage>39</fpage>&#x2013;<lpage>100</lpage>.</mixed-citation></ref>
<ref id="R12"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Hansson</surname>, <given-names>Bengt</given-names></string-name></person-group> (<year>1969</year>). <article-title>An Analysis of Some Deontic Logics.</article-title> <source>No&#x00FB;s</source>, <volume>3</volume>(<issue>4</issue>), <fpage>373</fpage>&#x2013;<lpage>398</lpage>.</mixed-citation></ref>
<ref id="R13"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Heim</surname>, <given-names>Irene</given-names></string-name></person-group> (<year>1983</year>). <chapter-title>File Change Semantics and the Familiarity Theory of Definiteness.</chapter-title> In <person-group person-group-type="editor"><string-name><surname>Guti&#x00E9;rrez-Rexach</surname>, <given-names>Javier</given-names></string-name></person-group> (Ed.), <source>Semantics: Critical Concepts in Linguistics</source> (<fpage>108</fpage>&#x2013;<lpage>135</lpage>). <publisher-name>Psychology Press</publisher-name>.</mixed-citation></ref>
<ref id="R14"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>J&#x00F6;rgensen</surname>, <given-names>J&#x00F6;rgen</given-names></string-name></person-group> (<year>1937</year>). <article-title>Imperatives and Logic.</article-title> <source>Erkenntnis</source>, <volume>7</volume>(<issue>4</issue>), <fpage>288</fpage>&#x2013;<lpage>296</lpage>.</mixed-citation></ref>
<ref id="R15"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kamp</surname>, <given-names>Hans</given-names></string-name></person-group> (<year>1988</year>). <article-title>Discourse Representation Theory: What It Is and Where It Ought to Go.</article-title> <source>Natural Language at the Computer</source>, <volume>320</volume>(<issue>1</issue>), <fpage>84</fpage>&#x2013;<lpage>111</lpage>.</mixed-citation></ref>
<ref id="R16"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Kamp</surname>, <given-names>Hans</given-names></string-name></person-group>, <person-group person-group-type="author"><string-name><surname>Van Genabith</surname>, <given-names>Josef</given-names></string-name></person-group>, and <person-group person-group-type="author"><string-name><surname>Reyle</surname>, <given-names>Uwe</given-names></string-name></person-group> (<year>2011</year>). <chapter-title>Discourse Representation Theory</chapter-title>. In <person-group person-group-type="editor"><string-name><surname>Gabbay</surname>, <given-names>Dov M.</given-names></string-name></person-group> (Ed.), <source>Handbook of Philosophical Logic</source> (<fpage>125</fpage>&#x2013;<lpage>394</lpage>). <publisher-name>Springer</publisher-name>.</mixed-citation></ref>
<ref id="R17"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kolodny</surname>, <given-names>Niko</given-names></string-name> and <string-name><surname>Macfarlane</surname>, <given-names>John</given-names></string-name></person-group> (<year>2010</year>). <article-title>Ifs and Oughts.</article-title> <source>The Journal of Philosophy</source>, <volume>107</volume>(<issue>3</issue>), <fpage>115</fpage>&#x2013;<lpage>143</lpage>.</mixed-citation></ref>
<ref id="R18"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kratzer</surname>, <given-names>Angelika</given-names></string-name></person-group> (<year>1977</year>). <article-title>What &#x2018;Must&#x2019; and &#x2018;Can&#x2019; Must and Can Mean.</article-title> <source>Linguistics and Philosophy</source>, <volume>1</volume>(<issue>3</issue>), <fpage>337</fpage>&#x2013;<lpage>355</lpage>.</mixed-citation></ref>
<ref id="R19"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Kratzer</surname>, <given-names>Angelika</given-names></string-name></person-group> (<year>1981</year>). <chapter-title>The Notional Category of Modality.</chapter-title> In <person-group person-group-type="editor"><string-name><surname>Eikmeyer</surname>, <given-names>Hans-J&#x00FC;rgen</given-names></string-name></person-group> and <person-group person-group-type="editor"><string-name><surname>Rieser</surname>, <given-names>Hannes</given-names></string-name></person-group> (Eds.), <source>Words, Worlds, and Contexts: New Approaches in Word Semantics</source> (<fpage>38</fpage>&#x2013;<lpage>74</lpage>). <publisher-name>Walter de Gruyter</publisher-name>.</mixed-citation></ref>
<ref id="R20"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Kratzer</surname>, <given-names>Angelika</given-names></string-name></person-group> (<year>1991</year>). <chapter-title>Modality.</chapter-title> In <person-group person-group-type="editor"><string-name><surname>von Stechow</surname>, <given-names>A.</given-names></string-name></person-group> and <person-group person-group-type="editor"><string-name><surname>Wunderlich</surname>, <given-names>D.</given-names></string-name></person-group> (Eds.), <source>Semantics: An International Handbook of Contemporary Research</source> (Vol. <volume>7</volume>, <fpage>639</fpage>&#x2013;<lpage>650</lpage>). <publisher-loc>Berlin</publisher-loc>.</mixed-citation></ref>
<ref id="R21"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Lemmon</surname>, <given-names>E. J.</given-names></string-name></person-group> (<year>1962</year>). <article-title>Moral Dilemma.</article-title> <source>The Philosophical Review</source>, <volume>71</volume>, <fpage>139</fpage>&#x2013;<lpage>158</lpage>.</mixed-citation></ref>
<ref id="R22"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Lewis</surname>, <given-names>David</given-names></string-name></person-group> (<year>1973</year>). <source>Counterfactuals.</source> <publisher-name>Harvard University Press</publisher-name>.</mixed-citation></ref>
<ref id="R23"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Lewis</surname>, <given-names>David</given-names></string-name></person-group> (<year>1974</year>). <chapter-title>Semantic Analyses for Dyadic Deontic Logic</chapter-title>. In <person-group person-group-type="editor"><string-name><surname>Stenlund</surname>, <given-names>S&#x00F6;ren</given-names></string-name></person-group>, <person-group person-group-type="editor"><string-name><surname>Henschen-Dahlquist</surname>, <given-names>Ann-Mari</given-names></string-name></person-group>, <person-group person-group-type="editor"><string-name><surname>Lindahl</surname>, <given-names>Lars</given-names></string-name></person-group>, <person-group person-group-type="editor"><string-name><surname>Nordenfelt</surname>, <given-names>Lennart</given-names></string-name></person-group>, and <person-group person-group-type="editor"><string-name><surname>Odelstad</surname>, <given-names>Jan</given-names></string-name></person-group> (Eds.), <source>Logical Theory and Semantic Analysis</source> (<fpage>1</fpage>&#x2013;<lpage>14</lpage>). <publisher-name>Springer</publisher-name>.</mixed-citation></ref>
<ref id="R24"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Lewis</surname>, <given-names>David</given-names></string-name></person-group> (<year>1979</year>). <chapter-title>Scorekeeping in a Language Game.</chapter-title> In <person-group person-group-type="editor"><string-name><surname>B&#x00E4;uerle</surname>, <given-names>Rainer</given-names></string-name></person-group>, <person-group person-group-type="editor"><string-name><surname>Egli</surname>, <given-names>Urs</given-names></string-name></person-group>, and <person-group person-group-type="editor"><string-name><surname>von Stechow</surname>, <given-names>Arnim</given-names></string-name></person-group> (Eds.), <source>Semantics from Different Points of View</source> (<fpage>172</fpage>&#x2013;<lpage>187</lpage>). <publisher-name>Springer</publisher-name>.</mixed-citation></ref>
<ref id="R25"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Lewis</surname>, <given-names>David</given-names></string-name></person-group> (<year>1981</year>). <article-title>Ordering Semantics and Premise Semantics for Counterfactuals.</article-title><source>Journal of Philosophical Logic</source>, <volume>10</volume>(<issue>2</issue>), <fpage>217</fpage>&#x2013;<lpage>234</lpage>.</mixed-citation></ref>
<ref id="R26"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Loewer</surname>, <given-names>Barry</given-names></string-name> and <string-name><surname>Belzer</surname>, <given-names>Marvin</given-names></string-name></person-group> (<year>1983</year>). <article-title>Dyadic Deontic Detachment.</article-title> <source>Synthese</source>, <volume>54</volume>(<issue>2</issue>), <fpage>295</fpage>&#x2013;<lpage>318</lpage>.</mixed-citation></ref>
<ref id="R27"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Mott</surname>, <given-names>Peter L.</given-names></string-name></person-group> (<year>1973</year>). <article-title>On Chisholm&#x2019;s Paradox.</article-title> <source>Journal of Philosophical Logic</source>, <volume>2</volume>(<issue>2</issue>), <fpage>197</fpage>&#x2013;<lpage>211</lpage>.</mixed-citation></ref>
<ref id="R28"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>ortner</surname>, <given-names>Paul</given-names></string-name></person-group> (<year>2009</year>). <source>Modality</source> (Vol. <volume>1</volume>). <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="R29"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Prakken</surname>, <given-names>Henry</given-names></string-name> and <string-name><surname>Sergot</surname>, <given-names>Marek</given-names></string-name></person-group> (<year>1996</year>). <article-title>Contrary-to-Duty Obligations.</article-title> <source>Studia Logica</source>, <volume>57</volume>(<issue>1</issue>), <fpage>91</fpage>&#x2013;<lpage>115</lpage>.</mixed-citation></ref>
<ref id="R30"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Prakken</surname>, <given-names>Henry</given-names></string-name> and <string-name><surname>Sergot</surname>, <given-names>Marek</given-names></string-name></person-group> (<year>1997</year>). <chapter-title>Dyadic Deontic Logic and Contrary-to-Duty Obligations.</chapter-title> In <person-group person-group-type="editor"><string-name><surname>Nute</surname>, <given-names>Donald</given-names></string-name></person-group> (Ed.), <source>Defeasible Deontic Logic</source> (<fpage>223</fpage>&#x2013;<lpage>262</lpage>). <publisher-name>Springer</publisher-name>.</mixed-citation></ref>
<ref id="R31"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Saint-Croix</surname>, <given-names>Catharine</given-names></string-name> and <string-name><surname>Thomason</surname>, <given-names>Richmond H.</given-names></string-name></person-group> (<year>2016</year>). <article-title>Chisholm&#x2019;s Paradox and Conditional Oughts.</article-title> <source>Journal of Logic and Computation</source>, <volume>29</volume>(<issue>3</issue>), <fpage>369</fpage>&#x2013;<lpage>386</lpage>.</mixed-citation></ref>
<ref id="R32"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Sayre-McCord</surname>, <given-names>Geoffrey</given-names></string-name></person-group> (<year>1992</year>). <article-title>Normative Explanations.</article-title> <source>Philosophical Perspectives</source>, <volume>6</volume>, <fpage>55</fpage>&#x2013;<lpage>71</lpage>.</mixed-citation></ref>
<ref id="R33"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Silk</surname>, <given-names>Alex</given-names></string-name></person-group> (<year>2014</year>). <article-title>Why &#x2018;Ought&#x2019; Detaches: Or, Why You Ought to Get with My Friends (If You Want to Be My Lover).</article-title> <source>Philosophers&#x2019; Imprint</source>, <volume>14</volume>(<issue>7</issue>), <fpage>1</fpage>&#x2013;<lpage>16</lpage>.</mixed-citation></ref>
<ref id="R34"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Stalnaker</surname>, <given-names>Robert C.</given-names></string-name></person-group> (<year>1968</year>). <chapter-title>A Theory of Conditionals.</chapter-title> In <person-group person-group-type="editor"><string-name><surname>Harper</surname>, <given-names>William L.</given-names></string-name></person-group>, <person-group person-group-type="editor"><string-name><surname>Stalnaker</surname>, <given-names>Robert</given-names></string-name></person-group>, and <person-group person-group-type="editor"><string-name><surname>Pearce</surname>, <given-names>Glenn</given-names></string-name></person-group> (Eds.), <source>Ifs</source> (<fpage>41</fpage>&#x2013;<lpage>55</lpage>). <publisher-name>Springer</publisher-name>.</mixed-citation></ref>
<ref id="R35"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Stalnaker</surname>, <given-names>Robert C.</given-names></string-name></person-group> (<year>1975</year>). <article-title>Indicative Conditionals.</article-title> <source>Philosophia</source>, <volume>5</volume>(<issue>3</issue>), <fpage>269</fpage>&#x2013;<lpage>286</lpage>.</mixed-citation></ref>
<ref id="R36"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Stalnaker</surname>, <given-names>Robert C.</given-names></string-name></person-group> (<year>1978</year>). <chapter-title>Assertion.</chapter-title> In <person-group person-group-type="editor"><string-name><surname>Cole</surname>, <given-names>Peter</given-names></string-name></person-group> (Ed.), <source>Pragmatics</source> (<fpage>315</fpage>&#x2013;<lpage>332</lpage>). <publisher-name>Brill</publisher-name>.</mixed-citation></ref>
<ref id="R37"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Starr</surname>, <given-names>William B.</given-names></string-name></person-group> (<year>2016</year>). <chapter-title>Dynamic Expressivism about Deontic Modality.</chapter-title> In <person-group person-group-type="editor"><string-name><surname>Charlow</surname>, <given-names>Nate</given-names></string-name></person-group> and <person-group person-group-type="editor"><string-name><surname>Chrisman</surname>, <given-names>Matthew</given-names></string-name></person-group> (Eds.), <source>Deontic Modality</source> (<fpage>355</fpage>&#x2013;<lpage>394</lpage>). <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>Stra&#x00DF;Er</surname>, <given-names>Christian</given-names></string-name></person-group> (<year>2014</year>). <chapter-title>A Deontic Logic Framework Allowing for Factual Detachment.</chapter-title> In <source>Adaptive Logics for Defeasible Reasoning: Applications in Argumentation, Normative Reasoning and Default Reasoning</source> (<fpage>297</fpage>&#x2013;<lpage>333</lpage>). <publisher-name>Springer</publisher-name>.</mixed-citation></ref>
<ref id="R39"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Veltman</surname>, <given-names>Frank</given-names></string-name></person-group> (<year>1996</year>). <article-title>Defaults in Update Semantics.</article-title> <source>Journal of Philosophical Logic</source>, <volume>25</volume>, <fpage>221</fpage>&#x2013;<lpage>261</lpage>.</mixed-citation></ref>
<ref id="R40"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Von Fintel</surname>, <given-names>Kai</given-names></string-name> and <string-name><surname>Anthony</surname>, <given-names>Gillies</given-names></string-name></person-group> (<year>2007</year>). <chapter-title>An Opinionated Guide to Epistemic Modality.</chapter-title> In <person-group person-group-type="editor"><string-name><surname>Szabo Gendler</surname>, <given-names>Tamar</given-names></string-name></person-group> and <person-group person-group-type="editor"><string-name><surname>Hawthorne</surname>, <given-names>John</given-names></string-name></person-group> (Eds.), <source>Oxford Studies in Epistemology</source> (Vol. <volume>2</volume>, <fpage>32</fpage>&#x2013;<lpage>62</lpage>). <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="R41"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wright</surname>, <given-names>Von</given-names></string-name></person-group>, <person-group person-group-type="author"><string-name><surname>Henrik</surname>, <given-names>Georg</given-names></string-name></person-group> (<year>1951</year>). <article-title>Deontic Logic.</article-title> <source>Mind</source>, <volume>60</volume>(<issue>237</issue>), <fpage>1</fpage>&#x2013;<lpage>15</lpage>.</mixed-citation></ref>
<ref id="R42"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wright</surname>, <given-names>Von</given-names></string-name></person-group>, <person-group person-group-type="author"><string-name><surname>Henrik</surname>, <given-names>Georg</given-names></string-name></person-group> (<year>1965</year>). <article-title>A Correction to a New System of Deontic Logic.</article-title> <source>Danish Yearbook of Philosophy</source>, <volume>2</volume>, <fpage>103</fpage>&#x2013;<lpage>107</lpage>.</mixed-citation></ref>
<ref id="R43"><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Wright</surname>, <given-names>Von</given-names></string-name></person-group>, <person-group person-group-type="author"><string-name><surname>Henrik</surname>, <given-names>Georg</given-names></string-name></person-group> (<year>1970</year>). <chapter-title>A New System of Deontic Logic.</chapter-title> In <person-group person-group-type="editor"><string-name><surname>Hilpinen</surname>, <given-names>Risto</given-names></string-name></person-group> (Ed.), <source>Deontic Logic: Introductory and Systematic Readings</source> (<fpage>105</fpage>&#x2013;<lpage>120</lpage>). <publisher-name>Springer</publisher-name>.</mixed-citation></ref>
<ref id="R44"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Willer</surname>, <given-names>Malte</given-names></string-name></person-group> (<year>2013</year>). <article-title>Dynamics of Epistemic Modality.</article-title> <source>Philosophical Review</source>, <volume>122</volume>(<issue>1</issue>), <fpage>45</fpage>&#x2013;<lpage>92</lpage>.</mixed-citation></ref>
<ref id="R45"><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Willer</surname>, <given-names>Malte</given-names></string-name></person-group> (<year>2014</year>). <article-title>Dynamic Thoughts on Ifs and Oughts.</article-title> <source>Philosophers&#x2019; Imprint</source>, <volume>14</volume>(<issue>28</issue>), <fpage>1</fpage>&#x2013;<lpage>30</lpage>.</mixed-citation></ref>
</ref-list>
</back>
</article>
