In 1958, to refute the argument known as the theoretician's dilemma, Hempel suggested that theoretical terms might be logically indispensable for inductive systematization of observational statements. This thesis, in some form or another, has later been supported by Scheffler, Lehrer, and Tuomela, and opposed by Bohnert, Hooker, Stegmüller, and Cornman. In this paper, a critical survey of this discussion is given. Several different putative definitions of the crucial notion inductive systematization achieved by a theory are discussed by reference to the (...) properties of inductive inference. The consequences of the following differences between deductive and inductive inference are emphasized: the lack of simple transitivity properties (even in a modified sense) of inductive inference, and the failure of the inductive analogue of the converse of The Deduction Theorem. The main conclusions are: (i) Hempel's original thesis may very well be right but his argument for it is unsatisfactory, (ii) theoretical terms can be logically indispensable for a non-Hempelian kind of inductive systematization, relative to both Craigian and Ramseyan elimination, (iii) Lehrer's attempt to prove the indispensability of theoretical terms for inductive-probabilistic systematization is, as a modification of Hempelian kind of inductive-deterministic systematization, unsatisfactory, and (iv) there does not seem to be much hope of escaping the conclusion (ii), if it is true, by extending the Craigian replacement programme along the lines suggested by Cornman. (shrink)

In addition to purely practical values, cognitive values also figure into scientific deliberations. One way of introducing cognitive values is to consider the cognitive value that accrues to the act of accepting a hypothesis. Although such values may have a role to play, such a role does not exhaust the significance of cognitive values in scientific decision-making. This paper makes a plea for consideration of epistemic value —that is, value attaching to a state of belief—and defends the notion of cognitive (...) epistemic value against some criticisms that have been raised. A stability requirement for epistemic value functions is argued for on the basis of considerations of diachronic coherence. This stability requirement is sufficient to obtain the Value of Learning Theorem, which says that the expected utility of cost-free learning cannot be negative. This holds also for cognitive epistemic values, provided that the stability requirement is met. (shrink)

I argue that considerations about computational complexity show that all finite agents need characteristics like those that have been called epistemic virtues. The necessity of these virtues follows in part from the nonexistence of shortcuts, or efficient ways of finding shortcuts, to cognitively expensive routines. It follows that agents must possess the capacities – metavirtues –of developing in advance the cognitive virtues they will need when time and memory are at a premium.

I argue that considerations about computational complexity show that all finite agents need characteristics like those that have been called epistemic virtues. The necessity of these virtues follows in part from the nonexistence of shortcuts, or efficient ways of finding shortcuts, to cognitively expensive routines. It follows that agents must possess the capacities – metavirtues –of developing in advance the cognitive virtues they will need when time and memory are at a premium.

This paper considers two novel Bayesian responses to a well-known skeptical paradox. The paradox consists of three intuitions: first, given appropriate sense experience, we have justification for accepting the relevant proposition about the external world; second, we have justification for expanding the body of accepted propositions through known entailment; third, we do not have justification for accepting that we are not disembodied souls in an immaterial world deceived by an evil demon. The first response we consider rejects the third intuition (...) and proposes an explanation of why we have a faulty intuition. The second response, which we favor, accommodates all three intuitions; it reconciles the first and the third intuition by the dual component model of justification, and defends the second intuition by distinguishing two principles of epistemic closure. (shrink)

In making assertions one takes on commitments to the consistency of what one asserts and to the logical consequences of what one asserts. Although there is no quick link between belief and assertion, the dialectical requirements on assertion feed back into normative constraints on those beliefs that constitute one's evidence. But if we are not certain of many of our beliefs and that uncertainty is modelled in terms of probabilities, then there is at least prima facie incoherence between the normative (...) constraints on belief and the probability-like structure of degrees of belief. I suggest that the norm-governed practice relating to degrees of belief is the evaluation of betting odds. (shrink)

Certain philosophers maintain that there is a ‘constitutive threshold for belief’: to believe that p just is to have a degree of confidence that p above a certain threshold. On the basis of this view, these philosophers defend what is known as ‘the Lockean Thesis ’, according to which it is rational to believe that p just in case it is rational to have a degree of confidence that p above the constitutive threshold for belief. While not directly speaking to (...) the controversy over the Lockean Thesis, this paper defends the general idea behind it—namely, the thesis that there is some threshold such that it is rational to believe that p if and only if it is rational to have a degree of confidence great than that threshold. This paper identifies the threshold in question—not with the alleged constitutive threshold for belief—but with what I call ‘the practical threshold for rational belief’. Roughly, the thesis defended here is that it is rational to believe that p if and only if it is rational to have a degree of confidence that p that rationalizes engaging in certain types of practical reasoning. (shrink)

I show that the Lottery Paradox is just a version of the Sorites, and argue that this should modify our way of looking at the Paradox itself. In particular, I focus on what I call “the Cut-off Point Problem” and contend that this problem, well known by Sorites scholars, ought to play a key role in the debate on Kyburg’s puzzle. Very briefly, I show that, in the Lottery Paradox, the premises “ticket n°1 will lose”, “ticket n°2 will lose”… “ticket (...) n°1000 will lose” are equivalent to soritical premises of the form “~(the winning ticket is in {…, (tn)}) ⊃ ~(the winning ticket is in {…, tn, (tn + 1)})” (where “⊃” is the material conditional, “~” is the negation symbol, “tn” and “tn + 1” are “ticket n°n” and “ticket n°n + 1” respectively, and “{}” identify the elements of the lottery tickets’ set. The brackets in “(tn)” and “(tn + 1)” are meant to point out that in the antecedent of the conditional we do not always have a “tn” (and, as a result, a “tn + 1” in the consequent): consider the conditional “~(the winning ticket is in {}) ⊃ ~(the winning ticket is in {t1})”). As a result, failing to believe, for some ticket, that it will lose comes down to introducing a cut-off point in a chain of soritical premises. In this paper I explore the consequences of the different ways of blocking the Lottery Paradox with respect to the Cut-off Point Problem. A heap variant of the Lottery Paradox is especially relevant for evaluating the different solutions. One important result is that the most popular way out of the puzzle, i.e., denying the Lockean Thesis, becomes less attractive. Moreover, I show that, along with the debate on whether rational belief is closed under classical logic, the debate on the validity of modus ponens should play an important role in discussions on the Lottery Paradox. -/- . (shrink)

This paper concerns the extent to which uncertain propositional reasoning can track probabilistic reasoning, and addresses kinematic problems that extend the familiar Lottery paradox. An acceptance rule assigns to each Bayesian credal state p a propositional belief revision method B p , which specifies an initial belief state B p (T) that is revised to the new propositional belief state B(E) upon receipt of information E. An acceptance rule tracks Bayesian conditioning when B p (E) = B p|E (T), for (...) every E such that p(E) > 0; namely, when acceptance by propositional belief revision equals Bayesian conditioning followed by acceptance. Standard proposals for uncertain acceptance and belief revision do not track Bayesian conditioning. The "Lockean" rule that accepts propositions above a probability threshold is subject to the familiar lottery paradox (Kyburg 1961), and we show that it is also subject to new and more stubborn paradoxes when the tracking property is taken into account. Moreover, we show that the familiar AGM approach to belief revision (Harper, Synthese 30(1-2):221-262, 1975; Alchourrón et al., J Symb Log 50:510-530, 1985) cannot be realized in a sensible way by any uncertain acceptance rule that tracks Bayesian conditioning. Finally, we present a plausible, alternative approach that tracks Bayesian conditioning and avoids all of the paradoxes. It combines an odds-based acceptance rule proposed originally by Levi (1996) with a non-AGM belief revision method proposed originally by Shoham (1987). (shrink)

This paper seeks to defend the following conclusions: The program advanced by Carnap and other necessarians for probability logic has little to recommend it except for one important point. Credal probability judgments ought to be adapted to changes in evidence or states of full belief in a principled manner in conformity with the inquirer’s confirmational commitments—except when the inquirer has good reason to modify his or her confirmational commitment. Probability logic ought to spell out the constraints on rationally coherent confirmational (...) commitments. In the case where credal judgments are numerically determinate confirmational commitments correspond to Carnap’s credibility functions mathematically represented by so—called confirmation functions. Serious investigation of the conditions under which confirmational commitments should be changed ought to be a prime target for critical reflection. The necessarians were mistaken in thinking that confirmational commitments are immune to legitimate modification altogether. But their personalist or subjectivist critics went too far in suggesting that we might dispense with confirmational commitments. There is room for serious reflection on conditions under which changes in confirmational commitments may be brought under critical control. Undertaking such reflection need not become embroiled in the anti inductivism that has characterized the work of Popper, Carnap and Jeffrey and narrowed the focus of students of logical and methodological issues pertaining to inquiry. (shrink)

This is a brief review of issues over which Henry Kyburg and I differed concerning the requirement that full beliefs should be closed under deductive consequence.

This paper suggests a bridge principle for all-or-nothing belief and degrees of belief to the effect that belief corresponds to stably high degree of belief. Different ways of making this Humean thesis on belief precise are discussed, and one of them is shown to stand out by unifying the others. The resulting version of the thesis proves to be fruitful in entailing the logical closure of belief, the Lockean thesis on belief, and coherence between decision-making based on all-or-nothing beliefs and (...) on degrees of belief. (shrink)