Suppose rational belief is closed under competent deduction:
(RBC) Necessarily, if S has a rational belief that p, and p entails q, then S is a competent deduction away from a rational belief that q, maintaining her belief that p throughout.
Given this moderate closure schema, which seems somewhat plausible, considering what seems to be a close link between rationality and deduction, it is possible to come to rationally believe a set of inconsistent propositions, by deduction alone.
Consider the preface paradox: An author publishes a book. It is rational for the author to believe that the conjunction of the propositions in this book are false, given reflection on her fallible nature, etc.:
(1) RB(~(p1&p2&…&pn))
Now, further suppose that the author then begins looking through the book, or reflecting on each proposition individually. Now for each p1,…,pn it is not a stretch to consider that the author rationally believe the proposition, as there is a good chance that the individual proposition countenanced is not that which makes the conjunction false, and the author stands behind her work. But we can take this further. Suppose for each p1,…,pn the possibility of error were raised. For example, someone–perhaps the author herself–were to point out that the editor is known for transposition errors, spelling mistakes, etc., and it would be beneficial to double check whether the proposition in question were true. In each of these cases, the author could, by disjunctive addition, come to the deductive conclusion that there is no editing mistake present 1:
(2) p1 v ~EM(p1)
(3) ~~(p1 v ~EM(p1))
(4) ~(~p1 & ~~EM(p1))
(5) ~(~p1 & EM(p1))
Thus, by (2)-(5), we have the conclusion that it is not the case that not p1 and there is an editing mistake regarding p1. This argument can be repeated for each p2,…,pn, with the result that, not only does it seem initially plausible that each of p1,…,pn are rational to accept individually, they are in fact robustly rational beliefs, immune to the possibility of error. At this point we now have:
(6) RB(p1) & … & RB(pn) & RB(~(p1 & … & pn))
If rational belief is aggregative, or closed under conjunction, then we have rational inconsistent beliefs:
(7) RB((p1 & … & pn) & ~(p1 & … & pn))
We can make this a bit uncomfortable for the author previous to the commitment to belief aggregation, however. For suppose that once the author had iterated through all of her beliefs, someone pointed out to her that she rationally believed the negation of the conjunction of her beliefs, and the iteration she just preformed committed her to rationally believing each proposition within the conjunction individually, which is inconsistent–one of her beliefs must not be rational. Given this, she could first prove that it is rational to believe the negation of the conjunction in the face of a series of rational beliefs in each conjunct:
(8) RB(~(p1&p2&…&pn)) v ~(RB(p1) & … & RB(pn))
…
(9) ~(~RB(~(p1&p2&…&pn)) & (RB(p1) & … & RB(pn)))
Then she could prove that it is rational to believe each conjunct in the face of the negation of the conjunction:
(10(1-n)) RB(p(1-n)) v ~RB(~(p1&p2&…&pn))
…
(11(1-n)) ~(~RB(p(1-n)) & RB(~(p1&p2&…&pn)))
If we wanted to take this a step further, and assume aggregation, by stopping one step short of the full-out contradiction:
(12) RB(p1&p2&…&pn) & RB(~(p1&p2&…&pn))
She could prove that it is rational to have a rational belief in both the conjunction and the negation of the conjunction:
(13) RB(p1&p2&…&pn) v ~RB(~(p1&p2&…&pn))
…
(14) ~(~RB(p1&p2&…&pn) & RB(~(p1&p2&…&pn)))
——-
(15) RB(~(p1&p2&…&pn)) v ~RB(p1&p2&…&pn)
…
(16) ~(~RB(~(p1&p2&…&pn)) & RB(p1&p2&…&pn))
So, not only can you have inconsistent rational beliefs, but you can have rational beliefs that your inconsistent beliefs are rational.
- This is Cohen’s Easy Knowledge deduction ↩

No comments
Comments feed for this article
Trackback link: http://www.ezracook.net/2009/06/rational-inconsistent-beliefs/trackback/