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.51 (5) If has only one value, then N() = ~p (not p); if it has two values then N() = ~p.~q (neither p, nor q).
5.52 (6) If the values of are the total values of a function fx for all values of x, then N() = ~(x).fx.
5.54 (2) In the general propositional form, propositions occur in a proposition only as bases of the truth-operations.
5.55 (7) We must now answer a priori the question as to all possible forms of the elementary propositions.
The elementary proposition consists of names. Since we cannot give the number of names with different meanings, we cannot give the composition of the elementary proposition.