A number of evaluations of the general prospects of Carnap's program of inductive logic have been presented on different occasions (e.g., Adler 1980, Jeffrey 1973, Kuipers 1984a, Lakatos 1968, Niiniluoto 1982). Niiniluoto's and my own account are the most positive about the internal strength of the program, provided one includes open systems of inductive probability, i.e., systems with non-zero probabilities for contingent universal generalizations. As is well-known, this was done for the first time by Hintikka.
This paper will not add a new evaluation to the list. Instead, I will show that the internal heuristic of Carnap's restricted program is already strong enough to solve one of its major problems, i.e., the problem of integrating analogy influences in systems of inductive probability.
Carnap has given considerable attention to the problem of analogy; to be precise, to what he called analogy by similarity, or analogy influences based on a distance function between the predicates.