aRb
' says 'a
stands in relation R
to b
'"; but we must says, "That 'a
' stands in a certain relation to 'b
' says that aRb
".
F(fx)
could be its own argument, then there would be a proposition "F(F(fx))
", and in this the outer functions F
and the inner function F
must have different meanings; for the inner has the form φ(fx)
, the outer the form ψ(φ(fx))
. Common to both functions is only the letter "F", which by itself signifies nothing.
F(Fu)
" we write "(∃
φ) :
F(φu) . φu = Fu
".
~p
" ("not p
") and "p ∨
q
" ("p
or q
").
aRb
" as a picture. Here the sign is obviously a likeness of the signified.
♯
and ♭
in the score).
(x) . fx
" by putting an index before fx
, like: "Gen.fx
", it would not do, we should not know what was generalized. If we tried to show it by an index g
, like: "F(xg
)" it would not do -- we should not know the scope of the generalization.
(G, G) . F(G, G)
", it would not do -- we could not determine the identity of the variables, etc.
p
" signifies in the true way what "~p
" signifies in the false way, etc.
p
" we mean ~p
, and what we mean is the case, then "p
" in the new conception is true and not false.
p
" and "~p
" can say the same thing is important, for it shows that the sign "~
" corresponds to nothing in reality.
~~p
= p
).
p
" and "~p
" have opposite senses, but to them corresponds one and the same reality.
p
" is true (or false) I must have determined under what conditions I call "p
" true, and thereby I determine the sense of the proposition.
fa
" shows that in its sense the object a
occurs, two propositions "fa
" and "ga
" that they are both about the same object.
aRb
",
∃
x
) : aRx . xRb
",
∃
x, y
) : aRx . xRy . yRb
", etc.
b
stands in one of these relations to a
, I call b
a successor of a
.)
x
" is the proper sign of the pseudo-concept object.
(∃
x, y) . . .
".
ℵ0
objects".
b
is a successor of a
" we need for this an expression for the general term of the formal series:
aRb
,
(∃
x) :
aRx . xRb
,
(∃
x, y) :
aRx . xRy . yRb
,
x, y, z
).
fx
", "φ
(x, y
)", etc.
p, q, r
.
=
".
a = b
" means then, that the sign "a
" is replaceable by the sign "b
".
b
", by determining that it shall replace a previously known sign "a
", I write the equation -- definition -- (like Russell) in the form "a = b
Def.". A definition is a symbolic rule.)
a = b
" are therefore only expedients in presentation: They assert nothing about the meaning of the signs "a
" and "b
".
a = a
", or expressions deduced from these are neither elementary propositions nor otherwise significant signs. (This will be shown later.)
n
atomic facts there are possibilities.
n
elementary propositions.
n
elementary propositions there are possibilities.
~p
, etc., then the sense of ~p
would by no means be determined by Frege's determination.)
`` | p | q | ||
---|---|---|---|---|
T | T | T | ||
F | T | T | ||
T | F | |||
F | F | T | '' |
⊢
" is logically altogether meaningless; in Frege (and Russell) it only shows that these authors hold as true the propositions marked in this way. "⊢
" belongs therefore to the propositions no more than does the number of the proposition. A proposition cannot possible assert of itself that it is true.)
p, q
)", or more plainly: "(T T F T)(p, q
)".
n
elementary propositions there are L
n
possible groups of truth-conditions.
+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 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 understood. (In the name Julius Caesar, Julius is an index. The index is always part of a description of the object to whose name we attach it, e.g. The Caesar of the Julian gens.)
(TTTT)(p, q ) | Tautology (if p then p , and if q then q ) [p ] |
(FTTT)(p, q ) | in words: Not both p and q . [~(p .q) ] |
(TFTT)(p, q ) | '' '' If q then p . [q ] |
(TTFT)(p, q ) | '' '' If p then q . [p ] |
(TTTF)(p, q ) | '' '' p or q . [p ] |
(FFTT)(p, q ) | '' '' Not q . [~q ] |
(FTFT)(p, q ) | '' '' Not p . [~p ] |
(FTTF)(p, q ) | '' '' p or q , but not both. [p .~q ] |
(TFFT)(p, q ) | '' '' If p , then q ; and if q , then p . [p ] |
(TFTF)(p, q ) | '' '' p |
(T T F F)(p, q ) | '' '' q |
(FFFT)(p, q ) | '' '' Neither p nor q . [p . ~q or p | q ] |
(FFTF)(p, q ) | '' '' p and not q . [p . ~q ] |
(FTFF)(p, q ) | '' '' q and not p . [q . ~p ] |
(TFFF)(p, q ) | '' '' q and p . [q .p ] |
(FFFF)(p, q ) | Contradiction (p and not p ; and q and not q .) [p . ~p . q . ~q ] |
p
follows from that of a proposition q
, if all the truth-grounds of the second are truth-grounds of the first.
q
are contained in those of p
; p
follows from q
.
p
follows from q
, the sense of "p
" is contained in that of "q
".
p
" is true without creating all its objects.
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.
fa
from (x) . fx
shows that generality is present also in the symbol "(x) . fx
".
p
follows from q
, I can conclude from q
to p
; infer p
from q
.
p
is the case" is senseless if p
is a tautology.)
p
follows from q
and q
from p
then they are one and the same proposition.
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 proposition "r
" gives to the proposition "s
".
Tr
is the number 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
.
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.
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.
O' O' O' a
" is the result of the threefold successive application of "O'ξ
" to "a
").
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 follws x
.
p
", "q
", "r
", etc. are not elementary propositions.
p
" and "q
" are truth-functions of elementary propositions.
∨
, ⊃
, etc., are not relations in the sense of right and left, etc., is obvious.
⊃
" 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.
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) shold follow from half a dozen "primitive propositions".
~~p
" deny "~p
", or does it affirm p
; or both?
~~p
" does not treat of denial as an object, but the possibility of denial is already prejudged in affirmation.
~
", then "~~p
" would have to say something other than "p
". For the one proposition would then treat of ~
, the other would not.
~p
", just as in propositions like "~(p ∨
q)
", "(∃
x) . ~fx
" and others. We may not first introduce it for oone 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.
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.
∨
and ⊃
need brackets -- unlike real relations -- is of great importance.
fa
" says the same as "(∃
x) .fx . x = a
".
ξ
, . . . .) to elementary propositions.
(ξ)
". "ξ
" is a variable whose values are the terms of the expression in brackets, and the line over the veriable indicates that it stands for all its values in the bracket.
ξ
has the 3 values P, Q, R
, then (ξ) = (P ,Q, R)
fx
, 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.
ξ
, . . . .)", "N
(ξ)
".
N
(ξ)
is the negation of all the values of the propositional variable ξ
.
ξ
has only one value, then N
(ξ) = ~p
(not p
), if it has two values then N
(ξ) = ~p . ~q
(neither p
nor q
).
~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?
~p
" is however not "~
", but that which all signs of this notation, which deny p
, have in common.
~p
", "~~~p
", "~p ∨
~p
", "~p . ~p
", etc. etc. (to infinity) are constructed. And this which is common to them all mirrors denial.
p
and q
, is the proposition "p . q
". What is common to all symbols, which asserts either p
or q
, is the proposition "p ∨
q
".
q
: p ∨
~p
" says the same thing as "q
"; that "p ∨
~p
" says nothing.
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 constructed, and so on. These rules are equivalent to the symbols and in them their sense is mirrored.
∨
", ".
", etc., must be propositions.
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.
a
" does not stand in a certain relation to "b
", it could express that aRb
is not the case.)
ξ
are the total values of a function fx
for all values of x
, then N(ξ
) = ~(∃x
) . fx
.
(∃
x) . fx
" and "(x) . fx
" in which both ideas lie concealed.
(∃
x ) . fx
" -- as Russell does -- in the words "fx
is possible".
x
, which . . . .": and this x
is a
.
(∃
x, ϕ) . ϕx
" we must mention "ϕ
" and "x
" separately. Both stand independently in signifying relations to the world as in the ungeneralized 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
.
a
has this relation to a
, but in order to express this we should need the sign of identity itself.
=
" won't do; because according to it one cannot say that two objects have all their properties in common. (Even if this proposition is never true, it is nevertheless significant.)
f(a, b) . a = b
" but "f(a, a)
" (or "f(b, b)
"). And not "f(a, b) . ~a = b
", but "f(a, b)
".
(∃
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)
".
(∃
x , y) . f (x, y)
" : "(∃
x , y) . f(x, y) .∨
. (∃
x ) . f(x, x)
".)
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.
a = a
" or "p ⊃
p
" As, for instance, when one would speak of the archtype Proposition, Thing, etc. So Russell in the Princples 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 occurpied by propositions.
p ⊃
p
before a proposition in order to ensure that its arguments have the right form, because the hypotheses for a non-proposition as arugment becomes 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 hypthesis attached for this purpose.)
~(∃
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?
p
is the case", or "A thinks p
", etc.
p
stood to the object A in a kind of relation.
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.
p
" must show that it is impossible to judge a nonsense. (Russell's theory does not satisfy this condition.)
a
and only glance at b
, a
appears in front and b
behind, and vice versa.)
p
, ξ
, N
(ξ
) ].
N
(ξ
) to the elementary propositions.
Ω'
(η
) is therefore: [ ξ
, N
(ξ
) ]'(η
) ( =
[ η
, ξ
, N
(η
) ] ).
x = Ω0
'x
Def. and Ω'Ων'x
= Ων
+1'x
Def.x
, Ω'x
, Ω'Ω'x
, Ω'Ω'Ω'x
, . . .Ω0'x
, Ω0+1'x
, Ω0+1+1'x
, Ω0+1+1+1'x
, . . .[ x, ξ
, Ω'ξ
]
",
[ Ω0'x
, Ων'x
, Ων
+1'x
]
", 0 + 1 = 1
Def.0 + 1 + 1 = 2
Def.0 + 1 + 1 + 1 = 3
Def.p
" and "~p
" in the connexion "~(p . ~p)
" give a tautology shows that they contradict one another. That the propositions "p ⊃
q
", "p
" and "q
" connected together in the form "(p
⊃ q
) . (p
) :⊃: (q
)
" give a tautology shows that q
follows from p
and p ⊃
q
. That "(x) . fx :⊃:
fa
" is a tautology shows that fa
follows from (x) . fx
, etc. etc.
p
", "q
", "r
, etc., "Tp
F", "Tq
F", "Tr
F", etc. The truth-combinations I express by brackets, e.g.:p ⊃
q
. Now I will proceed to inquire whether such a proposition as ~(p . ~p)
(The Law of Contradiction) is a tautology. The form "~ξ
" is written in our notationξ . η
" thus :--~(p . ~q)
runs thus :--p
" instead of "q
" and examine the combination of the outermost T and F with the innermost, it is seen that the truth of the whole proposition is co-ordinated with all the truth-combinations of its argument, its falsity with none of the truth-combinations.
p
" and "q
" give a tautology in the connexion "p ⊃
q
", then it is clear that q
follows from p
.
q
" follows from "p ⊃
q . p
" we see from these two propositions themselves, but we can also show it by combining them to "p ⊃
q . p :⊃:
q
" and then showing that this is a tautology.
a
and b
cannot be made to cover one another without – – – ○————✕ – – ✕————○ – – –
a b