valep\(\mathsf{\TeX}\): conversion from \(\mathsf{\LaTeX}\) to HTML |
Dear Dr. Quine‚
I wish to say you my best thanks for your letter of Nov. 24 and the cable, and also for your letter of June 29, to which I did not answer. I am very grateful for your kind and good help, as well in the terminological questions as now in the problem of the translator of my book
I am very glad that you gave three lectures about my “Syntax”
I was very surprised by your cable (please give my thanks also to Mrs. Quine
I am very grateful to you that you wrote a review
To your questions about “Syntax”
1. Definition of “quasi-syntactical”, p. 178-179. You are right, an addition is here necessary. But it is sufficient to replace “\(\grave{S}\!\grave{g}_2^n\)” (the accent \(\grave{}\) marks Gothic letters) on p. 178, last line, by “ein \(\grave{S}\!\grave{g}_1^n\)\(\grave{S}\!\grave{g}_2\)”. Then \(\grave{S}\!\grave{g}_2\) belongs to the logical sub-language \({S}_2\acute{}\) of \(S_2\) and is a syntactical \(\grave{S}\!\grave{g}\), because \({S}_2\acute{}\) is a syntactical language for \(S_1\) and \(\grave{Q}_1[\grave{A}_1]\) etc. are suitable arguments for \(\grave{S}\grave{g}_2\). – It is not possible to define a logical\(\grave{S}\grave{g}_2\) in such a way that for every \(\grave{S}_1\) of \(S_1\)\(\grave{S}\grave{g}_2(\grave{Q}_1[\grave{S}_1])\) has the sense of “\(\grave{S}_1\) is true”; because in this case, if we take a synthetic \(\grave{S}_1\), \(\grave{S}_1\) must be equipollent with \(\grave{S}\grave{g}_2(\grave{Q}_1[\grave{S}_1])\) which is a logical and hence a not-synthetic sentence, and that is impossible. – Not every full sentence of \(\grave{S}\grave{g}_2\) is L-determinate, but only every f. s. having logical arguments. If we add a descriptive description of an expression (e.g. “the expression written at that and that place”) as an argument to \(\grave{S}\grave{g}_2\), then the full sentence will in general be synthetic. Thus e.g. the quasi-syntactical sentences 1a (p. 215) and 12a (p. 217) are synthetic. But the
2. (p. 116). You are right, the truth value of an implication sentence can often be found in other way. But in the special case concerned here we cannot (according to the meaning of the objection which I reject however) use a general sentence, because the objection is based on the (erroneous) opinion that a general sentence has to be tested by testing the single instances. – Sometimes it is indeed sufficient to find the truth-value of one of the two parts, but not in this case, provided we do not make use of the definition of ‘\(P_3\)’.
Many thanks also for your offprints, which you kindly sent me. I had some doubt in respect to some points in your “Ontological Remarks”, but perhaps you yourself would formulate it today in a somewhat different way. Especially interesting is your report about Whiteheads
The four weeks which we spent together in London were a very interesting and stimulating time. I was very glad to make the acquaintaince of Stebbing
The terminological remarks in your former letter have been very valuable for me. I accepted your suggestions in the terminological list for the translator (if it will be Prof. Prall
I sent you recently an offprint “Antinomien”
Prof. Charles W. Morris
Through the help of the American Institute at Prague
If it will not be too much loss of time, could you perhaps send back the enclosed copy with corrections? It suffices of course to correct the serious grammatical mistakes (not expressions which are merely unsuitable). Please send me copies of your German letters (also of the last), if you think corrections useful.
Thanks for your kind Christmas greeting. My wife
Sincerely yours‚
R. Carnap
Brief, msl., 4 Seiten, WQ; Briefkopf: gestempelt Prof. Dr. Rudolf Carnap  /  Prag XVII.  /  N. Motol, Pod Homolkou, hsl. 18. Dec. 1934.
Remarks about Quine’s
I find your bookhave the intendtion to write a reviewfor me
I regret that we cannot discuss some points verbally. So I shall write some remarks.
1. I should find it suitable if you had given explicitly formation rules, i. e. definitions of “sentence”, “n-ad expression” (esp. “class expr.” and “sequence expr.”) and others (see 2, 3c), including the expressions containing defined symbols.
2. You have a much higher degree of exactness than P. M., and there remain now only very few demands for accomplishing exactness. So e.g. it was a lack of exactness in P. M., that no formation rules for definitions are given but only a practice. It will be good if you will supply that for your system. Because a reader, seeing your practice, could perhaps think that it werewould be allowedable to introduce the abbreviation “\(A\)” for an expression like “\(V‚x\)” (or “\(O‚\alpha \)” or others), which of course would lead to contradictions.
3. Substitution , p. 42. a) It seems to me very good, that you demand in your explanation of substitution the rewriting of certain variables. That is better than my procedure (prohibiting subst. in such cases and thereby indirectlyindirectly the rewriting before subst.)
b) I should prefer to say instead of “written in lieu of” (p. 42): “written in lieu of every free”. Then you may leave out “free” in the rule; and the convention at the end of p. 44 (containing the not quite exact expression “construed as cases”) will be unnecessary.
c) It seems to me necessary to restrict in your rule of substitution the range of expressions allowed for substitution.
4. p. 51. I do not think we cannotes of variables in your system. The latter is in fact uinessential (as you say), but not the former, because you cannot leave out the par[entheses]. Therefore I should prefer to call the parentheses primitive symbols and to take notice of them in the formation rules (demanded above), as you did already in your informal explanations.
5. Your device of discarding descriptions and keeping only “\(\alpha symbol x\)” defined as a sum of classes is very fine.
6. Likewise admirable is your treatment of operators, using “\(\hat{x}\)” as sole operator, replacing all other sorts by combinations of “\(\hat{x}\)” with class expressions. I think this is an essential improvement. Just now I gotreceived a paper from Ajdukiewicz containing the question whether such a replacement willwould be possible. Now I have written him that you have solved this problem already. I recommended your book and suggested to him tothat he send you an offprint of his paper.
7. It is a great advantage of your hierarchy of types that it includes also sentences. Hereby the desire may arise to find a way of inclusding also some other symbols which now have no type (see 8.).
8. You discarded operator symbols and replaced them by class symbols. That is a very good simplification of the system. Perhaps we may go one step or some steps further in this direction and replace some further symbols, now being without type, by class symbols.
a) There are some symbols which are now already predicates (in the widebroad sense of this word in “General Syntax”) but are not class symbols in your system and have no type; these are the symbols of implication, identity, equivalence, denial and conjunction. We can easily take them as class symbols, writing e. g. “\(\supset ‚p‚q\)”, “\(\sim ‚p\)” and so on. Then the dots are discarded which in your system are primitive symbols (and ought to be enumerated among those).
b) All defined symbols, with exception of class symbols and those just mentioned, are functors. If we keep “beingwhich is the fundamental and indispensable functor) we can replace all others by class symbols. This is possible because all definienda of those symbols are now alreadyhave become class expressions.
\(\ni x\)
\(\alpha \supset \beta \bar{a}\)
\(\alpha \cap \beta \)
Then all defined symbols with sole exception of Symbol will be class symbols. In my view this will be an advantage, because they belong then to the system of types, and we have variables for them.
c) I should prefer to replace the primitive symbols “[]” also by a class symbol. (The symbolised notion has‚into my way of feeling‚ too much weight for being symbolised by punctuation ThereHere are some possible ways:
A) We may write “cong
A1) either we take Symbol: as a new primitive symbol;
A2) or we take first “cong (we define later on we define “(” and show that “cong (” can now be taken as a combination of that “(” and a class symbol “cong”.
B) (Perhaps preferable to A). We take “{symbol}” as a prim. class symbol (writing “{symbol}‚{symbol}‚{symbol}” instead of Russell’s “{symbol}”). Then we may define, if desired‚ “cong ({symbol}”, if desired‚byas{symbol}, or use only the latter (in order to avoid “(” at this stage).
d) I should prefer to take “(” as a primitive symbol. [Do you believe that it will then be possible to define then “cong” (or “{symbol}”)? If not, I should take both “(” and “{symbol}” as pr.s.] If we take “(” as pr.s., the system will contain only these 3 kinds of symbols:
1) punctuation signs: comma, inverted comma, parentheses “( )”,
2) variables‚
3) class constants.
All defined symbols are class constants; hence there will comeresult a great simplification forof the formation rules for definitions (see above 2). And the discarding of all functors, excepted “(”, will simplify the syntactical definition forof “class expression” (and thereby that forof “sentence”), because every class expression has the form ”{symbol}” or {symbol} or {symbol}. The system of types includes every symbol with the exception of the punctuation signs.
9. p. 5. We dueowe the remark about the assertion sign to Wittgenstein
10. p. 144, line 25. {symbol}.
R. C.
Briefbeilage, msl. Dsl., 4 Seiten, RC 102-60-15 (Original WQ); von mehreren Kopien enthält nur die im Carnap-Nachlass liegende und mit Copy gekennzeichnete Kopie die hier annotierten mit Rotstift eingefügten Korrekturen Quines.