10.12.2012 Views

Online Papers - Brian Weatherson

Online Papers - Brian Weatherson

Online Papers - Brian Weatherson

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Dogmatism and Intuitionistic Probability 567<br />

If p is an ⊢I L-thesis, then p ∧ r ⊣⊢ r , so P r3 ( p ∧ r ) = P r3 (r ), so P r3 ( p|r ) = 1, as<br />

required for (P1).<br />

If p ⊢I L q then p ∧ r ⊢I L q ∧ r . So P r3 ( p ∧ r ) ≤ P r3 (q ∧ r ). So P r3 ( p∧r ) (q∧r )<br />

P r3 (r ) ≤ P r3 . P r3 (r )<br />

That is, P r 3 ( p|r ) ≤ P r 3 (q|r ), as required for (P2).<br />

Finally, we need to show that P r 3 ( p|r ) + P r 3 (q|r ) = P r 3 ( p ∨ q|r ) + P r 3 ( p ∧<br />

q|r ), as follows, making repeated use of the fact that P r 3 is an unconditional ⊢ I L -<br />

probability function, so we can assume it satisfies (P3), and that we can substitute<br />

intuitionistic equivalences inside P r 3 .<br />

P r3 ( p|r ) + P r3 (q|r ) = P r3 ( p ∧ r )<br />

P r3 (r ) + P r3 (q ∧ r )<br />

P r3 (r )<br />

= P r3 ( p ∧ r ) + P r (q ∧ r )<br />

P r3 (r )<br />

= P r3 (( p ∧ r ) ∨ (q ∧ r )) + P r3 (( p ∧ r ) ∧ (q ∧ r ))<br />

P r3 (r )<br />

= P r3 ( p ∨ q) ∧ r ) + P r3 (( p ∧ q) ∧ r )<br />

P r3 (r )<br />

= P r3 ( p ∨ q) ∧ r )<br />

+<br />

P r3 (r )<br />

P r3 (( p ∧ q) ∧ r )<br />

P r3 (r )<br />

= P r 3 ( p ∨ q|r ) + P r 3 ( p ∧ q|r ) as required<br />

Now if r ⊢ I L p, then r ∧ p I L ⊣⊢ I L p, so P r 3 (r ∧ p) = P r 3 ( p), so P r 3 ( p|r ) = 1,<br />

as required for (P5).<br />

Finally, we show that P r 3 satisfies (P6).<br />

P r3 ( p ∧ q|r ) = P r3 ( p ∧ q ∧ r )<br />

P r3 (r )<br />

= P r3 ( p ∧ q ∧ r ) P r3 (q ∧ r )<br />

P r3 (q ∧ r ) P r3 (r )<br />

= P r 3 ( p|q ∧ r )P r 3 (q|r ) as required<br />

Theorem 6 Let x be any real in (0,1). Then there is a probability function<br />

C r that (a) is a coherent credence function for someone whose credence<br />

that classical logic is correct is x, and (b) satisfies each of the following<br />

inequalities:<br />

P r (Ap → p|Ap) > P r (Ap → p)<br />

P r (¬Ap ∨ p|Ap) > P r (¬Ap ∨ p)<br />

P r (¬(Ap ∧ ¬ p)|Ap) > P r (¬(Ap ∧ ¬ p))

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!