Contemporary Bayesian confirmation theorists measure degree of (incremental) confirmation using a variety of non-equivalent relevance measures. As a result, a great many of the arguments surrounding quantitative Bayesian confirmation theory are implicitly sensitive to choice of measure of confirmation. Such arguments are enthymematic, since they tacitly presuppose that certain relevance measures should be used (for various purposes) rather than other relevance measures that have been proposed and defended in the philosophical literature. I present a survey of this pervasive class of (...) Bayesian confirmation-theoretic enthymemes, and a brief analysis of some recent attempts to resolve the problem of measure sensitivity. (shrink)

Theories of subjective probability are viewed as formal languages for analyzing evidence and expressing degrees of belief. This article focuses on two probability langauges, the Bayesian language and the language of belief functions (Shafer, 1976). We describe and compare the semantics (i.e., the meaning of the scale) and the syntax (i.e., the formal calculus) of these languages. We also investigate some of the designs for probability judgment afforded by the two languages.

Because the conjunction pandq implies p, the value of a bet on pandq cannot exceed the value of a bet on p at the same stakes. We tested recognition of this principle in a betting paradigm that (a) discouraged misreading p as pandnotq, and (b) encouraged genuinely conjunctive reading of pandq. Frequent violations were nonetheless observed. The findings appear to discredit the idea that most people spontaneously integrate the logic of conjunction into their assessments of chance.

Forty years of experimentation on class inclusion and its probabilistic relatives have led to inconsistent results and conclusions about human reasoning. Recent research on the conjunction "fallacy" recapitulates this history. In contrast to previous results, we found that a majority of participants adhere to class inclusion in the classic Linda problem. We outline a theoretical framework that attributes the contradictory results to differences in statistical sophistication and to differences in response mode-whether participants are asked for probability estimates or ranks-and propose (...) two precise cognitive algorithms for ranking probabilities. Our framework allows us to make novel predictions about when and why people adhere to class inclusion. Evidence obtained in several studies supports these predictions and demonstrates that the proposed ranking algorithms can account for about three-quarters of participants' inferences in the Linda problem. (shrink)