<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.2 20120330//EN" "http://jats.nlm.nih.gov/publishing/1.2/JATS-journalpublishing1.dtd">
<!--<?xml-stylesheet type="text/xsl" href="article.xsl"?>-->
<article article-type="research-article" dtd-version="1.2" xml:lang="en" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id journal-id-type="issn">2330-4014</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>
<publisher>
<publisher-name>Ergo</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3998/ergo.4631</article-id>
<article-categories>
<subj-group>
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Prefaces, Knowledge, and Questions</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Hong</surname>
<given-names>Frank</given-names>
</name>
<email>franksho@usc.edu</email>
<xref ref-type="aff" rid="aff-1">1</xref>
</contrib>
</contrib-group>
<aff id="aff-1"><label>1</label>University of Southern California</aff>
<pub-date publication-format="electronic" date-type="pub" iso-8601-date="2023-10-31">
<day>31</day>
<month>10</month>
<year>2023</year>
</pub-date>
<pub-date pub-type="collection">
<year>2023</year>
</pub-date>
<volume>10</volume>
<issue>0</issue>
<elocation-id>2</elocation-id>
<history>
<date date-type="received" iso-8601-date="XXXX-XX-XX">
<day>XX</day>
<month>XX</month>
<year>XXXX</year>
</date>
<date date-type="accepted" iso-8601-date="XXXX-XX-XX">
<day>XX</day>
<month>XX</month>
<year>XXXX</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright: &#x00A9; 2023 The Author(s)</copyright-statement>
<copyright-year>2023</copyright-year>
<license license-type="open-access" xlink:href="https://creativecommons.org/licenses/by-nc-nd/4.0/">
<license-p>This is an open-access article distributed under the terms of the Creative Commons Attribution 4.0 International License (CC BY-NC-ND 4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. See <uri xlink:href="https://creativecommons.org/licenses/by-nc-nd/4.0/">https://creativecommons.org/licenses/by-nc-nd/4.0/</uri>.</license-p>
</license>
</permissions>
<self-uri xlink:href="https://journals.publishing.umich.edu/ergo/article/10.3998/ergo.4631/"/>
<abstract>
<p>The Preface Paradox is often discussed for its implications for rational belief. Much less discussed is a variant of the Preface Paradox for knowledge. In this paper, I argue that the most plausible closure-friendly resolution to the Preface Paradox for Knowledge is to say that in any given context, we do not know much. I call this view &#8220;Socraticism&#8221;. I argue that Socraticism is the most plausible view on two accounts&#8212;(1) this view is compatible with the claim that most of our <italic>knowledge ascriptions</italic> are true, and (2) provided that (1) is true, the costs of accepting Socraticism are much less than the costs of accepting any other resolution to the Paradox. I argue for (1) in Section 2 by developing a question-sensitive contextualist model for knowledge that shows how Socraticism is compatible with the claim that most of our knowledge ascriptions are true. I also argue how this contextualist model can achieve this result where other contextualist models fail. I then consider other closure-friendly solutions to the paradox in Section 3 and show how accepting those solutions forces us to give up a number of plausible epistemic principles.</p>
</abstract>
</article-meta>
</front>
<body>
<sec>
<title>1. Introduction</title>
<p>&#8220;We know a lot&#8221;.<xref ref-type="fn" rid="n1">1</xref> At least, that&#8217;s what one might think. But as has been noted by Hawthorne (<xref ref-type="bibr" rid="B19">2003</xref>), Benton (<xref ref-type="bibr" rid="B1">2017</xref>), and Hawthorne (<xref ref-type="bibr" rid="B18">2002</xref>), a preface paradox for knowledge may bring that assumption into question. Here is a variant of such a paradox. Consider Xin, a person who purportedly knows a lot, and at time <inline-formula><mml:math id="Eq001-mml"><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> she writes a lot of things she thinks she knows. They range from things she has come to believe on the basis of perception (e.g., that there is a dog in her backyard) to things she has come to believe on the basis of testimony (e.g., that the Battle of Hastings took place in the year 1066) to things she has come to believe on the basis of <italic>a priori</italic> deduction (e.g., that the square root of <inline-formula><mml:math id="Eq002-mml"><mml:mn>2</mml:mn></mml:math></inline-formula> is irrational). After producing her impressive book of purported knowledge, she suspects that there must be <italic>at least one error</italic> in there, and most likely more than one error. After all, hardly anyone has <italic>only</italic> true beliefs. Much to her surprise, at time <inline-formula><mml:math id="Eq003-mml"><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> God appears and tells her, &#8220;Impressive! Every proposition in this book is true, save one!&#8221;. In fact, of the <inline-formula><mml:math id="Eq004-mml"><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> propositions in the book, propositions <inline-formula><mml:math id="Eq005-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq006-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> are all true, while <inline-formula><mml:math id="Eq007-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is false. Delighted, Xin goes away thinking that she knew more than she originally thought&#8212;after all, Xin has now come to learn that she knows every proposition in that book save for one. Or does she? Given <bold>Closure</bold>, there may be good reasons to suspect that Xin does not know as much as she thinks she knows.</p>
<disp-quote>
<p><bold>Closure:</bold> Necessarily, for any set of propositions <inline-formula><mml:math id="Eq008-mml"><mml:mi>A</mml:mi></mml:math></inline-formula>, if for any proposition <inline-formula><mml:math id="Eq009-mml"><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>A</mml:mi></mml:mrow></mml:math></inline-formula>, one knows <inline-formula><mml:math id="Eq010-mml"><mml:mi>p</mml:mi></mml:math></inline-formula>, then one is in a position to know by deduction whatever is entailed by <inline-formula><mml:math id="Eq011-mml"><mml:mi>A</mml:mi></mml:math></inline-formula>.</p>
</disp-quote>
<p>Consider the following argument. Suppose for <italic>reductio</italic> that Xin really does know all the true propositions in the book (i.e., <inline-formula><mml:math id="Eq012-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq013-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>) at <inline-formula><mml:math id="Eq014-mml"><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>. Xin also knows at <inline-formula><mml:math id="Eq015-mml"><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> (from God&#8217;s testimony) that there is exactly one false proposition among <inline-formula><mml:math id="Eq016-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq017-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>. Thus, if Xin knows all of <inline-formula><mml:math id="Eq018-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq019-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, and Xin knows that there is exactly one false proposition among <inline-formula><mml:math id="Eq020-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq021-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, it follows from <bold>Closure</bold> that she is in a position to know that <inline-formula><mml:math id="Eq022-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is false. But this is absurd. Even if Xin knows that there is exactly one false proposition in the book, it is <italic>prima facie</italic> implausible that she can be in a position to simply <italic>deduce which</italic> proposition is false. Thus, if Xin is not in a position to know which proposition is false at <inline-formula><mml:math id="Eq023-mml"><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> when she learns that there is exactly one false proposition in the book, then it follows from <bold>Closure</bold> that she is not in a position to know all of the true propositions <inline-formula><mml:math id="Eq024-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq025-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> at <inline-formula><mml:math id="Eq026-mml"><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>.</p>
<p>What is striking about this result is that very little is assumed about how Xin came to believe the things she has come to believe. Pick your favourite source of knowledge (e.g., perception, <italic>a priori</italic> deduction, testimony, etc.), and we can stipulate that each of the true individual beliefs that were produced by these sources of knowledge are safe and are without any defeaters (e.g., no fake barns, stopped clocks, or inferences from false premises). No matter how safe each of her individual beliefs are, no matter how competently she has formed them, the moment she learns that she has exactly one false belief, it follows that she also fails to know <italic>something else</italic> that is true.</p>
<p>So much for what Xin knows at <inline-formula><mml:math id="Eq027-mml"><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>. But what about <inline-formula><mml:math id="Eq028-mml"><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>? Perhaps Xin knew all of <inline-formula><mml:math id="Eq029-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq030-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and somehow her knowledge was <italic>lost</italic> when she heard from God. In Section 3.1, we will discuss this possibility that one&#8217;s knowledge is defeated when one learns that one has a single false belief. For now, it suffices to say that, for a set of beliefs like Xin&#8217;s, this possibility conflicts with a plausible principle connecting probability and defeat:</p>
<disp-quote>
<p><bold>Defeating Evidence Is Not Confirming Evidence:</bold> If one knows <inline-formula><mml:math id="Eq031-mml"><mml:mi>p</mml:mi></mml:math></inline-formula>, then evidence <inline-formula><mml:math id="Eq032-mml"><mml:mi>E</mml:mi></mml:math></inline-formula> does not defeat one&#8217;s knowledge of <inline-formula><mml:math id="Eq033-mml"><mml:mi>p</mml:mi></mml:math></inline-formula> if <inline-formula><mml:math id="Eq034-mml"><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mo>&#x007C;</mml:mo><mml:mi>E</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x003E;</mml:mo><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote>
<p>Now, what do I mean by a &#8220;set of beliefs like Xin&#8217;s&#8221;? For us, the important thing about Xin&#8217;s set of beliefs that gives rise to this puzzle is the fact that (1) Xin is very confident that there is <italic>at least</italic> one false belief in the set (recall how Xin was actually surprised that there was <italic>only one</italic> error among the set!), and (2) Xin has no special reason to think that any particular belief is false when she learns that she had exactly one false belief. I show in Section 3.1 that, since Xin&#8217;s sets of beliefs satisfy (1) and (2), <bold>Defeating Evidence Is Not Confirming Evidence</bold> implies that Xin cannot have lost any knowledge after learning that one of <inline-formula><mml:math id="Eq035-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq036-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is false.</p>
<p>Now, if none of Xin&#8217;s knowledge gets defeated when she learns that there is a single false proposition in the book, then this suggests that whichever of <inline-formula><mml:math id="Eq037-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq038-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> that Xin doesn&#8217;t know at <inline-formula><mml:math id="Eq039-mml"><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, she never knew at <inline-formula><mml:math id="Eq040-mml"><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> either.</p>
<p>This suggests that at <inline-formula><mml:math id="Eq041-mml"><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, the following is true of her epistemic state:</p>
<disp-quote>
<p><bold>No Loss, No Gain:</bold> It is possible for Xin to learn that there is exactly one false claim in her book without:</p>
<p>(a): losing knowledge of any of <inline-formula><mml:math id="Eq042-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq043-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>. [<bold>No Loss</bold>]</p>
<p>(b): being in a position to know <inline-formula><mml:math id="Eq044-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>. [<bold>No Gain</bold>]</p>
</disp-quote>
<p>However, <bold>No Loss, No Gain</bold> is jointly inconsistent with the following three assumptions:</p>
<disp-quote>
<p><bold>Closure:</bold> Necessarily, for any set of propositions <inline-formula><mml:math id="Eq045-mml"><mml:mi>A</mml:mi></mml:math></inline-formula>, if for any proposition <inline-formula><mml:math id="Eq046-mml"><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>A</mml:mi></mml:mrow></mml:math></inline-formula>, one knows <inline-formula><mml:math id="Eq047-mml"><mml:mi>p</mml:mi></mml:math></inline-formula>, then one is in a position to know by deduction whatever is entailed by <inline-formula><mml:math id="Eq048-mml"><mml:mi>A</mml:mi></mml:math></inline-formula>.</p>
<p><bold>Xin is Fallible:</bold> Xin does not know <inline-formula><mml:math id="Eq049-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>.</p>
<p><bold>Xin Knows A Lot:</bold> Xin knows all of <inline-formula><mml:math id="Eq050-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq051-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote>
<p>To see how <bold>No Loss, No Gain, Closure, Xin is Fallible</bold> and <bold>Xin Knows A Lot</bold> are jointly inconsistent, first suppose <bold>Xin Knows A Lot</bold>. Since <bold>Xin Knows A Lot</bold>, it follows by <bold>Closure</bold> that Xin is in a position to know <inline-formula><mml:math id="Eq052-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x2227;</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>&#x2227;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>. If Xin learns that there is exactly one false claim in <inline-formula><mml:math id="Eq053-mml"><mml:mi>A</mml:mi></mml:math></inline-formula>, then <italic>either</italic> Xin can come to know <inline-formula><mml:math id="Eq054-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> by <bold>Closure</bold>, OR, Xin can&#8217;t come to know <inline-formula><mml:math id="Eq055-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> by <bold>Closure</bold>. If Xin can come to know <inline-formula><mml:math id="Eq056-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> by <bold>Closure</bold>, then <bold>No Gain</bold> is false. If Xin <italic>cannot</italic> come to know <inline-formula><mml:math id="Eq057-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> by <bold>Closure</bold>, then that can only be because she has somehow lost her knowledge of one of <inline-formula><mml:math id="Eq058-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq059-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, and so <bold>No Loss</bold> is false. Either way, both cases contradict <bold>No Loss, No Gain</bold>, and so the four assumptions are jointly inconsistent.</p>
<p>It is worth noting that this puzzle is related, but importantly different, from standard presentations of the Lottery and the original Preface Paradox. Like the lottery, we have a case where there are a great number of propositions, each of which is likely to be true, one of which is false, and where we do not know which one is false. In the case of the lottery, the propositions are all of the form <italic>ticket</italic> <inline-formula><mml:math id="Eq060-mml"><mml:mi>i</mml:mi></mml:math></inline-formula> <italic>is going to lose</italic>. However, in standard presentations of the Lottery Paradox, one is supposed to have the intuition that one doesn&#8217;t know whether <italic>any</italic> of those propositions are true. I hope that in Xin&#8217;s case, however, you have the exact opposite intuition from the lottery case&#8212;that is, that for at least some of Xin&#8217;s beliefs, she knows whether they are true.<xref ref-type="fn" rid="n2">2</xref></p>
<p>Secondly, this case is similar to, but importantly different from, the original Preface Paradox as presented by Makinson (<xref ref-type="bibr" rid="B28">1965</xref>). That paradox is about rational <italic>belief</italic>. In Makinson&#8217;s setup, the author is rational in believing claims <inline-formula><mml:math id="Eq061-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq062-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, but is also rational in believing <inline-formula><mml:math id="Eq063-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x2227;</mml:mo><mml:mn>&#x2026;</mml:mn><mml:mo>&#x2227;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>. The puzzle is that these beliefs are clearly inconsistent, but the author seems to be eminently rational in having each of these beliefs. Similarly, in Xin&#8217;s case, it may seem eminently rational for Xin to believe each of <inline-formula><mml:math id="Eq064-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq065-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> but also believe (indeed, <inline-formula><mml:math id="Eq066-mml"><mml:mtext mathvariant="italic">know</mml:mtext></mml:math></inline-formula>) <inline-formula><mml:math id="Eq067-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x2227;</mml:mo><mml:mn>&#x2026;</mml:mn><mml:mo>&#x2227;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>.</p>
<p>However, whereas the original paradox is about rational belief, the puzzle we have here is about knowledge. Indeed, what makes the Preface Paradox so puzzling for belief is that one can say in a preface, &#8220;I believe each claim in this book; otherwise, I wouldn&#8217;t have written these claims down! However, I am not so arrogant as to say that I believe that there are no errors in the book&#8221;. However, to produce our paradox for knowledge, it is not so simple a matter as to replace each occurrence of &#8220;believe&#8221; in the preface for the word &#8220;knows&#8221;. For one would not write in a preface: &#8220;I <inline-formula><mml:math id="Eq068-mml"><mml:mtext mathvariant="italic">know</mml:mtext></mml:math></inline-formula> each claim in this book; otherwise, I wouldn&#8217;t have written these claims down! However, I am not so arrogant as to say that I <inline-formula><mml:math id="Eq069-mml"><mml:mtext mathvariant="italic">know</mml:mtext></mml:math></inline-formula> that there are no errors in the book&#8221;. Whereas the former statement is a beautiful display of one&#8217;s humility, the latter claim sounds downright bizarre.</p>
<p>So what we have here is a Preface Paradox for Knowledge. What shall we say about it? Which assumption should be denied?</p>
<p>In this paper, I will argue that <bold>Xin Knows A Lot</bold> is false. Indeed, I argue <bold>Xin Doesn&#8217;t Know a Lot</bold>&#8212;that there is some true proposition in the book that Xin simply does not know.</p>
<p>However, as I argue for <bold>Xin Doesn&#8217;t Know A Lot</bold>, I want to distinguish my approach from two other possible approaches that make that claim <italic>trivially</italic> true. Those two approaches are both Infallibilist in nature: they both claim that knowledge requires certainty.</p>
<p>On the first Infallibilist approach, we say that Xin hardly knows anything at all since she is not certain in any of her beliefs. Moreover, since Xin is as good of an epistemic agent as they come, it follows that <italic>we too</italic> hardly know anything at all. Let us call this view a &#8220;Pessimistic Infallibilism&#8221; since infallibilists of this sort tend to be skeptics (see <xref ref-type="bibr" rid="B35">Unger 1971</xref> as an example).</p>
<p>On the second Infallibilist approach, we say that knowledge requires certainty because our body of evidence E <italic>just is</italic> our body of knowledge K and a rational agent&#8217;s credences matches their prior probabilities conditional on all their evidence (see <xref ref-type="bibr" rid="B36">Williamson 2000</xref>). So for example, for any proposition <inline-formula><mml:math id="Eq070-mml"><mml:mi>p</mml:mi></mml:math></inline-formula> that one knows, <inline-formula><mml:math id="Eq071-mml"><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mo>&#x007C;</mml:mo><mml:mi>E</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>, and so one should be certain in <inline-formula><mml:math id="Eq072-mml"><mml:mi>p</mml:mi></mml:math></inline-formula>. Like the &#8220;Pessimistic Infallibilist&#8221; approach, this second kind of approach continues to say that Xin doesn&#8217;t know a lot since Xin is not certain in any of her beliefs.<xref ref-type="fn" rid="n3">3</xref> However, unlike Pessimistic Infallibilism, this kind of Infallibilism does not necessarily say that Xin is as good of an epistemic agent as they come. Indeed, proponents of the E = K thesis would often say that, if we were rational, <italic>we</italic> should be certain in many propositions. Thus, though the E = K theorist might say that Xin (at least in how I described her in not being rationally certain in any of her beliefs) hardly knows anything, the E = K theorist may still say that <italic>we</italic> can still know many things. Let us call this kind of Infallibilist an &#8220;Optimistic Infallibilist&#8221;.</p>
<p>As I argue against <bold>Xin Knows A Lot</bold>, I eschew both these approaches. I am a die-hard Fallibilist. I believe that knowledge does not require certainty. And unlike the Pessimistic Infallibilist, I am not a skeptic. And unlike the Optimistic Infallibilist, I do not regard us as any better than Xin. If not even Xin can know a lot, then neither can we.</p>
<p>Indeed, I argue that we do not know a lot because <italic>we</italic> are similar to Xin at <inline-formula><mml:math id="Eq073-mml"><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>. For just as (1) Xin is confident that there is <italic>at least</italic> one error among her beliefs, so am I that I have <italic>at least</italic> one error among my beliefs. And just as (2) Xin has no special reason to think that any particular belief of hers is false if exactly one of her beliefs is false, so too I have no special reason to think that any particular belief of mine is false if exactly one of my beliefs is false. In fact, this is true of me for even just a fraction of the beliefs I have gained in my lifetime. For example, after talking to some friends, reading bits of news, and a few chapters of a book in the last week, I have come to acquire many beliefs, and I am quite confident that I have acquired <italic>at least</italic> one false belief. Furthermore, I have no special reason to think that any particular belief is more likely to be false if only <italic>one</italic> of my beliefs is false.</p>
<p>And so, since the set of beliefs I have gained this past week is relevantly similar to the set of beliefs Xin has written down in her book, if Xin could not know all the true propositions she believes at <inline-formula><mml:math id="Eq074-mml"><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, then so too am I unable to know all the true propositions I have come to believe in the past week. And compared to all the beliefs I have gained in my lifetime, if I cannot even come to know all the true propositions I have come to believe in the past week, then I don&#8217;t know very much at all. Thus, since Xin doesn&#8217;t know a lot, I argue for:</p>
<disp-quote>
<p><bold>Socraticism:</bold> We do not know a lot.</p>
</disp-quote>
<p><bold>Socraticism</bold> is so called because, if true, it would mean that Socrates was right all along to be suspicious of those who claim to know much when in fact they know very little. Indeed, if <bold>Socraticism</bold> is true, it would mean that we all don&#8217;t know as much as we ordinarily think we do, and not just Socrates&#8217;s overconfident interlocutors.</p>
<p>I should also note that the claim that we do not know &#8220;a lot&#8221; is distinct, but related, from the claim that we do not know a &#8220;large number of propositions&#8221;. Clearly, if one knows a lot of things, then one would also know a large number of propositions, but not vice-versa. One can know some proposition <inline-formula><mml:math id="Eq075-mml"><mml:mi>p</mml:mi></mml:math></inline-formula>, and also be in a position to know <inline-formula><mml:math id="Eq076-mml"><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#x2228;</mml:mo><mml:mi>q</mml:mi></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math id="Eq077-mml"><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#x2228;</mml:mo><mml:mi>q</mml:mi><mml:mo>&#x2228;</mml:mo><mml:mi>r</mml:mi></mml:mrow></mml:math></inline-formula>, and so on. If someone only knew <inline-formula><mml:math id="Eq078-mml"><mml:mi>p</mml:mi></mml:math></inline-formula> and all its logical consequences, such a person would know a large number of propositions, but such a person would hardly count as someone who &#8220;knows a lot&#8221;. At the very least, someone who &#8220;knows a lot&#8221; would be someone who knows a large number of propositions that are not too dependent on each other.<xref ref-type="fn" rid="n4">4</xref></p>
<p>As surprising as this claim is, I will be defending <bold>Socraticism</bold>. Both I and the Skeptic (who argues that we don&#8217;t know anything at all except some <italic>a priori</italic> truths and perhaps some other truths of which we are certain) can agree on <bold>Socraticism</bold>. However, I depart from the Skeptic on two accounts. Firstly, I depart from the Skeptic in that I still think that we know <italic>some a posteriori</italic> things of which we aren&#8217;t certain. I just think that we do not know nearly as much as we think we know.</p>
<p>Secondly, I depart from the Skeptic in that I think that <italic>many</italic> of our knowledge ascriptions such as &#8220;A knows that p&#8221; are true. This is because I will be giving a contextualist model where &#8220;knows&#8221; expresses different relations in different contexts. So, whereas many of our knowledge ascriptions may not be true in a <italic>single</italic> context, many of our knowledge ascriptions are still true in <italic>some</italic> contexts.</p>
<p>In Section 2, I give my own model that is consistent with <bold>No Loss, No Gain</bold> and <bold>Closure</bold>, while still vindicating the idea that many of our knowledge ascriptions are true. I discuss some advantages of my model, including the fact that it can reconcile <bold>Closure</bold> with another plausible principle: <bold>Modesty</bold>. <bold>Modesty</bold> is the principle that one is justified in believing that not all of one&#8217;s beliefs are true. In Section 3, I explore the consequences of denying <bold>No Loss, No Gain</bold>.</p>
<p>In the following, I will take <bold>Closure</bold> for granted. Indeed, the costs for denying <bold>Closure</bold> are quite high. Stephen Yablo recalls that Kripke used to make vivid the implausibility of denying <bold>Closure</bold> by exclaiming, when giving a deductive argument with irreproachable reasoning, &#8220;Oh no, I&#8217;ve just committed the fallacy of logical deduction!&#8221; (<xref ref-type="bibr" rid="B39">Yablo 2014: 116</xref>). Still, perhaps the conclusion <bold>Socraticism</bold> is reason to place <bold>Closure</bold> under suspicion. I hope, however, that the contextualist model about to be presented will be able to take the sting away from <bold>Socraticism</bold>, vindicate most of our knowledge ascriptions, and make some headway into resolving the the original Preface Paradox, all without giving up <bold>Closure</bold>.<xref ref-type="fn" rid="n5">5</xref></p>
</sec>
<sec>
<title>2. A Contextualist Solution</title>
<p>Contextualism is a view about how the word &#8220;knows&#8221; can vary in its semantic value depending on speaker context. Thus, there is no single relation, <inline-formula><mml:math id="Eq079-mml"><mml:mtext mathvariant="italic">knows</mml:mtext></mml:math></inline-formula>, that is expressed by &#8220;knows&#8221; in every context. Instead, we have a plethora of knowledge relations&#8212;we have the relation <inline-formula><mml:math id="Eq080-mml"><mml:mtext mathvariant="italic">know</mml:mtext><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula><mml:math id="Eq081-mml"><mml:mtext mathvariant="italic">know</mml:mtext><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula>, &#8230; etc., and any of these relations can be expressed by the word &#8220;knows&#8221; in some context.</p>
<p>Contextualism is particularly well-suited for defending <bold>Closure</bold><xref ref-type="fn" rid="n6">6</xref> from counter-examples. For example, it is intuitive to think that one can easily know whether one&#8217;s car is in the parking lot, but also intuitive to think that one does not know whether one&#8217;s car has in fact been stolen in the last hour. However, one also knows that if one&#8217;s car is in the parking lot, then the car has not in fact been stolen in the last hour. <bold>Closure</bold> would then seem to imply that one both knows, and doesn&#8217;t know, that one&#8217;s car is still in the parking lot. Fortunately, contextualists have a ready solution. One <inline-formula><mml:math id="Eq082-mml"><mml:mtext mathvariant="italic">know</mml:mtext><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> that the car is still in the parking lot, and thereby also <inline-formula><mml:math id="Eq083-mml"><mml:mtext mathvariant="italic">know</mml:mtext><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> (by <bold>Closure</bold>) that no thief has stolen the car. However, in a different context where one is considering the possibility of a thief lurking in the neighborhood, or if the stakes of a stolen car are high, or (insert one&#8217;s preferred explanation for context shift here), &#8220;knows&#8221; might express the relation <inline-formula><mml:math id="Eq084-mml"><mml:mtext mathvariant="italic">know</mml:mtext><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula>, and one may fail to <inline-formula><mml:math id="Eq085-mml"><mml:mtext mathvariant="italic">kno</mml:mtext><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> that a thief stole the car and thereby also fail to <inline-formula><mml:math id="Eq086-mml"><mml:mtext mathvariant="italic">kno</mml:mtext><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> that one&#8217;s car is in the parking lot. So, contextualists can explain why, in some contexts, we are inclined to say that one &#8220;knows that the car is in the parking lot&#8221; while in other contexts refrain from saying that one &#8220;knows that a thief didn&#8217;t steal the car&#8221; without impugning <bold>Closure</bold>.</p>
<p>However, things are a little different with our puzzle. After God speaks, the contextualist must offer an explanation for why we are not reluctant to say &#8220;Xin knows <inline-formula><mml:math id="Eq087-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>&#8221; for any <inline-formula><mml:math id="Eq088-mml"><mml:mi>i</mml:mi></mml:math></inline-formula> from <inline-formula><mml:math id="Eq089-mml"><mml:mn>1</mml:mn></mml:math></inline-formula> to <inline-formula><mml:math id="Eq090-mml"><mml:mi>n</mml:mi></mml:math></inline-formula>, but are somehow reluctant to also say &#8220;Xin is in a position to know <inline-formula><mml:math id="Eq091-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>&#8221;. For a contextualist solution to work, one cannot simply say that Xin <inline-formula><mml:math id="Eq092-mml"><mml:mtext mathvariant="italic">know</mml:mtext><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> each of <inline-formula><mml:math id="Eq093-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq094-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, but is not in a position to <inline-formula><mml:math id="Eq095-mml"><mml:mtext mathvariant="italic">kno</mml:mtext><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> <inline-formula><mml:math id="Eq096-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>. For if a contextualist says this, then one must admit that Xin is in a position to <inline-formula><mml:math id="Eq097-mml"><mml:mtext mathvariant="italic">kno</mml:mtext><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula>, by <bold>Closure</bold>, <inline-formula><mml:math id="Eq098-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>. But unlike knowing whether a thief has stolen a car, it is implausible that &#8220;Xin is in a position to know <inline-formula><mml:math id="Eq099-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>&#8221; is true in <italic>any</italic> context.</p>
<p>Broadly speaking, in order for a contextualist solution to work, we need to have reason to believe that for each <inline-formula><mml:math id="Eq100-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> from <inline-formula><mml:math id="Eq101-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> to <inline-formula><mml:math id="Eq102-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, there is <italic>some</italic> context <inline-formula><mml:math id="Eq103-mml"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> such that &#8220;Xin knows <inline-formula><mml:math id="Eq104-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>&#8221; is true relative to <inline-formula><mml:math id="Eq105-mml"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, but that there is no <italic>single</italic> context <inline-formula><mml:math id="Eq106-mml"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>a</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> where all of those utterances are true. Thus, we need a picture that accepts the following combo:</p>
<boxed-text>
<p><bold>Combo A</bold></p>
<p>&#8220;Xin knows <inline-formula><mml:math id="Eq107-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>&#8221; is true relative to context <inline-formula><mml:math id="Eq108-mml"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></p>
<p>&#8220;Xin knows <inline-formula><mml:math id="Eq109-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>&#8221; is true relative to context <inline-formula><mml:math id="Eq110-mml"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></p>
<p>.</p>
<p>.</p>
<p>.</p>
<p>&#8220;Xin knows <inline-formula><mml:math id="Eq111-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>&#8221; is true relative to context <inline-formula><mml:math id="Eq112-mml"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></p>
</boxed-text>
<p>But we <italic>do not</italic> want a <italic>single context</italic> <inline-formula><mml:math id="Eq113-mml"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>a</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> such that:</p>
<boxed-text>
<p><bold>Combo B</bold></p>
<p>&#8220;Xin knows <inline-formula><mml:math id="Eq114-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>&#8221; is true relative to context <inline-formula><mml:math id="Eq115-mml"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>a</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></p>
<p>&#8220;Xin knows <inline-formula><mml:math id="Eq116-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>&#8221; is true relative to context <inline-formula><mml:math id="Eq117-mml"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>a</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></p>
<p>.</p>
<p>.</p>
<p>.</p>
<p>&#8220;Xin knows <inline-formula><mml:math id="Eq118-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>&#8221; is true relative to context <inline-formula><mml:math id="Eq119-mml"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>a</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></p>
</boxed-text>
<p>For if there were such a context, then <bold>Closure</bold> would imply that there is some relation <inline-formula><mml:math id="Eq120-mml"><mml:mtext mathvariant="italic">know</mml:mtext><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mn>a</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> such that Xin is in a position to <inline-formula><mml:math id="Eq121-mml"><mml:mtext mathvariant="italic">know</mml:mtext><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mn>a</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> <inline-formula><mml:math id="Eq122-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, and thus, &#8220;Xin is in a position to know <inline-formula><mml:math id="Eq123-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>&#8221; would be true in some context.</p>
<p>So, can a contextualist accept <bold>Combo A</bold>, but reject <bold>Combo B</bold>? On the two most common kinds of contextualism (&#8220;Standard-Shifting&#8221; Contextualism and Lewisian Contextualism), the answer is &#8220;no&#8221;. Let us see why for each in turn.<xref ref-type="fn" rid="n7">7</xref></p>
<sec>
<title>2.1. &#8220;Standard-Shifting&#8221; Contextualism</title>
<p>On a &#8220;Standard-Shifting&#8221; contextualism, the contextually salient parameter that shifts from context to context is one&#8217;s &#8220;epistemic standard&#8221;. One example of this kind of contextualism is DeRose&#8217;s contextualism, where the meaning of &#8220;S knows that <inline-formula><mml:math id="Eq124-mml"><mml:mi>p</mml:mi></mml:math></inline-formula>&#8221; is something like, &#8220;S has a true belief that <inline-formula><mml:math id="Eq125-mml"><mml:mi>p</mml:mi></mml:math></inline-formula>, and is in <italic>a good enough</italic> epistemic position with respect to <inline-formula><mml:math id="Eq126-mml"><mml:mi>p</mml:mi></mml:math></inline-formula>&#8221; (<xref ref-type="bibr" rid="B7">DeRose 2009: 3</xref>), where &#8220;good enough epistemic position&#8221; varies with the context. How &#8220;good&#8221; one&#8217;s epistemic position is is determined by the epistemic standards of the context. When the standards are high, &#8220;knows&#8221; expresses <inline-formula><mml:math id="Eq127-mml"><mml:mtext mathvariant="italic">know</mml:mtext><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mtext mathvariant="italic">high</mml:mtext></mml:mrow></mml:msub></mml:math></inline-formula>, and it is very difficult to <inline-formula><mml:math id="Eq128-mml"><mml:mtext mathvariant="italic">kno</mml:mtext><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mtext mathvariant="italic">high</mml:mtext></mml:mrow></mml:msub></mml:math></inline-formula> many things. On the other hand, when the standards are low, &#8220;knows&#8221; expresses <inline-formula><mml:math id="Eq129-mml"><mml:mtext mathvariant="italic">know</mml:mtext><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mtext mathvariant="italic">low</mml:mtext></mml:mrow></mml:msub></mml:math></inline-formula>, and one presumably can <inline-formula><mml:math id="Eq130-mml"><mml:mtext mathvariant="italic">kno</mml:mtext><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mtext mathvariant="italic">low</mml:mtext></mml:mrow></mml:msub></mml:math></inline-formula> many things.</p>
<p>But this view would not help with our puzzle at hand. For presumably, Xin has evidence <italic>par excellence</italic> for believing each of <inline-formula><mml:math id="Eq131-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq132-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>. Thus, she should <inline-formula><mml:math id="Eq133-mml"><mml:mtext mathvariant="italic">kno</mml:mtext><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mtext mathvariant="italic">low</mml:mtext></mml:mrow></mml:msub></mml:math></inline-formula> each of <inline-formula><mml:math id="Eq134-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq135-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>. But if that is the case, then we have a knowledge relation that satisfies <bold>Combo B</bold>, and <bold>Closure</bold> would then imply that Xin is in a position to <inline-formula><mml:math id="Eq136-mml"><mml:mtext mathvariant="italic">kno</mml:mtext><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mtext mathvariant="italic">low</mml:mtext></mml:mrow></mml:msub></mml:math></inline-formula> <inline-formula><mml:math id="Eq137-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>.</p>
<p>Furthermore, it is no help to consider contexts in which the standards are higher either. For no matter what the standards are, Xin&#8217;s true beliefs either all meet the standard (and so they all count as knowledge), or they all fail the standard (and so none count as knowledge). Thus, no matter the standards, either we get <bold>Combo A</bold> and <bold>Combo B</bold> together, or we get neither. What we want, however, is a contextualist model that offers <bold>Combo A</bold> without <bold>Combo B</bold>.</p>
<p>In general, any kind of contextualism that works by shifting &#8220;standards&#8221; from context to context will be unable to solve our puzzle. For example, consider a kind of contextualism where one can only know a proposition if one&#8217;s credence in that proposition conditional on one&#8217;s evidence is &#8220;sufficiently high&#8221;, where &#8220;sufficiently high&#8221; is context sensitive. For example, a sentence like &#8220;Xin knows that <inline-formula><mml:math id="Eq138-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>&#8221; might be true in a low standards context where Xin only needs to be about <inline-formula><mml:math id="Eq139-mml"><mml:mn>0.9</mml:mn></mml:math></inline-formula> certain in <inline-formula><mml:math id="Eq140-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, but &#8220;Xin knows that <inline-formula><mml:math id="Eq141-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>&#8221; might be false in a high standards context where Xin needs to be at least <inline-formula><mml:math id="Eq142-mml"><mml:mn>0.9999</mml:mn></mml:math></inline-formula> certain in <inline-formula><mml:math id="Eq143-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>. But this solution won&#8217;t work because, on this view, Xin can still <inline-formula><mml:math id="Eq144-mml"><mml:mtext mathvariant="italic">kno</mml:mtext><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mtext mathvariant="italic">low</mml:mtext></mml:mrow></mml:msub></mml:math></inline-formula> <inline-formula><mml:math id="Eq145-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> for any <inline-formula><mml:math id="Eq146-mml"><mml:mi>i</mml:mi></mml:math></inline-formula>. Thus, <bold>Closure</bold> will imply that Xin is in a position to <inline-formula><mml:math id="Eq147-mml"><mml:mtext mathvariant="italic">kno</mml:mtext><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mtext mathvariant="italic">low</mml:mtext></mml:mrow></mml:msub></mml:math></inline-formula> <inline-formula><mml:math id="Eq148-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>.<xref ref-type="fn" rid="n8">8</xref></p>
<p>The problem with contextualist views where the shifting contextually salient parameter is some &#8220;epistemic standard&#8221; is that one can always stipulate a case where, for many propositions, one meets that standard for each of those propositions. Thus, no matter what the standards are, or how they shift, we can just stipulate that Xin meets some standard for <inline-formula><mml:math id="Eq149-mml"><mml:mi>n</mml:mi></mml:math></inline-formula> true propositions. But once we have such a case, we have <bold>Combo B</bold>, and <bold>Closure</bold> would then imply that &#8220;Xin is in a position to know <inline-formula><mml:math id="Eq150-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>&#8221; is true in that context where that epistemic standard is at play.</p>
<p>Now, defenders of the &#8220;shifting-standards&#8221; approach may say that whenever we utter, &#8220;Xin is not in a position to know <inline-formula><mml:math id="Eq151-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>&#8221;, any epistemic standard under which we would know <inline-formula><mml:math id="Eq152-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq153-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> are <italic>never</italic> at play, and so these are contexts in which we should be able to say of any <inline-formula><mml:math id="Eq154-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> that Xin is not in a position to know <inline-formula><mml:math id="Eq155-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>. But this is a bit odd. When we say, &#8220;Xin is not in a position to know <inline-formula><mml:math id="Eq156-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>&#8221;, we should be able to say so without kicking the epistemic standards into ultra high-gear. It is not as if, when we deny Xin&#8217;s knowledge of <inline-formula><mml:math id="Eq157-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, we are suddenly Cartesian infallibilists who are prepared to also deny that Xin knows her own name. We simply deny that Xin is in a position to know <inline-formula><mml:math id="Eq158-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> because she falsely believes in its negation, and so we should be able to deny that she is in a position to know <inline-formula><mml:math id="Eq159-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> even when the standards of knowledge are very low.<xref ref-type="fn" rid="n9">9</xref> What we would like to be able to do is to deny, in one context, that Xin is in a position to know <inline-formula><mml:math id="Eq160-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> <inline-formula><mml:math id="Eq161-mml"><mml:mtext mathvariant="italic">without</mml:mtext></mml:math></inline-formula> having to deny Xin&#8217;s knowledge of <italic>all</italic> of <inline-formula><mml:math id="Eq162-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq163-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>; and we would like to be able to be able to affirm, in one context, that Xin is in a position to know one of <inline-formula><mml:math id="Eq164-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq165-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> without consequently having to affirm that she knows <italic>all</italic> of <inline-formula><mml:math id="Eq166-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq167-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and thereby be in a position to know <inline-formula><mml:math id="Eq168-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> by <bold>Closure</bold>.</p>
<p>What we need, then, is a contextualist view where one can only know relatively few propositions in each context. The problem with &#8220;standard-shifting&#8221; contextualist views is that, once we have a contextually salient standard, there is no limit to how many propositions meet that standard. But once we have that kind of contextualist feature, we will have a difficult time accepting <bold>Combo A</bold> while rejecting <bold>Combo B</bold>. Let&#8217;s see if Lewisian contextualism fares any better.</p>
</sec>
<sec>
<title>2.2. Lewisian Contextualism</title>
<p>We have seen how &#8220;standard- shifting&#8221; contextualist views are inadequate for solving our puzzle at hand. Lewis, for different reasons, also rejected the &#8220;standard-shifting&#8221; contextualist view:</p>
<disp-quote>
<p>If you start from the ancient idea that justification is the mark that distinguishes knowledge from mere opinion (even true opinion), then you well might conclude that ascriptions of knowledge are context-dependent because standards for adequate justification are context-dependent&#8230;But I myself cannot subscribe to this account of the context-dependence of knowledge, because I question its starting point. I don&#8217;t agree that the mark of knowledge is justification. (<xref ref-type="bibr" rid="B26">1996: 550&#8211;51</xref>)</p>
</disp-quote>
<p>On Lewis&#8217;s view, as expounded in &#8220;Elusive Knowledge&#8221;, S knows proposition P iff:</p>
<disp-quote>
<p>P holds in every possibility left uneliminated by P&#8217;s evidence; equivalently, iff S&#8217;s evidence eliminates every possibility in which not-P. (<xref ref-type="bibr" rid="B26">1996: 551</xref>)</p>
</disp-quote>
<p>Here, the word &#8220;every&#8221; is context sensitive. In some contexts, &#8220;every&#8221; quantifies over possibilities where S is a handless Brain-In-A-Vat (BIV), and sometimes not. In the context where &#8220;every&#8221; quantifies over possibilities where S is a BIV, S&#8217;s evidence needs to rule that possibility out if &#8220;S knows that S has hands&#8221; is to be true in that context.<xref ref-type="fn" rid="n10">10</xref> In a context where &#8220;every&#8221; does not quantify over such a possibility, S&#8217;s evidence need not rule out that possibility in order for &#8220;S knows that S has hands&#8221; to be true in that context.</p>
<p>So what matters for Lewis is not that our epistemic standards shift from context to context; rather, his contextualism for knowledge reduces to a familiar kind of contextualism about the domain of quantification. In explaining how the extension of &#8220;knows&#8221; shifts from context to context, then, Lewis only needs to explain how the domain of quantification over possibilities shifts from context to context.</p>
<p>For Lewis, what determines which possibilities are quantified over depends on which possibilities are not being &#8220;properly ignored&#8221;. Lewis then proceeds to give seven rules that determine which possibilities are not properly ignored. I will only highlight four of the rules: (1) The Rule of Actuality&#8212;the possibility that actually obtains is not properly ignored; (2) The Rule of Belief&#8212;any possibility which S believes to obtain is not properly ignored, (3) The Rule of Resemblance&#8212;if two possibilities saliently resemble each other (where what counts as &#8220;salient&#8221; is also determined by context), then either both possibilities are properly ignored, or neither are properly ignored, and (4) The Rule of Attention&#8212;any possibility that is not being ignored is not being properly ignored.</p>
<p>Lewis himself used the Rule of Actuality and the Rule of Resemblance to attempt to explain why one does not know that one would lose the lottery. Since the possibility where your ticket wins saliently resembles any other ticket winning, one can only properly ignore the possibility where your ticket wins if one can ignore the possibility of any ticket winning. But, by the Rule of Actuality, one cannot properly ignore the possibility where the <italic>actual winning</italic> ticket wins, and so one cannot, by the Rule of Resemblance, properly ignore the possibility where one&#8217;s own ticket wins.</p>
<p>At first blush, Lewis&#8217;s contextualism may be just what we need for our own contextualist solution. After all, in <italic>some</italic> context, the actual possibility where <inline-formula><mml:math id="Eq169-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is false <italic>does</italic> saliently resemble the possibility that any of the other <inline-formula><mml:math id="Eq170-mml"><mml:mi>n</mml:mi></mml:math></inline-formula> propositions are false. The possibility that any of the <inline-formula><mml:math id="Eq171-mml"><mml:mi>n</mml:mi></mml:math></inline-formula> propositions are false saliently resembles the possibility where <inline-formula><mml:math id="Eq172-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is false because these are all worlds where Xin has written down exactly one false proposition. Thus, there is some context where Xin does not know any of <inline-formula><mml:math id="Eq173-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq174-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, and so there is a context in which Xin <italic>is not</italic> in a position to know <inline-formula><mml:math id="Eq175-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> by <bold>Closure</bold>. Nonetheless, this does not preclude the possibility of Xin knowing the other <inline-formula><mml:math id="Eq176-mml"><mml:mi>n</mml:mi></mml:math></inline-formula> propositions in some <italic>other</italic> context. Thus, although there is a context in which Xin is not in a position to know <inline-formula><mml:math id="Eq177-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, this fact does not preclude the existence of a context where Xin <italic>does</italic> know <inline-formula><mml:math id="Eq178-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>.<xref ref-type="fn" rid="n11">11</xref></p>
<p>So Lewis&#8217;s contextualism does not go far enough. We need a contextualist solution that not only prevents &#8220;Xin is in a position to know <inline-formula><mml:math id="Eq179-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>&#8221; from being true in <italic>some</italic> context, we need a contextualist solution that prevents that sentence from being true in <italic>all</italic> contexts. And on Lewis&#8217;s, view, the rules at hand do not prevent &#8220;Xin knows <inline-formula><mml:math id="Eq180-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>&#8221; for all <inline-formula><mml:math id="Eq181-mml"><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2264;</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:math></inline-formula> from being true in a <italic>single</italic> context. Even if the actual world is one where <inline-formula><mml:math id="Eq182-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is false, there is no reason to think that this possibility <italic>always</italic> saliently resembles possibilities where one of the other <inline-formula><mml:math id="Eq183-mml"><mml:mi>n</mml:mi></mml:math></inline-formula> propositions are false. For example, <inline-formula><mml:math id="Eq184-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> may be a proposition about the weather, and every other proposition may be about some major historical event, and so there could be a context where a possibility in which the weather proposition is false does not saliently resemble at all the possibilities where one of the historically important propositions are false.</p>
<p>To resolve this issue, Hawthorne (<xref ref-type="bibr" rid="B19">2003</xref>) proposes an extra rule: the New Rule of Belief:</p>
<disp-quote>
<p><bold>New Rule of Belief:</bold> If the proposition that P is given sufficiently high credence&#8212;or ought to be&#8212;by the subject, then one cannot properly ignore all of the possibilities that constitute subcases of P.</p>
</disp-quote>
<p>In our case, proposition P would be the proposition that one of <inline-formula><mml:math id="Eq185-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq186-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is false. Assuming that there are <inline-formula><mml:math id="Eq187-mml"><mml:mrow><mml:mn>1000</mml:mn></mml:mrow></mml:math></inline-formula> propositions, and that Xin becomes <inline-formula><mml:math id="Eq188-mml"><mml:mrow><mml:mn>0.999</mml:mn></mml:mrow></mml:math></inline-formula> confident in each proposition when she learns she wrote down only one false proposition, she should be <inline-formula><mml:math id="Eq189-mml"><mml:mrow><mml:mn>0.999</mml:mn></mml:mrow></mml:math></inline-formula> confident that <inline-formula><mml:math id="Eq190-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is true, and so she should be <inline-formula><mml:math id="Eq191-mml"><mml:mrow><mml:mn>0.999</mml:mn></mml:mrow></mml:math></inline-formula> confident that the false proposition is one of <inline-formula><mml:math id="Eq192-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq193-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>. Assuming, as is plausible, that <inline-formula><mml:math id="Eq194-mml"><mml:mrow><mml:mn>0.999</mml:mn></mml:mrow></mml:math></inline-formula> is a sufficiently high credence, the New Rule of Belief implies that Xin cannot properly ignore <italic>all</italic> of the possibilities that constitute subcases of P. In other words, Xin cannot ignore the possibility that <inline-formula><mml:math id="Eq195-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> is false <italic>and</italic> the possibility that <inline-formula><mml:math id="Eq196-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> is false <italic>and</italic>&#8230; <italic>and</italic> the possibility that <inline-formula><mml:math id="Eq197-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is false. The New Rule of Belief essentially puts an upper limit to how many possibilities Xin can properly ignore. So, no matter the context, Xin can only properly ignore relatively few possibilities, and she cannot properly ignore the rest. For example, if the threshold for &#8220;sufficiently high&#8221; for P is <inline-formula><mml:math id="Eq198-mml"><mml:mrow><mml:mn>0.9</mml:mn></mml:mrow></mml:math></inline-formula>, then of the <inline-formula><mml:math id="Eq199-mml"><mml:mi>n</mml:mi></mml:math></inline-formula> propositions, Xin can only properly ignore all the possibilities that together are given only <inline-formula><mml:math id="Eq200-mml"><mml:mrow><mml:mn>0.1</mml:mn></mml:mrow></mml:math></inline-formula> credence. In Xin&#8217;s case, that means she can only properly ignore up to <inline-formula><mml:math id="Eq201-mml"><mml:mrow><mml:mn>100</mml:mn></mml:mrow></mml:math></inline-formula> possibilities where one of <inline-formula><mml:math id="Eq202-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq203-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> are false.</p>
<p>This solution brings us tantalizingly close to a solution. It would seem that with the New Rule of Belief, we can make sense of the fact that Xin can only know relatively few propositions per context, and that for every proposition from <inline-formula><mml:math id="Eq204-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> to <inline-formula><mml:math id="Eq205-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, there is in principle a different context where Xin can know each of them. Thus, we seem to be able to both accept <bold>Combo A</bold> and deny <bold>Combo B</bold>.</p>
<p>However, the New Rule of Belief doesn&#8217;t quite bring us this far. It only implies that Xin can only <italic>properly ignore</italic> relatively few possibilities per context. This does not yet mean that Xin can only <inline-formula><mml:math id="Eq206-mml"><mml:mtext mathvariant="italic">know</mml:mtext></mml:math></inline-formula> relatively few propositions per context, since those possibilities that remain unignored may still be <italic>ruled out</italic> by Xin&#8217;s evidence. For example, the New Rule Belief may imply that if Xin is properly ignoring all the possibilities where <inline-formula><mml:math id="Eq207-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq208-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>100</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> are false, then she cannot be properly ignoring the possibilities where one of <inline-formula><mml:math id="Eq209-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>101</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq210-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1000</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> are false. But nothing precludes us from saying that Xin&#8217;s <italic>evidence</italic> rules out those possibilities which she is not properly ignoring.</p>
<p>To make it concrete, suppose that Xin is simply <italic>attending</italic> to a possibility where <inline-formula><mml:math id="Eq211-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>101</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> is false. By the Rule of Attention, she is not properly ignoring that possibility. Let&#8217;s say <inline-formula><mml:math id="Eq212-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>101</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> is the proposition that Xin&#8217;s friend emailed her a computer program that, once executed, produces the text of all of <italic>Hamlet</italic>. Suppose Xin is attending to the possibility that her friend did not actually email her such a program, but had instead emailed her a random text generator. Indeed, we could even imagine the scenario as if Xin&#8217;s friend emails the program, but later asks Xin whether she mistakenly emailed the random text generator program she was working on. Once Xin&#8217;s friend asks this question, the possibility of her sending a random text generator is no longer properly ignored. Nonetheless, Xin could easily rule out that possibility upon executing the program several times and observing that it produces all of <italic>Hamlet</italic> each time. In fact, such a procedure would be a perfectly good example of how Xin could come to learn which program her friend actually sent her (after all, most of us can come to know what a program does when we run the program). So if her evidence is good enough to rule out the possibility that her friend sent a random word generator when she raised the question, it is plausible that her evidence is still good enough to rule out that possibility even when she attends to it again later.</p>
<p>In this example, we don&#8217;t even need the New Rule of Belief to say that she cannot be properly ignoring a possibility where <inline-formula><mml:math id="Eq213-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>101</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> is false. Nonetheless, we can still say that Xin&#8217;s excellent evidence still rules out the possibility.<xref ref-type="fn" rid="n12">12</xref></p>
<p>Still, the New Rule of Belief gives us a hint of what we must do. What we need is not a picture where there is a limit to how many possibilities we can properly ignore per context; rather, we need a picture where there is a limit to how many possibilities we <italic>can rule out</italic> per context. My contextualism is just such a picture.</p>
</sec>
<sec>
<title>2.3. Question-Relative Contextualism</title>
<p>One simple way to impose a limit to how many possibilities one can rule out is to set a credence threshold to which propositions can even be believed. In the language of possible worlds, we can revise Hawthorne&#8217;s New Rule of Belief like so:</p>
<disp-quote>
<p><bold>Brand New Rule of Belief</bold> If the proposition that <inline-formula><mml:math id="Eq214-mml"><mml:mi>P</mml:mi></mml:math></inline-formula> is given sufficiently high credence&#8212;or ought to be&#8212;by the subject, then one cannot <italic>rule out</italic> all the possible worlds <inline-formula><mml:math id="Eq215-mml"><mml:mi>w</mml:mi></mml:math></inline-formula> s.t. <inline-formula><mml:math id="Eq216-mml"><mml:mrow><mml:mi>w</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>P</mml:mi></mml:mrow></mml:math></inline-formula> (i.e., there must be <italic>some</italic> <inline-formula><mml:math id="Eq217-mml"><mml:mrow><mml:mi>w</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>P</mml:mi></mml:mrow></mml:math></inline-formula> which we cannot rule out).</p>
</disp-quote>
<p>This <bold>Brand New Rule of Belief</bold> is related to the Lockean Thesis for belief which states that belief is just confidence over a threshold. The motivation for the <bold>Brand New Rule of Belief</bold> is that one cannot come to know a proposition where one is not even confident enough to <italic>believe</italic> that proposition. However, one need not adopt the entirety of the Lockean Thesis to motivate the <bold>Brand New Rule of Belief</bold>. One need only to say that confidence over a threshold is a <italic>necessary</italic> condition for belief, and not necessarily a sufficient condition.</p>
<p>However, although the Lockean Thesis can motivate the <bold>Brand New Rule of Belief</bold>, the Lockean Thesis is one that is profoundly difficult to reconcile with any view of belief and knowledge that accept <bold>Closure</bold>. This is because, on the Lockean Thesis, Xin would count as believing (and possibly knowing) each of <inline-formula><mml:math id="Eq218-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq219-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> since Xin is sufficiently confident in each, but Xin could not even believe, let alone know, <inline-formula><mml:math id="Eq220-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x2227;</mml:mo><mml:mn>&#x2026;</mml:mn><mml:mo>&#x2227;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> since Xin&#8217;s credence in that proposition is too low.</p>
<p>So, how can we square the <bold>Brand New Rule of Belief</bold> with <bold>Closure</bold>? A naive contextualism that makes &#8220;sufficiently confident&#8221; context sensitive will do no good here. For the only thresholds where <inline-formula><mml:math id="Eq221-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq222-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="Eq223-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x2227;</mml:mo><mml:mn>&#x2026;</mml:mn><mml:mo>&#x2227;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> are all believed would be thresholds that are implausibly low (Xin would count as believing almost anything). And the only thresholds where none of <inline-formula><mml:math id="Eq224-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq225-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="Eq226-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x2227;</mml:mo><mml:mn>&#x2026;</mml:mn><mml:mo>&#x2227;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> are believed will be implausibly high (Xin would count as believing almost nothing at all). In <italic>most</italic> contexts, then, Xin&#8217;s credence in each of <inline-formula><mml:math id="Eq227-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq228-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> would be over the threshold for belief, while her credence in <inline-formula><mml:math id="Eq229-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x2227;</mml:mo><mml:mn>&#x2026;</mml:mn><mml:mo>&#x2227;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> would be under the threshold for belief. Thus, in most contexts, what she believes (and therefore, what she knows) would not be closed under deduction.</p>
<p>One way of squaring the <bold>Brand New Rule of Belief</bold> with <bold>Closure</bold> is to aim for a contextualist view where &#8220;worlds we cannot rule out&#8221; is context sensitive. In particular, &#8220;worlds we cannot rule out&#8221; will be sensitive to a specific <italic>question</italic>.</p>
<p>To do this, we will introduce a formal model and first define a doxastic accessibility relation <inline-formula><mml:math id="Eq230-mml"><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> that encodes the <bold>Brand New Rule of Belief</bold>, and then define an epistemic accessibility relation <inline-formula><mml:math id="Eq231-mml"><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mi>K</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> based on <inline-formula><mml:math id="Eq232-mml"><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula>. We then apply our model to the Preface Paradox for knowledge and then we will apply our model to the Preface Paradox for rational/justified belief.</p>
<sec>
<title>2.3.1. Formal Model for Question-Relative Contextualism</title>
<p>Here enters my model. Our model is an ordered quadruple <inline-formula><mml:math id="Eq233-mml"><mml:mrow><mml:mo>&#x003C;</mml:mo><mml:mi>W</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x212C;</mml:mo><mml:mo>,</mml:mo><mml:mi>P</mml:mi><mml:mo>,</mml:mo><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo>&#x003E;</mml:mo></mml:mrow></mml:math></inline-formula> where <inline-formula><mml:math id="Eq234-mml"><mml:mi>W</mml:mi></mml:math></inline-formula> is a set of possible worlds, <inline-formula><mml:math id="Eq235-mml"><mml:mo>&#x212C;</mml:mo></mml:math></inline-formula> is a Boolean <inline-formula><mml:math id="Eq236-mml"><mml:mo>&#x03A3;</mml:mo></mml:math></inline-formula>-Algebra over worlds,<xref ref-type="fn" rid="n13">13</xref> <inline-formula><mml:math id="Eq237-mml"><mml:mi>P</mml:mi></mml:math></inline-formula> is a partition on those worlds, and <italic>Pr</italic> is a probability function defined over the elements of <inline-formula><mml:math id="Eq238-mml"><mml:mo>&#x212C;</mml:mo></mml:math></inline-formula>. As usual, propositions are modeled as sets of worlds and, following Groenendijk and Stokhof (<xref ref-type="bibr" rid="B17">1984</xref>), a partition models a <italic>question</italic>. For example, the proposition that James is at the party is just the set containing all the worlds where James is at the party, and the question whether James is at the party is the partition {James is at the party; James is not at the party}.</p>
<p>Given this model, we can now define a <italic>plausibility</italic> relation among worlds, <inline-formula><mml:math id="Eq239-mml"><mml:mrow><mml:mo>&#x003E;</mml:mo><mml:mo>&#x003E;</mml:mo></mml:mrow></mml:math></inline-formula> (read as &#8220;way more plausible than&#8221;), like so:</p>
<p><bold>Definition 1</bold>. <inline-formula><mml:math id="Eq240-mml"><mml:mrow><mml:mi>w</mml:mi><mml:mo>&#x003E;</mml:mo><mml:mo>&#x003E;</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2009;</mml:mo><mml:mtext>iff</mml:mtext><mml:mstyle scriptlevel='+1'><mml:mfrac><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#x007C;</mml:mo><mml:mi>w</mml:mi><mml:mo>&#x007C;</mml:mo><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#x007C;</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x007C;</mml:mo><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>&#x003E;</mml:mo><mml:mi>t</mml:mi><mml:mo>&#x2009;</mml:mo><mml:mtext>when</mml:mtext><mml:mo>&#x2009;</mml:mo><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#x007C;</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x007C;</mml:mo><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x2260;</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula><xref ref-type="fn" rid="n14">14</xref></p>
<p>where &#124;<inline-formula><mml:math id="Eq241-mml"><mml:mi>w</mml:mi></mml:math></inline-formula>&#124; denotes the proposition in the partition that <inline-formula><mml:math id="Eq242-mml"><mml:mi>w</mml:mi></mml:math></inline-formula> is an element of, and <inline-formula><mml:math id="Eq243-mml"><mml:mi>t</mml:mi></mml:math></inline-formula> is some threshold greater than 1 (let&#8217;s say 10).<xref ref-type="fn" rid="n15">15</xref> For an entirely different use of partitions in modelling beliefs, see Yalcin (<xref ref-type="bibr" rid="B40">2018</xref>).</p>
<p>The motivation for introducing this plausibility relation is the idea that there are certain propositions that we can simply <italic>rule out</italic> by default for being too implausible. For example, relative to the question {I am a brain in a vat; I am not a brain in a vat}, we can simply rule out the worlds where I am a brain in a vat so long as it is much less probable than the proposition that I am not a brain in a vat and it is false. In setting up things this way, we also do justice to the Fallibilist intuition that we can know things without being absolutely certain. For example, we do not need to be <italic>certain</italic> that we are not brains in a vat to know that we aren&#8217;t; the proposition simply needs to be way more implausible than it&#8217;s negation relative to the question &#8220;are we brains in a vat?&#8221;.</p>
<p>Given this plausibility relation, we can now define <inline-formula><mml:math id="Eq244-mml"><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula>, our function that takes possible worlds <inline-formula><mml:math id="Eq245-mml"><mml:mrow><mml:mi>w</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>W</mml:mi></mml:mrow></mml:math></inline-formula> to the strongest proposition one is justified in believing at that world. As a first pass, we can define <inline-formula><mml:math id="Eq246-mml"><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> like so:</p>
<p><disp-quote><p><bold>Definition 2</bold>. <inline-formula><mml:math id="Eq247-mml"><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x007B;</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>:</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mo>&#x2203;</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x2033;</mml:mo></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x2033;</mml:mo></mml:msup><mml:mo>&#x003E;</mml:mo><mml:mo>&#x003E;</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x007D;</mml:mo></mml:mrow></mml:math></inline-formula><xref ref-type="fn" rid="n16">16</xref></p></disp-quote></p>
<p>In other words, the set of worlds doxastically accessible to a world <inline-formula><mml:math id="Eq248-mml"><mml:mi>w</mml:mi></mml:math></inline-formula> are the worlds such that there are no other worlds way more plausible than it. An important thing to note about <inline-formula><mml:math id="Eq249-mml"><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> is that its value does not depend on which particular world it takes as its argument. <inline-formula><mml:math id="Eq250-mml"><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> gives you the same proposition no matter what world you are in. In other words, what you are justified in believing does not depend on the actual state of the world, it only depends on our degrees of belief about the world and the question we are considering.</p>
<p>For a graphical illustration, suppose one is looking at a red wall and one is certain that one of the following things is true: (A) The wall is red, (B) The wall is white with trick lighting, (C) One is a BIV and there is no wall. Accordingly, <inline-formula><mml:math id="Eq251-mml"><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>A</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mn>0.99</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="Eq252-mml"><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>B</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mn>0.01</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mo>&#x03F5;</mml:mo></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math id="Eq253-mml"><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>C</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x03F5;</mml:mo></mml:mrow></mml:math></inline-formula>.</p>
<p>In such a situation, what is one justified in believing? The answer is easy, one is justified in believing that the wall is red because the A-worlds are the most plausible worlds. Since <inline-formula><mml:math id="Eq254-mml"><mml:mrow><mml:mstyle scriptlevel='+1'><mml:mfrac><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>A</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>B</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>&#x003E;</mml:mo><mml:mn>10</mml:mn><mml:mo>&#x2009;</mml:mo><mml:mo>&#x2009;</mml:mo><mml:mtext>and</mml:mtext><mml:mo>&#x2009;</mml:mo><mml:mstyle scriptlevel='+1'><mml:mfrac><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>A</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>C</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>&#x003E;</mml:mo><mml:mn>10</mml:mn></mml:mrow></mml:math></inline-formula>, one is by default justified in believing that one is neither in the B-worlds nor the C-worlds, and so one is justified in believing that we are in a A-world.</p>
<fig id="F1">
<label>Figure 1</label>
<caption>
<p>Red Wall, White Wall, or BIV? Justified Belief</p>
</caption>
<graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="ergo-4631_hong-g1.png"/>
</fig>
<p><xref ref-type="fig" rid="F1">Fig. 1</xref> above is an illustration to make clear what one is justified in believing relative to the question <inline-formula><mml:math id="Eq255-mml"><mml:mrow><mml:mo>&#x007B;</mml:mo><mml:mi>A</mml:mi><mml:mo>;</mml:mo><mml:mi>B</mml:mi><mml:mo>;</mml:mo><mml:mi>C</mml:mi><mml:mo>&#x007D;</mml:mo></mml:mrow></mml:math></inline-formula>. <xref ref-type="fig" rid="F1">Fig. 1</xref> represents how the probabilities are distributed over the set of worlds, where the size of the regions roughly represent the relative proportions of their probabilities, and the arrows show which worlds are doxastically accessible to which other worlds.</p>
<p>An easy, effective procedure to determine which worlds belong to <inline-formula><mml:math id="Eq256-mml"><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:math></inline-formula> is to follow the following steps:</p>
<boxed-text>
<p>Effective Procedure To Determine <inline-formula><mml:math id="Eq257-mml"><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:math></inline-formula></p>
<list list-type="order">
<list-item><p>Find the biggest cell or cells (i.e., the most probable cell) in the partition, and add all the worlds in those cells to <inline-formula><mml:math id="Eq258-mml"><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:math></inline-formula>.</p></list-item>
<list-item><p>Next, find all the cells that are of similar size to the biggest cells (i.e., find the cells that are <italic>not</italic>over ten times smaller than the biggest cells), and add all the worlds in those cells to <inline-formula><mml:math id="Eq259-mml"><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:math></inline-formula>.</p></list-item>
<list-item><p>You are done!</p></list-item>
</list>
</boxed-text>
<p>The problem with this definition, however, is that it is consistent with one being justified in believing a very improbable proposition. For example, if we are playing a rigged lottery where we are certain that ticket 1 has a 1% chance of winning while tickets 2 through 1001 each have a <inline-formula><mml:math id="Eq260-mml"><mml:mrow><mml:mn>0.099</mml:mn><mml:mo>%</mml:mo></mml:mrow></mml:math></inline-formula> chance of winning, then relative to the question &#8220;which ticket will win?&#8221; one would be justified in believing that ticket 1 will win simply because it is much more probable than all the alternatives.<xref ref-type="fn" rid="n17">17</xref></p>
<p>To avoid the result that there are some contexts where one is justified in believing in incredibly improbable propositions, we need to encode our <bold>Brand New Rule of Belief</bold> into our definition of <inline-formula><mml:math id="Eq261-mml"><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula>. Thus, the following will be our official definition:</p>
<p>Let us define our doxastic accessibility relation <inline-formula><mml:math id="Eq262-mml"><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> like so:</p>
<p><bold>Definition 3</bold>. <inline-formula><mml:math id="Eq263-mml"><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mo>&#x222A;</mml:mo><mml:mi>i</mml:mi></mml:msub><mml:msubsup><mml:mi>R</mml:mi><mml:mi>i</mml:mi><mml:mi>B</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula> for <inline-formula><mml:math id="Eq264-mml"><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x003C;</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:math></inline-formula> the smallest <italic>k</italic> s.t. <inline-formula><mml:math id="Eq265-mml"><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mo>&#x222A;</mml:mo><mml:mi>i</mml:mi></mml:msub><mml:msubsup><mml:mi>R</mml:mi><mml:mi>i</mml:mi><mml:mi>B</mml:mi></mml:msubsup><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x003E;</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:math></inline-formula> (where <inline-formula><mml:math id="Eq266-mml"><mml:mrow><mml:mn>0.5</mml:mn><mml:mo>&#x003C;</mml:mo><mml:mi>t</mml:mi><mml:mo>&#x003C;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>)<xref ref-type="fn" rid="n18">18</xref></p>
<p>We now define <inline-formula><mml:math id="Eq267-mml"><mml:mrow><mml:msubsup><mml:mi>R</mml:mi><mml:mi>i</mml:mi><mml:mi>B</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula> recursively as follows:</p>
<list list-type="order">
<list-item><p>If <inline-formula><mml:math id="Eq268-mml"><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:msubsup><mml:mi>R</mml:mi><mml:mn>0</mml:mn><mml:mi>B</mml:mi></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x007B;</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>:</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mo>&#x2203;</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x2033;</mml:mo></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x2033;</mml:mo></mml:msup><mml:mo>&#x003E;</mml:mo><mml:mo>&#x003E;</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x007D;</mml:mo></mml:mrow></mml:math></inline-formula></p></list-item>
<list-item><p>If <inline-formula><mml:math id="Eq269-mml"><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:msubsup><mml:mi>R</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>B</mml:mi></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x007B;</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x2208;</mml:mo><mml:mo>&#x007B;</mml:mo><mml:mi>W</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mo>&#x222A;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:msubsup><mml:msubsup><mml:mi>R</mml:mi><mml:mi>i</mml:mi><mml:mi>B</mml:mi></mml:msubsup><mml:mo>&#x007C;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mo>&#x2203;</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x2033;</mml:mo></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x2033;</mml:mo></mml:msup><mml:mo>&#x003E;</mml:mo><mml:mo>&#x003E;</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x007D;</mml:mo><mml:mo>&#x007D;</mml:mo></mml:mrow></mml:math></inline-formula></p></list-item>
</list>
<p>Informally, <inline-formula><mml:math id="Eq270-mml"><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:math></inline-formula> is the strongest (not necessarily true) answer (or partial answer) to the question that is both probable and much more probable than any of its alternatives.<xref ref-type="fn" rid="n19">19</xref> And depending on the question, what the <italic>alternatives</italic> are can differ.</p>
<p>Our new definition of <inline-formula><mml:math id="Eq271-mml"><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> encodes the spirit of the <bold>Brand New Rule of Belief</bold> because it prevents us from doxastically ruling out so many worlds such that the probability of one of those worlds obtaining exceeds some number <inline-formula><mml:math id="Eq272-mml"><mml:mi>t</mml:mi></mml:math></inline-formula> which represents our threshold for belief. In other words, we cannot rule out so many answers to a question such that the only answer to the question we are left with is too improbable for us to even believe.</p>
<p>Again, we have an effective procedure to easily compute <inline-formula><mml:math id="Eq273-mml"><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:math></inline-formula>:</p>
<boxed-text>
<p>Effective Procedure To Determine <inline-formula><mml:math id="Eq274-mml"><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:math></inline-formula></p>
<list list-type="order">
<list-item><p>Find the biggest cell (or cells) in the partition. Add all worlds in that cell (or cells) to <inline-formula><mml:math id="Eq275-mml"><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:math></inline-formula>.</p></list-item>
<list-item><p>Find all the cells that are of similar size to the biggest cell (i.e., cells that are not over ten times smaller than the biggest cell). Add all the worlds in those cells to <inline-formula><mml:math id="Eq276-mml"><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:math></inline-formula> if they are not already in.</p></list-item>
<list-item><p>While (<inline-formula><mml:math id="Eq277-mml"><mml:mtext mathvariant="italic">Pr</mml:mtext><mml:mo stretchy='false'>(</mml:mo><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mi>t</mml:mi></mml:math></inline-formula>, look at the group of cells that haven&#8217;t been added in yet, and then add the worlds in the much bigger cells (i.e., cells that are at least 10 times bigger than the other left over cells) into <inline-formula><mml:math id="Eq278-mml"><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:math></inline-formula>.</p></list-item>
<list-item><p>You are done!</p></list-item>
</list>
</boxed-text>
<p>When we apply this new definition to our rigged lottery case, we get the result that one is not justified in believing in anything (or one is justified in only believing tautologies) relative to the question &#8220;which lottery ticket will win?&#8221;. That is because, though the worlds where ticket 1 wins are the most plausible, they do not constitute a proposition with a probability over some threshold <inline-formula><mml:math id="Eq279-mml"><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x003E;</mml:mo><mml:mn>0.5</mml:mn></mml:mrow></mml:math></inline-formula>. Thus, we need to add into <inline-formula><mml:math id="Eq280-mml"><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:math></inline-formula> our next batch of most plausible worlds. Since the next batch of worlds are all equiprobable, we add them all into <inline-formula><mml:math id="Eq281-mml"><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:math></inline-formula>. After we do that, we find that <inline-formula><mml:math id="Eq282-mml"><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> (since we have now essentially added all the worlds in <inline-formula><mml:math id="Eq283-mml"><mml:mi>W</mml:mi></mml:math></inline-formula> to <inline-formula><mml:math id="Eq284-mml"><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:math></inline-formula>). Since <inline-formula><mml:math id="Eq285-mml"><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x003E;</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:math></inline-formula> (let&#8217;s say <inline-formula><mml:math id="Eq286-mml"><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>0.91</mml:mn></mml:mrow></mml:math></inline-formula> for concreteness), we stop adding any more worlds into <inline-formula><mml:math id="Eq287-mml"><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:math></inline-formula>, and now we see that <inline-formula><mml:math id="Eq288-mml"><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mi>W</mml:mi></mml:math></inline-formula>. In other words, the only proposition one is justified in believing in the rigged lottery case is the tautology.</p>
<p>So much for justified belief. What about knowledge? Let <inline-formula><mml:math id="Eq289-mml"><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mi>K</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> be our function that takes possible worlds <inline-formula><mml:math id="Eq290-mml"><mml:mrow><mml:mi>w</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>W</mml:mi></mml:mrow></mml:math></inline-formula> to the strongest proposition one knows at that world. Let us define <inline-formula><mml:math id="Eq291-mml"><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mi>K</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> as follows:</p>
<p><bold>Definition 4</bold>. <inline-formula><mml:math id="Eq292-mml"><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mi>K</mml:mi></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x222A;</mml:mo><mml:mo>&#x007B;</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>:</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo>&#x003E;</mml:mo><mml:mo>&#x003E;</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x007D;</mml:mo></mml:mrow></mml:math></inline-formula><xref ref-type="fn" rid="n20">20</xref></p>
<p>In other words, the strongest thing you know at a world <inline-formula><mml:math id="Eq293-mml"><mml:mi>w</mml:mi></mml:math></inline-formula> is the proposition containing all the worlds you are not justified in ruling out plus all the worlds that are not way less plausible than <inline-formula><mml:math id="Eq294-mml"><mml:mi>w</mml:mi></mml:math></inline-formula>.</p>
<p>For a graphical illustration, let us return to the case where one is looking at a red wall. As a reminder, (A) The wall is red, (B) The wall is white with trick lighting, (C) One is a BIV and there is no wall. Accordingly, <inline-formula><mml:math id="Eq295-mml"><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>A</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mn>0.99</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="Eq296-mml"><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>B</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mn>0.01</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mo>&#x03F5;</mml:mo></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math id="Eq297-mml"><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>C</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x03F5;</mml:mo></mml:mrow></mml:math></inline-formula>. <xref ref-type="fig" rid="F2">Fig. 2</xref> below is an illustration to make clear what one knows relative to the question <inline-formula><mml:math id="Eq298-mml"><mml:mrow><mml:mo>&#x007B;</mml:mo><mml:mi>A</mml:mi><mml:mo>;</mml:mo><mml:mi>B</mml:mi><mml:mo>;</mml:mo><mml:mi>C</mml:mi><mml:mo>&#x007D;</mml:mo></mml:mrow></mml:math></inline-formula>. In <xref ref-type="fig" rid="F2">Fig. 2</xref>, the arrows show which worlds are epistemically accessible to which other worlds.</p>
<fig id="F2">
<label>Figure 2</label>
<caption>
<p>Red Wall, White Wall, or BIV? Knowledge</p>
</caption>
<graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="ergo-4631_hong-g2.png"/>
</fig>
<p>Since <inline-formula><mml:math id="Eq299-mml"><mml:mi>A</mml:mi><mml:mo>=</mml:mo><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:math></inline-formula> no matter which cell <inline-formula><mml:math id="Eq300-mml"><mml:mi>w</mml:mi></mml:math></inline-formula> is in (as we saw in <xref ref-type="fig" rid="F1">Fig. 1</xref>), we know that <inline-formula><mml:math id="Eq301-mml"><mml:mrow><mml:mi>A</mml:mi><mml:mo>&#x2286;</mml:mo><mml:msup><mml:mi>R</mml:mi><mml:mi>K</mml:mi></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>. If <inline-formula><mml:math id="Eq302-mml"><mml:mi>w</mml:mi></mml:math></inline-formula> is an A-world, then since the A-worlds are much more plausible than the B-worlds and C-worlds and <inline-formula><mml:math id="Eq303-mml"><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>A</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x003E;</mml:mo><mml:mn>0.91</mml:mn></mml:mrow></mml:math></inline-formula>, one one can rule out the B-worlds and C-worlds. Thus, in the A-worlds, one can know <inline-formula><mml:math id="Eq304-mml"><mml:mi>A</mml:mi></mml:math></inline-formula>. If <inline-formula><mml:math id="Eq305-mml"><mml:mi>w</mml:mi></mml:math></inline-formula> is a B-world, then one can only rule out the C-worlds for being too implausible since <inline-formula><mml:math id="Eq306-mml"><mml:mrow><mml:mstyle scriptlevel='+1'><mml:mfrac><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>B</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>C</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>&#x003E;</mml:mo><mml:mn>10</mml:mn></mml:mrow></mml:math></inline-formula>. Thus, in the B-worlds, one can know <inline-formula><mml:math id="Eq307-mml"><mml:mrow><mml:mi>A</mml:mi><mml:mo>&#x2228;</mml:mo><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula>. And finally, if one has the misfortune of being a BIV in a C-world, then one cannot rule out anything, and so one only knows the tautology. In other words, if the wall is red, you know it is red; and if there is trick lighting, you at least know that you aren&#8217;t a BIV; and if you are a BIV, you know nothing.</p>
<p>Fortunately, there is an effective procedure one can use to compute <inline-formula><mml:math id="Eq308-mml"><mml:msup><mml:mi>R</mml:mi><mml:mi>K</mml:mi></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:math></inline-formula>:</p>
<boxed-text>
<p>Effective Procedure To Determine <inline-formula><mml:math id="Eq309-mml"><mml:msup><mml:mi>R</mml:mi><mml:mi>K</mml:mi></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:math></inline-formula></p>
<list list-type="order">
<list-item><p>Add all the worlds in <inline-formula><mml:math id="Eq310-mml"><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:math></inline-formula> to <inline-formula><mml:math id="Eq311-mml"><mml:msup><mml:mi>R</mml:mi><mml:mi>K</mml:mi></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:math></inline-formula>.</p></list-item>
<list-item><p>Find all the cells that are of similar size or bigger than <inline-formula><mml:math id="Eq312-mml"><mml:mo>|</mml:mo><mml:mi>w</mml:mi><mml:mo>|</mml:mo></mml:math></inline-formula> (i.e., cells that are not over ten times smaller than <inline-formula><mml:math id="Eq313-mml"><mml:mo>|</mml:mo><mml:mi>w</mml:mi><mml:mo>|</mml:mo></mml:math></inline-formula>). Add all the worlds in those cells to <inline-formula><mml:math id="Eq314-mml"><mml:msup><mml:mi>R</mml:mi><mml:mi>K</mml:mi></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:math></inline-formula> if they are not already in.</p></list-item>
<list-item><p>You are done!</p></list-item>
</list>
</boxed-text>
<p>Informally, <inline-formula><mml:math id="Eq315-mml"><mml:msup><mml:mi>R</mml:mi><mml:mi>K</mml:mi></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:math></inline-formula> is the strongest true answer (or partial answer) to the question that is both probable and much more probable than any of its alternatives.<xref ref-type="fn" rid="n21">21</xref> And depending on the question, what the <italic>alternatives</italic> are can differ.</p>
<p>Finally, our model is entirely consistent with <bold>Closure</bold> for both justified belief and knowledge. As is standard, we say that one is in a position to know <italic>q</italic> at <inline-formula><mml:math id="Eq316-mml"><mml:mi>w</mml:mi></mml:math></inline-formula> iff <inline-formula><mml:math id="Eq317-mml"><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mi>K</mml:mi></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x2286;</mml:mo><mml:mi>q</mml:mi></mml:mrow></mml:math></inline-formula>. And one is justified in believing <inline-formula><mml:math id="Eq318-mml"><mml:mi>q</mml:mi></mml:math></inline-formula> at <inline-formula><mml:math id="Eq319-mml"><mml:mi>w</mml:mi></mml:math></inline-formula> iff <inline-formula><mml:math id="Eq320-mml"><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x2286;</mml:mo><mml:mi>q</mml:mi></mml:mrow></mml:math></inline-formula>. Thus, if <inline-formula><mml:math id="Eq321-mml"><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#x2286;</mml:mo><mml:mi>q</mml:mi></mml:mrow></mml:math></inline-formula> (i.e., <inline-formula><mml:math id="Eq322-mml"><mml:mi>p</mml:mi></mml:math></inline-formula> entails <inline-formula><mml:math id="Eq323-mml"><mml:mi>q</mml:mi></mml:math></inline-formula>), then if one is in a position to know/justifiably believe <inline-formula><mml:math id="Eq324-mml"><mml:mi>p</mml:mi></mml:math></inline-formula>, then one is in a position to know/justifiably believe <inline-formula><mml:math id="Eq325-mml"><mml:mi>q</mml:mi></mml:math></inline-formula>.</p>
<p>Now that we have our model for knowledge and justified belief, let us return to the Preface Paradoxes.</p>
</sec>
<sec>
<title>2.3.2. Applying the Formal Model to the Preface Paradox for Knowledge</title>
<p>Recall that on my view, one can rule out worlds that are <italic>much more implausible</italic> than the actual world <inline-formula><mml:math id="Eq326-mml"><mml:mo>@</mml:mo></mml:math></inline-formula> relative to a certain partition. A world <inline-formula><mml:math id="Eq327-mml"><mml:mi>w</mml:mi></mml:math></inline-formula> is much more implausible than the actual world <inline-formula><mml:math id="Eq328-mml"><mml:mo>@</mml:mo></mml:math></inline-formula> in the partition <inline-formula><mml:math id="Eq329-mml"><mml:mrow><mml:mo>&#x007B;</mml:mo><mml:mi>P</mml:mi><mml:mo>;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>P</mml:mi><mml:mo>&#x007D;</mml:mo></mml:mrow></mml:math></inline-formula> when <inline-formula><mml:math id="Eq330-mml"><mml:mrow><mml:mstyle scriptlevel='+1'><mml:mfrac><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#x007C;</mml:mo><mml:mo>&#x0040;</mml:mo><mml:mo>&#x007C;</mml:mo><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#x007C;</mml:mo><mml:mi>w</mml:mi><mml:mo>&#x007C;</mml:mo><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>&#x003E;</mml:mo><mml:mn>10</mml:mn></mml:mrow></mml:math></inline-formula>, where <inline-formula><mml:math id="Eq331-mml"><mml:mrow><mml:mo>&#x007C;</mml:mo><mml:mo>&#x0040;</mml:mo><mml:mo>&#x007C;</mml:mo></mml:mrow></mml:math></inline-formula> is the cell in the partition of which <inline-formula><mml:math id="Eq332-mml"><mml:mo>@</mml:mo></mml:math></inline-formula> is a member, and likewise for <inline-formula><mml:math id="Eq333-mml"><mml:mo>&#x7C;</mml:mo><mml:mi>w</mml:mi><mml:mo>&#x7C;</mml:mo></mml:math></inline-formula>.</p>
<p>Thus, on the question, &#8220;is <inline-formula><mml:math id="Eq334-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> true?&#8221; (which gives the partition <inline-formula><mml:math id="Eq335-mml"><mml:mrow><mml:mo>&#x007B;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>;</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x007D;</mml:mo></mml:mrow></mml:math></inline-formula>) Xin can rule out the worlds where <inline-formula><mml:math id="Eq336-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> is true since <inline-formula><mml:math id="Eq337-mml"><mml:mrow><mml:mo>&#x0040;</mml:mo><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="Eq338-mml"><mml:mrow><mml:mstyle scriptlevel='+1'><mml:mfrac><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>&#x003E;</mml:mo><mml:mn>10</mml:mn></mml:mrow></mml:math></inline-formula>, and so all the <inline-formula><mml:math id="Eq339-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>-worlds are ruled out. However, relative to this question, Xin cannot rule out <italic>any</italic> of the worlds where <inline-formula><mml:math id="Eq340-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> is true. These worlds include worlds where <inline-formula><mml:math id="Eq341-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> is true, where <inline-formula><mml:math id="Eq342-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> is true, and so on. Thus, relative to the question &#8220;is <inline-formula><mml:math id="Eq343-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> true?&#8221;, Xin can know <inline-formula><mml:math id="Eq344-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, but there will be some <inline-formula><mml:math id="Eq345-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>-worlds that remain uneliminated by Xin&#8217;s evidence, and so Xin would not know <inline-formula><mml:math id="Eq346-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>.</p>
<p>However, in some sense, Xin does &#8220;know&#8221; <inline-formula><mml:math id="Eq347-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>; she just knows it relative to a <italic>different</italic> question. Relative to the question &#8220;is <inline-formula><mml:math id="Eq348-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> true?&#8221;, she can rule out the <inline-formula><mml:math id="Eq349-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> worlds since <inline-formula><mml:math id="Eq350-mml"><mml:mrow><mml:mstyle scriptlevel='+1'><mml:mfrac><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>&#x003E;</mml:mo><mml:mn>10</mml:mn></mml:mrow></mml:math></inline-formula>.</p>
<p>So on this picture, we can accept <bold>Combo A</bold>. Even more than that, we also picked out what the contextually salient parameter is. So we can rearticulate <bold>Combo A</bold> as <bold>Combo A*</bold>:</p>
<boxed-text>
<p><bold>Combo A*</bold></p>
<p>&#8220;Xin knows <inline-formula><mml:math id="Eq351-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>&#8221; is true relative to the question &#8220;is <inline-formula><mml:math id="Eq352-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> true?&#8221;</p>
<p>&#8220;Xin knows <inline-formula><mml:math id="Eq353-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>&#8221; is true relative to the question &#8220;is <inline-formula><mml:math id="Eq354-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> true?&#8221;</p>
<p>.</p>
<p>.</p>
<p>.</p>
<p>&#8220;Xin knows <inline-formula><mml:math id="Eq355-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>&#8221; is true relative to the question &#8220;is <inline-formula><mml:math id="Eq356-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> true?&#8221;</p>
</boxed-text>
<p>Furthermore, this picture gives an intuitive reason for why, in many of these contexts, one only knows one proposition (and anything it entails). Since &#8220;knowing&#8221; is relative to a question, it makes sense to say that Xin knows that <inline-formula><mml:math id="Eq357-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> is the answer to the question &#8220;is <inline-formula><mml:math id="Eq358-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> true?&#8221;, but it doesn&#8217;t make sense to say that Xin knows that <inline-formula><mml:math id="Eq359-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> is the answer to the question &#8220;is <inline-formula><mml:math id="Eq360-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> true?&#8221;.</p>
<p>Of course, there can still be contexts where Xin can still know <italic>more</italic> than one proposition. For example, relative to the question, &#8220;is <inline-formula><mml:math id="Eq361-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x2227;</mml:mo><mml:mn>&#x2026;</mml:mn><mml:mo>&#x2227;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mn>100</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> true?&#8221;, Xin can know the answer to that question so long as it is true and <inline-formula><mml:math id="Eq362-mml"><mml:mrow><mml:mstyle scriptlevel='+1'><mml:mfrac><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x2227;</mml:mo><mml:mn>&#x2026;</mml:mn><mml:mo>&#x2227;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mn>100</mml:mn></mml:mrow></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x2227;</mml:mo><mml:mn>&#x2026;</mml:mn><mml:mo>&#x2227;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mn>100</mml:mn></mml:mrow></mml:msub><mml:mo stretchy='false'>)</mml:mo><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>&#x003E;</mml:mo><mml:mn>10</mml:mn></mml:mrow></mml:math></inline-formula> (i.e., <inline-formula><mml:math id="Eq363-mml"><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x2227;</mml:mo><mml:mn>&#x2026;</mml:mn><mml:mo>&#x2227;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mn>100</mml:mn></mml:mrow></mml:msub><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x003E;</mml:mo><mml:mstyle scriptlevel='+1'><mml:mfrac><mml:mrow><mml:mn>10</mml:mn></mml:mrow><mml:mrow><mml:mn>11</mml:mn></mml:mrow></mml:mfrac></mml:mstyle></mml:mrow></mml:math></inline-formula>).</p>
<p>However, if Xin is not certain in each of <inline-formula><mml:math id="Eq364-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq365-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, then for sufficiently large <inline-formula><mml:math id="Eq366-mml"><mml:mi>n</mml:mi></mml:math></inline-formula>, there will be <italic>no</italic> context in which Xin can know <inline-formula><mml:math id="Eq367-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x2227;</mml:mo><mml:mn>&#x2026;</mml:mn><mml:mo>&#x2227;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>. This is because we have the restriction that if, after ruling out all the worlds that are much more implausible than the actual world, we are only left with a proposition <inline-formula><mml:math id="Eq368-mml"><mml:mi>P</mml:mi></mml:math></inline-formula> s.t. <inline-formula><mml:math id="Eq369-mml"><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:math></inline-formula> (where we previously stipulated that <inline-formula><mml:math id="Eq370-mml"><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>0.91</mml:mn></mml:mrow></mml:math></inline-formula>), then we add in the next set of most plausible worlds until the uneliminated possible worlds constitute a proposition <inline-formula><mml:math id="Eq371-mml"><mml:mi>Q</mml:mi></mml:math></inline-formula> s.t. <inline-formula><mml:math id="Eq372-mml"><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>Q</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x003E;</mml:mo><mml:mn>0.91</mml:mn></mml:mrow></mml:math></inline-formula>. The strongest thing one knows relative to that partition, then, is <inline-formula><mml:math id="Eq373-mml"><mml:mi>Q</mml:mi></mml:math></inline-formula>. This rule is essentially an instance of the <bold>Brand New Rule of Belief</bold>, and it ensures that one cannot rule out so many worlds that the set of worlds that are eliminated exceed probability <inline-formula><mml:math id="Eq374-mml"><mml:mrow><mml:mn>0.09</mml:mn></mml:mrow></mml:math></inline-formula>.</p>
<p>With this rule in place, our contextualist picture allows us to both accept <bold>Combo A*</bold> and reject <bold>Combo B</bold>, and so we have achieved our desired result.</p>
</sec>
<sec>
<title>2.3.3. Question Relative Contextualism and the Original Preface Paradox</title>
<p>The Preface Paradox above is a Preface Paradox for knowledge. What might our contextualist picture say about the original Preface Paradox for justified/rational belief?</p>
<p>Recall that, on our picture, &#8220;A is justified in believing <inline-formula><mml:math id="Eq375-mml"><mml:mi>p</mml:mi></mml:math></inline-formula>&#8221; is true relative to a particular question. In particular, one is only justified in believing propositions as answers or as partial answers to particular questions. The answer, or partial answer must both be probable (at least over 0.5 probable), and the answer, or each answer within the partial answer, must be way more plausible than any of the alternative answers. With this in mind, let us return to the original Preface Paradox for belief.</p>
<p>The original paradox is presented here:</p>
<disp-quote>
<p><bold>The Original Preface Paradox</bold></p>
<p>Suppose that in the course of his book a writer makes a great many assertions, which we shall call <inline-formula><mml:math id="Eq376-mml"><mml:mrow><mml:msub><mml:mi>s</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>s</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>. Given each one of these, he believes that it is true. If he has already written other books, and received corrections from readers and reviewers, he may also believe that not everything he has written in his latest book is true. His approach is eminently rational; he has learnt from experience. The discovery of errors among statements which previously he believed to be true gives him good ground for believing that there are undetected errors in his latest book. However, to say that not everything I assert in this book is true, is to say that at least one statement in this book is false. That is to say that at least one of <inline-formula><mml:math id="Eq377-mml"><mml:mrow><mml:msub><mml:mi>s</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>s</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is false, where <inline-formula><mml:math id="Eq378-mml"><mml:mrow><mml:msub><mml:mi>s</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>s</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> are the statements in the book; that <inline-formula><mml:math id="Eq379-mml"><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2227;</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>&#x2227;</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> is false; that <inline-formula><mml:math id="Eq380-mml"><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2227;</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>&#x2227;</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> is true. The author who writes and believes each of <inline-formula><mml:math id="Eq381-mml"><mml:mrow><mml:msub><mml:mi>s</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>s</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and yet in a preface asserts and believes <inline-formula><mml:math id="Eq382-mml"><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2227;</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>&#x2227;</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> is, it appears, behaving very rationally. Yet clearly he is holding logically incompatible beliefs &#8230; The man is being rational though inconsistent. (<xref ref-type="bibr" rid="B28">Makinson 1965</xref>)</p>
</disp-quote>
<p>Here, Makinson&#8217;s focus is not merely on the author&#8217;s beliefs, but on what the author is <italic>rational</italic> in believing. Note that in this version of the paradox, <bold>Closure</bold> isn&#8217;t even mentioned. This is because the author, though he believes each of <inline-formula><mml:math id="Eq383-mml"><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq384-mml"><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, <italic>does not</italic> believe their conjunction. However, even without <bold>Closure</bold>, this paradox still reveals an inconsistent triad of plausible principles:</p>
<disp-quote>
<p>(A) The author rationally believes each of <inline-formula><mml:math id="Eq385-mml"><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq386-mml"><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>. [<bold>We Rationally Believe A Lot</bold>]</p>
<p>(B) The author rationally believes <inline-formula><mml:math id="Eq387-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x2227;</mml:mo><mml:mn>&#x2026;</mml:mn><mml:mo>&#x2227;</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>. [<bold>Modesty</bold>]</p>
<p>(C) The author cannot rationally believe an inconsistent set of propositions. [<bold>Consistency</bold>]</p>
</disp-quote>
<p>Much ink has been spilled in trying to resolve this paradox. For example, many have denied <bold>Modesty</bold> for various reasons. Some have denied <bold>Modesty</bold> on the grounds that rational belief is closed under consequence, and so one cannot rationally believe <inline-formula><mml:math id="Eq388-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x2227;</mml:mo><mml:mn>&#x2026;</mml:mn><mml:mo>&#x2227;</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> because one already rationally believes its negation. Still, some others have denied <bold>Consistency</bold> (<xref ref-type="bibr" rid="B23">Kyburg 1961</xref>), and some have denied it on probabilistic grounds: one can be rational in having a high credence in each of <inline-formula><mml:math id="Eq389-mml"><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq390-mml"><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, and thus count as believing each of them, but also be rational in having a high credence in <inline-formula><mml:math id="Eq391-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x2227;</mml:mo><mml:mn>&#x2026;</mml:mn><mml:mo>&#x2227;</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> (<xref ref-type="bibr" rid="B4">Christensen 2004</xref>; <xref ref-type="bibr" rid="B12">Easwaran 2016</xref>) and also count as believing it as well.</p>
<p>However, relatively few have questioned <bold>We Rationally Believe A Lot</bold>.<xref ref-type="fn" rid="n22">22</xref> Oftentimes, <bold>We Rationally Believe A Lot</bold> is just stipulated to be true. We are simply <italic>told</italic> that the author has done the research, and so of course she is justified and rational in believing each of <inline-formula><mml:math id="Eq392-mml"><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq393-mml"><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>.</p>
<p>But, as we have seen from our contextualist model, <bold>We Rationally Believe A Lot</bold> should be the assumption to go. For the same reasons for which one can&#8217;t know all of <inline-formula><mml:math id="Eq394-mml"><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq395-mml"><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> in a single context, one also cannot be justified in believing all of <inline-formula><mml:math id="Eq396-mml"><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq397-mml"><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> either. This is because the conjunction of <inline-formula><mml:math id="Eq398-mml"><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq399-mml"><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is too improbable to be believed relative to any question. Thus, there are no contexts in which one can justifiably believe all of <inline-formula><mml:math id="Eq400-mml"><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq401-mml"><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>. However, for the same reason one can still know each of <inline-formula><mml:math id="Eq402-mml"><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="Eq403-mml"><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> in <italic>different</italic> contexts, so also one can rationally believe each of them in <italic>different</italic> contexts as well.</p>
<p>And so one cannot simply stipulate that one is rational, or justified, in believing each of <inline-formula><mml:math id="Eq404-mml"><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> to <inline-formula><mml:math id="Eq405-mml"><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>. But this shouldn&#8217;t bother us too much when we accept that most propositions are still believed in <italic>some</italic> contexts.</p>
<p>The advantage of this solution to the original paradox is that one can also add in <bold>Closure</bold> for belief without too much worry. For example, if we had chosen to deny <bold>Consistency</bold> instead, then, by <bold>Closure</bold>, not only will the author rationally believe an inconsistent set of propositions, the author would also be rational in believing <italic>any</italic> set of propositions. Thus, those who cling onto <bold>Closure</bold> are more likely to deny <bold>Modesty</bold> instead. However, on my contextualist model, <bold>Closure</bold> and <bold>Modesty</bold> can get along after all.</p>
</sec>
<sec>
<title>2.3.4. Knowing A Lot and Question Sensitive Contextualism</title>
<p>Perhaps one obvious disadvantage of this model is that, although many knowledge ascriptions of the form &#8220;Jill knows that <inline-formula><mml:math id="Eq406-mml"><mml:mi>p</mml:mi></mml:math></inline-formula>&#8221; are true, so long as <bold>Socraticism</bold> is true, it would seem that sentences of the form &#8220;Jill knows a lot&#8221;, or &#8220;Jill knows a lot about physics&#8221; would be false. It would seem to be a cost of my theory that sentences of that form would come out false since it is sometimes helpful to utter such sentences to point the audience to people who can answer their questions. For example, if I want to learn some physics, and I want to find a teacher, it would be helpful for someone to say, &#8220;Go ask Jill. She knows a lot about physics&#8221;.</p>
<p>I can perhaps respond to this question in two different ways. The first is to adopt an error-theory and say that sentences of the form &#8220;Jill knows a lot&#8221; <italic>are</italic> false; but nonetheless, it is sometimes appropriate to assert something false if it serves some practical purpose.<xref ref-type="fn" rid="n23">23</xref> This is a view, although an admittedly costly view. I think a better way to respond is to suggest that sentences of the form &#8220;Jill knows a lot&#8221; <italic>do</italic> express a truth in some contexts, but that is not because it expresses the proposition that Jill bears <italic>a single</italic> knowledge relation that holds between her and <italic>a lot</italic> of propositions; rather, it is because it expresses the proposition that Jill bears <italic>many</italic> knowledge relations to <italic>each</italic> of the many propositions. Let me explain.</p>
<p>Thus far, we have argued that for different contextually salient questions, q, &#8220;knows&#8221; expresses a different knowledge relation, knows<inline-formula><mml:math id="Eq407-mml"><mml:mrow><mml:msub><mml:mrow></mml:mrow><mml:mi>q</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, that relates a subject, S, and a proposition, p. But context-sensitive expressions have important interactions with quantifiers. For example, the meaning of &#8220;local&#8221; depends on a contextually determined place; but consider: &#8220;Every reporter went to a local bar to hear the news&#8221;. This is most naturally understood not as saying that every reporter went to a bar <italic>local to the speaker</italic>, but rather that they each went to a bar <italic>local to them</italic>. So the sentence expresses the proposition <italic>for all reporters, x, x went to a local<inline-formula><mml:math id="Eq408-mml"><mml:mrow><mml:msub><mml:mrow></mml:mrow><mml:mi>x</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> bar to hear the news</italic>, where <italic>local</italic><inline-formula><mml:math id="Eq409-mml"><mml:mrow><mml:msub><mml:mrow></mml:mrow><mml:mi>q</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the property of being local to x (example comes from <xref ref-type="bibr" rid="B33">Stanley 2000</xref>). The value of the place parameter for &#8220;local&#8221; varies along with the values that &#8220;everyone&#8221; ranges over. Context-sensitive expressions typically exhibit this kind of interaction with quantifiers.<xref ref-type="fn" rid="n24">24</xref> Similarly, in sentences like &#8220;Jill knows a lot about physics&#8221;, the question parameter for &#8220;knows&#8221; varies along with the values that &#8220;a lot&#8221; ranges over. So the sentence &#8220;Jill knows a lot about physics&#8221; is true whenever it expresses the proposition that <italic>for a lot of propositions</italic>, <inline-formula><mml:math id="Eq410-mml"><mml:mi>p</mml:mi></mml:math></inline-formula>, <italic>about physics, Jill knows</italic><inline-formula><mml:math id="Eq411-mml"><mml:mrow><mml:msub><mml:mrow></mml:mrow><mml:mtext mathvariant="italic">p?</mml:mtext></mml:msub></mml:mrow></mml:math></inline-formula> <inline-formula><mml:math id="Eq412-mml"><mml:mi>p</mml:mi></mml:math></inline-formula>, where S knows<inline-formula><mml:math id="Eq413-mml"><mml:mrow><mml:msub><mml:mrow></mml:mrow><mml:mtext mathvariant="italic">p?</mml:mtext></mml:msub></mml:mrow></mml:math></inline-formula> <inline-formula><mml:math id="Eq414-mml"><mml:mi>p</mml:mi></mml:math></inline-formula> when S knows that <inline-formula><mml:math id="Eq415-mml"><mml:mi>p</mml:mi></mml:math></inline-formula> is the answer to the question whether <inline-formula><mml:math id="Eq416-mml"><mml:mi>p</mml:mi></mml:math></inline-formula>.</p>
<p>So sentences like &#8220;Jill knows a lot about physics&#8221;, and even &#8220;Xin knows a lot&#8221;, exhibit the same features as sentences like &#8220;everyone went to a local bar&#8221;. And just as sentences like &#8220;everyone went to a local bar&#8221; has both a true and false reading (depending on whether the place parameter in &#8220;local&#8221; is coordinated with the quantifier), so too do sentences like &#8220;Xin knows a lot&#8221; have both a true and false reading (depending on whether the question parameter in &#8220;knows&#8221; is coordinated with the quantifier). Admittedly, the true reading of &#8220;Xin knows a lot&#8221; is more natural in common speech. The true reading arises when we are perhaps only concerned with whether we can query Xin for information. In cases like this, we usually want to know whether Xin is the kind of person who knows the answer to a variety of questions, and so the context in which we utter, &#8220;Xin knows a lot&#8221; does not set the question parameter once and for all, but allows for the question parameter to vary with the proposition variable being bounded.</p>
<p>But not all contexts are like that. At the beginning of this paper, we set up a context in which we asked what Xin can know by deduction. In that context we were concerned with what Xin can know relative to a <italic>specific question</italic>, since knowledge is only closed under deduction within a question and not across questions. So it is false to say, &#8220;Xin knows a lot&#8221;, because there is no single knowledge relation that holds between Xin and a lot of propositions. And so in this context, we can truthfully say, &#8220;Xin <italic>does not</italic> know a lot&#8221;. There are similar contexts in which we can also truthfully say, &#8220;We don&#8217;t know a lot&#8221;. Indeed, it is in this sense, where the question parameter in &#8220;knows&#8221; is not coordinated with the quantifier, that we defend the truth of <bold>Socraticism</bold>.</p>
<p>So much for the contextualist solution to our puzzle. In the following sections, we will explore some non-contextualist solutions. If one is not a contextualist about knowledge, then one who accepts the argument in Section 1 would have to accept <bold>Socraticism</bold>. Though this view doesn&#8217;t quite amount to Skepticism, one might think it&#8217;s already bad enough if one can only know about 100 things and forever be left ignorant about everything else. I take it, then, that a non-contextualist would want to rebut the argument. In the following section I will explore non-contextualist solutions that deny <bold>No Loss, No Gain</bold>.</p>
</sec>
</sec>
</sec>
<sec>
<title>3. Denying No Loss, No Gain</title>
<p>In this section, we will discuss the views of the &#8220;Anti-Socratics&#8221;: those who believe <bold>Xin Knows A Lot</bold> and deny <bold>Socraticism</bold>. In particular, we will discuss the views of the Anti-Socratics who accept <bold>Closure</bold>. Anti-Socratics who accept <bold>Closure</bold> must deny <bold>No Loss, No Gain</bold>. These Anti-Socratics come in two varieties. The first kind of Anti-Socratic is the one who thinks that Xin knows <inline-formula><mml:math id="Eq417-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq418-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, but somehow loses some of her knowledge once she learns that there is exactly one false proposition in the book. This kind of Anti-Socratic denies <bold>No Loss</bold>. The second kind of Anti-Socratic is the one who thinks that, after Xin learns that exactly one of the propositions in the book is false, she can come to know <italic>which</italic> proposition is false on the basis of deduction. This kind of Anti-Socratic denies <bold>No Gain</bold>.<xref ref-type="fn" rid="n25">25</xref></p>
<p>We will discuss the views of the first kind of Anti-Socratic first.</p>
<sec>
<title>3.1. Denying No Loss by Accepting Strange Defeat</title>
<p>Here we consider the move to deny <bold>No Loss</bold>. In particular, we are considering the view that Xin starts off knowing every true proposition in the book, but she somehow loses some knowledge the moment she learns that there is exactly one false proposition in the book. On this view, Xin learns something that <italic>defeats</italic> her previous knowledge. Let us call this phenomena &#8220;Strange Defeat&#8221;.</p>
<p>The reason why we call this &#8220;Strange Defeat&#8221; is because the knowledge Xin gains would only defeat her previous knowledge in an unfamiliar way. In familiar cases of defeat, one loses knowledge of <inline-formula><mml:math id="Eq419-mml"><mml:mi>p</mml:mi></mml:math></inline-formula> when one learns some other kind of proposition <inline-formula><mml:math id="Eq420-mml"><mml:mi>q</mml:mi></mml:math></inline-formula> that somehow undermines one&#8217;s confidence in <inline-formula><mml:math id="Eq421-mml"><mml:mi>p</mml:mi></mml:math></inline-formula>. For example, suppose Xin had only 3 probabilistically independent beliefs, each with probability <inline-formula><mml:math id="Eq422-mml"><mml:mn>0.99</mml:mn></mml:math></inline-formula>. Now, if Xin were told that she had exactly one false belief, Xin&#8217;s confidence in each proposition will drop from <inline-formula><mml:math id="Eq423-mml"><mml:mn>0.99</mml:mn></mml:math></inline-formula> to roughly <inline-formula><mml:math id="Eq424-mml"><mml:mn>0.67</mml:mn></mml:math></inline-formula> (or <inline-formula><mml:math id="Eq425-mml"><mml:mrow><mml:mstyle scriptlevel='+1'><mml:mfrac><mml:mn>2</mml:mn><mml:mn>3</mml:mn></mml:mfrac></mml:mstyle></mml:mrow></mml:math></inline-formula>). In this case, it&#8217;s not too surprising that Xin would lose knowledge for any one of her true beliefs since she may not even be confident enough to justifiably believe anything anymore. Thus, one&#8217;s loss of knowledge can be attributed to one&#8217;s loss of confidence. In other words, in familiar cases of defeat, learning some proposition <inline-formula><mml:math id="Eq426-mml"><mml:mi>q</mml:mi></mml:math></inline-formula> destroys our knowledge of <inline-formula><mml:math id="Eq427-mml"><mml:mi>p</mml:mi></mml:math></inline-formula> partly because <inline-formula><mml:math id="Eq428-mml"><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mo>&#x007C;</mml:mo><mml:mi>q</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>.</p>
<p>But this is not so with Xin. Things are quite different when we have a <italic>large</italic> number of true beliefs. Suppose for concreteness that Xin had <inline-formula><mml:math id="Eq429-mml"><mml:mn>1000</mml:mn></mml:math></inline-formula> probabilistically independent beliefs in her book, and that Xin is <inline-formula><mml:math id="Eq430-mml"><mml:mn>0.99</mml:mn></mml:math></inline-formula> confident in each of them. In that case, coming to learn that there is exactly one error in the book would actually raise her confidence in each claim to <inline-formula><mml:math id="Eq431-mml"><mml:mn>0.999</mml:mn></mml:math></inline-formula>. So in her case, she has learned some proposition <inline-formula><mml:math id="Eq432-mml"><mml:mi>q</mml:mi></mml:math></inline-formula> such that for every proposition <inline-formula><mml:math id="Eq433-mml"><mml:mi>p</mml:mi></mml:math></inline-formula> in the book, <inline-formula><mml:math id="Eq434-mml"><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mo>&#x007C;</mml:mo><mml:mi>q</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>! In Xin&#8217;s case, learning that only one of her beliefs is false actually <italic>increases</italic> her confidence in each of the claims in the book. So if Xin is a victim of Strange Defeat, then she somehow loses her knowledge that <inline-formula><mml:math id="Eq435-mml"><mml:mi>p</mml:mi></mml:math></inline-formula> (for some <inline-formula><mml:math id="Eq436-mml"><mml:mi>p</mml:mi></mml:math></inline-formula>) despite learning something that would make her justifiably more confident in <inline-formula><mml:math id="Eq437-mml"><mml:mi>p</mml:mi></mml:math></inline-formula> than ever before!</p>
<p>The phenomenon of Strange Defeat would then conflict with the following principle about defeat:</p>
<disp-quote>
<p><bold>Defeating Evidence Is Not Confirming Evidence (DENCE):</bold> If one knows <inline-formula><mml:math id="Eq438-mml"><mml:mi>p</mml:mi></mml:math></inline-formula>, then evidence <inline-formula><mml:math id="Eq439-mml"><mml:mi>E</mml:mi></mml:math></inline-formula> does not defeat one&#8217;s knowledge of <inline-formula><mml:math id="Eq440-mml"><mml:mi>p</mml:mi></mml:math></inline-formula> if <inline-formula><mml:math id="Eq441-mml"><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mo>&#x007C;</mml:mo><mml:mi>E</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x003E;</mml:mo><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>.</p>
</disp-quote>
<p>To see how this principle is inconsistent with the phenomena of Strange Defeat, simply replace <inline-formula><mml:math id="Eq442-mml"><mml:mi>E</mml:mi></mml:math></inline-formula> with the proposition <inline-formula><mml:math id="Eq443-mml"><mml:mi>O</mml:mi></mml:math></inline-formula>: that there is a single false belief in the book. In that case, if Xin knew every true proposition in the book <inline-formula><mml:math id="Eq444-mml"><mml:mi>p</mml:mi></mml:math></inline-formula>, then <bold>DENCE</bold> implies that she continues to know <inline-formula><mml:math id="Eq445-mml"><mml:mi>p</mml:mi></mml:math></inline-formula> when she learns <inline-formula><mml:math id="Eq446-mml"><mml:mi>O</mml:mi></mml:math></inline-formula>, since learning <inline-formula><mml:math id="Eq447-mml"><mml:mi>O</mml:mi></mml:math></inline-formula> only increases her confidence in each true proposition.</p>
<p>Thus, if one accepts the phenomena of Strange Defeat, then one must say that defeating evidence <italic>can</italic> be confirming evidence.<xref ref-type="fn" rid="n26">26</xref></p>
<p>Furthermore, it is hard to see what <italic>special</italic> reason Xin gains for doubting any of her particular beliefs. At best, the knowledge that exactly one of her beliefs is false might give her some reason to think that, for any particular belief, there is a chance that <italic>that</italic> belief is the false one. However, it can be argued that Xin already knew that, for any particular belief, there is a chance that that belief is false! It would be strange indeed if the knowledge that one&#8217;s belief has a chance of being <italic>a false belief</italic> does not defeat any knowledge, but the knowledge that one&#8217;s belief has a chance of being the <italic>only false belief</italic> somehow does.</p>
<p>To make this point more vivid, let us imagine that I have many friends who are generally reliable. I ask each of my <inline-formula><mml:math id="Eq448-mml"><mml:mn>1000</mml:mn></mml:math></inline-formula> friends whether they can make it to my birthday party. Some say &#8220;yes&#8221;, and others say &#8220;no&#8221;, and I come to believe what each of them say. However, even though my friends are incredibly reliable, I know that friends who say &#8220;yes&#8221; sometimes flake in the end, and friends who say &#8220;no&#8221; sometimes change their mind. Given the sheer number of friends that I have, I suspect that a few friends would change their minds. So when <inline-formula><mml:math id="Eq449-mml"><mml:mn>500</mml:mn></mml:math></inline-formula> of my friends say &#8220;yes&#8221;, and <inline-formula><mml:math id="Eq450-mml"><mml:mn>500</mml:mn></mml:math></inline-formula> say &#8220;no&#8221;, I estimate that about <inline-formula><mml:math id="Eq451-mml"><mml:mn>500</mml:mn></mml:math></inline-formula>, give or take <inline-formula><mml:math id="Eq452-mml"><mml:mn>5</mml:mn></mml:math></inline-formula>, people will be at the party.</p>
<p>Now, the Anti-Socratic who denies <bold>No Loss</bold> would say that, of the truthful friends, I know whether they will show up at the party on the basis of their testimony. However, they would also say that once I learn that only one of my friends will change their mind, I somehow no longer know, for some of my truthful friends, whether they will be at the party. They will say this is so even though I gained no special reason to doubt anyone&#8217;s particular testimony (in fact, it increases my confidence in each of my friends)!</p>
<p>I find that conclusion hard to swallow. I find it hard to swallow, for example, to say that I can know that John will be at the party when I know that some friends don&#8217;t tell the truth, but that I can&#8217;t know that John will be at the party when I know that only <italic>one</italic> friend did not tell the truth.</p>
<p>Even worse, since this is a case where the basis of my knowledge about each of my friends is the same, it would be arbitrary to say that my knowledge about John is defeated while my knowledge about my other friends remains intact. To avoid this arbitrariness, one would have to say that, once I learn that only one of my friends will change their mind, I cannot know whether <italic>any</italic> of my friends will change their mind.</p>
<p>Ironically, then, the Anti-Socratic who wishes to salvage <bold>We Know A Lot</bold> by denying <bold>No Loss</bold> may have to say that, although we know a lot, we also stand to lose a lot. If even confirming evidence can drive me to doubt the testimony of all my friends, then that would mean that my knowledge is fragile indeed.</p>
<p>Finally, even if the Anti-Socratic who accepts <bold>Closure</bold> is right in denying <bold>No Loss</bold>, there is still the problem of how the Anti-Socratic can come to know a lot in the first place. In Xin&#8217;s case, it is still puzzling how she can come to know every element of the set <inline-formula><mml:math id="Eq453-mml"><mml:mrow><mml:mi>S</mml:mi><mml:mo>=</mml:mo><mml:mo>&#x007B;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mn>&#x2026;</mml:mn><mml:msub><mml:mi>p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>&#x007D;</mml:mo></mml:mrow></mml:math></inline-formula>, and thereby come to know, by <bold>Closure</bold>, <inline-formula><mml:math id="Eq454-mml"><mml:mrow><mml:mo>&#x22C0;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>. The reason why it is puzzling as to how Xin can come to know <inline-formula><mml:math id="Eq455-mml"><mml:mrow><mml:mo>&#x22C0;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula> is because two independent arguments can be made for the conclusion that Xin cannot come to know <inline-formula><mml:math id="Eq456-mml"><mml:mrow><mml:mo>&#x22C0;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>.</p>
<disp-quote>
<p><bold>Argument from Strong Modesty</bold></p>
<p>(S1) Xin is justified in believing <inline-formula><mml:math id="Eq457-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mo>&#x22C0;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>. [<bold>Strong Modesty</bold>]</p>
<p>(S2) For any proposition <inline-formula><mml:math id="Eq458-mml"><mml:mi>p</mml:mi></mml:math></inline-formula>, if one is justified in believing <inline-formula><mml:math id="Eq459-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>, then one is not in a position to know <inline-formula><mml:math id="Eq460-mml"><mml:mi>p</mml:mi></mml:math></inline-formula>. [<bold>Knowledge-Exclusion</bold>]<xref ref-type="fn" rid="n27">27</xref></p>
<p><inline-formula><mml:math id="Eq461-mml"><mml:mo>&#x2234;</mml:mo></mml:math></inline-formula> Xin is not in a position to know <inline-formula><mml:math id="Eq462-mml"><mml:mrow><mml:mo>&#x22C0;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula></p>
<p><bold>Argument from Weak Modesty</bold></p>
<p>(W1) Xin is <italic>not</italic> justified in believing <inline-formula><mml:math id="Eq463-mml"><mml:mrow><mml:mo>&#x22C0;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>. [<bold>Weak Modesty</bold>]</p>
<p>(W2) For any proposition <inline-formula><mml:math id="Eq464-mml"><mml:mi>p</mml:mi></mml:math></inline-formula>, if one is not justified in believing <inline-formula><mml:math id="Eq465-mml"><mml:mi>p</mml:mi></mml:math></inline-formula>, then one is not in a position to know <inline-formula><mml:math id="Eq466-mml"><mml:mi>p</mml:mi></mml:math></inline-formula>. [<bold>Knowledge Implies Justification</bold>]</p>
<p><inline-formula><mml:math id="Eq467-mml"><mml:mo>&#x2234;</mml:mo></mml:math></inline-formula> Xin is not in a position to know <inline-formula><mml:math id="Eq468-mml"><mml:mrow><mml:mo>&#x22C0;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula></p>
</disp-quote>
<p>(S1) and (W1) are plausible for Preface Paradox style reasons&#8212;since Xin is not completely certain in each proposition in <inline-formula><mml:math id="Eq469-mml"><mml:mi>S</mml:mi></mml:math></inline-formula>, she will be very uncertain in their conjunction (and hence very confident that the conjunction is false).<xref ref-type="fn" rid="n28">28</xref></p>
<p>(S2) and (W2) are also quite plausible, but not entirely uncontested. We will discuss these two principles more in the next section, but for now it suffices to note their <italic>prima facie</italic> plausibility.<xref ref-type="fn" rid="n29">29</xref></p>
<p>Ultimately, any Anti-Socratic who accepts <bold>Closure</bold> must also deal with the arguments from <bold>Strong</bold> and <bold>Weak Modesty</bold>. Thus, even if one accepts the phenomena of Strange Defeat and gives up the principle <bold>DENCE</bold>, one still needs to say something about (S1) and (S2) and (W1) and (W2). Unless the Anti-Socratic deals also with these two arguments, they cannot explain how Xin can come to know a lot in the first place. Perhaps the Anti-Socratic who denies <bold>No Gain</bold> can do better. We explore this view in the next section.</p>
</sec>
<sec>
<title>3.2. Denying No Gain</title>
<p>In this section, we consider the views of the Anti-Socratic who denies <bold>No Gain</bold>. Such an Anti-Socratic believes that Xin starts off knowing a lot, continues to know a lot, and comes to even be able to know which of her beliefs is false when told that there is exactly one false proposition in the book.</p>
<p>Anti-Socratics of this sort would also have no problem with the view that Xin is in a position to know <inline-formula><mml:math id="Eq470-mml"><mml:mrow><mml:mo>&#x22C0;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>. After all, if Xin can come to gain the knowledge that <inline-formula><mml:math id="Eq471-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is false when Xin learns that exactly one proposition in the book is false, it is only because Xin deduces that since <inline-formula><mml:math id="Eq472-mml"><mml:mrow><mml:mo>&#x22C0;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula> is true and one of the propositions in the book is false, <inline-formula><mml:math id="Eq473-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> must be the false proposition.</p>
<p>Anti-Socratics who deny <bold>No Gain</bold>, then, should adopt a principled reason for how Xin can know <inline-formula><mml:math id="Eq474-mml"><mml:mrow><mml:mo>&#x22C0;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>. Doing so would require some principled reason in rejecting either (S1) or (S2) and either (W1) or (W2). Broadly speaking, there are two such strategies for doing so.</p>
<p>The first strategy is to deny both (S1) and (W1) and assert that Xin is in fact <italic>justified</italic> in believing <inline-formula><mml:math id="Eq475-mml"><mml:mrow><mml:mo>&#x22C0;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>. One way of doing so would be to adopt the E = K thesis (our evidence consists in all and only in what we know). If the Anti-Socratic adopts the E = K thesis, the Anti-Socratic should think that, since Xin knows all the propositions in <inline-formula><mml:math id="Eq476-mml"><mml:mi>S</mml:mi></mml:math></inline-formula>, she is justified in being <italic>maximally</italic> confident in <inline-formula><mml:math id="Eq477-mml"><mml:mrow><mml:mo>&#x22C0;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>, given all her evidence. Thus, Xin would be justified in believing <inline-formula><mml:math id="Eq478-mml"><mml:mrow><mml:mo>&#x22C0;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula> (<italic>contra</italic> (W1)), and Xin would not be justified in believing <inline-formula><mml:math id="Eq479-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mo>&#x22C0;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula> (<italic>contra</italic> (S1)).</p>
<p>The second strategy is to deny both (S2) and (W2). To deny (S2) and (W2) would be to assert that someone can know a proposition on <italic>insufficient</italic> or even on <italic>countervailing</italic> evidence. As far as I know, Donahue (<xref ref-type="bibr" rid="B8">2019</xref>) adopts this strategy. He calls it a variant of Maria Lasonen-Aarnio&#8217;s concept of &#8220;Unreasonable Knowing&#8221;.</p>
<p>Let us first discuss the E = K strategy.</p>
<sec>
<title>3.2.1. The E = K Strategy</title>
<p>If E = K, the Anti-Socratics can easily identify what is wrong with <bold>Strong</bold> and <bold>Weak Modesty</bold>. For since the Anti-Socratic thinks that Xin knows every proposition in <inline-formula><mml:math id="Eq480-mml"><mml:mi>S</mml:mi></mml:math></inline-formula>, if they adopt the E = K thesis, then the Anti-Socratic should also think that the probability of <inline-formula><mml:math id="Eq481-mml"><mml:mrow><mml:mo>&#x22C0;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula> given everything she knows is 1, and the probability of <inline-formula><mml:math id="Eq482-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mo>&#x22C0;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula> given everything she knows is 0. Williamson calls our probabilities conditional on everything we know our &#8220;Evidential Probabilities&#8221;, and so if our credences should match our Evidential Probabilities, we should be certain that <inline-formula><mml:math id="Eq483-mml"><mml:mrow><mml:mo>&#x22C0;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula> is true. Now, if our Evidential Probabilities are an indication as to how justified we are in believing a certain proposition, then to have an Evidential Probability of 1 in <inline-formula><mml:math id="Eq484-mml"><mml:mrow><mml:mo>&#x22C0;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula> would give us the most justification possible for believing <inline-formula><mml:math id="Eq485-mml"><mml:mrow><mml:mo>&#x22C0;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>. So having an Evidential Probability of 1 in <inline-formula><mml:math id="Eq486-mml"><mml:mrow><mml:mo>&#x22C0;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula> would mean that <bold>Weak Modesty</bold> is false, while having an Evidential Probability of 0 in <inline-formula><mml:math id="Eq487-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mo>&#x22C0;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula> would mean that <bold>Strong Modesty</bold> is false.</p>
<p>And once it is clear that one can thereby know <inline-formula><mml:math id="Eq488-mml"><mml:mrow><mml:mo>&#x22C0;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula> on the grounds that it has such a high Evidential Probability, it no longer seems so problematic that Xin can simply deduce <inline-formula><mml:math id="Eq489-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> when she learns that exactly one thing she wrote down is false. Furthermore, the E = K view also comes furnished with a candidate explanation for why it is good practice to <italic>think</italic> that we might be mistaken, even though we know all the propositions in <inline-formula><mml:math id="Eq490-mml"><mml:mi>S</mml:mi></mml:math></inline-formula>. The reason is because we often do not <inline-formula><mml:math id="Eq491-mml"><mml:mtext mathvariant="italic">know</mml:mtext></mml:math></inline-formula> what we know, and so even conditional on everything we know (i.e., <inline-formula><mml:math id="Eq492-mml"><mml:mrow><mml:mo>&#x22C0;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>) it may still be incredibly improbable that we know <inline-formula><mml:math id="Eq493-mml"><mml:mrow><mml:mo>&#x22C0;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>. In other words, even though <inline-formula><mml:math id="Eq494-mml"><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#x2227;</mml:mo><mml:mi>S</mml:mi><mml:mo>&#x007C;</mml:mo><mml:mo>&#x2227;</mml:mo><mml:mi>S</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="Eq495-mml"><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mtext>We&#x00A0;know</mml:mtext><mml:mo>&#x2227;</mml:mo><mml:mi>S</mml:mi><mml:mo>&#x007C;</mml:mo><mml:mo>&#x2227;</mml:mo><mml:mi>S</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>. Williamson in fact takes the error-free version of the Preface Paradox to be an example of such &#8220;Improbable Knowing&#8221; Williamson (<xref ref-type="bibr" rid="B37">2014</xref>). And so even though one may be in a position to know <inline-formula><mml:math id="Eq496-mml"><mml:mrow><mml:mo>&#x22C0;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula> by deduction, it may be bad practice to believe it on the basis of deduction because such a person who believes the conjunction of a large number of propositions where all of them are known is bound to also believe the conjunction of a large number of propositions where they only seem to be known. So now we have some reason to deny <bold>Strong Modesty</bold> and <bold>Weak Modesty</bold>, and we are still able to explain why one should, in some sense, be modest.</p>
<p>I think there is much to like about this view since it vindicates our reliance on <bold>Closure</bold> but still gives us a candidate explanation for why we find <bold>Strong Modesty</bold> and <bold>Weak Modesty</bold> so compelling. However, the E = K view has not gone unchallenged (see <xref ref-type="bibr" rid="B20">Hawthorne 2005</xref>; <xref ref-type="bibr" rid="B6">Comesa&#241;a &amp; Kantin 2010</xref>).</p>
<p>I have at least two general worries for the E = K view. The first worry is that our knowledge goes beyond what we ordinarily take to be our evidence. <xref ref-type="bibr" rid="B20">Hawthorne 2005</xref> gives such an example when he has us consider two cases where a person sees a gas gauge that reads &#8220;full&#8221;, except in the first case the gauge is accurate while in the second case the gauge is inaccurate. It is intuitive to think that both have the same evidence, but only one knows, and so one can know something that is not part of one&#8217;s evidence.</p>
<p>One way to reply to this argument, however, is to contest that the testimonial evidence gained from reading the gauge is only of the form &#8220;the gauge reads that&#8230;&#8221;, or the perceptual evidence that &#8220;the gas tank <italic>seems</italic> full&#8221;. In the case where the gauge is accurate, perception and testimony can also give one the proposition that the gas tank <italic>is</italic> full as evidence. Thus, when the gauge is accurate, one knows that the tank is full because we gain the proposition that the gas tank is full as evidence, but in the latter case, we do not know that the gas tank is full because we only have the proposition that the gas gauge reads &#8220;full&#8221; as evidence.</p>
<p>However, even if we accept this view of evidence, we can still create other examples where it is intuitive to think that one&#8217;s knowledge goes beyond one&#8217;s evidence. An example of such a phenomenon comes from the possibility of inductive knowledge. Consider two people in two situations:</p>
<disp-quote>
<p>Case A:</p>
<p>Anne has observed emeralds <inline-formula><mml:math id="Eq497-mml"><mml:mrow><mml:msub><mml:mi>e</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq498-mml"><mml:mrow><mml:msub><mml:mi>e</mml:mi><mml:mn>1000</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>. Anne doesn&#8217;t just learn that emeralds <inline-formula><mml:math id="Eq499-mml"><mml:mrow><mml:msub><mml:mi>e</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq500-mml"><mml:mrow><mml:msub><mml:mi>e</mml:mi><mml:mn>1000</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> <italic>look</italic> green, but that they <italic>are</italic> green. On this basis, Anne comes to know that all emeralds are green.</p>
<p>Case B:</p>
<p>Bill has observed emeralds <inline-formula><mml:math id="Eq501-mml"><mml:mrow><mml:msub><mml:mi>e</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq502-mml"><mml:mrow><mml:msub><mml:mi>e</mml:mi><mml:mn>2000</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>. Bill doesn&#8217;t just learn that emeralds <inline-formula><mml:math id="Eq503-mml"><mml:mrow><mml:msub><mml:mi>e</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq504-mml"><mml:mrow><mml:msub><mml:mi>e</mml:mi><mml:mn>2000</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> <italic>look</italic> green, but that they <italic>are</italic> green. On this basis, Bill comes to know that all emeralds are green.</p>
</disp-quote>
<p>What shall we say about Anne and Bill? If inductive knowledge is possible, then it is plausible that after Anne has observed 1000 emeralds, she can come to know that all emeralds are green (and if you think 1000 emeralds are too few, feel free to substitute it for a larger number). Bill, however, has observed those same emeralds and 1000 more. So although both Anne and Bill are the same with respect to their knowing whether all emeralds are green, I find it intuitive that Bill has <italic>more evidence</italic> than Anne does for the proposition that all emeralds are green. Indeed, if Anne later comes to observe the other 1000 emeralds that Bill observed, it would be entirely be appropriate for Anne to exclaim, &#8220;ah! more evidence for the fact that all emeralds are green!&#8221;.</p>
<p>However, if E = K, then it cannot be the case that Bill has more evidence than Anne because both Bill and Anne <inline-formula><mml:math id="Eq505-mml"><mml:mtext mathvariant="italic">know</mml:mtext></mml:math></inline-formula> that all emeralds are green, and so the proposition that all emeralds are green is part of both of their evidence. And if the proposition that all emeralds are green are part of both of their evidence, then they both already have the most possible evidence that all emeralds are green, since for every proposition <inline-formula><mml:math id="Eq506-mml"><mml:mi>p</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math id="Eq507-mml"><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mo>&#x007C;</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>. Thus, Anne could not rationally be <italic>more</italic> certain than she was before, even if she comes to observe the additional emeralds Bill observed.</p>
<p>Intuitively, however, Bill <italic>does</italic> have more evidence for the proposition that all emeralds are green than Anne does. If Bill, for example, observed every single emerald in the world, it would be odd to say that Anne has just as much evidence as Bill does for the proposition that all emeralds are green. Furthermore, if Bill (who has seen all emeralds himself, and knows this) hears from a reliable witness (who has seen 5000 emeralds) that all emeralds are green, we would not say that Bill has gained any additional reason for believing that all emeralds are green. If, however, Anne has heard from that same witness that all emeralds are green, we <italic>would</italic> say that Anne has gained some more evidence that all emeralds are green. But of course, if the proposition that all emeralds are green is already part of Anne&#8217;s evidence, then Anne has just as much evidence as if she saw all the emeralds in the world herself, and so hearing from a reliable witness should not give her any additional reason to believe that all emeralds are green at all.</p>
<p>Secondly, on the E = K view, it is hard to justify our practice of sometimes testing hypotheses of which we already know.<xref ref-type="fn" rid="n30">30</xref> For example, even though one might know that all emeralds are green, it may be worthwhile to gather more emeralds to test this hypothesis. Perhaps we would want to test this hypothesis because, although we know it to be true, we wish to know that we know it, and so further testing may be necessary. However, if we already knew that all emeralds are green, we cannot learn anything more by looking at another green emerald than we could by simply deducing from &#8220;all emeralds are green&#8221; to &#8220;the next emerald I see is green&#8221;, or &#8220;emeralds <inline-formula><mml:math id="Eq508-mml"><mml:mrow><mml:msub><mml:mi>e</mml:mi><mml:mrow><mml:mn>1000</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> to <inline-formula><mml:math id="Eq509-mml"><mml:mrow><mml:msub><mml:mi>e</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, where <inline-formula><mml:math id="Eq510-mml"><mml:mi>n</mml:mi></mml:math></inline-formula> is the number of emeralds, are green&#8221;. But if we could simply deduce that all the other emeralds are green from what we know, then going out to search for more evidence that all emeralds are green would be as much of a waste of time as it is for a person to check the weather to see whether it&#8217;s true that it is either raining or not raining. Thus, if inductive evidence is possible, and E = K, then all new evidence may just as well be old evidence. And that&#8217;s a problem.</p>
</sec>
<sec>
<title>3.2.2. The Unreasonable Knowledge Strategy</title>
<p>Another strategy for the Anti-Socratic would be to deny <bold>Knowledge-Exclusion</bold> and <bold>Knowledge Implies Justification</bold>. The Anti-Socratic who does this would say that since Xin knows a lot, she can come to know <inline-formula><mml:math id="Eq511-mml"><mml:mrow><mml:mo>&#x22C0;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>, and thereby come to know <inline-formula><mml:math id="Eq512-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> <italic>despite</italic> the fact that she has insufficient evidence to believe <inline-formula><mml:math id="Eq513-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> and <italic>despite</italic> the fact that she actually has good reason to believe <inline-formula><mml:math id="Eq514-mml"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>.</p>
<p>Such a move would be quite radical, but such a move has been defended precisely by Donahue (<xref ref-type="bibr" rid="B8">2019</xref>).</p>
<p>To see how radical this move is, it would be helpful to distinguish it from the nearby ideas of &#8220;Improbable Knowing&#8221; and &#8220;Level-Splitting&#8221;. A case of Improbable Knowing, as mentioned above, is one where one can know <inline-formula><mml:math id="Eq515-mml"><mml:mi>p</mml:mi></mml:math></inline-formula> <italic>despite</italic> the fact that it is highly improbable on one&#8217;s evidence that one <inline-formula><mml:math id="Eq516-mml"><mml:mtext mathvariant="italic">knows</mml:mtext><mml:mo>&#x00A0;</mml:mo><mml:mi>p</mml:mi></mml:math></inline-formula>. However, this move is consistent with both <bold>Knowledge-Exclusion</bold> and <bold>Knowledge Implies Justified Belief</bold>. This is because improbable knowing is not a case where one knows <inline-formula><mml:math id="Eq517-mml"><mml:mi>p</mml:mi></mml:math></inline-formula> even though <inline-formula><mml:math id="Eq518-mml"><mml:mi>p</mml:mi></mml:math></inline-formula> is improbable on one&#8217;s evidence&#8212;it is only a case where <inline-formula><mml:math id="Eq519-mml"><mml:mtext mathvariant="italic">knowing</mml:mtext><mml:mo>&#x00A0;</mml:mo><mml:mi>p</mml:mi></mml:math></inline-formula> is improbable on one&#8217;s evidence.</p>
<p>Secondly, <bold>Knowledge-Exclusion</bold> and <bold>Knowledge Implies Justification</bold> are consistent with the &#8220;Level- Splitting&#8221; views. The term &#8220;Level-Splitting&#8221; comes from Lasonen-Aarnio (<xref ref-type="bibr" rid="B24">2014</xref>), and it refers to how we should rationally respond to higher-order evidence that suggests that our first-order evidence is somehow unreliable. A paradigm example where one receives such higher-order evidence would be a case where one sees a red wall, comes to gain perceptual evidence that the wall is red, but is then (misleadingly) told by a usually reliable friend that one has just ingested a drug that makes it seem like white walls are actually red. In such a case, a &#8220;Level-Splitter&#8221; would be one who would say it is rational to believe that the wall is red based on one&#8217;s first-order perceptual evidence about the redness of the wall, but also believe (based on the higher-order testimonial evidence) that one does not have sufficient evidence to justifiably believe that the wall is red.</p>
<p>Such a view has some odd consequences (see <xref ref-type="bibr" rid="B22">Horowitz 2014</xref> for examples of such consequences), but not even the level-splitter has to deny either <bold>Knowledge-Exclusion</bold> or <bold>Knowledge Implies Justification</bold>. The level-splitter only needs to say that one&#8217;s evidence <inline-formula><mml:math id="Eq520-mml"><mml:mi>E</mml:mi></mml:math></inline-formula> can support <inline-formula><mml:math id="Eq521-mml"><mml:mi>p</mml:mi></mml:math></inline-formula>, but one&#8217;s higher-order evidence <inline-formula><mml:math id="Eq522-mml"><mml:mtext mathvariant="italic">HE</mml:mtext></mml:math></inline-formula> can cast doubt on whether <inline-formula><mml:math id="Eq523-mml"><mml:mi>E</mml:mi></mml:math></inline-formula> supports <inline-formula><mml:math id="Eq524-mml"><mml:mi>p</mml:mi></mml:math></inline-formula>. But since, on the level-splitting view, higher-order evidence does not decrease one&#8217;s rational credence for <inline-formula><mml:math id="Eq525-mml"><mml:mi>p</mml:mi></mml:math></inline-formula>, one&#8217;s <italic>total</italic> evidence simply supports <inline-formula><mml:math id="Eq526-mml"><mml:mi>p</mml:mi></mml:math></inline-formula>. Thus, even the level-splitter does not have any reason to think that one can know <inline-formula><mml:math id="Eq527-mml"><mml:mi>p</mml:mi></mml:math></inline-formula> even if one has insufficient evidence for, or even countervailing evidence against, <inline-formula><mml:math id="Eq528-mml"><mml:mi>p</mml:mi></mml:math></inline-formula>.</p>
<p>For an example where something like <bold>Knowledge-Exclusion</bold> is false, we need a case where one is justified in believing <inline-formula><mml:math id="Eq529-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>, but where one can knows <inline-formula><mml:math id="Eq530-mml"><mml:mi>p</mml:mi></mml:math></inline-formula> nonetheless. Sean Donahue thinks that the Preface Paradox for knowledge is precisely an example of this kind of case. Donahue has us consider a variant of the Preface Paradox where an agent in fact knows all the claims in her book. Since knowledge is closed under deduction, the agent comes to know the conjunction of all the claims in the book. Nonetheless, she has excellent inductive evidence (based on all the errors she discovered in her previous books) that the conjunction is false. So she can know that the conjunction is true, although she is justified (by her inductive evidence) that the conjunction is false. Thus, we supposedly have an example where <bold>Knowledge-Exclusion</bold> fails.</p>
<p>Furthermore, in order for this example to work, it also needs to be a case where <bold>Knowledge Implies Justified Belief</bold> fails. This is because, if knowledge implies justified belief, then if an agent knows the conjunction, she would also be justified in believing in the conjunction. But the counter-example crucially relies on the intuition that the agent is justified in believing the <italic>negation</italic> of the conjunction. Of course, it is possible for the agent to be justified <italic>on one basis</italic> in believing the conjunction, and justified <italic>on another basis</italic> in believing its negation; but we are interested in what the agent is justified in believing in full stop. To answer this question, we need to know what the agent is justified in believing on the basis of one&#8217;s <italic>total evidence</italic>. So if the agent is justified in believing in the negation of the conjunction on her total evidence, she cannot be justified in believing the conjunction. This is because to the degree that one is justified in believing a proposition <inline-formula><mml:math id="Eq531-mml"><mml:mi>p</mml:mi></mml:math></inline-formula>, one should also be justified to the same degree in <italic>dis</italic>believing <inline-formula><mml:math id="Eq532-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>. On the probabilistic framework which we are working in, this is unavoidable since the higher <inline-formula><mml:math id="Eq533-mml"><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mo>&#x007C;</mml:mo><mml:mi>E</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> is, the lower <inline-formula><mml:math id="Eq534-mml"><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>p</mml:mi><mml:mo>&#x007C;</mml:mo><mml:mi>E</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> must be. Thus, if <inline-formula><mml:math id="Eq535-mml"><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>p</mml:mi><mml:mo>&#x007C;</mml:mo><mml:mi>E</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> is high enough to justify believing in <inline-formula><mml:math id="Eq536-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math id="Eq537-mml"><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mo>&#x007C;</mml:mo><mml:mi>E</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> cannot be equally as high so as to justify believing <inline-formula><mml:math id="Eq538-mml"><mml:mi>p</mml:mi></mml:math></inline-formula> (assuming, of course, that one can only be justified in believing <inline-formula><mml:math id="Eq539-mml"><mml:mi>p</mml:mi></mml:math></inline-formula> when <inline-formula><mml:math id="Eq540-mml"><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mo>&#x007C;</mml:mo><mml:mi>E</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> is at least greater than 0.5).</p>
<p>Thus, if Donahue&#8217;s variant of the Preface Paradox is a genuine counter-example to <bold>Knowledge-Exclusion</bold>, it must also be a counterexample to <bold>Knowledge Implies Justification</bold>. But if this variant really is a counter-example to these two principles, what explains their plausibility? What, for example, explains our intuitive judgment that an agent cannot know the conjunction on insufficient evidence, and in this case, <italic>countervailing</italic> evidence?</p>
<p>Donahue explains this intuition by noting that though <bold>Knowledge-Exclusion</bold> (and perhaps by extension, <bold>Knowledge Implies Justified Belief</bold>) is false, there is still <italic>something</italic> blameworthy about an agent who goes ahead and believes in the conjunction of all the claims in her book. In particular, such an agent would be blameworthy because she is not manifesting <italic>knowledge-conducive dispositions</italic>. Being inspired by Lasonen-Aarnio, Donahue treats the Preface Paradox as just another instance of &#8220;Unreasonable Knowing&#8221; where one can know a proposition <inline-formula><mml:math id="Eq541-mml"><mml:mi>p</mml:mi></mml:math></inline-formula> although one is unreasonable for believing <inline-formula><mml:math id="Eq542-mml"><mml:mi>p</mml:mi></mml:math></inline-formula> because one would be manifesting a non-knowledge-conducive disposition in doing so. In this case, it is unreasonable for an agent to believe the conjunction because it manifests the disposition to believe the conjunction of claims that <italic>seem</italic> to be known. And of course, an agent cannot always distinguish cases where claims are known and where they only seem to be known, and so to manifest a disposition to believe a conjunction of claims that seem to be known is bound to lead one into error in the majority of cases where the conjunction is large enough. However, Donahue is quick to note that though an agent would be unreasonable in this sense for believing the conjunction, this by no means shows that the agent does not thereby obtain knowledge through these unreasonable means.</p>
<p>However, I think this strategy goes too far. If we can explain away our intuition that an agent cannot know something on insufficient, and even on countervailing evidence, by appealing to Donahue&#8217;s take on Unreasonable Knowing, then we can explain away almost any of our intuitions where we think true belief falls short of knowledge. For example, intuitively, if Jack believes that the number of stars is odd because he likes odd numbers, then Jack does not know that the number of stars is odd, even if its true. However, if Donahue is right, then we could easily explain away this intuition by saying that Jack <italic>does</italic> know that the number of stars is odd, however, he is still epistemically blameworthy because he is not manifesting knowledge-conducive dispositions. Likewise, if Jack believes that the number of stars is odd despite overwhelming evidence that it is not, we can similarly explain away our intuition that Jack doesn&#8217;t know by saying that Jack is still epistemically blameworthy because he is not manifesting knowledge-conducive dispositions.</p>
<p>Here, Donahue may reply that in the examples I gave, an agent has a true belief on <italic>no</italic> evidence, while in the Preface case, the agent knows the conjunction because she deduces it from known premises. Thus, the agent in the Preface case still has <italic>some</italic> evidence for believing the conjunction.</p>
<p>However, whether or not an agent has <italic>some</italic> evidence is beyond the point. After all, one would not say that Jack still gets to know that the number of stars is odd on the basis of an unreliable news source just because Jack has <italic>some</italic> evidence. Likewise, if Jack had <italic>some</italic> evidence that the number of stars is odd, but is also swamped by overwhelming evidence that it is not, one would also say that Jack does not have knowledge.</p>
<p>Perhaps this is just what the Anti-Socratic wants to say. The Anti-Socratic wants to say that we know a lot. One way of securing this is to make knowledge a ridiculously easy epistemic state to achieve. Denying <bold>Knowledge-Exclusion</bold> and <bold>Knowledge Implies Justification</bold> does just this. However, for Anti-Socratics who think that knowledge must be something more than just true belief, denying these two principles may just be too heavy a cost.</p>
</sec>
</sec>
</sec>
<sec>
<title>4. Conclusion</title>
<p>The common sense view is that we know a lot. In this paper, I hope to have shown through a variant of the Preface Paradox that we, in fact, do not know very much. However, though I have argued that this common sense view is false, I still maintain the common sense view that many of our knowledge-ascriptions are true. In order to secure the truth of many of our knowledge ascriptions, I needed a contextualist view where one can only know relatively few things in a certain context. My contextualist view that treats knowledge as relative to a contextually provided question does just this.</p>
<p>However, for the Anti-Socratic, it isn&#8217;t enough that many of our knowledge ascriptions are true. They really want it to be true that we do know as much as we think we know in any given context. This common sense view turns out to be fairly costly. Either the Anti-Socratic must give up <bold>Closure</bold>, or they must give up <bold>No Gain, No Loss</bold>. Giving up either of those principles, however, can lead us to highly unintuitive consequences.</p>
<p>That being said, there are some pressing questions that the Question-Sensitive Contextualist must answer. For example, what are the rules and mechanisms that govern context shift? Where do bread and butter epistemological notions such as safety and reliability fit into our picture? Do those notions play a role in determining which contexts are active, or will they fall by the wayside? These questions have been raised, but they must be left for further research.</p>
</sec>
</body>
<back>
<fn-group>
<fn id="n1"><label>1.</label><p>Quote from Lewis (<xref ref-type="bibr" rid="B26">1996</xref>).</p></fn>
<fn id="n2"><label>2.</label><p>Indeed, some of the most common explanations for why we intuitively do not think that one can know whether any particular lottery ticket will lose simply do not apply in Xin&#8217;s case. For example, some authors think that we cannot know whether any particular ticket will lose because our evidence for thinking so is (a) perfectly symmetrical (<xref ref-type="bibr" rid="B4">Christensen 2004</xref> cites <xref ref-type="bibr" rid="B3">BonJour 1985</xref>, <xref ref-type="bibr" rid="B32">Ryan 1996</xref>, <xref ref-type="bibr" rid="B13">Evnine 1999</xref> for a similar view), or (b) purely statistical Cohen (<xref ref-type="bibr" rid="B5">1988</xref>). However, in Xin&#8217;s case, neither (a) nor (b) hold.</p></fn>
<fn id="n3"><label>3.</label><p>Alternatively, the E = K theorist may argue that the case as I described it is impossible. The E = K theorist may be convinced that, since we stipulated that Xin has evidence <italic>par excellence</italic> for each of her true beliefs, she really does know each of them. In that case, on the E = K view, it would be impossible for Xin to rationally be extremely confident that she has at least one false belief. In fact, she should be extremely confident that she has <italic>no</italic> false beliefs. I consider this view in Section 3.2, and I directly deal with the E = K view in Section 3.2.1.</p></fn>
<fn id="n4"><label>4.</label><p>For the purposes of this paper, I think we can rest content with an informal understanding of what it means for propositions to &#8220;not be too dependent on each other&#8221;. For example, the propositions in a book, the propositions I write on a long test, and the propositions I&#8217;ve come to believe in the last week are all clearly probabilistically dependent on each other, but they are still not so dependent on each other that the probability of their conjunctions is not much lower than the probability of their most probable conjunct. Essentially, the qualifier that a set of propositions be &#8220;not too dependent&#8221; on each other rules out cases where having a high credence in just a few of the propositions in a <italic>large</italic> set would lead to having a high credence in the conjunction of all the propositions in that set.</p></fn>
<fn id="n5"><label>5.</label><p>I find <bold>Closure</bold> to be a feature of the view I will argue for, but I am aware that not all will want <bold>Closure</bold> to be true (see <xref ref-type="bibr" rid="B31">Nozick 1981</xref>; <xref ref-type="bibr" rid="B11">Dretske 1970</xref>). To those who wish to deny <bold>Closure</bold>, I recommend that they should treat this paper as more of an exploration of how a person who wishes to accept <bold>Closure</bold> may deal with the puzzle at hand. I hope such an exploration would be interesting in its own right.</p></fn>
<fn id="n6"><label>6.</label><p>Strictly speaking, the contextualists will be defending a <bold>Closure Schema</bold>, where there is one instance of the schema for each relation <inline-formula><mml:math id="Eq543-mml"><mml:mtext mathvariant="italic">know</mml:mtext><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> for every <inline-formula><mml:math id="Eq544-mml"><mml:mi>i</mml:mi></mml:math></inline-formula>. In the following, we will just use the term <bold>Closure</bold> to refer to whichever instance of the schema is relevant.</p></fn>
<fn id="n7"><label>7.</label><p>In the following, I will sometimes say that an agent knows something in some context but not in another. I hope to make it clear that when I use this locution, I am playing fast and loose with the use and mention distinction for convenience sake. Officially, when I say that an agent <inline-formula><mml:math id="Eq545-mml"><mml:mi>A</mml:mi></mml:math></inline-formula> knows <inline-formula><mml:math id="Eq546-mml"><mml:mi>p</mml:mi></mml:math></inline-formula> in context <inline-formula><mml:math id="Eq547-mml"><mml:mi>c</mml:mi></mml:math></inline-formula>, I mean that the <italic>sentence</italic> &#8220;<inline-formula><mml:math id="Eq548-mml"><mml:mi>A</mml:mi></mml:math></inline-formula> knows <inline-formula><mml:math id="Eq549-mml"><mml:mi>p</mml:mi></mml:math></inline-formula>&#8221; is <italic>true</italic> relative to context <inline-formula><mml:math id="Eq550-mml"><mml:mi>c</mml:mi></mml:math></inline-formula>.</p></fn>
<fn id="n8"><label>8.</label><p>Here we discuss a contextualist view where rational credence above a threshold is <italic>sufficient</italic> for knowing a true proposition (where the threshold is context sensitive). A stronger version of this view would be one where confidence above a threshold would be both sufficient <italic>and</italic> necessary. However, on this particular view, we have the result that Xin also <italic>cannot</italic> <inline-formula><mml:math id="Eq551-mml"><mml:mtext mathvariant="italic">kno</mml:mtext><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mtext mathvariant="italic">low</mml:mtext></mml:mrow></mml:msub></mml:math></inline-formula> <inline-formula><mml:math id="Eq552-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> since Xin is not even <inline-formula><mml:math id="Eq553-mml"><mml:mn>0.9</mml:mn></mml:math></inline-formula> certain in <inline-formula><mml:math id="Eq554-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>. So we would also have an inconsistency here.</p></fn>
<fn id="n9"><label>9.</label><p>Here I am implicitly relying on a principle called <bold>Knowledge Exclusion</bold> whereby, roughly, one cannot be in a position to know <inline-formula><mml:math id="Eq555-mml"><mml:mi>p</mml:mi></mml:math></inline-formula> if one believes <inline-formula><mml:math id="Eq556-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>. In Section 3.2.2 I defend this principle against some objections.</p></fn>
<fn id="n10"><label>10.</label><p>Strictly speaking, Lewis speaks in terms of &#8220;eliminating&#8221; a possibility, where a possibility is eliminated when one&#8217;s having of an experience is incompatible with that possibility obtaining (<xref ref-type="bibr" rid="B26">1996: 553</xref>). Given our Fallibilist commitments, talk about having an experience that is incompatible with a possibility is too strong. Instead, we will talk in more general terms of &#8220;ruling out&#8221; a possibility, where a possibility may be ruled out if one has sufficiently good evidence that it does not obtain.</p></fn>
<fn id="n11"><label>11.</label><p>Indeed, Lewis himself recognizes that &#8220;salient resemblance&#8221; is context sensitive, and so he admits that there are even contexts in which we can know that a person will lose the lottery because the worlds where that person wins the lottery <italic>does not saliently resemble</italic> actuality in that context. Lewis gives the example of poor Bill to demonstrate such a context: &#8220;Pity poor Bill! He squanders all his spare cash on the pokies, the races, and the lottery. He will be a wage slave all his days. We know he will never be rich&#8221; (<xref ref-type="bibr" rid="B26">1996: 565</xref>).</p></fn>
<fn id="n12"><label>12.</label><p>Here I do not want to suggest that Lewis&#8217;s contextualism has <italic>no</italic> resources for showing how we cannot rule out the possibilities we are not properly ignoring. Indeed, Lewis&#8217;s talk of &#8220;eliminating possibilities&#8221; may be strong enough to show that if we are not properly ignoring the possibility that Xin&#8217;s friend emailed a random text generator, we simply cannot know that she didn&#8217;t (even as Xin is repeatedly running the <italic>Hamlet</italic> program). This is because Xin&#8217;s experience of observing the program produce all of <italic>Hamlet</italic> is <italic>still consistent</italic> with the possibility where her friend sent her a random text generator that produced all of <italic>Hamlet</italic> every time. On this view, perhaps the <bold>New Rule of Belief</bold> does entail that one can know relatively few things per context. However, I find that talk of terms of &#8220;elimination&#8221; may be too strong. There are many possibilities that I take to be left uneliminated by my evidence; nonetheless, I still know those possibilities to not obtain. The same goes for you. For example, if I tell you here that this entire paper was actually written by a random word generator, you will have to admit that your experience of reading this paper does not eliminate that possibility. However, as I mention the possibility, I take it that you can correctly ascertain that I am joking, and that I have not in fact used a random word generator. A die-hard Lewisian might say that, in fact, after I raised this possibility, you no longer know that this paper was written by human hands. Such a conclusion would be quite extreme. I think that if we can achieve the results we need without having to resort to such extremes, then that would be a plus. In the next section, I attempt to do just that.</p></fn>
<fn id="n13"><label>13.</label><p>A Boolean <inline-formula><mml:math id="Eq557-mml"><mml:mo>&#x03A3;</mml:mo></mml:math></inline-formula>-Algebra over <inline-formula><mml:math id="Eq558-mml"><mml:mi>W</mml:mi></mml:math></inline-formula> is just a set of subsets of <inline-formula><mml:math id="Eq559-mml"><mml:mi>W</mml:mi></mml:math></inline-formula> that (i) contains <inline-formula><mml:math id="Eq560-mml"><mml:mi>W</mml:mi></mml:math></inline-formula> itself, (ii) is closed under complement (i.e., if <inline-formula><mml:math id="Eq561-mml"><mml:mi>A</mml:mi></mml:math></inline-formula> is in <inline-formula><mml:math id="Eq562-mml"><mml:mo>&#x212C;</mml:mo></mml:math></inline-formula>, then <inline-formula><mml:math id="Eq563-mml"><mml:mi>A</mml:mi></mml:math></inline-formula> is in <inline-formula><mml:math id="Eq564-mml"><mml:mo>&#x212C;</mml:mo></mml:math></inline-formula>), and (iii) is closed under countable union (i.e., if <inline-formula><mml:math id="Eq565-mml"><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="Eq566-mml"><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, &#8230;<inline-formula><mml:math id="Eq567-mml"><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, &#8230; are all in <inline-formula><mml:math id="Eq568-mml"><mml:mo>&#x212C;</mml:mo></mml:math></inline-formula>, then &#8899;<italic><sub>i</sub> A<sub>i</sub></italic> is in <inline-formula><mml:math id="Eq569-mml"><mml:mo>&#x212C;</mml:mo></mml:math></inline-formula>). For simplicity, we can simply let <inline-formula><mml:math id="Eq570-mml"><mml:mo>&#x212C;</mml:mo></mml:math></inline-formula> be <inline-formula><mml:math id="Eq571-mml"><mml:mrow><mml:mi>P</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>W</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula>. Nothing much turns on that simplification.</p></fn>
<fn id="n14"><label>14.</label><p>Alternatively, we can define &gt;&gt; with primitive conditional probabilities like so: <inline-formula><mml:math id="Eq572-mml"><mml:mrow><mml:mi>w</mml:mi><mml:mo>&#x003E;</mml:mo><mml:mo>&#x003E;</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> iff <inline-formula><mml:math id="Eq573-mml"><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#x007C;</mml:mo><mml:mi>w</mml:mi><mml:mo>&#x007C;</mml:mo><mml:mo>&#x007C;</mml:mo><mml:mo>&#x007C;</mml:mo><mml:mi>w</mml:mi><mml:mo>&#x007C;</mml:mo><mml:mo>&#x222A;</mml:mo><mml:mo>&#x007C;</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#x007C;</mml:mo><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:math></inline-formula>.</p></fn>
<fn id="n15"><label>15.</label><p>The plausibility relation given here is the same one that Lin and Kelly (<xref ref-type="bibr" rid="B27">2012</xref>) give. In that paper, they define the plausibility relation like so in order to define an <italic>acceptance</italic> condition for propositions. Their acceptance condition will be similar to clause 1 of my recursive definition for my doxastic accessibility relation in the next section. Goodman and Salow (<xref ref-type="bibr" rid="B15">2021</xref>) have also independently developed a very similar model of knowledge and belief to our own. See also Goodman and Salow (<xref ref-type="bibr" rid="B16">in press</xref>) for further discussion and developments of this view. Holgu&#237;n (<xref ref-type="bibr" rid="B21">in press</xref>) has also independently developed a comparable view for rational belief to account for the preface and lottery paradoxes for belief.</p></fn>
<fn id="n16"><label>16.</label><p>Strictly speaking, this is a definition of <inline-formula><mml:math id="Eq574-mml"><mml:mrow><mml:msubsup><mml:mi>R</mml:mi><mml:mi>P</mml:mi><mml:mi>B</mml:mi></mml:msubsup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:math></inline-formula> where the belief relation <inline-formula><mml:math id="Eq575-mml"><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> is relativized to the partition <inline-formula><mml:math id="Eq576-mml"><mml:mi>P</mml:mi></mml:math></inline-formula>. For ease of readability, I have omitted the subscript <inline-formula><mml:math id="Eq577-mml"><mml:mi>P</mml:mi></mml:math></inline-formula> when it is clear which partition we are talking about.</p></fn>
<fn id="n17"><label>17.</label><p>This example comes from Jonathan Wright (<xref ref-type="bibr" rid="B38">2018</xref>) Our redefined doxastic accessibility relation will follow a solution that is close to his. I should note, however, that the view that we <italic>can</italic> rationally believe extremely improbable propositions has been recently defended by Dorst and Mandelkern (<xref ref-type="bibr" rid="B10">in press</xref>), Dorst (<xref ref-type="bibr" rid="B9">2019</xref>), and Holgu&#237;n (<xref ref-type="bibr" rid="B21">in press</xref>). These philosophers will not see any need to revise Definition 2.</p></fn>
<fn id="n18"><label>18.</label><p>For ease of exposition, we can just let the threshold <inline-formula><mml:math id="Eq578-mml"><mml:mi>t</mml:mi></mml:math></inline-formula> be between <inline-formula><mml:math id="Eq579-mml"><mml:mrow><mml:mn>0.5</mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="Eq580-mml"><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>; but in fact, we would like some more constraints on what <inline-formula><mml:math id="Eq581-mml"><mml:mi>t</mml:mi></mml:math></inline-formula> should be. For example, at the very least, <inline-formula><mml:math id="Eq582-mml"><mml:mi>t</mml:mi></mml:math></inline-formula> should be the threshold required for believing <inline-formula><mml:math id="Eq583-mml"><mml:mi>p</mml:mi></mml:math></inline-formula> under the question &#8220;is <inline-formula><mml:math id="Eq584-mml"><mml:mi>p</mml:mi></mml:math></inline-formula> true?&#8221;. Since we stipulated that one can believe <inline-formula><mml:math id="Eq585-mml"><mml:mi>p</mml:mi></mml:math></inline-formula> under the question &#8220;is <inline-formula><mml:math id="Eq586-mml"><mml:mi>p</mml:mi></mml:math></inline-formula> true?&#8221; when <inline-formula><mml:math id="Eq587-mml"><mml:mrow><mml:mstyle scriptlevel='+1'><mml:mfrac><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>&#x003E;</mml:mo><mml:mn>10</mml:mn></mml:mrow></mml:math></inline-formula>, this makes is the case that <inline-formula><mml:math id="Eq588-mml"><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x003E;</mml:mo><mml:mstyle scriptlevel='+1'><mml:mfrac><mml:mrow><mml:mn>10</mml:mn></mml:mrow><mml:mrow><mml:mn>11</mml:mn></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>&#x2248;</mml:mo><mml:mn>0.91</mml:mn></mml:mrow></mml:math></inline-formula>. This requirement is most obviously needed when we think about knowledge. Without it, we can get absurd results where one fails to know whether it is raining (because Pr(rain) = 0.51), but one can know whether it is raining, snowing, sunny, hailing, etc&#8230;(because the probability of any particular weather condition other than rain is far less than <inline-formula><mml:math id="Eq589-mml"><mml:mrow><mml:mn>0.51</mml:mn></mml:mrow></mml:math></inline-formula>).</p></fn>
<fn id="n19"><label>19.</label><p>In the case where the strongest probable answer is just a partial answer, what matters is that each cell in the partial answer is much more probable than all the other alternatives not in the partial answer.</p></fn>
<fn id="n20"><label>20.</label><p>This definition for the epistemic accessibility relation is similar to the one presented in a footnote in Goodman and Salow&#8217;s paper, &#8220;Taking A Chance On KK&#8221; (<xref ref-type="bibr" rid="B14">2018</xref>).</p></fn>
<fn id="n21"><label>21.</label><p>In the case where the strongest true probable answer is just a partial answer, what matters is that each cell in the partial answer is much more probable than all the other alternatives not in the partial answer.</p></fn>
<fn id="n22"><label>22.</label><p>One prominent exception may be Leitgeb (<xref ref-type="bibr" rid="B25">2014</xref>) who argues that, in most contexts, one only believes that <italic>most</italic> of <inline-formula><mml:math id="Eq590-mml"><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through <inline-formula><mml:math id="Eq591-mml"><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is true, and in other contexts, one only believes that one of them is true. This solution is similar to mine, except Leitgeb is aiming to explain what an author believes or asserts when writing a whole book, not what an author <italic>rationally</italic> believes or asserts. Indeed, Leitgeb thinks that, in some contexts, one can indeed double down and assert that <italic>everything</italic> one has written in the book is true. Whether this is irrational, or unjustified, is not discussed in his short piece.</p></fn>
<fn id="n23"><label>23.</label><p>This move is akin to a pragmatic approach to quantifier domain restriction. On that view, sentences like &#8220;every bottle is in the room&#8221; always quantifies over every bottle in the universe, and will almost always come out false in every context. Nonetheless, even in asserting this falsehood, a truth is communicated via implicature&#8212;i.e., that every bottle in the house (for example) is in the room.</p></fn>
<fn id="n24"><label>24.</label><p>For example, context sensitive expressions like &#8220;exactly one&#8221; and paradigmatically context-sensitive adjectives like &#8220;tall&#8221; all exhibit this kind of interaction with quantifiers. Consider an example adapted from Stanley and Szab&#243; (<xref ref-type="bibr" rid="B34">2000</xref>): &#8220;In most of John&#8217;s classes, he fails exactly one Frenchman&#8221;. The natural way of interpreting the domain of the quantifier &#8220;exactly one Frenchman&#8221; is to interpret it as varying with the values of the quantifier &#8220;most of John&#8217;s classes&#8221;. So we can understand the statement as saying, &#8220;In most of John&#8217;s classes, x, there is exactly one y in D<inline-formula><mml:math id="Eq592-mml"><mml:mrow><mml:msub><mml:mrow></mml:mrow><mml:mi>x</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, such that John fails y&#8221;, where D<inline-formula><mml:math id="Eq593-mml"><mml:mrow><mml:msub><mml:mrow></mml:mrow><mml:mi>x</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the quantifier domain that varies with the class x. Similar things can be said of the sentence, &#8220;In some places, our six-foot friend is tall, and in other places he is not&#8221;. This sentence expresses the proposition <italic>there is a place x and a place y such that our six-foot friend is tall</italic><inline-formula><mml:math id="Eq594-mml"><mml:mrow><mml:msub><mml:mrow></mml:mrow><mml:mi>x</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> <italic>but not tall</italic><inline-formula><mml:math id="Eq595-mml"><mml:mrow><mml:msub><mml:mrow></mml:mrow><mml:mi>y</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, where <italic>tall</italic><inline-formula><mml:math id="Eq596-mml"><mml:mrow><mml:msub><mml:mrow></mml:mrow><mml:mi>x</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the property of being tall compared to people living in <inline-formula><mml:math id="Eq597-mml"><mml:mi>x</mml:mi></mml:math></inline-formula> and <italic>tall</italic><inline-formula><mml:math id="Eq598-mml"><mml:mrow><mml:msub><mml:mrow></mml:mrow><mml:mi>y</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the property of being tall compared to people living in <inline-formula><mml:math id="Eq599-mml"><mml:mi>y</mml:mi></mml:math></inline-formula>.</p></fn>
<fn id="n25"><label>25.</label><p>Theoretically, there can be a third kind of Anti-Socratic who accepts <bold>No Loss, No Gain</bold> and <bold>Closure</bold>, but denies <bold>Xin is Fallible</bold>. However, I take it that <bold>Xin is Fallible</bold> is unassailable&#8212;there is no reason to think that we cannot assume that there is a proposition that Xin falsely believes, and hence, does not know. Thus, we will be ignoring this kind of Anti-Socratic.</p></fn>
<fn id="n26"><label>26.</label><p>Some views seem to imply the possibility of Strange Defeat. For example, Nagel (<xref ref-type="bibr" rid="B30">2011</xref>) has argued that one can destroy someone&#8217;s knowledge of who the Pope is by citing to them the fact that people of Pope Francis&#8217;s demographic have a <inline-formula><mml:math id="Eq600-mml"><mml:mn>0.9999918384</mml:mn></mml:math></inline-formula> chance of dying from a heart attack. She then argues that the reason that learning such a fact might destroy one&#8217;s knowledge <italic>need not</italic> be because it reduces one&#8217;s confidence in the proposition that the current Pope is Francis (presumably, this new evidence can even raise one&#8217;s confidence); rather, learning this fact can destroy one&#8217;s knowledge because one has now shifted from the unreflective System 1 thinking to the more reflective System 2 thinking such that under this mode of thinking, one can no longer access one&#8217;s prior knowledge in occurrent judgment. However, Nagel is also careful to note that it is compatible with her view to say that one knows who the Pope is all along, although learning new information may simply put us in a mode of thinking that make it difficult for us to register ourselves as knowing who the Pope is.</p></fn>
<fn id="n27"><label>27.</label><p>The term &#8220;Knowledge-Exclusion&#8221; comes from Donahue (<xref ref-type="bibr" rid="B8">2019</xref>). The principle we call &#8220;Knowledge-Exclusion&#8221; here is actually a close variant of what Donahue calls &#8220;Rational Knowledge-Exclusion&#8221;.</p></fn>
<fn id="n28"><label>28.</label><p>In the original Preface Paradox, Makinson (<xref ref-type="bibr" rid="B28">1965</xref>) gives inductive reasons for why someone like Xin shouldn&#8217;t be believe <inline-formula><mml:math id="Eq601-mml"><mml:mrow><mml:mo>&#x22C0;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:math></inline-formula>. The reason is that, since there has always been at least one error in every book she wrote, she should believe that this book of hers has at least one error too.</p></fn>
<fn id="n29"><label>29.</label><p>It is also worth noting that the contextualist model presented in Section 2 vindicates both (S2) and (W2). Our model implies (S2) since we have as a necessary condition for both knowledge and belief in <inline-formula><mml:math id="Eq602-mml"><mml:mi>p</mml:mi></mml:math></inline-formula> that <inline-formula><mml:math id="Eq603-mml"><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x003E;</mml:mo><mml:mi>t</mml:mi><mml:mo>&#x003E;</mml:mo><mml:mn>0.5</mml:mn></mml:mrow></mml:math></inline-formula>. Thus, if one is justified in believing <inline-formula><mml:math id="Eq604-mml"><mml:mrow><mml:mo>&#x00AC;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>, then <inline-formula><mml:math id="Eq605-mml"><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x003E;</mml:mo><mml:mn>0.5</mml:mn></mml:mrow></mml:math></inline-formula>, and thus <inline-formula><mml:math id="Eq606-mml"><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mn>0.5</mml:mn></mml:mrow></mml:math></inline-formula>, and so one cannot be in a position to know <inline-formula><mml:math id="Eq607-mml"><mml:mi>p</mml:mi></mml:math></inline-formula>. Our model also implies (W2). This can easily be seen when we recall that our definition for the epistemic accessibility relation <inline-formula><mml:math id="Eq608-mml"><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mi>K</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> can be expressed in terms of our doxastic accessibility relation <inline-formula><mml:math id="Eq609-mml"><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> like so:</p>
<p><disp-quote><p><bold>Definition 5</bold>. <inline-formula><mml:math id="Eq610-mml"><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mi>K</mml:mi></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:msup><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x222A;</mml:mo><mml:mo>&#x007B;</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>:</mml:mo><mml:mo>&#x00AC;</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mi>w</mml:mi><mml:mo>&#x003E;</mml:mo><mml:mo>&#x003E;</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x007D;</mml:mo></mml:mrow></mml:math></inline-formula></p></disp-quote></p>
<p>Thus, it can be clearly seen that any doxastically accessible world is also epistemically accessible, and so knowledge implies justified belief. So our contextualist model has the added benefit of implying these two plausible principles. Needless to say, the model implies both <bold>Modesty</bold> principles as well, as was discussed in the last section.</p></fn>
<fn id="n30"><label>30.</label><p>Nado (<xref ref-type="bibr" rid="B29">2019</xref>) gives a particularly vivid example of this in the history of medicine&#8212;in 1947, aspirin was already widely prescribed by doctors because of its known effects on alleviating pain and fevers. Nonetheless, doctors knew this even before 1948 when the first results of a randomized control trial of a medication was published (<xref ref-type="bibr" rid="B2">Bhatt 2010</xref>).</p></fn>
</fn-group>
<ack>
<title>Acknowledgements</title>
<p>Many thanks to Andrew Bacon, Jeremy Goodman, John Hawthorne, Jeff Russell, and two anonymous referees for their valuable feedback. Thanks also to the audience of the 12th annual Arch&#233; Graduate Conference, and special thanks to my commentator, Paolo Savino. Special thanks also goes to Andrew Bacon and Jeff Russell for their extensive feedback on multiple drafts.</p>
</ack>
<ref-list>
<ref id="B1"><label>1</label><mixed-citation publication-type="book"><string-name><surname>Benton</surname>, <given-names>Matthew A.</given-names></string-name> (<year>2017</year>). <chapter-title>Lotteries and Prefaces</chapter-title>. In <string-name><given-names>Jonathan Jenkins</given-names> <surname>Ichikawa</surname></string-name> (Ed.), <source>The Routledge Handbook of Epistemic Contextualism</source> (<fpage>168</fpage>&#8211;<lpage>76</lpage>). <publisher-name>Routledge</publisher-name>.</mixed-citation></ref>
<ref id="B2"><label>2</label><mixed-citation publication-type="journal"><string-name><surname>Bhatt</surname>, <given-names>Arun</given-names></string-name> (<year>2010</year>). <article-title>Evolution of Clinical Research</article-title>. <source>Perspectives in Clinical Research</source>, <volume>1</volume>(<issue>1</issue>), <fpage>6</fpage>&#8211;<lpage>10</lpage>.</mixed-citation></ref>
<ref id="B3"><label>3</label><mixed-citation publication-type="book"><string-name><surname>BonJour</surname>, <given-names>Laurence</given-names></string-name> (<year>1985</year>). <source>The Structure of Empirical Knowledge</source>. <publisher-name>Harvard University Press</publisher-name>.</mixed-citation></ref>
<ref id="B4"><label>4</label><mixed-citation publication-type="book"><string-name><surname>Christensen</surname>, <given-names>David</given-names></string-name> (<year>2004</year>). <source>Putting Logic in Its Place: Formal Constraints on Rational Belief</source>. <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="B5"><label>5</label><mixed-citation publication-type="journal"><string-name><surname>Cohen</surname>, <given-names>Stewart</given-names></string-name> (<year>1988</year>). <article-title>How to Be a Fallibilist</article-title>. <source>Philosophical Perspectives</source>, <volume>2</volume>, <fpage>91</fpage>&#8211;<lpage>123</lpage>. <pub-id pub-id-type="doi">10.2307/2214070</pub-id></mixed-citation></ref>
<ref id="B6"><label>6</label><mixed-citation publication-type="journal"><string-name><surname>Comesa&#241;a</surname>, <given-names>Juan</given-names></string-name> and <string-name><given-names>Holly</given-names> <surname>Kantin</surname></string-name> (<year>2010</year>). <article-title>Is Evidence Knowledge?</article-title> <source>Philosophy and Phenomenological Research</source>, <volume>80</volume>(<issue>2</issue>), <fpage>447</fpage>&#8211;<lpage>54</lpage>. <pub-id pub-id-type="doi">10.1111/j.1933-1592.2010.00323.x </pub-id></mixed-citation></ref>
<ref id="B7"><label>7</label><mixed-citation publication-type="book"><string-name><surname>DeRose</surname>, <given-names>Keith</given-names></string-name> (<year>2009</year>). <source>The Case for Contextualism: Knowledge, Skepticism, and Context (Vol. 1)</source>. <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="B8"><label>8</label><mixed-citation publication-type="journal"><string-name><surname>Donahue</surname>, <given-names>Sean</given-names></string-name> (<year>2019</year>). <article-title>Knowledge Exclusion and the Rationality of Belief</article-title>. <source>Analysis</source>, <volume>79</volume>(<issue>3</issue>), <fpage>402</fpage>&#8211;<lpage>10</lpage>.</mixed-citation></ref>
<ref id="B9"><label>9</label><mixed-citation publication-type="journal"><string-name><surname>Dorst</surname>, <given-names>Kevin</given-names></string-name> (<year>2019</year>). <article-title>Lockeans Maximize Expected Accuracy</article-title>. <source>Mind</source>, <volume>128</volume>(<issue>509</issue>), <fpage>175</fpage>&#8211;<lpage>211</lpage>. <pub-id pub-id-type="doi">10.1093/mind/fzx028</pub-id></mixed-citation></ref>
<ref id="B10"><label>10</label><mixed-citation publication-type="journal"><string-name><surname>Dorst</surname>, <given-names>Kevin</given-names></string-name> and <string-name><given-names>Matthew</given-names> <surname>Mandelkern</surname></string-name> (in press). <article-title>Good Guesses</article-title>. <source>Philosophy and Phenomenological Research</source>. <pub-id pub-id-type="doi">10.1111/phpr.12831</pub-id></mixed-citation></ref>
<ref id="B11"><label>11</label><mixed-citation publication-type="journal"><string-name><surname>Dretske</surname>, <given-names>Fred I.</given-names></string-name> (<year>1970</year>). <article-title>Epistemic Operators</article-title>. <source>Journal of Philosophy</source>, <volume>67</volume>(<issue>24</issue>), <fpage>1007</fpage>&#8211;<lpage>23</lpage>. <pub-id pub-id-type="doi">10.2307/2024710</pub-id></mixed-citation></ref>
<ref id="B12"><label>12</label><mixed-citation publication-type="journal"><string-name><surname>Easwaran</surname>, <given-names>Kenny</given-names></string-name> (<year>2016</year>). <article-title>Dr. Truthlove Or: How I Learned to Stop Worrying and Love Bayesian Probabilities</article-title>. <source>No&#251;s</source>, <volume>50</volume>(<issue>4</issue>), <fpage>816</fpage>&#8211;<lpage>53</lpage>. <pub-id pub-id-type="doi">10.1111/nous.12099</pub-id></mixed-citation></ref>
<ref id="B13"><label>13</label><mixed-citation publication-type="journal"><string-name><surname>Evnine</surname>, <given-names>Simon J.</given-names></string-name> (<year>1999</year>). <article-title>Believing Conjunctions</article-title>. <source>Synthese</source>, <volume>118</volume>(<issue>2</issue>), <fpage>201</fpage>&#8211;<lpage>27</lpage>. <pub-id pub-id-type="doi">10.1023/A:1005114419965</pub-id></mixed-citation></ref>
<ref id="B14"><label>14</label><mixed-citation publication-type="journal"><string-name><surname>Goodman</surname>, <given-names>Jeremy</given-names></string-name> and <string-name><given-names>Bernhard</given-names> <surname>Salow</surname></string-name> (<year>2018</year>). <article-title>Taking a Chance on KK</article-title>. <source>Philosophical Studies</source>, <volume>175</volume>(<issue>1</issue>), <fpage>183</fpage>&#8211;<lpage>96</lpage>. <pub-id pub-id-type="doi">10.1007/s11098-017-0861-1</pub-id></mixed-citation></ref>
<ref id="B15"><label>15</label><mixed-citation publication-type="book"><string-name><surname>Goodman</surname>, <given-names>Jeremy</given-names></string-name> and <string-name><given-names>Bernhard</given-names> <surname>Salow</surname></string-name> (<year>2021</year>). <chapter-title>Knowledge from Probability</chapter-title>. In <string-name><given-names>Joseph Y.</given-names> <surname>Halpern</surname></string-name> and <string-name><given-names>Andres</given-names> <surname>Perea</surname></string-name> (Eds.), <source>Theoretical Aspects of Rationality and Knowledge TARK (2021)</source> (<fpage>171</fpage>&#8211;<lpage>86</lpage>). <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="B16"><label>16</label><mixed-citation publication-type="journal"><string-name><surname>Goodman</surname>, <given-names>Jeremy</given-names></string-name> and <string-name><given-names>Bernhard</given-names> <surname>Salow</surname></string-name> (in press). <article-title>Epistemology Normalized</article-title>. <source>Philosophical Review</source>.</mixed-citation></ref>
<ref id="B17"><label>17</label><mixed-citation publication-type="journal"><string-name><surname>Groenendijk</surname>, <given-names>Joroen</given-names></string-name> and <string-name><given-names>Martin</given-names> <surname>Stokhof</surname></string-name> (<year>1984</year>). <article-title>Questions</article-title>. <source>Handbook of Logic and Language</source>, <volume>10</volume>(<issue>2</issue>), <fpage>1059</fpage>&#8211;<lpage>131</lpage>.</mixed-citation></ref>
<ref id="B18"><label>18</label><mixed-citation publication-type="journal"><string-name><surname>Hawthorne</surname>, <given-names>John</given-names></string-name> (<year>2002</year>). <article-title>Lewis, the Lottery and the Preface</article-title>. <source>Analysis</source>, <volume>62</volume>(<issue>3</issue>), <fpage>242</fpage>&#8211;<lpage>51</lpage>. <pub-id pub-id-type="doi">10.1111/1467-8284.00363</pub-id></mixed-citation></ref>
<ref id="B19"><label>19</label><mixed-citation publication-type="book"><string-name><surname>Hawthorne</surname>, <given-names>John</given-names></string-name> (<year>2003</year>). <source>Knowledge and Lotteries</source>. <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="B20"><label>20</label><mixed-citation publication-type="journal"><string-name><surname>Hawthorne</surname>, <given-names>John</given-names></string-name> (<year>2005</year>). <article-title>Knowledge and Evidence</article-title>. <source>Philosophy and Phenomenological Research</source>, <volume>70</volume>(<issue>2</issue>), <fpage>452</fpage>&#8211;<lpage>58</lpage>. <pub-id pub-id-type="doi">10.1111/j.1933-1592.2005.tb00540.x</pub-id></mixed-citation></ref>
<ref id="B21"><label>21</label><mixed-citation publication-type="journal"><string-name><surname>Holgu&#237;n</surname>, <given-names>Ben</given-names></string-name> (in press). <article-title>Thinking, Guessing, and Believing</article-title>. <source>Philosophers&#8217; Imprint</source>.</mixed-citation></ref>
<ref id="B22"><label>22</label><mixed-citation publication-type="journal"><string-name><surname>Horowitz</surname>, <given-names>Sophie</given-names></string-name> (<year>2014</year>). <article-title>Epistemic Akrasia</article-title>. <source>No&#251;s</source>, <volume>48</volume>(<issue>4</issue>), <fpage>718</fpage>&#8211;<lpage>44</lpage>. <pub-id pub-id-type="doi">10.1111/nous.12026</pub-id></mixed-citation></ref>
<ref id="B23"><label>23</label><mixed-citation publication-type="book"><string-name><surname>Kyburg</surname>, <given-names>Henry E.</given-names>, <suffix>Jr.</suffix></string-name> (<year>1961</year>). <source>Probability and the Logic of Rational Belief</source>. <publisher-name>Wesleyan University Press</publisher-name>.</mixed-citation></ref>
<ref id="B24"><label>24</label><mixed-citation publication-type="journal"><string-name><surname>Lasonen-Aarnio</surname>, <given-names>Maria</given-names></string-name> (<year>2014</year>). <article-title>Higher-Order Evidence and the Limits of Defeat</article-title>. <source>Philosophy and Phenomenological Research</source>, <volume>88</volume>(<issue>2</issue>), <fpage>314</fpage>&#8211;<lpage>45</lpage>. <pub-id pub-id-type="doi">10.1111/phpr.12090</pub-id></mixed-citation></ref>
<ref id="B25"><label>25</label><mixed-citation publication-type="journal"><string-name><surname>Leitgeb</surname>, <given-names>Hannes</given-names></string-name> (<year>2014</year>). <article-title>A Way Out of the Preface Paradox?</article-title> <source>Analysis</source>, <volume>74</volume>(<issue>1</issue>), <fpage>11</fpage>&#8211;<lpage>15</lpage>.</mixed-citation></ref>
<ref id="B26"><label>26</label><mixed-citation publication-type="journal"><string-name><surname>Lewis</surname>, <given-names>David</given-names></string-name> (<year>1996</year>). <article-title>Elusive Knowledge</article-title>. <source>Australasian Journal of Philosophy</source>, <volume>74</volume>(<issue>4</issue>), <fpage>549</fpage>&#8211;<lpage>67</lpage>.</mixed-citation></ref>
<ref id="B27"><label>27</label><mixed-citation publication-type="journal"><string-name><surname>Lin</surname>, <given-names>Hanti</given-names></string-name> and <string-name><given-names>Kevin</given-names> <surname>Kelly</surname></string-name> (<year>2012</year>). <article-title>Propositional Reasoning That Tracks Probabilistic Reasoning</article-title>. <source>Journal of Philosophical Logic</source>, <volume>41</volume>(<issue>6</issue>), <fpage>957</fpage>&#8211;<lpage>81</lpage>.</mixed-citation></ref>
<ref id="B28"><label>28</label><mixed-citation publication-type="journal"><string-name><surname>Makinson</surname>, <given-names>D. C.</given-names></string-name> (<year>1965</year>). <article-title>The Paradox of the Preface</article-title>. <source>Analysis</source>, <volume>25</volume>(<issue>6</issue>), <fpage>205</fpage>&#8211;<lpage>7</lpage>.</mixed-citation></ref>
<ref id="B29"><label>29</label><mixed-citation publication-type="book"><string-name><surname>Nado</surname>, <given-names>Jennifer</given-names></string-name> (<year>2019</year>). <chapter-title>Who Wants to Know?</chapter-title> In <string-name><given-names>Tamar Szabo</given-names> <surname>Gendler</surname></string-name> and <string-name><given-names>John</given-names> <surname>Hawthorne</surname></string-name> (Eds.), <source>Oxford Studies in Epistemology Volume 6</source> (<fpage>114</fpage>&#8211;<lpage>136</lpage>). <publisher-name>Oxford University Press</publisher-name>. <pub-id pub-id-type="doi">10.1093/oso/9780198833314.003.0005</pub-id></mixed-citation></ref>
<ref id="B30"><label>30</label><mixed-citation publication-type="journal"><string-name><surname>Nagel</surname>, <given-names>Jennifer</given-names></string-name> (<year>2011</year>). <article-title>The Psychological Basis of the Harman-Vogel Paradox</article-title>. <source>Philosophers&#8217; Imprint</source>, <volume>11</volume>(<issue>5</issue>), <fpage>1</fpage>&#8211;<lpage>28</lpage>.</mixed-citation></ref>
<ref id="B31"><label>31</label><mixed-citation publication-type="book"><string-name><surname>Nozick</surname>, <given-names>Robert</given-names></string-name> (<year>1981</year>). <source>Philosophical Explanations</source>. <publisher-name>Harvard University Press</publisher-name>.</mixed-citation></ref>
<ref id="B32"><label>32</label><mixed-citation publication-type="journal"><string-name><surname>Ryan</surname>, <given-names>Sharon</given-names></string-name> (<year>1996</year>). <article-title>The Epistemic Virtues of Consistency</article-title>. <source>Synthese</source>, <volume>109</volume>(<issue>2</issue>), <fpage>121</fpage>&#8211;<lpage>41</lpage>. <pub-id pub-id-type="doi">10.1007/bf00413765</pub-id></mixed-citation></ref>
<ref id="B33"><label>33</label><mixed-citation publication-type="journal"><string-name><surname>Stanley</surname>, <given-names>Jason</given-names></string-name> (<year>2000</year>). <article-title>Context and Logical Form</article-title>. <source>Linguistics and Philosophy</source>, <volume>23</volume>(<issue>4</issue>), <fpage>391</fpage>&#8211;<lpage>434</lpage>. <pub-id pub-id-type="doi">10.1023/A:1005599312747</pub-id></mixed-citation></ref>
<ref id="B34"><label>34</label><mixed-citation publication-type="journal"><string-name><surname>Stanley</surname>, <given-names>Jason</given-names></string-name> and <string-name><given-names>Zolt&#225;n Gendler</given-names> <surname>Szab&#243;</surname></string-name> (<year>2000</year>). <article-title>On Quantifier Domain Restriction</article-title>. <source>Mind and Language</source>, <volume>15</volume>(<issue>2&#8211;3</issue>), <fpage>219</fpage>&#8211;<lpage>61</lpage>. <pub-id pub-id-type="doi">10.1111/1468-0017.00130</pub-id></mixed-citation></ref>
<ref id="B35"><label>35</label><mixed-citation publication-type="journal"><string-name><surname>Unger</surname>, <given-names>Peter</given-names></string-name> (<year>1971</year>). <article-title>A Defense of Skepticism</article-title>. <source>Philosophical Review</source>, <volume>80</volume>(<issue>2</issue>), <fpage>198</fpage>&#8211;<lpage>219</lpage>. <pub-id pub-id-type="doi">10.2307/2184030</pub-id></mixed-citation></ref>
<ref id="B36"><label>36</label><mixed-citation publication-type="book"><string-name><surname>Williamson</surname>, <given-names>Timothy</given-names></string-name> (<year>2000</year>). <source>Knowledge and Its Limits</source>. <publisher-name>Oxford University Press</publisher-name>.</mixed-citation></ref>
<ref id="B37"><label>37</label><mixed-citation publication-type="journal"><string-name><surname>Williamson</surname>, <given-names>Timothy</given-names></string-name> (<year>2014</year>). <article-title>Very Improbable Knowing</article-title>. <source>Erkenntnis</source>, <volume>79</volume>(<issue>5</issue>), <fpage>971</fpage>&#8211;<lpage>99</lpage>.</mixed-citation></ref>
<ref id="B38"><label>38</label><mixed-citation publication-type="journal"><string-name><surname>Wright</surname>, <given-names>Jonathan</given-names></string-name> (<year>2018</year>). <article-title>Rigged Lotteries: A Diachronic Problem for Reducing Belief to Credence</article-title>. <source>Synthese</source>, <volume>195</volume>(<issue>3</issue>), <fpage>1355</fpage>&#8211;<lpage>73</lpage>. <pub-id pub-id-type="doi">10.1007/s11229-016-1275-x</pub-id></mixed-citation></ref>
<ref id="B39"><label>39</label><mixed-citation publication-type="book"><string-name><surname>Yablo</surname>, <given-names>Stephen</given-names></string-name> (<year>2014</year>). <source>Aboutness</source>. <publisher-name>Princeton University Press</publisher-name>.</mixed-citation></ref>
<ref id="B40"><label>40</label><mixed-citation publication-type="journal"><string-name><surname>Yalcin</surname>, <given-names>Seth</given-names></string-name> (<year>2018</year>). <article-title>Belief as Question-Sensitive</article-title>. <source>Philosophy and Phenomenological Research</source>, <volume>97</volume>(<issue>1</issue>), <fpage>23</fpage>&#8211;<lpage>47</lpage>. <pub-id pub-id-type="doi">10.1111/phpr.12330</pub-id></mixed-citation></ref>
</ref-list>
</back>
</article>