Professional Documents
Culture Documents
Studies in Inductive Logic and Probability Volume 1 Rudolf Carnap Editor Online Ebook Texxtbook Full Chapter PDF
Studies in Inductive Logic and Probability Volume 1 Rudolf Carnap Editor Online Ebook Texxtbook Full Chapter PDF
https://ebookmeta.com/product/studies-in-inductive-logic-and-
probability-volume-2-richard-c-jeffrey-editor/
https://ebookmeta.com/product/40-paradoxes-in-logic-probability-
and-game-theory-presh-talwalkar/
https://ebookmeta.com/product/studies-in-medieval-philosophy-
science-and-logic-ernest-a-moody/
https://ebookmeta.com/product/american-studies-in-europe-
volume-1-their-history-and-present-organization-sigmund-skard/
Bracha L Ettinger Matrixial Subjectivity Aesthetics
Ethics Volume 1 1990 2000 Volume 1 1990 2000 Studies in
the Psychosocial Ettinger
https://ebookmeta.com/product/bracha-l-ettinger-matrixial-
subjectivity-aesthetics-ethics-
volume-1-1990-2000-volume-1-1990-2000-studies-in-the-
psychosocial-ettinger/
https://ebookmeta.com/product/california-studies-in-classical-
antiquity-volume-8-california-studies-in-classical-antiquity-
volume-8/
https://ebookmeta.com/product/california-studies-in-classical-
antiquity-volume-7-california-studies-in-classical-antiquity-
volume-7/
https://ebookmeta.com/product/christianity-and-the-eastern-slavs-
volume-1-california-slavic-studies-volume-viii-nicholas-v-
riasanovsky-editor/
https://ebookmeta.com/product/selected-collected-works-
volume-2-probability-theory-and-extreme-value-theory/
Studies in Inductive
Logic and Probability
VOLUME I
Studies in Inductive
Logic and Probability
VOLUME I
EDITORS
U N I V E R S I T Y OF C A L I F O R N I A PRESS
B E R K E L E Y • LOS A N G E L E S • L O N D O N • 1971
University of California Press
Berkeley and Los Angeles
ISBN: 0-520-01866-4
Introduction 1
1. Decision Making 7
2. Actual Decisions 11
3. Rational Decisions 13
4. Credibility 17
5. Permanent Dispositions 21
6. Inductive Logic 25
7. The Question of Acceptance 29
Postscript
Carnap died in September, 1970, after a brief illness. He had
finished revising all but the last two sections of the continuation of the
Basic System (Art. 2) which will appear in Volume II. These last two
sections are now being revised by Lary Kuhns and Gordon Matthews,
who had been working with Carnap over the years, and with whom
Carnap had discussed the two sections in detail.
The Introduction above is a draft, written by me and incompletely
revised by Carnap, who approved it and sent me some additional notes,
which are reproduced below essentially as he wrote them. They give
some of the further facts he wanted mentioned.
Thanks are due to Carnap's assistant, Brooks Colburn, for
proofreading Articles 1 and 2, and for other help; and to Hannaliese
INTRODUCTION 3
Carnap had many talks with Hilary Putnam; also some talks with Kurt
Godel. [I hope to provide more material on the second year later, when
I shall have read more of my diary.]
1954-1962: Carnap was teaching at UCLA. He had many talks
with philosophers and others who came to Los Angeles for a time,
often for work at the Rand Corporation.
Kemeny and Richard Jeffrey were Research Associates in Carnap's
research grant NSF (2) for 1959-62. Jeffrey had written his doctoral
dissertation on inductive logic with Hempel.
Research Assistants
Gordon Matthews and Lary John Kuhns (financed by Research
Committee of UCLA 1957-63; later by NSF grants (3) and (4), see
below).
Haim Gaifman, 1959-60 (NSF grant (2)).
Peter Krauss, 1962-63 (NSF grant (3)).
Institutions and Foundations
Institute for Advanced Study, Princeton, 1952-54. Stipend from the
institute, supplemented in the first year by:
Bollingen Foundation, 1952-53, and NSF (1), and in the second
year by:
John Simon Guggenheim Memorial Foundation, 1953-54.
UCLA Research Committee, 1957-62: yearly grants for Research
Assistants Matthews and Kuhns.
Office of Naval Research: Contract Nonr-233(55). July 1, 1961-
January 31, 1963, only for Research Assistant Krauss.
National Science Foundation:
(1) Grant G163.
(2) Grant G7585.
(3) Grant G22315.
(4) Grant GS550; this is a continuation of (3).
I wish to express my deep appreciation for the support of my
research work by the Institute and the foundations listed above.
Rudolf Carnap
May 21, 1970
1
BY R U D O L F C A R N A P
1
Decision Making1
CXX T{E) > 0. Cr'X,T{H | E) is the credence that H would have for X
at TIF X ascertained that E holds.
Using the concept of credence, we now replace the definition of
value (1) by the following:
(5) Definition. VX T(Am) = £ [Ux{Om,n)Cvx_T{Wn)].
n
As was pointed out by Frank P. Ramsey, we can determine X's
credence function by his betting behavior. A bet is a contract of the
following form: Xpays into the pool the amount u, his partner Y pays
the amount v; they agree that the total stake u + v goes to X if the
hypothesis H turns out to be true, and to Y if it turns out to be false.
If X accepts this contract, we say that he bets on H with the total stake
u + v and with the betting quotient q = uj(u + v) (or, at odds of u to v).
If we apply the decision principle with the definition (5) to the situation
in which X may either accept or reject an offered bet on H with the
betting quotient q, we find that X will accept the bet if q is not larger
than his credence for H. Thus we may interpret CrX T(H) as the
12 STUDIES IN INDUCTIVE LOGIC AND PROBABILITY
but not by any other factors, e.g., feelings like his hopes or fears
concerning a possible future event H, feelings that in fact often influence
the beliefs of all actual human beings. Part (b) specifies exactly the
transformation of Cr„ into Cr n+1 ; the latter is the conditional credence
Cr'n with respect to E. The rule (b) can be used only if Cr n (E) ^ 0;
this condition is fulfilled for any possible observational result, provided
that Cr n satisfies the requirement of strict coherence.
4
Credibility
Let the proposition En+2 represent the data obtained between Tn+1
and a later time point Tn+2. Let Crn+2 be the credence function at Tn+2
obtained by R3(b) from Cr K + 1 with respect to En+2. It can easily be
shown that the same function Cr„ + 2 results if R3(b) is applied to Cr n
with respect to the combined data En+1 n En+2. In the same way we can
determine any later credence function C r „ + m from the given function
Cr„ either in m steps, applying the rule R3(b) in each step to one datum
of the sequence En+2,. . . , En+m, or in one step to the intersection
m
| J En+V. If m is large so that the intersection contains thousands of
3>=1
single data, the objection might be raised that it is unrealistic to think
of a procedure of this kind, because a man's memory is unable to
retain and reproduce at will so many items. Since, however, our goal is
not the psychology of actual human behavior in the field of inductive
reasoning, but rather inductive logic as a system of rules, we do not aim
at realism. We may make the further idealizing assumption that X is
not only perfectly rational but has also an infallible memory. Our
assumptions deviate from reality very much if the observer X is a
natural human being, but not so much if we think of X as a robot with
organs of perception, memory, data processing, decision making, and
acting. Thinking about the design of a robot might help us in finding
rules of rationality. Once found, these rules can be applied not only in
the construction of a robot but also in advising human beings in their
effort to make their decisions as rational as their limited abilities permit.
Consider now the whole sequence of data obtained by X up to the
present time Tn: Elt E2, • • • , En. Let J^x,T n or > f ° r short, Kn be the
proposition representing the combination of all these data:
Cr 0 for the time point T0 before he obtains his first datum Ev Any later
function Cr„ for a time point Tn is uniquely determined by Cr 0 and Kn:
(12) For any H, C r n ( H ) = Cr' 0 (H \ Kn), where Cr; is the condi-
tional function based on Cr„.
C r n { H ) is thus seen to be the conditional initial credence of H
given Kn.
How can we understand the function Cr 0 ? In terms of the robot,
Cr 0 is the credence function that we originally build in and that he
transforms step for step, with regard to the incoming data, into the later
credence functions. In the case of a human being X, suppose that we
find at the time Tn his credence function Cr„. Then we can, under
suitable conditions, reconstruct a sequence Eu . . . , En, the proposition
Kn, and a function Cr 0 such that (a) Eu . . . ,En are possible observation
data, (b) Kn is defined by (11), (c) Cr 0 satisfies all requirements of
rationality for initial credence functions, and (d) the application of
(12) to the assumed function Cr 0 and Kn would lead to the ascertained
function Cr n . We do not assert that X actually experienced the
data Eu . . . , En, and that he actually had the initial credence function
Cr„, but merely that, under idealized conditions, his function Cr n
could have evolved from Cr 0 by the effect of the data El,.. . , En.
For the conditional initial credence function (Cr^) we shall also
use the term "credibility function" and the symbol 'Cred'. As an alter-
native to defining 'Cred' on the basis of 'Cr 0 ', we could introduce it as a
primitive term. In this case we may take the following universal state-
ment as the main postulate for the theoretical primitive term 'Cred':
(13) Let Cred be any function from pairs of propositions to real
numbers, satisfying all requirements which we have laid down or shall
lay down for credibility functions. Let H and A be any propositions
(A not empty). Let X be any observer and T any time point. If A"s
credibility function is Cred and his total observational knowledge at
Tis A, then his credence for H at 7" is Cred(//1 A).
Note that (13) is much more general than (12). There the function
Cred (or Cr^) was applied only to those pairs H, A, in which A is a
proposition of the sequence Kx, K2, . . . , and thus represents the actual
observational knowledge of A" at some time point. In (13), however, A
may be any nonempty proposition. Let A1 be a certain nonempty
proposition that does not occur in sequence Ku K2, . . . , and Hx some
proposition. Then the statement
C r T ( / f x ) = Cred(//j | A J
is to be understood as a counterfactual conditional as follows:
(14) Let X's credibility function be 'Cred'. If his total observa-
tional knowledge at some time point T had been Ar, then his credence
for Hx at T would have been equal to Cred(// X | At).
INDUCTIVE LOGIC A N D RATIONAL DECISIONS 19
function Cred and the man X' characterized by this function. Our
argument would here, as frequently in an intellectual or moral con-
demnation, be expressed in a counterfactual conditional as follows:
if the total knowledge of X' had at some time been E, or E together
with irrelevant data, then his credence for H would have had the
unreasonable value 2/3. The same considerations hold, of course, for
the initial credence function Cr 0 corresponding to the function Cred;
for, on the basis of any possible knowledge proposition K, Cr 0 and Cred
would lead to the same credence function.
The following is an example of a requirement of rationality for Cr 0
(and hence for Cred) which has no analogue for credence functions.
As we shall see later, this requirement leads to one of the most impor-
tant axioms of inductive logic. (The term "individual" means "element
of the universe of discourse", or "element of the population" in the
terminology of statistics.)
R4. Requirement of symmetry. Let at and a, be two distinct
individuals. Let H and H' be two propositions such that H' results
from H by taking a3 for a( and vice versa. Then Cr 0 should be such that
Cr„( H) = Cr 0 (//')- (I n other words, Cr 0 should be invariant with
respect to any finite permutation of individuals.)
This requirement seems indispensable. H and H' have exactly the
same logical form; they differ merely by their reference to two distinct
individuals. These individuals may happen to be quite different. But
since their differences are not known to X at time T0, they cannot have
any influence on the Cr 0 -values of H and H'. Suppose, however, that at
a later time Tn, X's knowledge Kn contains information E relevant to
H and H', say information making H more probable than H' (as an
extreme case, E may imply that H is true and H' is false). Then X's
credence function Cr n at Tn will have different values for H and for H'.
Thus it is clear that R4 applies only to Cr„, but is not generally valid
for other credence functions Cr„ (n > 0).
Suppose that X is a robot constructed by us. Since the propositions
H and H' are alike in all their logical properties, it would be entirely
arbitrary and therefore unreasonable for us to assign to them different
Cr 0 -values in the construction of X.
A function Cr 0 is suitable for being built into a robot only if it
fulfills the requirements of rationality; and most of these requirements
apply only to Cr 0 (and Cred) but not generally to other credence
functions.
6
Inductive Logic
Let us apply this new view of the essential task of inductive reason-
ing to the earlier example. Let H be the prediction of rain for tomorrow.
According to the new view, X does not assert the prediction H, but
merely the following statements (where the value 0.99 serves simply as
an example):
(19) (a) At the present moment Tn, the totality of A^s observation
results is Kn.
BY R U D O L F C A R N A P
1
Basic Concepts and Basic Axioms
A. BASIC CONCEPTS
We use 'H\ 'A', ' 5 ' , etc., for propositions. Thus '<g(H\Ey
takes the place of the earlier 'c(A, e)\ where h and e were sentences.
Since propositions will be defined as certain sets, set connectives will
be used instead of sentence connectives. Thus the complement — E
corresponds to the negation the intersection E n H corresponds
to the conjunction e. h, and the union E U H corresponds to the
disjunction e v h. The necessary proposition Z (the set of all models, §3)
corresponds to any tautological sentence; the empty (or impossible)
proposition 0 corresponds to any self-contradictory sentence. Inclu-
sion, e.g., E c H, corresponds to logical implication, e.g., V e => h.
Other set-theoretic notations: {x} is the set whose only element is
x; analogously, {x,y}, {x l 5 . . . , xn}. {x: . . . x . . .} is the set A such
that x e A if-if x satisfies the condition . . . . v . . . . (I write 'if-if' for
'if and only if'.) If si is a class of sets, U si is the union of si, p| is
the intersection of si. (x,y) is the ordered pair with x as the first
member and y as the second; analogously, (x,y, z) is an ordered
triple, (x 1; . . . , xn) an ordered n-tuple. A \ B = D f {(x, j ) : x e A and
yeB); the Cartesian product A X B is the set of all ordered pairs
whose first member belongs to A and whose second member to B.
We shall use the terms "class" and "set" as synonyms. We
sometimes, however, prefer "class of sets" to "set of sets" (and
therefore also "class of functions", since functions may be regarded
as sets of pairs or of n-tuples).
We use 'I' for the set of all integers; 'N' for the set of the natural
numbers (the positive integers), and °N for N u {0}. A set A is said to
be (¡enumerable if-if it has the same cardinal number as N (namely,
aleph-zero). A is said to be countable if-if A is finite or denumerable.
Tl-1. Let stf be any class of subsets of X, and 88 be (a) the field
[(b) the cr-field] on X generated by si. Then 38 is the only class that
satisfies the following three conditions:
a. si ^ 38,
b. 38 is a field [a cr-field] on X,
c. 38 is the smallest class satisfying (a) and (b); that is to say,
if any class J " satisfies (a) and (b), then 38 <=- 38'.
(1-1) (i) The class of sentences is closed with respect to the following
sentence-forming operations: negation, disjunction, and
conjunction.
(ii) For every sentence S in JSf, there is a proposition E g e S
corresponding to S; we say then also that S designates or
describes Es.
(iii) $ is a a-field.
The first three axioms are here given in forms weaker than the
customary ones (Al instead of a combination of Al with the subsequent
theorem T2a; A2 instead of T2b; A3 instead of the special addition
principle T2h). Von Wright ([1957], see the Bibliography at the end
of this volume) proposed these weaker forms and showed that the
customary forms are provable on this basis. The end of a proof is
marked by ' • ' .
b. If £ c H, <V(H\E) = 1.
Isabelle Eberhardt.
1.D. The copyright laws of the place where you are located also
govern what you can do with this work. Copyright laws in most
countries are in a constant state of change. If you are outside
the United States, check the laws of your country in addition to
the terms of this agreement before downloading, copying,
displaying, performing, distributing or creating derivative works
based on this work or any other Project Gutenberg™ work. The
Foundation makes no representations concerning the copyright
status of any work in any country other than the United States.
1.E.6. You may convert to and distribute this work in any binary,
compressed, marked up, nonproprietary or proprietary form,
including any word processing or hypertext form. However, if
you provide access to or distribute copies of a Project
Gutenberg™ work in a format other than “Plain Vanilla ASCII” or
other format used in the official version posted on the official
Project Gutenberg™ website (www.gutenberg.org), you must, at
no additional cost, fee or expense to the user, provide a copy, a
means of exporting a copy, or a means of obtaining a copy upon
request, of the work in its original “Plain Vanilla ASCII” or other
form. Any alternate format must include the full Project
Gutenberg™ License as specified in paragraph 1.E.1.
• You pay a royalty fee of 20% of the gross profits you derive
from the use of Project Gutenberg™ works calculated using
the method you already use to calculate your applicable
taxes. The fee is owed to the owner of the Project
Gutenberg™ trademark, but he has agreed to donate
royalties under this paragraph to the Project Gutenberg
Literary Archive Foundation. Royalty payments must be paid
within 60 days following each date on which you prepare (or
are legally required to prepare) your periodic tax returns.
Royalty payments should be clearly marked as such and
sent to the Project Gutenberg Literary Archive Foundation at
the address specified in Section 4, “Information about
donations to the Project Gutenberg Literary Archive
Foundation.”
• You comply with all other terms of this agreement for free
distribution of Project Gutenberg™ works.
1.F.
Most people start at our website which has the main PG search
facility: www.gutenberg.org.