<?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:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments on: Counterexamples to Modus Ponens?</title>
	<atom:link href="http://possiblyphilosophy.wordpress.com/2008/08/19/counterexamples-to-modus-ponens/feed/" rel="self" type="application/rss+xml" />
	<link>http://possiblyphilosophy.wordpress.com/2008/08/19/counterexamples-to-modus-ponens/</link>
	<description>Weblog devoted to the philosophy of language, metaphysics and philosophical logic</description>
	<lastBuildDate>Fri, 25 Dec 2009 22:13:35 +0000</lastBuildDate>
	<generator>http://wordpress.com/</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Recent Links Tagged With "modal" - JabberTags</title>
		<link>http://possiblyphilosophy.wordpress.com/2008/08/19/counterexamples-to-modus-ponens/#comment-383</link>
		<dc:creator>Recent Links Tagged With "modal" - JabberTags</dc:creator>
		<pubDate>Thu, 23 Oct 2008 10:04:30 +0000</pubDate>
		<guid isPermaLink="false">http://possiblyphilosophy.wordpress.com/?p=79#comment-383</guid>
		<description>[...] public links &gt;&gt; modal   Counterexamples to Modus Ponens? Saved by Firite on Wed 22-10-2008   Product Review: Boris Final Effects Complete 5 Saved by [...]</description>
		<content:encoded><![CDATA[<p>[...] public links &gt;&gt; modal   Counterexamples to Modus Ponens? Saved by Firite on Wed 22-10-2008   Product Review: Boris Final Effects Complete 5 Saved by [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: moritz</title>
		<link>http://possiblyphilosophy.wordpress.com/2008/08/19/counterexamples-to-modus-ponens/#comment-309</link>
		<dc:creator>moritz</dc:creator>
		<pubDate>Wed, 17 Sep 2008 14:17:50 +0000</pubDate>
		<guid isPermaLink="false">http://possiblyphilosophy.wordpress.com/?p=79#comment-309</guid>
		<description>That may be right ...</description>
		<content:encoded><![CDATA[<p>That may be right &#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Andrew</title>
		<link>http://possiblyphilosophy.wordpress.com/2008/08/19/counterexamples-to-modus-ponens/#comment-307</link>
		<dc:creator>Andrew</dc:creator>
		<pubDate>Tue, 16 Sep 2008 14:05:08 +0000</pubDate>
		<guid isPermaLink="false">http://possiblyphilosophy.wordpress.com/?p=79#comment-307</guid>
		<description>Yeah, I share the intuition with that example. 

The crux of the problem I was worried about is that there are various constraints on rational credences that ensure some valid probabilistic inferences are logically invalid. For example there are surely *some* constraints regarding higher order credences. Similarly, you would have thought there are some connections between credences and knowledge (e.g. if you know p, you should have a high credence in p or if you have a high credence that you know p, you should have a high credence in p, and you should have a high credence that you have a high credence in p. etc etc...) If you accept some of these connections you can construct more problems along the same lines.</description>
		<content:encoded><![CDATA[<p>Yeah, I share the intuition with that example. </p>
<p>The crux of the problem I was worried about is that there are various constraints on rational credences that ensure some valid probabilistic inferences are logically invalid. For example there are surely *some* constraints regarding higher order credences. Similarly, you would have thought there are some connections between credences and knowledge (e.g. if you know p, you should have a high credence in p or if you have a high credence that you know p, you should have a high credence in p, and you should have a high credence that you have a high credence in p. etc etc&#8230;) If you accept some of these connections you can construct more problems along the same lines.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: moritz</title>
		<link>http://possiblyphilosophy.wordpress.com/2008/08/19/counterexamples-to-modus-ponens/#comment-306</link>
		<dc:creator>moritz</dc:creator>
		<pubDate>Mon, 15 Sep 2008 17:46:55 +0000</pubDate>
		<guid isPermaLink="false">http://possiblyphilosophy.wordpress.com/?p=79#comment-306</guid>
		<description>Guess I need to think more about higher-order credences...

Concerning the lottery case: there is an even simpler example. Just think of a typical heads-tails situation. Your credence in heads is 1/2. But your credence in that you know that the coin comes up heads is 0, since you are certain that you cannot know whether heads or tails.   Do your intuitions still differ?</description>
		<content:encoded><![CDATA[<p>Guess I need to think more about higher-order credences&#8230;</p>
<p>Concerning the lottery case: there is an even simpler example. Just think of a typical heads-tails situation. Your credence in heads is 1/2. But your credence in that you know that the coin comes up heads is 0, since you are certain that you cannot know whether heads or tails.   Do your intuitions still differ?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Andrew</title>
		<link>http://possiblyphilosophy.wordpress.com/2008/08/19/counterexamples-to-modus-ponens/#comment-297</link>
		<dc:creator>Andrew</dc:creator>
		<pubDate>Mon, 15 Sep 2008 12:31:02 +0000</pubDate>
		<guid isPermaLink="false">http://possiblyphilosophy.wordpress.com/?p=79#comment-297</guid>
		<description>Hmm. In the lottery case you described I&#039;d be more inclined to say that I&#039;m pretty sure I know I&#039;m not going to win, even though there&#039;s a small chance I&#039;m wrong. Maybe I just have deviant intuitions. 

Actually I&#039;ve never been quite convinced about the failure of KK. But will the Williamson argument carry over to certainty? I&#039;m not sure - if you&#039;re certain that p_k, then you&#039;re credence in p_n where n!=k is 0 by finite additivity. Doesn&#039;t that just mean the margin for error principle fails? You might also think you should have fuzzy credences in propositions like in the Williamson example, in which case I don&#039;t know how the argument would run.

Eitherway, you don&#039;t actually need anything as strong as S4 for certainty for the result I mentioned. You can do it with: C¬Cp-&gt;¬Cp, which is strictly weaker. Another route would be that there can&#039;t be any rational credence function that gives full credence to p, and full credence that p has been assigned zero credence. The counterexamples to KK rely on small differences between the credences and the credences in the credences, but here you have the widest difference possible.</description>
		<content:encoded><![CDATA[<p>Hmm. In the lottery case you described I&#8217;d be more inclined to say that I&#8217;m pretty sure I know I&#8217;m not going to win, even though there&#8217;s a small chance I&#8217;m wrong. Maybe I just have deviant intuitions. </p>
<p>Actually I&#8217;ve never been quite convinced about the failure of KK. But will the Williamson argument carry over to certainty? I&#8217;m not sure &#8211; if you&#8217;re certain that p_k, then you&#8217;re credence in p_n where n!=k is 0 by finite additivity. Doesn&#8217;t that just mean the margin for error principle fails? You might also think you should have fuzzy credences in propositions like in the Williamson example, in which case I don&#8217;t know how the argument would run.</p>
<p>Eitherway, you don&#8217;t actually need anything as strong as S4 for certainty for the result I mentioned. You can do it with: C¬Cp-&gt;¬Cp, which is strictly weaker. Another route would be that there can&#8217;t be any rational credence function that gives full credence to p, and full credence that p has been assigned zero credence. The counterexamples to KK rely on small differences between the credences and the credences in the credences, but here you have the widest difference possible.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: moritz</title>
		<link>http://possiblyphilosophy.wordpress.com/2008/08/19/counterexamples-to-modus-ponens/#comment-296</link>
		<dc:creator>moritz</dc:creator>
		<pubDate>Sun, 14 Sep 2008 17:53:16 +0000</pubDate>
		<guid isPermaLink="false">http://possiblyphilosophy.wordpress.com/?p=79#comment-296</guid>
		<description>What about Williamson&#039;s counterexamples to the KK-principle? Don&#039;t they carry over to certainty?</description>
		<content:encoded><![CDATA[<p>What about Williamson&#8217;s counterexamples to the KK-principle? Don&#8217;t they carry over to certainty?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: moritz</title>
		<link>http://possiblyphilosophy.wordpress.com/2008/08/19/counterexamples-to-modus-ponens/#comment-295</link>
		<dc:creator>moritz</dc:creator>
		<pubDate>Sun, 14 Sep 2008 17:51:38 +0000</pubDate>
		<guid isPermaLink="false">http://possiblyphilosophy.wordpress.com/?p=79#comment-295</guid>
		<description>Hi Andrew,

yes, I had the latter conception of probabilistic validity (a la Adams) in mind.

I don&#039;t know about the S4 axiom for certainty. But the second principle you mention seems to be false (if I understand it correctly). Consider a lottery case. My credence in `My ticket will lose&#039; is high, but strictly less than 1. However, I am certain that I do not know that my ticket will lose. This seems to be a rational epistemic state. But it would violate the principle that my credence in &quot;p&quot; equals my credence in &quot;I know that p&quot;.</description>
		<content:encoded><![CDATA[<p>Hi Andrew,</p>
<p>yes, I had the latter conception of probabilistic validity (a la Adams) in mind.</p>
<p>I don&#8217;t know about the S4 axiom for certainty. But the second principle you mention seems to be false (if I understand it correctly). Consider a lottery case. My credence in `My ticket will lose&#8217; is high, but strictly less than 1. However, I am certain that I do not know that my ticket will lose. This seems to be a rational epistemic state. But it would violate the principle that my credence in &#8220;p&#8221; equals my credence in &#8220;I know that p&#8221;.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Andrew</title>
		<link>http://possiblyphilosophy.wordpress.com/2008/08/19/counterexamples-to-modus-ponens/#comment-286</link>
		<dc:creator>Andrew</dc:creator>
		<pubDate>Mon, 08 Sep 2008 22:13:47 +0000</pubDate>
		<guid isPermaLink="false">http://possiblyphilosophy.wordpress.com/?p=79#comment-286</guid>
		<description>Sorry, I think I was a bit too quick on some of that. In particular, there are two notions of probabilistic inference that are relevant, which makes a difference to inferences I gave. 

If we think of validity as preservation of certainty, we get

 * $latex (p \wedge \neg Cp) \models  (q \wedge \neg q)$
 * $latex p \models Kp$

Assuming the principles $latex (Cp \rightarrow CCp)$ and $latex (Cp \rightarrow CKp)$ respectively. (Here Cp means full credence in p.) This consequence relation violates classical inferences rules though, for example the deduction theorem:

 * If $latex p \models Cp$ then $latex \models (p \rightarrow Cp)$

To see how the consequent fails, it seems perfectly rational to have a credence of 1/2 in p and 0 in Cp. (I think most of the Williamson arguments against validity=preservation of supertruth carry over here.)

The other relevant consequence relation is where the sum of the uncertainties of the premises must be greater-than-or-equal to the uncertainty of the conclusion. This gets us back classical inference rules, like DT.  I assume you had this one in mind, while I was assuming the other one in my post. The Moore like inference I stated in the first post remains valid on this consequence relation given the S4 axiom for certainty (and it was more than I needed for validity on the first consequence relation.) For the second inference you get it if you assume that your credence in p should be equal to your credence that you know p: $latex Cr(p)=Cr(Kp)$. I find the principles appealed to quite appealing - but maybe you disagree.</description>
		<content:encoded><![CDATA[<p>Sorry, I think I was a bit too quick on some of that. In particular, there are two notions of probabilistic inference that are relevant, which makes a difference to inferences I gave. </p>
<p>If we think of validity as preservation of certainty, we get</p>
<p> * <img src='http://l.wordpress.com/latex.php?latex=%28p+%5Cwedge+%5Cneg+Cp%29+%5Cmodels++%28q+%5Cwedge+%5Cneg+q%29&#038;bg=ffffff&#038;fg=61636a&#038;s=0' alt='(p \wedge \neg Cp) \models  (q \wedge \neg q)' title='(p \wedge \neg Cp) \models  (q \wedge \neg q)' class='latex' /><br />
 * <img src='http://l.wordpress.com/latex.php?latex=p+%5Cmodels+Kp&#038;bg=ffffff&#038;fg=61636a&#038;s=0' alt='p \models Kp' title='p \models Kp' class='latex' /></p>
<p>Assuming the principles <img src='http://l.wordpress.com/latex.php?latex=%28Cp+%5Crightarrow+CCp%29&#038;bg=ffffff&#038;fg=61636a&#038;s=0' alt='(Cp \rightarrow CCp)' title='(Cp \rightarrow CCp)' class='latex' /> and <img src='http://l.wordpress.com/latex.php?latex=%28Cp+%5Crightarrow+CKp%29&#038;bg=ffffff&#038;fg=61636a&#038;s=0' alt='(Cp \rightarrow CKp)' title='(Cp \rightarrow CKp)' class='latex' /> respectively. (Here Cp means full credence in p.) This consequence relation violates classical inferences rules though, for example the deduction theorem:</p>
<p> * If <img src='http://l.wordpress.com/latex.php?latex=p+%5Cmodels+Cp&#038;bg=ffffff&#038;fg=61636a&#038;s=0' alt='p \models Cp' title='p \models Cp' class='latex' /> then <img src='http://l.wordpress.com/latex.php?latex=%5Cmodels+%28p+%5Crightarrow+Cp%29&#038;bg=ffffff&#038;fg=61636a&#038;s=0' alt='\models (p \rightarrow Cp)' title='\models (p \rightarrow Cp)' class='latex' /></p>
<p>To see how the consequent fails, it seems perfectly rational to have a credence of 1/2 in p and 0 in Cp. (I think most of the Williamson arguments against validity=preservation of supertruth carry over here.)</p>
<p>The other relevant consequence relation is where the sum of the uncertainties of the premises must be greater-than-or-equal to the uncertainty of the conclusion. This gets us back classical inference rules, like DT.  I assume you had this one in mind, while I was assuming the other one in my post. The Moore like inference I stated in the first post remains valid on this consequence relation given the S4 axiom for certainty (and it was more than I needed for validity on the first consequence relation.) For the second inference you get it if you assume that your credence in p should be equal to your credence that you know p: <img src='http://l.wordpress.com/latex.php?latex=Cr%28p%29%3DCr%28Kp%29&#038;bg=ffffff&#038;fg=61636a&#038;s=0' alt='Cr(p)=Cr(Kp)' title='Cr(p)=Cr(Kp)' class='latex' />. I find the principles appealed to quite appealing &#8211; but maybe you disagree.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Andrew</title>
		<link>http://possiblyphilosophy.wordpress.com/2008/08/19/counterexamples-to-modus-ponens/#comment-284</link>
		<dc:creator>Andrew</dc:creator>
		<pubDate>Mon, 08 Sep 2008 21:32:34 +0000</pubDate>
		<guid isPermaLink="false">http://possiblyphilosophy.wordpress.com/?p=79#comment-284</guid>
		<description>Hey Moritz,

Hope you had a good time in Krakow. I was planning on going, but was too disorganised :-s.

Thanks for your comments! I like the method of using probabilistic consequence to get a handle on inferences where standard methods are left wanting in the way you describe. However, I think that this consequence relation differs from the relation we think of as &#039;logical consequence&#039; in some crucial respects, that make its application here slightly spurious.

In fact - I think the probabilistic notion is actually *extensionally* inadequate in that it classifies some inferences as valid which aren&#039;t (in the strictly logical sense.) The example I have in mind trades on Moore like paradoxes: &#039;p but I have a low credence in p&#039;. In particular the following inference is valid with respect to all rational credence functions:

 * $latex (p \wedge Cr(p)=0) \models (q \wedge \neg q)$

(The argument trades on the S4 principle for rational certainty - I briefly spelled it out &lt;a href=&quot;http://possiblyphilosophy.wordpress.com/2008/07/02/the-paradox-of-rational-believability/&quot; rel=&quot;nofollow&quot;&gt;here&lt;/a&gt; if you&#039;re interested.)

Now the reason I think this is relevant here is because the counterexample above trades on doxastic and epistemic attitudes in the premises and conclusion, and the counterexample to modus ponens presented trades on epistemic modals.

Another potentially damaging principle relevant to this context, which governs the interaction between credences and knowledge, is the principle that if you believe something, then you believe that you know it. If you accept the corresponding principle for full credence instead of belief that makes the following valid:

 * $latex p \models Kp$

Even if you found the Moore like paradox above an acceptable inferenc, this one is clearly an awful inference.</description>
		<content:encoded><![CDATA[<p>Hey Moritz,</p>
<p>Hope you had a good time in Krakow. I was planning on going, but was too disorganised :-s.</p>
<p>Thanks for your comments! I like the method of using probabilistic consequence to get a handle on inferences where standard methods are left wanting in the way you describe. However, I think that this consequence relation differs from the relation we think of as &#8216;logical consequence&#8217; in some crucial respects, that make its application here slightly spurious.</p>
<p>In fact &#8211; I think the probabilistic notion is actually *extensionally* inadequate in that it classifies some inferences as valid which aren&#8217;t (in the strictly logical sense.) The example I have in mind trades on Moore like paradoxes: &#8216;p but I have a low credence in p&#8217;. In particular the following inference is valid with respect to all rational credence functions:</p>
<p> * <img src='http://l.wordpress.com/latex.php?latex=%28p+%5Cwedge+Cr%28p%29%3D0%29+%5Cmodels+%28q+%5Cwedge+%5Cneg+q%29&#038;bg=ffffff&#038;fg=61636a&#038;s=0' alt='(p \wedge Cr(p)=0) \models (q \wedge \neg q)' title='(p \wedge Cr(p)=0) \models (q \wedge \neg q)' class='latex' /></p>
<p>(The argument trades on the S4 principle for rational certainty &#8211; I briefly spelled it out <a href="http://possiblyphilosophy.wordpress.com/2008/07/02/the-paradox-of-rational-believability/" rel="nofollow">here</a> if you&#8217;re interested.)</p>
<p>Now the reason I think this is relevant here is because the counterexample above trades on doxastic and epistemic attitudes in the premises and conclusion, and the counterexample to modus ponens presented trades on epistemic modals.</p>
<p>Another potentially damaging principle relevant to this context, which governs the interaction between credences and knowledge, is the principle that if you believe something, then you believe that you know it. If you accept the corresponding principle for full credence instead of belief that makes the following valid:</p>
<p> * <img src='http://l.wordpress.com/latex.php?latex=p+%5Cmodels+Kp&#038;bg=ffffff&#038;fg=61636a&#038;s=0' alt='p \models Kp' title='p \models Kp' class='latex' /></p>
<p>Even if you found the Moore like paradox above an acceptable inferenc, this one is clearly an awful inference.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: moritz</title>
		<link>http://possiblyphilosophy.wordpress.com/2008/08/19/counterexamples-to-modus-ponens/#comment-283</link>
		<dc:creator>moritz</dc:creator>
		<pubDate>Mon, 08 Sep 2008 16:08:08 +0000</pubDate>
		<guid isPermaLink="false">http://possiblyphilosophy.wordpress.com/?p=79#comment-283</guid>
		<description>Hi Andrew,

sorry that it took me so long to read this entry. After Krakow we had another workshop (the &quot;phloxshop&quot;) here in Berlin. 

I am still a bit troubled by how best to set up the debate about modus ponens within the restrictor&#039;s framework. I need to think more about this. 

Perhaps there is a way to strengthen your second exammple. Once we enter the realm of epistemic modals etc, it is not clear whether asking what is assertable in which contexts is a very safe guide to validity. For instance, in a context in which you assert &quot;p&quot;, you may also be committed to assert &quot;Must p&quot;. But that shouldn&#039;t force us to think that &quot;Must p&quot; follows from &quot;p&quot;. Rather, we should focus on the fact that assertion is governed by a certain norm, perhaps knowledge. Now, asserting &quot;p&quot; without acknowledging that the norm governing this assertion is in place is pragmatically inappropriate. So, asserting &quot;p&quot; and refraining from asserting &quot;I know p&quot; seems to be pragmatically somewhat strange. Nevertheless, no way that the latter follows from the former.

Now, I think that your example sounds not as good as you would like it to be for precisely this reason. But perhaps we can look at another feature of this inference in order to see that it is not valid. It seems that we can have high credence in the first premise, high credence or even certainty in the second premise, but low credence in the conclusion. Usually, such a complex of epistemic attitudes is not rationally permitted with respect to a valid inference. Doesn&#039;t this show what you want?</description>
		<content:encoded><![CDATA[<p>Hi Andrew,</p>
<p>sorry that it took me so long to read this entry. After Krakow we had another workshop (the &#8220;phloxshop&#8221;) here in Berlin. </p>
<p>I am still a bit troubled by how best to set up the debate about modus ponens within the restrictor&#8217;s framework. I need to think more about this. </p>
<p>Perhaps there is a way to strengthen your second exammple. Once we enter the realm of epistemic modals etc, it is not clear whether asking what is assertable in which contexts is a very safe guide to validity. For instance, in a context in which you assert &#8220;p&#8221;, you may also be committed to assert &#8220;Must p&#8221;. But that shouldn&#8217;t force us to think that &#8220;Must p&#8221; follows from &#8220;p&#8221;. Rather, we should focus on the fact that assertion is governed by a certain norm, perhaps knowledge. Now, asserting &#8220;p&#8221; without acknowledging that the norm governing this assertion is in place is pragmatically inappropriate. So, asserting &#8220;p&#8221; and refraining from asserting &#8220;I know p&#8221; seems to be pragmatically somewhat strange. Nevertheless, no way that the latter follows from the former.</p>
<p>Now, I think that your example sounds not as good as you would like it to be for precisely this reason. But perhaps we can look at another feature of this inference in order to see that it is not valid. It seems that we can have high credence in the first premise, high credence or even certainty in the second premise, but low credence in the conclusion. Usually, such a complex of epistemic attitudes is not rationally permitted with respect to a valid inference. Doesn&#8217;t this show what you want?</p>
]]></content:encoded>
	</item>
</channel>
</rss>
