<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments on: Fitch&#8217;s Paradox and True Believability</title>
	<atom:link href="http://possiblyphilosophy.wordpress.com/2008/04/20/fitchs-paradox-and-true-believability/feed/" rel="self" type="application/rss+xml" />
	<link>http://possiblyphilosophy.wordpress.com/2008/04/20/fitchs-paradox-and-true-believability/</link>
	<description>Weblog devoted to the philosophy of language, metaphysics and philosophical logic</description>
	<lastBuildDate>Fri, 06 Nov 2009 16:17:33 +0000</lastBuildDate>
	<generator>http://wordpress.com/</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: The Paradox of Rational Believability &#171; Possibly Philosophy</title>
		<link>http://possiblyphilosophy.wordpress.com/2008/04/20/fitchs-paradox-and-true-believability/#comment-202</link>
		<dc:creator>The Paradox of Rational Believability &#171; Possibly Philosophy</dc:creator>
		<pubDate>Wed, 02 Jul 2008 20:09:55 +0000</pubDate>
		<guid isPermaLink="false">http://possiblyphilosophy.wordpress.com/?p=45#comment-202</guid>
		<description>[...]    &#171; Logic for&#160;Philosophy    The Paradox of Rational&#160;Believability July 2, 2008   A while back I considered a weakening of Fitch&#8217;s paradox for knowability, to true belief instead of [...]</description>
		<content:encoded><![CDATA[<p>[...]    &laquo; Logic for&nbsp;Philosophy    The Paradox of Rational&nbsp;Believability July 2, 2008   A while back I considered a weakening of Fitch&#8217;s paradox for knowability, to true belief instead of [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jesse Butler</title>
		<link>http://possiblyphilosophy.wordpress.com/2008/04/20/fitchs-paradox-and-true-believability/#comment-97</link>
		<dc:creator>Jesse Butler</dc:creator>
		<pubDate>Tue, 29 Apr 2008 15:00:14 +0000</pubDate>
		<guid isPermaLink="false">http://possiblyphilosophy.wordpress.com/?p=45#comment-97</guid>
		<description>Hello Andrew and Kenny (and others). Thanks for this post and discussion. I&#039;ve been thinking about Fitch&#039;s Paradox recently. I&#039;ve got a comment about the original formulation of the paradox at SEP (you linked to it in the post). By way of introduction, I believe there&#039;s a bit of conflation on the &#039;K&#039; operator that causes confusion. Let me try to spell out what I think is the problem. Brogaard and Salerno write that Kp iff it is known by someone at some time that p. I suggest that instead of working with K, we work instead with what I call &#039;K3&#039; whose semantics follow: K3(p, k, t) iff k knows that p at t. To relate this to the operator K in the entry, we can say that Kp iff (Ey)(Ez)K(p, y, z). Using K3 we can spell out principle (KP) and (NonO) like so:

(KP): (x)(x -&gt; (poss.)(Ey)(Ez)K(x, y, z)

(NonO): (Eq)(q &amp; ~(Eu)(Ev)K(q, u, v)

An instance of NonO is:

(p &amp; ~(Eu)(Ev)K(p, u, v)) 

[in other words &quot;p is true, but it&#039;s not the case that there is a knower u and time v, such that at v, u knows p&quot;]

From this and KP we have:

(p &amp; ~(Eu)(Ev)K(p, u, v)) &amp; (poss.)(Ey)(Ez)K((p &amp; ~(Eu)(Ev)K(p, u, v)), y, z)

informal quantifier exchange to simplify:

(p &amp; (u)(v)~K(p, u, v)) &amp; (poss.)(Ey)(Ez)K(p &amp; (u)(v)~K(p, u, v)), y, z)

Now if we&#039;re serious about possible world semantics for the &#039;poss.&#039; operator, would we say the following? (Curioser and curioser...)

In the actual world, p is true, but at no time does anybody in the actual world know p, but there is a possible world in which someone at some time knows that p is true in the actual world and knows that at no time, in the actual world, does anyone, in the actual world, know that p is true.

Here&#039;s a thought experiment to show that this last English translation of the supposedly inconsistent result from Fitch is not, in fact, inconsistent. This is a bit far fetched, but this is after all philosophy...

Suppose the actual world (W@) had had no knowers, but was otherwise exactly as it is, so specifically the W@ has a certain physical feature F. Now suppose, that in possible world WP, there exists a modal clairvoyant who comes to know about W@, in particular that it has feature F and that there are no knowers in it. If p is the proposition expressed by the sentence &#039;W@ has feature F&#039; then p is true and nobody in W@ knows it, as there are no knowers in W@, but the clairvoyant knows that world W@ has feature F and that nobody in W@ knows this, again as there are no knowers in W@.

Is this a case a sort of model for K3 version of the supposedly inconsistent sentence (3) from the SEP entry?</description>
		<content:encoded><![CDATA[<p>Hello Andrew and Kenny (and others). Thanks for this post and discussion. I&#8217;ve been thinking about Fitch&#8217;s Paradox recently. I&#8217;ve got a comment about the original formulation of the paradox at SEP (you linked to it in the post). By way of introduction, I believe there&#8217;s a bit of conflation on the &#8216;K&#8217; operator that causes confusion. Let me try to spell out what I think is the problem. Brogaard and Salerno write that Kp iff it is known by someone at some time that p. I suggest that instead of working with K, we work instead with what I call &#8216;K3&#8242; whose semantics follow: K3(p, k, t) iff k knows that p at t. To relate this to the operator K in the entry, we can say that Kp iff (Ey)(Ez)K(p, y, z). Using K3 we can spell out principle (KP) and (NonO) like so:</p>
<p>(KP): (x)(x -&gt; (poss.)(Ey)(Ez)K(x, y, z)</p>
<p>(NonO): (Eq)(q &amp; ~(Eu)(Ev)K(q, u, v)</p>
<p>An instance of NonO is:</p>
<p>(p &amp; ~(Eu)(Ev)K(p, u, v)) </p>
<p>[in other words "p is true, but it's not the case that there is a knower u and time v, such that at v, u knows p"]</p>
<p>From this and KP we have:</p>
<p>(p &amp; ~(Eu)(Ev)K(p, u, v)) &amp; (poss.)(Ey)(Ez)K((p &amp; ~(Eu)(Ev)K(p, u, v)), y, z)</p>
<p>informal quantifier exchange to simplify:</p>
<p>(p &amp; (u)(v)~K(p, u, v)) &amp; (poss.)(Ey)(Ez)K(p &amp; (u)(v)~K(p, u, v)), y, z)</p>
<p>Now if we&#8217;re serious about possible world semantics for the &#8216;poss.&#8217; operator, would we say the following? (Curioser and curioser&#8230;)</p>
<p>In the actual world, p is true, but at no time does anybody in the actual world know p, but there is a possible world in which someone at some time knows that p is true in the actual world and knows that at no time, in the actual world, does anyone, in the actual world, know that p is true.</p>
<p>Here&#8217;s a thought experiment to show that this last English translation of the supposedly inconsistent result from Fitch is not, in fact, inconsistent. This is a bit far fetched, but this is after all philosophy&#8230;</p>
<p>Suppose the actual world (W@) had had no knowers, but was otherwise exactly as it is, so specifically the W@ has a certain physical feature F. Now suppose, that in possible world WP, there exists a modal clairvoyant who comes to know about W@, in particular that it has feature F and that there are no knowers in it. If p is the proposition expressed by the sentence &#8216;W@ has feature F&#8217; then p is true and nobody in W@ knows it, as there are no knowers in W@, but the clairvoyant knows that world W@ has feature F and that nobody in W@ knows this, again as there are no knowers in W@.</p>
<p>Is this a case a sort of model for K3 version of the supposedly inconsistent sentence (3) from the SEP entry?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: The 68th Philosophers&#8217; Carnival &#171; MQPhil</title>
		<link>http://possiblyphilosophy.wordpress.com/2008/04/20/fitchs-paradox-and-true-believability/#comment-93</link>
		<dc:creator>The 68th Philosophers&#8217; Carnival &#171; MQPhil</dc:creator>
		<pubDate>Mon, 28 Apr 2008 06:46:58 +0000</pubDate>
		<guid isPermaLink="false">http://possiblyphilosophy.wordpress.com/?p=45#comment-93</guid>
		<description>[...] Bacon, a Philosophy student at Oxford University, presents &#8216;Fitch&#8217;s Paradox and True Believability&#8216;, postulating whether truth is truly knowable; (or conversely, if unknown truths are [...]</description>
		<content:encoded><![CDATA[<p>[...] Bacon, a Philosophy student at Oxford University, presents &#8216;Fitch&#8217;s Paradox and True Believability&#8216;, postulating whether truth is truly knowable; (or conversely, if unknown truths are [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Andrew</title>
		<link>http://possiblyphilosophy.wordpress.com/2008/04/20/fitchs-paradox-and-true-believability/#comment-89</link>
		<dc:creator>Andrew</dc:creator>
		<pubDate>Wed, 23 Apr 2008 22:05:30 +0000</pubDate>
		<guid isPermaLink="false">http://possiblyphilosophy.wordpress.com/?p=45#comment-89</guid>
		<description>Hmm, actually I&#039;m getting a bit worried. That last formula comes out true on a fixed domain kripke semantics which is why I wrote it out, but it doesn&#039;t make too much sense because I&#039;m mixing tense operators and quantifiers over times.

But if I do it with temporal operators throughout, not quantifiers I get: 
$latex N(p \wedge \neg \exists x FPKp) \leftrightarrow (Np \wedge \neg \exists x NFPKp)$.
Here FP is &#039;at some time or other.&#039; But I can&#039;t commute NFPKp to FPNKp I don&#039;t think, which is what we need if its to come out knowable. If I remember correctly, Edgington&#039;s paper glossed over this in her discussion of the temporal version of Fitch&#039;s paradox - she (incorrectly it seems) claimed that future knowers could know that Fitch sentences currently obtain.</description>
		<content:encoded><![CDATA[<p>Hmm, actually I&#8217;m getting a bit worried. That last formula comes out true on a fixed domain kripke semantics which is why I wrote it out, but it doesn&#8217;t make too much sense because I&#8217;m mixing tense operators and quantifiers over times.</p>
<p>But if I do it with temporal operators throughout, not quantifiers I get:<br />
<img src='http://l.wordpress.com/latex.php?latex=N%28p+%5Cwedge+%5Cneg+%5Cexists+x+FPKp%29+%5Cleftrightarrow+%28Np+%5Cwedge+%5Cneg+%5Cexists+x+NFPKp%29&#038;bg=ffffff&#038;fg=61636a&#038;s=0' alt='N(p \wedge \neg \exists x FPKp) \leftrightarrow (Np \wedge \neg \exists x NFPKp)' title='N(p \wedge \neg \exists x FPKp) \leftrightarrow (Np \wedge \neg \exists x NFPKp)' class='latex' />.<br />
Here FP is &#8216;at some time or other.&#8217; But I can&#8217;t commute NFPKp to FPNKp I don&#8217;t think, which is what we need if its to come out knowable. If I remember correctly, Edgington&#8217;s paper glossed over this in her discussion of the temporal version of Fitch&#8217;s paradox &#8211; she (incorrectly it seems) claimed that future knowers could know that Fitch sentences currently obtain.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Andrew</title>
		<link>http://possiblyphilosophy.wordpress.com/2008/04/20/fitchs-paradox-and-true-believability/#comment-88</link>
		<dc:creator>Andrew</dc:creator>
		<pubDate>Wed, 23 Apr 2008 21:34:12 +0000</pubDate>
		<guid isPermaLink="false">http://possiblyphilosophy.wordpress.com/?p=45#comment-88</guid>
		<description>Right, so it&#039;s knowable because it seems I&#039;m gaining future knowledge of now p but nobody now knows it. (I&#039;m inclined to think the present tense implicitly does something like this anyway, but that&#039;s a side issue.)

So I guess you&#039;re wondering where the &#039;now&#039; came from if you&#039;ve stipulated what p and K are. I want to say that it&#039;s a sufficient condition for a truth, p, to be knowable, that it is possible to know that Np (i.e. that p is now true.)

In this case it&#039;s not that the quantifiers in K are restricted to currently existing knowers as you suggest, but rather that they are unrestrictedly quantifying over all (future) knowers saying they don&#039;t currently know p. That is: $latex \neg \exists x \exists t NKp$. (Where did that come from? Well it&#039;s sufficient for p to be knowable that it&#039;s possible to know Np - so in this case $latex N(p \wedge \neg \exists xt Kp) \leftrightarrow Np \wedge \neg \exists x \exists t NKp$.)</description>
		<content:encoded><![CDATA[<p>Right, so it&#8217;s knowable because it seems I&#8217;m gaining future knowledge of now p but nobody now knows it. (I&#8217;m inclined to think the present tense implicitly does something like this anyway, but that&#8217;s a side issue.)</p>
<p>So I guess you&#8217;re wondering where the &#8216;now&#8217; came from if you&#8217;ve stipulated what p and K are. I want to say that it&#8217;s a sufficient condition for a truth, p, to be knowable, that it is possible to know that Np (i.e. that p is now true.)</p>
<p>In this case it&#8217;s not that the quantifiers in K are restricted to currently existing knowers as you suggest, but rather that they are unrestrictedly quantifying over all (future) knowers saying they don&#8217;t currently know p. That is: <img src='http://l.wordpress.com/latex.php?latex=%5Cneg+%5Cexists+x+%5Cexists+t+NKp&#038;bg=ffffff&#038;fg=61636a&#038;s=0' alt='\neg \exists x \exists t NKp' title='\neg \exists x \exists t NKp' class='latex' />. (Where did that come from? Well it&#8217;s sufficient for p to be knowable that it&#8217;s possible to know Np &#8211; so in this case <img src='http://l.wordpress.com/latex.php?latex=N%28p+%5Cwedge+%5Cneg+%5Cexists+xt+Kp%29+%5Cleftrightarrow+Np+%5Cwedge+%5Cneg+%5Cexists+x+%5Cexists+t+NKp&#038;bg=ffffff&#038;fg=61636a&#038;s=0' alt='N(p \wedge \neg \exists xt Kp) \leftrightarrow Np \wedge \neg \exists x \exists t NKp' title='N(p \wedge \neg \exists xt Kp) \leftrightarrow Np \wedge \neg \exists x \exists t NKp' class='latex' />.)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Kenny</title>
		<link>http://possiblyphilosophy.wordpress.com/2008/04/20/fitchs-paradox-and-true-believability/#comment-86</link>
		<dc:creator>Kenny</dc:creator>
		<pubDate>Wed, 23 Apr 2008 19:21:44 +0000</pubDate>
		<guid isPermaLink="false">http://possiblyphilosophy.wordpress.com/?p=45#comment-86</guid>
		<description>Thanks for fixing the code!

I&#039;m not quite sure that you&#039;re right about the Fitch sentences being knowable - after all, the verificationist just means it&#039;s possible for someone at some point to know any given sentence, and not that it&#039;s possible for someone now to know it.  Thus, Kp must mean &quot;someone, at some time knows p&quot; - and thus, if you ever count your books, then &quot;that there are an even (odd) number of books on your shelf&quot; is not an unknown truth, and so no one could know that it is.</description>
		<content:encoded><![CDATA[<p>Thanks for fixing the code!</p>
<p>I&#8217;m not quite sure that you&#8217;re right about the Fitch sentences being knowable &#8211; after all, the verificationist just means it&#8217;s possible for someone at some point to know any given sentence, and not that it&#8217;s possible for someone now to know it.  Thus, Kp must mean &#8220;someone, at some time knows p&#8221; &#8211; and thus, if you ever count your books, then &#8220;that there are an even (odd) number of books on your shelf&#8221; is not an unknown truth, and so no one could know that it is.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Andrew</title>
		<link>http://possiblyphilosophy.wordpress.com/2008/04/20/fitchs-paradox-and-true-believability/#comment-83</link>
		<dc:creator>Andrew</dc:creator>
		<pubDate>Tue, 22 Apr 2008 14:33:24 +0000</pubDate>
		<guid isPermaLink="false">http://possiblyphilosophy.wordpress.com/?p=45#comment-83</guid>
		<description>Hi Kenny - thanks for the comment! 

I think I agree with you that making epistemic facts metaphysically primitive is bad. But I&#039;m not sure you need to go that far - I just want to argue that the notion of verifiability is, as it where, a &#039;semantic atom&#039; much like knowledge is, in that an analysis which decomposes it into more primitive notions is not possible, or particularly illuminating.

For example, the analysis from which Fitch&#039;s paradox arose was possible knowledge. But as &lt;a href=&quot;http://knowability.blogspot.com/2006/10/most-general-factive-mental-state.html&quot; rel=&quot;nofollow&quot;&gt;Salerno&lt;/a&gt; has argued, the expressions used in English to express knowability are factive (&#039;could have known&#039; etc.) which possible knowledge isn&#039;t - contingent falsehoods are possibly known. 

Another reason I don&#039;t like the Fitch analysis is that according to it: &#039;that there are an even (odd) number of books on my shelf is an unknown truth&#039; is unknowable according to the possible knowledge analysis (just run Fitch&#039;s argument.) However, I could just come by tomorrow, count the books on my shelf, and since I know no-one else would be bothered to count them, I can infer &#039;there was an even (odd) number of books on my shelf and nobody knew this&#039;. On the pretheoretic notion of knowability, some Fitch sentences *are* knowable. 

(I fixed your formula BTW - I can&#039;t work out how to give posters edit rights over their own posts yet. Sorry.)</description>
		<content:encoded><![CDATA[<p>Hi Kenny &#8211; thanks for the comment! </p>
<p>I think I agree with you that making epistemic facts metaphysically primitive is bad. But I&#8217;m not sure you need to go that far &#8211; I just want to argue that the notion of verifiability is, as it where, a &#8217;semantic atom&#8217; much like knowledge is, in that an analysis which decomposes it into more primitive notions is not possible, or particularly illuminating.</p>
<p>For example, the analysis from which Fitch&#8217;s paradox arose was possible knowledge. But as <a href="http://knowability.blogspot.com/2006/10/most-general-factive-mental-state.html" rel="nofollow">Salerno</a> has argued, the expressions used in English to express knowability are factive (&#8216;could have known&#8217; etc.) which possible knowledge isn&#8217;t &#8211; contingent falsehoods are possibly known. </p>
<p>Another reason I don&#8217;t like the Fitch analysis is that according to it: &#8216;that there are an even (odd) number of books on my shelf is an unknown truth&#8217; is unknowable according to the possible knowledge analysis (just run Fitch&#8217;s argument.) However, I could just come by tomorrow, count the books on my shelf, and since I know no-one else would be bothered to count them, I can infer &#8216;there was an even (odd) number of books on my shelf and nobody knew this&#8217;. On the pretheoretic notion of knowability, some Fitch sentences *are* knowable. </p>
<p>(I fixed your formula BTW &#8211; I can&#8217;t work out how to give posters edit rights over their own posts yet. Sorry.)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Kenny</title>
		<link>http://possiblyphilosophy.wordpress.com/2008/04/20/fitchs-paradox-and-true-believability/#comment-82</link>
		<dc:creator>Kenny</dc:creator>
		<pubDate>Tue, 22 Apr 2008 01:14:32 +0000</pubDate>
		<guid isPermaLink="false">http://possiblyphilosophy.wordpress.com/?p=45#comment-82</guid>
		<description>Hmm, I just meant that to be the code for this formula that you used above: </description>
		<content:encoded><![CDATA[<p>Hmm, I just meant that to be the code for this formula that you used above:</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Kenny</title>
		<link>http://possiblyphilosophy.wordpress.com/2008/04/20/fitchs-paradox-and-true-believability/#comment-81</link>
		<dc:creator>Kenny</dc:creator>
		<pubDate>Tue, 22 Apr 2008 01:13:43 +0000</pubDate>
		<guid isPermaLink="false">http://possiblyphilosophy.wordpress.com/?p=45#comment-81</guid>
		<description>That BT version of the argument is nice!  The response that I&#039;ve considered (but never been quite sure how to phrase) looks like it&#039;s just the $latex \Diamond K@ p$ version.

I wonder though about taking a primitive notion of verifiability - could this really do the work that&#039;s wanted here?  Letting verifiability be primitive seems just as bad as letting truth be primitive - perhaps even worse, because the epistemic facts that it appeals to seem much less natural to countenance than a realist world.</description>
		<content:encoded><![CDATA[<p>That BT version of the argument is nice!  The response that I&#8217;ve considered (but never been quite sure how to phrase) looks like it&#8217;s just the <img src='http://l.wordpress.com/latex.php?latex=%5CDiamond+K%40+p&#038;bg=ffffff&#038;fg=61636a&#038;s=0' alt='\Diamond K@ p' title='\Diamond K@ p' class='latex' /> version.</p>
<p>I wonder though about taking a primitive notion of verifiability &#8211; could this really do the work that&#8217;s wanted here?  Letting verifiability be primitive seems just as bad as letting truth be primitive &#8211; perhaps even worse, because the epistemic facts that it appeals to seem much less natural to countenance than a realist world.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
