Jeanne Peijnenburg

The Emergence of Justification

A major objection to epistemic infinitism is that it seems to make justification impossible. For if there is an infinite chain of reasons, each receiving its justification from its neighbour, then there is no justification to inherit in the first place. Some have argued that the objection arises from misunderstanding the character of justification. Justification is not something that one reason inherits from another; rather it gradually emerges from the chain as a whole. Nowhere however is it made clear what exactly is meant by emergence. The aim of this paper is to fill that lacuna: we describe a detailed procedure for the emergence of justification that enables us to see exactly how justification surfaces from a chain of reasons.

How to Confirm the Conjunction of Disconfirmed Hypotheses

Could some evidence confirm a conjunction of two hypotheses more than it confirms either of the hypotheses separately? We show that it might, moreover under conditions that are the same for ten different measures of confirmation. Further, we demonstrate that it is even possible for the conjunction of two disconfirmed hypotheses to be confirmed by the same evidence.

Justification by an Infinity of Conditional Probabilities

Today it is generally assumed that epistemic justification comes in degrees. The consequences, however, have not been adequately appreciated. In this paper we show that the assumption invalidates some venerable attacks on infinitism: once we accept that epistemic justification is gradual, an infinitist stance makes perfect sense. It is only without the assumption that infinitism runs into difficulties.

Probabilistic Justification and the Regress Problem

We discuss two objections that foundationalists have raised against infinite chains of probabilistic justification. We demonstrate that neither of the objections can be maintained.

Grounds and limits: Reichenbach and foundationalist epistemology

From 1929 onwards, C. I. Lewis defended the foundationalist claim that judgements of the form ‘x is probable’ only make sense if one assumes there to be a ground y that is certain (where x and y may be beliefs, propositions, or events). Without this assumption, Lewis argues, the probability of x could not be anything other than zero. Hans Reichenbach repeatedly contested Lewis’s idea, calling it “a remnant of rationalism”. The last move in this debate was a challenge by Lewis, defying Reichenbach to produce a regress of probability values that yields a number other than zero. Reichenbach never took up the challenge, but we will meet it on his behalf, as it were. By presenting a series converging to a limit, we demonstrate that x can have a definite and computable probability, even if its justification consists of an infinite number of steps. Next we show the invalidity of a recent riposte of foundationalists that this limit of the series can be the ground of justification. Finally we discuss the question where justification can come from if not from a ground.

Justification by Infinite Loops

In an earlier paper we have shown that a proposition can have a well-defined probability value, even if its justification consists of an infinite linear chain. In the present paper we demonstrate that the same holds if the justification takes the form of a closed loop. Moreover, in the limit that the size of the loop tends to infinity, the probability value of the justified proposition is always well-defined, whereas this is not always so for the infinite linear chain. This suggests that infinitism sits more comfortably with a coherentist view of justification than with an approach in which justification is portrayed as a linear process.

The Solvability of Probabilistic Regresses. A Reply to Frederik Herzberg

We have earlier shown by construction that a proposition can have a welldefined nonzero probability, even if it is justified by an infinite probabilistic regress. We thought this to be an adequate rebuttal of foundationalist claims that probabilistic regresses must lead either to an indeterminate, or to a determinate but zero probability. In a comment, Frederik Herzberg has argued that our counterexamples are of a special kind, being what he calls ‘solvable’. In the present reaction we investigate what Herzberg means by solvability. We discuss the advantages and disadvantages of making solvability a sine qua non, and we ventilate our misgivings about Herzberg’s suggestion that the notion of solvability might help the foundationalist.We further show that the canonical series arising from an infinite chain of conditional probabilities always converges, and also that the sum is equal to the required unconditional probability if a certain infinite product of conditional probabilities vanishes.

Akrasia, Dispositions And Degrees

It is argued that the recent revival of theakrasia problem in the philosophy of mind is adirect, albeit unforeseen result of the debate onaction explanation in the philosophy of science. Asolution of the problem is put forward that takesaccount of the intimate links between the problem ofakrasia and this debate. This solution is basedon the idea that beliefs and desires have degrees ofstrength, and it suggests a way of giving a precisemeaning to that idea. Finally, it is pointed out thatthe solution captures certain intuitions of bothSocrates and Aristotle.

Probability as a theory dependent concept

It is argued that probability should be defined implicitly by the distributions of possible measurement values characteristic of a theory. These distributions are tested by, but not defined in terms of, relative frequencies of occurrences of events of a specified kind. The adoption of an a priori probability in an empirical investigation constitutes part of the formulation of a theory. In particular, an assumption of equiprobability in a given situation is merely one hypothesis inter alia, which can be tested, like any other assumption. Probability in relation to some theories – for example quantum mechanics – need not satisfy the Kolmogorov axioms. To illustrate how two theories about the same system can generate quite different probability concepts, and not just different probabilistic predictions, a team game for three players is described. If only classical methods are allowed, a 75% success rate at best can be achieved. Nevertheless, a quantum strategy exists that gives a 100% probability of winning.

A case of confusing probability and confirmation

Tom Stoneham put forward an argument purporting to show that coherentists are, under certain conditions, committed to the conjunction fallacy. Stoneham considers this argument a reductio ad absurdum of any coherence theory of justification. I argue that Stoneham neglects the distinction between degrees of confirmation and degrees of probability. Once the distinction is in place, it becomes clear that no conjunction fallacy has been committed.