Carnap's Inductive Logic, like most philosophical discussions of induction, is designed for the case of independent trials. To take account of periodicities, and more generally of order, the account must be extended. From both a physical and a probabilistic point of view, the first and fundamental step is to extend Carnap's inductive logic to the case of finite Markov chains. Kuipers (1988) and Martin (1967) suggest a natural way in which this can be done. The probabilistic character of Carnapian inductive (...) logic(s) for Markov chains and their relationship to Carnap's inductive logic(s) is discussed at various levels of Bayesian analysis. (shrink)

Let R(X, B) denote the class of probability functions that are defined on algebra X and that represent rationally permissible degrees of certainty for a person whose total relevant background evidence is B. This paper is concerned with characterizing R(X, B) for the case in whichX is an algebra of propositions involving two properties and B is empty. It proposes necessary conditions for a probability function to be in R(X, B), some of which involve the notion of statistical dependence. The (...) class of probability functions that satisfy these conditions, here denoted PI, includes a class that Carnap once proposed for the same situation. Probability functions in PI violate Carnap's axiom of analogy but, it is argued, that axiom should be rejected. A derivation of Carnap's model by Hesse has limitations that are not present in the derivation of PI given here. Various alternative probability models are considered and rejected. (shrink)

In section I the notions of logical and inductive probability will be discussed as well as two explicanda, viz. degree of confirmation, the base for inductive probability, and degree of evidential support, Popper's favourite explicandum. In section II it will be argued that Popper's paradox of ideal evidence is no paradox at all; however, it will also be shown that Popper's way out has its own merits.

An important problem in inductive probability theory is the design of exchangeable analogical methods, i.e., of exchangeable inductive methods that take into account certain considerations of analogy by similarity for predictive inferences. Here a precise reformulation of the problem of predictive analogy is given and a new family of exchangeable analogical methods is introduced.Firstly, it is proved that the exchangeable analogical method introduced by Skyrms (1993) does not satisfy the best known general principles of predictive analogy. Secondly, Skyrms's approach — (...) consisting of the usage of particular hyper-Carnapian methods, i.e., mixtures of Carnapian inductive methods — is adopted in the design of a new family of exchangeable analogical methods. Lastly, it is proved that such methods satisfy an interesting general principle of predictive analogy. (shrink)

The paper explores the handling of singular analogy in quantitative inductive logics. It concentrates on two analogical patterns coextensive with the traditional argument from analogy: perfect and imperfect analogy. Each is examined within Carnap’s λ-continuum, Carnap’s and Stegmüller’s λ-η continuum, Carnap’s Basic System, Hintikka’s α-λ continuum, and Hintikka’s and Niiniluoto’s K-dimensional system. Itis argued that these logics handle perfect analogies with ease, and that imperfect analogies, while unmanageable in some logics, are quite manageable in others. The paper concludes with a (...) modification of the K-dimensional system that synthesizes independent proposals by Kuipers and Niiniluoto. (shrink)