Bayesians often assume, suppose, or conjecture that for any reasonable explication of the notion of simplicity a prior can be designed that will enforce a preference for hypotheses simpler in just that sense. But it is shown here that there are simplicity-driven approaches to curve-fitting problems that cannot be captured within the orthodox Bayesian framework.

ABSTRACTTo build a process model of the understanding of conditionals we extract a common core of three semantics of if-then sentences: the conditional event interpretation in the coherencebased probability logic, the discourse processingtheory of Hans Kamp, and the game-theoretical approach of Jaakko Hintikka. The empirical part reports three experiments in which each participant assessed the probability of 52 if-then sentencesin a truth table task. Each experiment included a second task: An n-back task relating the interpretation of conditionals to working memory, (...) a Bayesian bookbag and poker chip task relating the interpretation of conditionals to probability updating, and a probabilistic modus ponens task relating the interpretation of conditionals to a classical inference task. Data analysis shows that the way in which the conditionals are interpreted correlates with each of the supplementary tasks. The results are discussed within the process model proposed in the introduction. (shrink)

Despite the widespread use of key concepts of the Neyman–Pearson (N–P) statistical paradigm—type I and II errors, significance levels, power, confidence levels—they have been the subject of philosophical controversy and debate for over 60 years. Both current and long-standing problems of N–P tests stem from unclarity and confusion, even among N–P adherents, as to how a test's (pre-data) error probabilities are to be used for (post-data) inductive inference as opposed to inductive behavior. We argue that the relevance of error probabilities (...) is to ensure that only statistical hypotheses that have passed severe or probative tests are inferred from the data. The severity criterion supplies a meta-statistical principle for evaluating proposed statistical inferences, avoiding classic fallacies from tests that are overly sensitive, as well as those not sensitive enough to particular errors and discrepancies. Introduction and overview 1.1 Behavioristic and inferential rationales for Neyman–Pearson (N–P) tests 1.2 Severity rationale: induction as severe testing 1.3 Severity as a meta-statistical concept: three required restrictions on the N–P paradigm Error statistical tests from the severity perspective 2.1 N–P test T(): type I, II error probabilities and power 2.2 Specifying test T() using p-values Neyman's post-data use of power 3.1 Neyman: does failure to reject H warrant confirming H? Severe testing as a basic concept for an adequate post-data inference 4.1 The severity interpretation of acceptance (SIA) for test T() 4.2 The fallacy of acceptance (i.e., an insignificant difference): Ms Rosy 4.3 Severity and power Fallacy of rejection: statistical vs. substantive significance 5.1 Taking a rejection of H0 as evidence for a substantive claim or theory 5.2 A statistically significant difference from H0 may fail to indicate a substantively important magnitude 5.3 Principle for the severity interpretation of a rejection (SIR) 5.4 Comparing significant results with different sample sizes in T(): large n problem 5.5 General testing rules for T(), using the severe testing concept The severe testing concept and confidence intervals 6.1 Dualities between one and two-sided intervals and tests 6.2 Avoiding shortcomings of confidence intervals Beyond the N–P paradigm: pure significance, and misspecification tests Concluding comments: have we shown severity to be a basic concept in a N–P philosophy of induction? (shrink)

Bayesians often assume, suppose, or conjecture that for any reasonable explication of the notion of simplicity a prior can be designed that will enforce a preference for hypotheses simpler in just that sense. Further, it is often claimed that the Bayesian framework automatically implements Occam's razor—that conditionalizing on data consistent with both a simple theory and a complex theory more or less inevitably favours the simpler theory. But it is shown here that there are simplicity-driven approaches to curve-fitting problems that (...) cannot be captured within the orthodox Bayesian framework and that the automatic razor does not function for such problems. (shrink)

Four experiments investigated uncertainty about a premise in a deductive argument as a function of the expertise of the speaker and of the conversational context. The procedure mimicked everyday reasoning in that participants were not told that the premises were to be treated as certain. The results showed that the perceived likelihood of a conclusion was greater when the major or the minor premise was uttered by an expert rather than a novice (Experiment 1). The results also showed that uncertainty (...) about the conclusion was higher when the major premise was uttered by a novice and an alternative premise by an expert, compared to when the major premise was uttered by an expert and the alternative by a novice (Experiment 2). Similarly, the believability of a conclusion was considerably lower when the minor premise was uttered by a novice and denied by an expert, as opposed to when an expert uttered the minor premise and a novice denied it (Experiment 3). Experiment 4 showed that the nature of the uncertainty induced by a denial of the minor premise depended on whether or not the context was a conversation. These results pose difficult problems for current theories of reasoning, as current theories are based on the results of experiments in which the premises are treated as certain. Our discussion of the results emphasises the importance of pragmatics in reasoning, namely, the role of general knowledge about the world in assessing the probability of a premise uttered by an expert or a novice and the role of interpretations of the premise based on pragmatic inferences in revising these initial probabilities. (shrink)