This article seeks to state, first, what traditionally has been assumed must be the case in order for an infinite epistemic regress to arise. It identifies three assumptions. Next it discusses Jeanne Peijnenburg's and David Atkinson's setting up of their argument for the claim that some infinite epistemic regresses can actually be completed and hence that, in addition to foundationalism, coherentism, and infinitism, there is yet another solution (if only a partial one) to the traditional epistemic regress problem. The article (...) argues that Peijnenburg and Atkinson fail to address the traditional regress problem, as they don't adopt all of the three assumptions that underlie the traditional regress problem. It also points to a problem in the notion of making probable that Peijnenburg and Atkinson use in their account of justification. (shrink)

This article seeks to state, first, what traditionally has been assumed must be the case in order for an infinite epistemic regress to arise. It identifies three assumptions. Next it discusses Jeanne Peijnenburg's and David Atkinson's setting up of their argument for the claim that some infinite epistemic regresses can actually be completed and hence that, in addition to foundationalism, coherentism, and infinitism, there is yet another solution (if only a partial one) to the traditional epistemic regress problem. The article (...) argues that Peijnenburg and Atkinson fail to address the traditional regress problem, as they don't adopt all of the three assumptions that underlie the traditional regress problem. It also points to a problem in the notion of making probable that Peijnenburg and Atkinson use in their account of justification. (shrink)

There is a long-standing debate in epistemology on the structure of justification. Some recent work in formal epistemology promises to shed some new light on that debate. I have in mind here some recent work by David Atkinson and Jeanne Peijnenburg, hereafter “A&P”, on infinite regresses of probabilistic support. A&P show that there are probability distributions defined over an infinite set of propositions {\ such that \ is probabilistically supported by \ for all i and \ has a high probability. (...) Let this result be “APR”. A&P oftentimes write as though they believe that APR runs counter to foundationalism. This makes sense, since there is some prima facie plausibility in the idea that APR runs counter to foundationalism, and since some prominent foundationalists argue for theses inconsistent with APR. I argue, though, that in fact APR does not run counter to foundationalism. I further argue that there is a place in foundationalism for infinite regresses of probabilistic support. (shrink)

Recent work by Peijnenburg, Atkinson, and Herzberg suggests that infinitists who accept a probabilistic construal of justification can overcome significant challenges to their position by attending to mathematical treatments of infinite probabilistic regresses. In this essay, it is argued that care must be taken when assessing the significance of these formal results. Though valuable lessons can be drawn from these mathematical exercises (many of which are not disputed here), the essay argues that it is entirely unclear that the form of (...) infinitism that results meets a basic requirement: namely, providing an account of infinite chains of propositions qua reasons made available to agents. (shrink)

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

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. (shrink)

In an earlier paper I argued that there are cases in which an infinite probabilistic chain can be completed. According to Jeremy Gwiazda, however, I have merely shown that the chain in question can be computed, not that it can be completed. Gwiazda thereby discriminates between two terms that I used as synonyms. In the present paper I discuss to what extent computability and completability can be meaningfully distinguished.

In this article we analyze the claim that a probabilistic interpretation of the infinite epistemic regress problem leads to a unique solution, the so called “completion” of the regress. This claim is implicitly based on the assumption that the standard Kolmogorov axioms of probability theory are suitable for describing epistemic probability. This assumption, however, has been challenged in the literature, by various authors. One of the alternatives that have been suggested to replace the Kolmogorov axioms in case of an epistemic (...) interpretation of probability, are belief functions, introduced by Shafer in 1976. We show that when one uses belief functions to describe the infinite epistemic regress problem, it is no longer the case that the solution is unique. We also argue that this complies with common sense. (shrink)

This note employs the recently established consistency theorem for infinite regresses of probabilistic justification (Herzberg in Stud Log 94(3):331–345, 2010) to address some of the better-known objections to epistemological infinitism. In addition, another proof for that consistency theorem is given; the new derivation no longer employs nonstandard analysis, but utilises the Daniell–Kolmogorov theorem.

This paper formally explores the common ground between mild versions of epistemological coherentism and infinitism; it proposes—and argues for—a hybrid, coherentist–infinitist account of epistemic justification. First, the epistemological regress argument and its relation to the classical taxonomy regarding epistemic justification—of foundationalism, infinitism and coherentism—is reviewed. We then recall recent results proving that an influential argument against infinite regresses of justification, which alleges their incoherence on account of probabilistic inconsistency, cannot be maintained. Furthermore, we prove that the Principle of Inferential Justification (...) has rather unwelcome consequences—formally resembling the Sorites paradox—as soon as it is iterated and combined with a natural Bayesian perspective on probabilistic inferences. We conclude that strong versions of foundationalism and infinitism should be abandoned. Positively, we provide a rough sketch for a graded formal coherence notion, according to which infinite regresses of epistemic justification will often have more than a minimal degree of coherence. (shrink)

In a recent paper, Jeanne Peijnenburg and David Atkinson [ Studia Logica, 89:333-341 ] have challenged the foundationalist rejection of infinitism by giving an example of an infinite, yet explicitly solvable regress of probabilistic justification. So far, however, there has been no criterion for the consistency of infinite probabilistic regresses, and in particular, foundationalists might still question the consistency of the solvable regress proposed by Peijnenburg and Atkinson.

In ‘Infinitism Regained’, Jeanne Peijnenburg argues for a version of infinitism wherein ‘beliefs may be justified by an infinite chain of reasons that can be actually completed’. I argue that Peijnenburg has not successfully argued for this claim, but rather has shown that certain infinite series can be computed.

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. (shrink)

Reichenbach’s use of ‘posits’ to defend his frequentistic theory of probability has been criticized on the grounds that it makes unfalsifiable predictions. The justice of this criticism has blinded many to Reichenbach’s second use of a posit, one that can fruitfully be applied to current debates within epistemology. We show first that Reichenbach’s alternative type of posit creates a difficulty for epistemic foundationalists, and then that its use is equivalent to a particular kind of Jeffrey conditionalization. We conclude that, under (...) particular circumstances, Reichenbach’s approach and that of the Bayesians amount to the same thing, thereby presenting us with a new instance in which chance and credence coincide. (shrink)

In a recent paper Ronald Meester and Timber Kerkvliet argue by example that infinite epistemic regresses have different solutions depending on whether they are analyzed with probability functions or with belief functions. Meester and Kerkvliet give two examples, each of which aims to show that an analysis based on belief functions yields a different numerical outcome for the agent’s degree of rational belief than one based on probability functions. In the present paper we however show that the outcomes are the (...) same. The only way in which probability functions and belief functions can yield different solutions for the agent’s degree of belief is if they are applied to different examples, i.e. to different situations in which the agent finds himself. (shrink)

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.

This article poses two regresses for justification of moral knowledge and discusses three models for moral epistemic infinitism that arise. There are moral infinitisms dependent on empirical infinitism, what are called “piggyback” moral infinitisms. There are substantive empiricist moral infinitisms, requiring infinite chains of descriptive facts to justify normative rules. These empiricist infinitisms are developed either as infinitist egoisms or as infinitist sentimentalisms. And, finally, there are substantive rationalist moral infinitisms, requiring infinite chains of normative reasons to justify moral rules. (...) Rationalist moral infinitism is posed as a mixed view integrating moral intuitions with the demand for justifying reasons. (shrink)

‘Bayesian epistemology’ became an epistemological movement in the 20th century, though its two main features can be traced back to the eponymous Reverend Thomas Bayes (c. 1701-61). Those two features are: (1) the introduction of a formal apparatus for inductive logic; (2) the introduction of a pragmatic self-defeat test (as illustrated by Dutch Book Arguments) for epistemic rationality as a way of extending the justification of the laws of deductive logic to include a justification for the laws of inductive logic. (...) The formal apparatus itself has two main elements: the use of the laws of probability as coherence constraints on rational degrees of belief (or degrees of confidence) and the introduction of a rule of probabilistic inference, a rule or principle of conditionalization. (shrink)

Is it possible for an argument to have either zero premises or an infinite number of premises? I shall argue that regardless of how you conceive of arguments you should accept that an argument could have an infinite number of premises. The zero case is more complicated since the matter seems to depend not only on the metaphysics of arguments, but also the nature and function of arguing. I shall argue that at least a plausible case can be made for (...) the possibility of zero premise arguments. (shrink)

This dissertation is on infinite regress arguments in philosophy. Its main goals are to explain what such arguments from many distinct philosophical debates have in common, and to provide guidelines for using and evaluating them. Two theories are reviewed: the Paradox Theory and the Failure Theory. According to the Paradox Theory, infinite regress arguments can be used to refute an existentially or universally quantified statement (e.g. to refute the statement that at least one discussion is settled, or the statement that (...) discussions are settled only if there is an agreed-upon criterion to settle them). According to the Failure Theory, infinite regress arguments can be used to demonstrate that a certain solution fails to solve an existentially or universally quantified problem (e.g. to demonstrate that a certain solution fails to settle all discussions, or that it fails to settle even one discussion). In the literature, the Paradox Theory is fairly well-developed, and this dissertation provides the Failure Theory with the same tools. (shrink)

In this paper I fix a typical regress argument, locate a typical gap in the argument, and try to supply a number of gap-filling readings of its first premise.