5. Propositions are truth-functions of elementary propositions. (An elementary proposition is a truth-function of itself.)

5.01 The elementary propositions are the truth-arguments of propo- sitions.

5.02 It is natural to confuse the arguments of functions with the indices of names. For I recognize the meaning of the sign con- taining it from the argument just as much as from the index.

In Russell's "+c", for example, "c" is an index which indicates that the whole sign is the addition sign for cardinal numbers. But this way of symbolizing depends on arbitrary agreement, and one could choose a simple sign instead of "+c": but in "∼p" "p" is not an index but an argument; the sense of "∼p" cannot be understood, unless the sense of "p" has previously been un- derstood. (In the name Julius Cæsar, Julius is an index. The index is always part of a description of the object to whose name we attach it, e.g. The Cæsar of the Julian gens.)

The confusion of argument and index is, if I am not mistaken, at the root of Frege's theory of the meaning of propositions and functions. For Frege the propositions of logic were names and their arguments the indices of these names.

5.1 The truth-functions can be ordered in series.

That is the foundation of the theory of probability.

5.101 The truth-functions of every number of elementary propositions can be written in a schema of the following kind:

(TTTT)(p, q) Tautology (FTTT)(p, q) in words:

(ifpthenp,andifqthenq)[p⊃p.q⊃q] Notbothpandq.[∼(p.q)]

Ifqthenp. [q⊃p]

Ifpthenq. [p⊃q]

porq.[p∨q]

Not q. [∼q]

Not p. [∼p]

porq,butnotboth. [p.∼q:∨:q.∼p] Ifp,thenq;andifq,thenp. [p≡q]

p

q

Neither p nor q. [∼p.∼q or p|q] p and not q. [p.∼q]

q and not p. [q.∼p] pandq.[p.q]

(TFTT)(p, q) " (TTFT)(p, q) " (TTTF)(p, q) " (FFTT)(p, q) " (FTFT)(p, q) " (FTTF)(p, q) " (TFFT)(p, q) " (TFTF)(p, q) " (TTFF)(p, q) " (FFFT)(p, q) " (FFTF)(p, q) " (FTFF)(p, q) " (TFFF)(p, q) "

" " " " " " " " " " " " "

(FFFF)(p, q) Contradiction (p and not p; and q and not q.) [p . ∼p . q . ∼q] Those truth-possibilities of its truth-arguments, which verify the proposition, I shall call its truth-grounds.

5.11 If the truth-grounds which are common to a number of proposi- tions are all also truth-grounds of some one proposition, we say that the truth of this proposition follows from the truth of those propositions.

5.12 In particular the truth of a proposition p follows from that of a proposition q, if all the truth-grounds of the second are truth- grounds of the first.

5.121 The truth-grounds of q are contained in those of p; p follows from q.

5.122 If p follows from q, the sense of "p" is contained in that of "q".

5.123 If a god creates a world in which certain propositions are true, he creates thereby also a world in which all propositions consequent on them are true. And similarly he could not create a world in which the proposition "p" is true without creating all its objects.

5.124 A proposition asserts every proposition which follows from it.

5.1241 "p.q" is one of the propositions which assert "p" and at the same

time one of the propositions which assert "q". Two propositions are opposed to one another if there is no significant proposition which asserts them both. Every proposition which contradicts another, denies it.

5.13 That the truth of one proposition follows from the truth of other propositions, we perceive from the structure of the propositions.

5.131 If the truth of one proposition follows from the truth of others, this expresses itself in relations in which the forms of these propositions stand to one another, and we do not need to put them in these relations first by connecting them with one another in a proposition; for these relations are internal, and exist as soon as, and by the very fact that, the propositions exist.

5.1311 When we conclude from p ∨ q and ∼p to q the relation between the forms of the propositions "p ∨ q" and "∼p" is here concealed by the method of symbolizing. But if we write, e.g. instead of "p∨q" "p|q.|.p|q" and instead of "∼p" "p|p" (p|q = neither p nor q), then the inner connexion becomes obvious.

(The fact that we can infer f a from (x) . f x shows that gen- erality is present also in the symbol "(x) . fx".

5.132 If p follows from q, I can conclude from q to p; infer p from q. The method of inference is to be understood from the two

propositions alone. Only they themselves can justify the inference. Laws of inference, which—as in Frege and Russell—are to justify the conclusions, are senseless and would be superfluous.

5.133 All inference takes place a priori.

5.134 From an elementary proposition no other can be inferred.

5.135 In no way can an inference be made from the existence of one state of affairs to the existence of another entirely different from it.

5.136 There is no causal nexus which justifies such an inference.

5.1361 The events of the future cannot be inferred from those of the present.

Superstition is the belief in the causal nexus.

5.1362 The freedom of the will consists in the fact that future actions cannot be known now. We could only know them if causality were an inner necessity, like that of logical deduction.—The connexion of knowledge and what is known is that of logical necessity. ("A knows that p is the case" is senseless if p is a tautology.)

5.1363 If from the fact that a proposition is obvious to us it does not follow that it is true, then obviousness is no justification for our belief in its truth.

5.14 If a proposition follows from another, then the latter says more than the former, the former less than the latter.

5.141 If p follows from q and q from p then they are one and the same proposition.

5.142 A tautology follows from all propositions: it says nothing.

5.143 Contradiction is something shared by propositions, which no proposition has in common with another. Tautology is that which is shared by all propositions, which have nothing in common with one another. Contradiction vanishes so to speak outside, tautology inside all propositions.

Contradiction is the external limit of the propositions, tau- tology their substanceless centre.

5.15 If Tr is the number of the truth-grounds of the proposition "r", Trs the number of those truth-grounds of the proposition "s" which are at the same time truth-grounds of "r", then we call the ratio Trs : Tr the measure of the probability which the prop- osition "r" gives to the proposition "s".

5.151 Suppose in a schema like that above in No. 5.101 Tr is the num- ber of the "T"'s in the proposition r, Trs the number of those "T"'s in the proposition s, which stand in the same columns as "T"'s of the proposition r; then the proposition r gives to the proposition s the probability Trs : Tr.

5.1511 There is no special object peculiar to probability propositions.

5.152 Propositions which have no truth-arguments in common with one another we call independent. Independent propositions (e.g. any two elementary proposi-

tions) give to one another the probability 1:2.

If p follows from q, the proposition q gives to the proposition p the probability 1. The certainty of logical conclusion is a limiting case of probability.

(Application to tautology and contradiction.)

5.153 A proposition is in itself neither probable nor improbable. An event occurs or does not occur, there is no middle course.

5.154 In an urn there are equal numbers of white and black balls (and no others). I draw one ball after another and put them back in the urn. Then I can determine by the experiment that the num- bers of the black and white balls which are drawn approximate as the drawing continues. So this is not a mathematical fact. If then, I say, It is equally probable that I should draw a white and a black ball, this means, All the circumstances known to me (including the natural laws hypothetically assumed) give to the occurrence of the one event no more probability than to the occurrence of the other. That is they give—as can easily be understood from the above explanations—to each the probability 1:2. What I can verify by the experiment is that the occurrence of the two events is independent of the circumstances with which I have no closer acquaintance.

5.155 The unit of the probability proposition is: The circumstances— with which I am not further acquainted—give to the occurrence of a definite event such and such a degree of probability.

5.156 Probability is a generalization. It involves a general description of a propositional form. Only in default of certainty do we need probability.

If we are not completely acquainted with a fact, but know something about its form.

(A proposition can, indeed, be an incomplete picture of a

certain state of affairs, but it is always a complete picture.)

The probability proposition is, as it were, an extract from other propositions.

5.2 The structures of propositions stand to one another in internal relations.

5.21 We can bring out these internal relations in our manner of expression, by presenting a proposition as the result of an opera- tion which produces it from other propositions (the bases of the operation).

5.22 The operation is the expression of a relation between the struc- tures of its result and its bases.

5.23 The operation is that which must happen to a proposition in order to make another out of it.

5.231 And that will naturally depend on their formal properties, on the internal similarity of their forms.

5.232 The internal relation which orders a series is equivalent to the operation by which one term arises from another.

5.233 The first place in which an operation can occur is where a prop- osition arises from another in a logically significant way; i.e. where the logical construction of the proposition begins.

5.234 The truth-functions of elementary propositions, are results of operations which have the elementary propositions as bases. (I call these operations, truth-operations.)

5.2341 The sense of a truth-function of p is a function of the sense of p. Denial, logical addition, logical multiplication, etc. etc., are

operations. (Denial reverses the sense of a proposition.)

5.24 An operation shows itself in a variable; it shows how we can proceed from one form of proposition to another. It gives expression to the difference between the forms. (And that which is common to the bases, and the result of an operation, is the bases themselves.)

5.241 The operation does not characterize a form but only the differ- ence between forms.

5.242 The same operation which makes "q" from "p", makes "r" from "q", and so on. This can only be expressed by the fact that "p", "q", "r", etc., are variables which give general expression to certain formal relations.

5.25 The occurrence of an operation does not characterize the sense of a proposition.

For an operation does not assert anything; only its result does, and this depends on the bases of the operation.

(Operation and function must not be confused with one another.)

5.251 A function cannot be its own argument, but the result of an operation can be its own basis.

5.252 Only in this way is the progress from term to term in a formal series possible (from type to type in the hierarchy of Russell and Whitehead). (Russell and Whitehead have not admitted the possibility of this progress but have made use of it all the same.)

5.2521 The repeated application of an operation to its own result I call its successive application ("O′O′O′a" is the result of the threefold successive application of "O′ξ" to "a").

In a similar sense I speak of the successive application of several operations to a number of propositions.

5.2522 The general term of the formal series a, O′a, O′O′a, . . . . I write thus: "[a, x, O′x]". This expression in brackets is a variable. The first term of the expression is the beginning of the formal series, the second the form of an arbitrary term x of the series, and the third the form of that term of the series which immediately follows x.

5.2523 The concept of the successive application of an operation is equivalent to the concept "and so on".

5.253 One operation can reverse the effect of another. Operations can cancel one another.

5.254 Operations can vanish (e.g. denial in "∼∼p", ∼∼p = p).

5.3 All propositions are results of truth-operations on the elemen- tary propositions.

The truth-operation is the way in which a truth-function arises from elementary propositions.

According to the nature of truth-operations, in the same way as out of elementary propositions arise their truth-functions, from truth-functions arises a new one. Every truth-operation creates from truth-functions of elementary propositions another truth-function of elementary propositions, i.e. a proposition. The result of every truth-operation on the results of truth-operations on elementary propositions is also the result of one truth- operation on elementary propositions. Every proposition is the result of truth-operations on elementary propositions.

5.31 The Schemata No. 4.31 are also significant, if "p", "q", "r", etc. are not elementary propositions. And it is easy to see that the propositional sign in No. 4.442 expresses one truth-function of elementary propositions even when "p" and "q" are truth-functions of elementary propositions.

5.32 All truth-functions are results of the successive application of a finite number of truth-operations to elementary propositions.

5.4 Here it becomes clear that there are no such things as "logical objects" or "logical constants" (in the sense of Frege and Russell).

5.41 For all those results of truth-operations on truth-functions are identical, which are one and the same truth-function of elementary propositions.

5.42 That ∨, ⊃, etc., are not relations in the sense of right and left, etc., is obvious.

The possibility of crosswise definition of the logical "primitive signs" of Frege and Russell shows by itself that these are not primitive signs and that they signify no relations. And it is obvious that the "⊃" which we define by means of "∼" and "∨" is identical with that by which we define "∨" with the help of "∼", and that this "∨" is the same as the first, and so on.

5.43 That from a fact p an infinite number of others should follow, namely ∼∼p, ∼∼∼∼p, etc., is indeed hardly to be believed, and it is no less wonderful that the infinite number of propositions of logic (of mathematics) should follow from half a dozen "primitive propositions". But all propositions of logic say the same thing. That is, nothing.

5.44 Truth-functions are not material functions. If e.g. an affirmation can be produced by repeated denial, is the denial—in any sense—contained in the affirmation? Does "∼∼p" deny ∼p, or does it affirm p; or both? The proposition "∼∼p" does not treat of denial as an object, but the possibility of denial is already prejudged in affirmation. And if there was an object called "∼", then "∼∼p" would have to say something other than "p". For the one proposition would then treat of ∼, the other would not.

5.441 This disappearance of the apparent logical constants also occurs if "∼(∃x).∼fx" says the same as "(x).fx", or "(∃x).fx.x = a" the same as "fa".

5.442 If a proposition is given to us then the results of all truth- operations which have it as their basis are given with it.

5.45 If there are logical primitive signs a correct logic must make clear their position relative to one another and justify their existence. The construction of logic out of its primitive signs must become clear.

5.451 If logic has primitive ideas these must be independent of one an- other. If a primitive idea is introduced it must be introduced in all contexts in which it occurs at all. One cannot therefore intro- duce it for one context and then again for another. For example, if denial is introduced, we must understand it in propositions of the form "∼p", just as in propositions like "∼(p∨q)", "(∃x).∼fx" and others. We may not first introduce it for one class of cases and then for another, for it would then remain doubtful whether its meaning in the two cases was the same, and there would be no reason to use the same way of symbolizing in the two cases. (In short, what Frege ("Grundgesetze der Arithmetik") has said about the introduction of signs by definitions holds, mutatis mutandis, for the introduction of primitive signs also.)

5.452 The introduction of a new expedient in the symbolism of logic must always be an event full of consequences. No new symbol may be introduced in logic in brackets or in the margin—with, so to speak, an entirely innocent face.

(Thus in the "Principia Mathematica" of Russell and Whitehead there occur definitions and primitive propositions in words. Why suddenly words here? This would need a justification. There was none, and can be none for the process is actually not allowed.)

But if the introduction of a new expedient has proved nec- essary in one place, we must immediately ask: Where is this expedient always to be used? Its position in logic must be made clear.

5.453 All numbers in logic must be capable of justification. Or rather it must become plain that there are no numbers in logic. There are no pre-eminent numbers.

5.454 In logic there is no side by side, there can be no classification. In logic there cannot be a more general and a more special.

5.4541 The solution of logical problems must be simple for they set the standard of simplicity. Men have always thought that there must be a sphere of questions whose answers—a priori—are symmetrical and united into a closed regular structure.

A sphere in which the proposition, simplex sigillum veri, is valid.

5.46 When we have rightly introduced the logical signs, the sense of all their combinations has been already introduced with them: therefore not only "p ∨ q" but also "∼(p ∨ ∼q)", etc. etc. We should then already have introduced the effect of all possible combinations of brackets; and it would then have become clear that the proper general primitive signs are not "p∨q", "(∃x).fx", etc., but the most general form of their combinations.

5.461 The apparently unimportant fact that the apparent relations like ∨ and ⊃ need brackets—unlike real relations is of great importance.

The use of brackets with these apparent primitive signs shows that these are not the real primitive signs; and nobody of course would believe that the brackets have meaning by themselves.

5.4611 Logical operation signs are punctuations.

5.47 It is clear that everything which can be said beforehand about the form of all propositions at all can be said on one occasion.

For all logical operations are already contained in the elementary proposition. For "fa" says the same as "(∃x) . fx . x = a".

Where there is composition, there is argument and function, and where these are, all logical constants already are.

One could say: the one logical constant is that which all propositions, according to their nature, have in common with one another.

That however is the general form of proposition.

5.471 The general form of proposition is the essence of proposition.

5.4711 To give the essence of proposition means to give the essence of all description, therefore the essence of the world.

5.472 The description of the most general propositional form is the description of the one and only general primitive sign in logic.

5.473 Logic must take care of itself.

A possible sign must also be able to signify. Everything

which is possible in logic is also permitted. ("Socrates is identi- cal" means nothing because there is no property which is called "identical". The proposition is senseless because we have not made some arbitrary determination, not because the symbol is in itself unpermissible.)

In a certain sense we cannot make mistakes in logic.

5.4731 Self-evidence, of which Russell has said so much, can only be discarded in logic by language itself preventing every logical mis- take. That logic is a priori consists in the fact that we cannot think illogically.

5.4732 We cannot give a sign the wrong sense.

5.47321 Occam's razor is, of course, not an arbitrary rule nor one justified by its practical success. It simply says that unnecessary elements in a symbolism mean nothing. Signs which serve one purpose are logically equivalent, signs which serve no purpose are logically meaningless.

5.4733 Frege says: Every legitimately constructed proposition must have a sense; and I say: Every possible proposition is legitimately constructed, and if it has no sense this can only be because we have given no meaning to some of its constituent parts. (Even if we believe that we have done so.) Thus "Socrates is identical" says nothing, because we have given no meaning to the word "identical" as adjective. For when it occurs as the sign of equality it symbolizes in an entirely different way—the symbolizing relation is another—therefore the symbol is in the two cases entirely different; the two symbols have the sign in common with one another only by accident.

5.474 The number of necessary fundamental operations depends only on our notation.

5.475 It is only a question of constructing a system of signs of a definite number of dimensions—of a definite mathematical multiplicity.

5.476 It is clear that we are not concerned here with a number of primitive ideas which must be signified but with the expression of a rule.

5.5 Every truth-function is a result of the successive application of the operation (– – – – –T)(ξ, . . . .) to elementary propositions.

This operation denies all the propositions in the right-hand bracket and I call it the negation of these propositions.

5.501 An expression in brackets whose terms are propositions I indi- cate—if the order of the terms in the bracket is indifferent—by a sign of the form "(ξ)". "ξ" is a variable whose values are the terms of the expression in brackets, and the line over the variable indicates that it stands for all its values in the bracket.

(Thus if ξ has the 3 values P, Q, R, then (ξ) = (P, Q, R).) The values of the variables must be determined. The determination is the description of the propositions

which the variable stands for. How the description of the terms of the expression in brackets

takes place is unessential. We may distinguish 3 kinds of description: 1. Direct enu-

meration. In this case we can place simply its constant values instead of the variable. 2. Giving a function f x, whose values for all values of x are the propositions to be described. 3. Giving a formal law, according to which those propositions are constructed. In this case the terms of the expression in brackets are all the terms of a formal series.

5.502 Therefore I write instead of "(– – – – –T)(ξ,....)", "N(ξ)". N(ξ) is the negation of all the values of the propositional

variable ξ.

5.503 As it is obviously easy to express how propositions can be con- structed by means of this operation and how propositions are not to be constructed by means of it, this must be capable of exact expression.

5.51 If ξ has only one value, then N(ξ) = ∼p (not p), if it has two values then N(ξ) = ∼p . ∼q (neither p nor q).

5.511 How can the all-embracing logic which mirrors the world use such special catches and manipulations? Only because all these are connected into an infinitely fine network, to the great mirror.

5.512 "∼p" is true if "p" is false. Therefore in the true proposition "∼p" "p" is a false proposition. How then can the stroke "∼" bring it into agreement with reality?

That which denies in "∼p" is however not "∼", but that which all signs of this notation, which deny p, have in common. Hence the common rule according to which "∼p", "∼∼∼p", "∼p∨∼p", "∼p.∼p", etc. etc. (to infinity) are constructed. And this which is common to them all mirrors denial.

5.513 We could say: What is common to all symbols, which assert both p and q, is the proposition "p . q". What is common to all symbols, which assert either p or q, is the proposition "p ∨ q". And similarly we can say: Two propositions are opposed to one another when they have nothing in common with one another; and every proposition has only one negative, because there is only one proposition which lies altogether outside it. Thus even in Russell's notation it is evident that "q : p∨∼p" says the same as "q"; that "p ∨ ∼p" says nothing.

5.514 If a notation is fixed, there is in it a rule according to which all the propositions denying p are constructed, a rule according to which all the propositions asserting p are constructed, a rule according to which all the propositions asserting p or q are con- structed, and so on. These rules are equivalent to the symbols and in them their sense is mirrored.

5.515 It must be recognized in our symbols that what is connected by "∨", ".", etc., must be propositions.

And this is the case, for the symbols "p" and "q" presuppose "∨", "∼", etc. If the sign "p" in "p ∨ q" does not stand for a complex sign, then by itself it cannot have sense; but then also the signs "p ∨ p", "p . p", etc. which have the same sense as "p" have no sense. If, however, "p∨p" has no sense, then also "p∨q" can have no sense.

5.5151 Must the sign of the negative proposition be constructed by means of the sign of the positive? Why should one not be able to express the negative proposition by means of a negative fact? (Like: if "a" does not stand in a certain relation to "b", it could express that aRb is not the case.)

But here also the negative proposition is indirectly con- structed with the positive.

The positive proposition must presuppose the existence of the negative proposition and conversely.

5.52 If the values of ξ are the total values of a function fx for all values of x, then N(ξ) = ∼(∃x) . fx.

5.521 I separate the concept all from the truth-function. Frege and Russell have introduced generality in connexion with the logical product or the logical sum. Then it would be difficult to understand the propositions "(∃x).fx" and "(x).fx" in which both ideas lie concealed.

5.522 That which is peculiar to the "symbolism of generality" is firstly, that it refers to a logical prototype, and secondly, that it makes constants prominent.

5.523 The generality symbol occurs as an argument.

5.524 If the objects are given, therewith are all objects also given. If the elementary propositions are given, then therewith all elementary propositions are also given.

5.525 It is not correct to render the proposition "(∃x).fx"—as Russell

does—in words "fx is possible". Certainty, possibility or impossibility of a state of affairs are not expressed by a proposition but by the fact that an expression is a tautology, a significant proposition or a contradiction. That precedent to which one would always appeal, must be present in the symbol itself.

5.526 One can describe the world completely by completely generalized propositions, i.e. without from the outset co-ordinating any name with a definite object. In order then to arrive at the customary way of expression we need simply say after an expression "there is one and only one x, which ....": and this x is a.

5.5261 A completely generalized proposition is like every other proposition composite. (This is shown by the fact that in "(∃x, φ) . φx" we must mention "φ" and "x" separately. Both stand independently in signifying relations to the world as in the ungeneralized proposition.) A characteristic of a composite symbol: it has something in common with other symbols.

5.5262 The truth or falsehood of every proposition alters something in the general structure of the world. And the range which is allowed to its structure by the totality of elementary propositions is exactly that which the completely general propositions delimit.

(If an elementary proposition is true, then, at any rate, there is one more elementary proposition true.)

5.53 Identity of the object I express by identity of the sign and not by means of a sign of identity. Difference of the objects by difference of the signs.

5.5301 That identity is not a relation between objects is obvious. This becomes very clear if, for example, one considers the proposition "(x) : fx. ⊃ .x = a". What this proposition says is simply that only a satisfies the function f, and not that only such things satisfy the function f which have a certain relation to a.

One could of course say that in fact only a has this relation to a, but in order to express this we should need the sign of identity itself.

5.5302 Russell's definition of "=" won't do; because according to it one cannot say that two objects have all their properties in com- mon. (Even if this proposition is never true, it is nevertheless significant.)

5.5303 Roughly speaking: to say of two things that they are identical is nonsense, and to say of one thing that it is identical with itself is to say nothing.

5.531 I write therefore not "f(a, b) . a = b", but "f(a, a)" (or "f(b, b)"). And not " f (a, b) . ∼a = b", but " f (a, b)".

5.532 And analogously: not "(∃x, y).f(x, y).x = y", but "(∃x).f(x, x)"; and not "(∃x, y) . f(x, y) . ∼x = y", but "(∃x, y) . f(x, y)".

(Therefore instead of Russell's "(∃x, y) . f(x, y)": "(∃x, y) . f(x,y).∨.(∃x).f(x,x)".)

5.5321 Instead of "(x) : fx ⊃ x = a" we therefore write e.g. "(∃x).fx. ⊃ .f a : ∼(∃x, y) . f x . f y".

And the proposition "only one x satisfies f()" reads: "(∃x) . f x : ∼(∃x, y) . f x . f y".

5.533 The identity sign is therefore not an essential constituent of log- ical notation.

5.534 And we see that apparent propositions like: "a = a", "a = b.b = c. ⊃ a = c", "(x).x = x", "(∃x).x = a", etc. cannot be written in a correct logical notation at all.

5.535 So all problems disappear which are connected with such pseu- do-propositions.

This is the place to solve all the problems which arise through Russell's "Axiom of Infinity".

What the axiom of infinity is meant to say would be ex- pressed in language by the fact that there is an infinite number of names with different meanings.

5.5351 There are certain cases in which one is tempted to use expres- sionsoftheform"a=a"or"p⊃p"andofthatkind. And indeed this takes place when one would like to speak of the archetype Proposition, Thing, etc. So Russell in the Principles of Mathematics has rendered the nonsense "p is a proposition" in symbols by "p ⊃ p" and has put it as hypothesis before certain propositions to show that their places for arguments could only be occupied by propositions.

(It is nonsense to place the hypothesis p ⊃ p before a propo- sition in order to ensure that its arguments have the right form, because the hypothesis for a non-proposition as argument be- comes not false but meaningless, and because the proposition itself becomes senseless for arguments of the wrong kind, and therefore it survives the wrong arguments no better and no worse than the senseless hypothesis attached for this purpose.)

5.5352 Similarly it was proposed to express "There are no things" by "∼(∃x) . x = x". But even if this were a proposition—would it not be true if indeed "There were things", but these were not identical with themselves?

5.54 In the general propositional form, propositions occur in a prop- osition only as bases of the truth-operations.

5.541 At first sight it appears as if there were also a different way in which one proposition could occur in another.

Especially in certain propositional forms of psychology, like "A thinks, that p is the case", or "A thinks p", etc.

Here it appears superficially as if the proposition p stood to the object A in a kind of relation.

(And in modern epistemology (Russell, Moore, etc.) those propositions have been conceived in this way.)

5.542 But it is clear that "A believes that p", "A thinks p", "A says p", are of the form "'p' says p": and here we have no co-ordination of a fact and an object, but a co-ordination of facts by means of a co-ordination of their objects.

5.5421 This shows that there is no such thing as the soul—the subject, etc.—as it is conceived in contemporary superficial psychology.

A composite soul would not be a soul any longer.

5.5422 The correct explanation of the form of the proposition "A judges p" must show that it is impossible to judge a nonsense. (Russell's theory does not satisfy this condition.)

5.5423 To perceive a complex means to perceive that its constituents are combined in such and such a way. This perhaps explains that the figure ￼￼￼￼￼￼￼￼￼