Branden Fitelson

There are various non-contrastive questions that one can ask about a single hypothesis H and a body of evidence E: What is the probability of H, given E [Pr(H | E)]? What is the likelihood of H on E [Pr(E | H)]? Does E support/counter-support H? Should we accept/reject H in light of E? There are also contrastive questions concerning pairs of alternative hypotheses H1 vs H2 and a body of evidence E: Is H1 more probable than H2, given E? Is the likelihood of H1 greater than that of H2 on E? Does E favor H1 over H2 (or vice versa)?

To the extent that we have reasons to avoid these “bad B -properties”, these arguments provide reasons not to have an incoherent credence function b — and perhaps even reasons to have a coherent one. But, note that these two traditional arguments for probabilism involve what might be called “pragmatic” reasons (not) to be (in)coherent. In the case of the Dutch Book argument, the “bad” property is pragmatically bad (to the extent that one values money). But, it is not clear whether the DBA pinpoints any epistemic defect of incoherent agents. The same can be said for Representation Theorem arguments, since they involve the structure of an agent’s preferences

In the first edition of LFP, Carnap [2] undertakes a precise probabilistic explication of the concept of confirmation. This is where modern confirmation theory was born (in sin). Carnap was interested mainly in quantitative confirmation (which he took to be fundamental). But, he also gave (derivative) qualitative and comparative explications: • Qualitative. E inductively supports H. • Comparative. E supports H more strongly than E supports H . • Quantitative. E inductively supports H to degree r . Carnap begins by clarifying the explicandum (the informal “inductive support” concept) in various ways, including.

mathematicians for over 60 years. Amazingly, the Argonne team's automated theorem-proving program EQP took only 8 days to find a proof of it. Unfortunately, the proof found by EQP is quite complex and difficult to follow. Some of the steps of the EQP proof require highly complex and unintuitive substitution strategies. As a result, it is nearly impossible to reconstruct or verify the computer proof of the Robbins conjecture entirely by hand. This is where the unique symbolic capabilities of Mathematica 3 come in handy. With the help of Mathematica, it is relatively easy to work out and explain each step of the dense EQP proof in detail. In this paper, I use Mathematica to provide a detailed, step-by-step reconstruction of the highly complex EQP proof of the Robbins conjecture.