The twin goals of this essay are: to investigate a family of cases in which the goal of guaranteed convergence to the truth is beyond our reach; and to argue that each of three strands prominent in contemporary epistemological thought has undesirable consequences when confronted with the existence of such problems. Approaches that follow Reichenbach in taking guaranteed convergence to the truth to be the characteristic virtue of good methods face a vicious closure problem. Approaches on which there is a (...) unique rational doxastic response to any given body of evidence can avoid incoherence only by rendering epistemology a curiously limited enterprise. Bayesian approaches rule out humility about one’s prospects of success in certain situations in which failure is typical. (shrink)

Probability and logic are two branches of mathematics that have important philosophical applications. This article discusses several areas of intersection between them. Several involve the role for probability in giving semantics for logic or the role of logic in governing assignments of probability. Some involve probability over non-classical logic or self-referential sentences.

A piece of folklore enjoys some currency among philosophical Bayesians, according to which Bayesian agents that, intuitively speaking, spread their credence over the entire space of available hypotheses are certain to converge to the truth. The goals of the present discussion are to show that kernel of truth in this folklore is in some ways fairly small and to argue that Bayesian convergence-to-the-truth results are a liability for Bayesianism as an account of rationality, since they render a certain sort of (...) arrogance rationally mandatory. (shrink)

An inductive logic is a system of inference that describes the relation between propositions on data, and propositions that extend beyond the data, such as predictions over future data, and general conclusions on all possible data. Statistics, on the other hand, is a mathematical discipline that describes procedures for deriving results about a population from sample data. These results include predictions on future samples, decisions on rejecting or accepting a hypothesis about the population, the determination of probability assignments over such (...) hypotheses, the selection of a statistical model for studying the population, and so on. Both inductive logic and statistics are calculi for getting from the given data to propositions or results that transcend the data. (shrink)

This chapter has two objectives. The first is to clarify Aristotle’s view of the first principles of the sciences. The second is to stake out a critical position with respect to this view. The paper sketches an alternative to Aristotle’s intuitionism based in part on the use of quantitative inductive logics.

Putnam construed the aim of Carnap’s program of inductive logic as the specification of a “universal learning machine,” and presented a diagonal proof against the very possibility of such a thing. Yet the ideas of Solomonoff and Levin lead to a mathematical foundation of precisely those aspects of Carnap’s program that Putnam took issue with, and in particular, resurrect the notion of a universal mechanical rule for induction. In this paper, I take up the question whether the Solomonoff–Levin proposal is (...) successful in this respect. I expose the general strategy to evade Putnam’s argument, leading to a broader discussion of the outer limits of mechanized induction. I argue that this strategy ultimately still succumbs to diagonalization, reinforcing Putnam’s impossibility claim. (shrink)

L'idée d'associer probabilité et induction n'est pas propre au xxe siècle, mais elle a reçu un développement systématique lorsque les philosophes néo-positivistes s'en sont emparés. Dès les années 1940, le philosophe Rudolf Carnap s'est proposé de relever le «défi humien» en fondant une théorie de la confirmation par la construction d'une logique probabiliste dite «inductive». Ce projet avait été esquissé à Cambridge dans les années 1920 par l'économiste John M. Keynes. Examiner le programme de Carnap dans sa totalité, le situer (...) dans son contexte historique, suivre son évolution et les influences qu'il a eues, tels sont les buts de cet article. The idea of associating probability and induction is not a theme suitable for the xxth century but it has received a systematic development when the neo-positivist philosophers seized it. Beginning with the 1940's, the philosopher Rudolph Carnap proposed to affront the «Humian challenge» by founding a theory of confirmation through the construction of a probabilistic logic called «inductive». This project had been outlined in Cambridge during the 1920's by the economist John M. Keynes. To examine Carnap's program in its totality, to situate it in its historical context, to follow its evolution and the influences it has had, these are the aims of this article. (shrink)

In this thesis I investigate the theoretical possibility of a universal method of prediction. A prediction method is universal if it is always able to learn from data: if it is always able to extrapolate given data about past observations to maximally successful predictions about future observations. The context of this investigation is the broader philosophical question into the possibility of a formal specification of inductive or scientific reasoning, a question that also relates to modern-day speculation about a fully automatized (...) data-driven science. I investigate, in particular, a proposed definition of a universal prediction method that goes back to Solomonoff and Levin. This definition marks the birth of the theory of Kolmogorov complexity, and has a direct line to the information-theoretic approach in modern machine learning. Solomonoff's work was inspired by Carnap's program of inductive logic, and the more precise definition due to Levin can be seen as an explicit attempt to escape the diagonal argument that Putnam famously launched against the feasibility of Carnap's program. The Solomonoff-Levin definition essentially aims at a mixture of all possible prediction algorithms. An alternative interpretation is that the definition formalizes the idea that learning from data is equivalent to compressing data. In this guise, the definition is often presented as an implementation and even as a justification of Occam's razor, the principle that we should look for simple explanations. The conclusions of my investigation are negative. I show that the Solomonoff-Levin definition fails to unite two necessary conditions to count as a universal prediction method, as turns out be entailed by Putnam's original argument after all; and I argue that this indeed shows that no definition can. Moreover, I show that the suggested justification of Occam's razor does not work, and I argue that the relevant notion of simplicity as compressibility is already problematic itself. (shrink)

Learning to take turns in repeated game situations is a robust phenomenon in both laboratory experiments and in everyday life. Nevertheless, it has received little attention in recent studies of learning dynamics in games. We investigate the simplest and most obvious extension of fictitious play to a learning rule that can recognize patterns, and show how players using this rule can spontaneously learn to take turns.

Surprisingly, modified versions of the confirmation theory (Carnap and Hempel) and truth approximation theory (Popper) turn out to be smoothly sythesizable. The glue between the two appears to be the instrumentalist methodology, rather than that of the falsificationalist. The instrumentalist methodology, used in the separate, comparative evaluation of theories in terms of their successes and problems (hence, even if already falsified), provides in theory and practice the straight road to short-term empirical progress in science ( à la Laudan). It is (...) also argued that such progress is also functional for all kinds of truth approximation: observational, referential, and theoretical. This sheds new light on the long-term dynamics of science and hence on the relation between the main epistemological positions, viz., instrumentalism (Toulmin, Laudan), constructive empiricism (Van Fraassen), referential realism (Hacking, Cartwright), and theory realism of a non-essentialist nature (constructive realism à la Popper). Readership: Open minded philosophers and scientists. The book explains and justifies the scientist's intuition that the debate among philosophers about instrumentalism and realism has almost no practical consequences. (shrink)

This volume recreates the received notion of reflective equilibrium. It reconfigures reflective equilibrium as both a cognitive ideal and a method for approximating this ideal. The ideal of reflective equilibrium is restructured using the concept of discursive strata, which are formed by sentences and differentiated by function. Sentences that perform the same kind of linguistic function constitute a stratum. The book shows how moral discourse can be analyzed into phenomenal, instrumental, and teleological strata, and the ideal of reflective equilibrium reworked (...) in these terms. In addition, the work strengthens the method of reflective equilibrium by harnessing the resources of decision theory and inductive logic. It launches a comparative version of decision theory and employs this framework as a guide to moral theory choice. It also recruits quantitative inductive logic to inform a standard of inductive cogency. When used in tandem with comparative decision theory, this standard can aid in the effort to turn the undesirable condition of reflective disequilibrium into reflective equilibrium. (shrink)

We study a simple game theoretic model of information transfer which we consider to be a baseline model for capturing strategic aspects of epistemological questions. In particular, we focus on the question whether simple learning rules lead to an efficient transfer of information. We find that reinforcement learning, which is based exclusively on payoff experiences, is inadequate to generate efficient networks of information transfer. Fictitious play, the game theoretic counterpart to Carnapian inductive logic and a more sophisticated kind of learning, (...) suffices to produce efficiency in information transfer. (shrink)