In the general theory of logic built up by Whitehead and Russell to furnish a basis for all mathematics there is a certain subtheory which is unique in its simplicity and precision; and though all other portions of the work have their roots in this subtheory, it itself is completely independent of them. Whereas the complete theory requires for the enunciation of its propositions real and apparent variables, which represent both individuals and propositional functions of different kinds, and as a (...) result necessitates- the introduction of the cumbersome theory of types, this subtheory uses only real variables, and these real variables represent but one kind of entity—which the authors have chosen to call elementary propositions. The most general statements are formed by merely combining these variables by means of the two primitive propositional functions of propositions Negation and Disjunction; and the entire theory is concerned with the process of asserting those combinations which it regards as true propositions, employing for this purpose a few general rules which tell how to assert new combinations from old, and a certain number of primitive assertions from which to begin. (shrink)

It is shown that a complete axiomatization of classical non-tautologies can be obtained by taking F (falsehood) as the sole axiom along with the two inference rules: (i) if A is a substitution instance of B, then A |– B; and (ii) if A is obtained from B by replacement of equivalent sentences, then A |– B (counting as equivalent the pairs {T, ~F}, {F, F&F}, {F, F&T}, {F, T&F}, {T, T&T}). Since the set of tautologies is also specifiable by (...) purely syntactic means, the resulting picture gives an improved syntactic account of classical sentential logic. The picture can then be completed by considering related systems that prove adequate to specify the set of contradictions, the set of non-contradictions, and the set of contingencies respectively. (shrink)