The Principle of Indifference is a central element of the ‘classical’ conception of probability, but, for all its strong intuitive appeal, it is widely believed that it faces a devastating objection: the so-called (by Poincare´) ‘Bertrand paradoxes’ (in essence, cases in which the same probability question receives different answers). The puzzle has fascinated many since its discovery, and a series of clever solutions (followed promptly by equally clever rebuttals) have been proposed. However, despite the long-standing interest in this problem, an (...) important assumption, necessary for its generation, has been overlooked. My aim in this paper is to identify this assumption. Since what it claims turns out to be prima facie problematic, I will urge that the burden of proof now shifts to the objectors to PI; they have to provide reasons why this assumption holds. (shrink)

Responding to the paradox of inference and the related problems in philosophy of logic, this paper argues for the necessity of distinguishing between two different objects of justification: logica utens and logica docens. Then, equipped with Peirce’s critical common-sensist conception of logica utens and his classification of sciences, I propose a diagnosis of and a solution to the problem of justification of logic. I argue that this alternative approach successfully avoids circularity in which most attempts in philosophy of logic have (...) been inescapably trapped. I also anticipate and respond to possible objections to taking a Peircean turn in justifying logic. (shrink)

(No abstract is available for this citation).

Tarski's Undefinability of Truth Theorem comes in two versions: that no consistent theory which interprets Robinson's Arithmetic (Q) can prove all instances of the T-Scheme and hence define truth; and that no such theory, if sound, can even express truth. In this note, I prove corresponding limitative results for validity. While Peano Arithmetic already has the resources to define a predicate expressing logical validity, as Jeff Ketland has recently pointed out (2012, Validity as a primitive. Analysis 72: 421-30), no theory (...) which interprets Q closed under the standard structural rules can define nor express validity, on pain of triviality. The results put pressure on the widespread view that there is an asymmetry between truth and validity, viz. that while the former cannot be defined within the language, the latter can. I argue that Vann McGee's and Hartry Field's arguments for the asymmetry view are problematic. (shrink)

In this article, I argue that it is impossible to complete infinitely many tasks in a finite time. A key premise in my argument is that the only way to get to 0 tasks remaining is from 1 task remaining, when tasks are done 1-by-1. I suggest that the only way to deny this premise is by begging the question, that is, by assuming that supertasks are possible. I go on to present one reason why this conclusion (that supertasks are (...) impossible) is important, namely that it implies a new verdict on a decision puzzle propounded by Jeffrey Barrett and Frank Arntzenius. (shrink)