CHAPTER 28. LOGICAL COMPOSITIONS.
This chapter very briefly describes various processes having to do with the logical composition of conjunctions and disjunctions. The equations developed here, are selected to enable us to deal efficiently, in later chapters, with factorial formulas, especially. They are only a tip of an enormous iceberg, comprising hypothetical relations as well, consideration of all modalities of connections and bases, and full analysis of the negative side.
Although I personally avoid symbolic logic as much as possible, so as not to obscure for myself and others the meaning of what I am doing — in the case of the theorems below, I find that symbolization of logical relations does indeed bring out the processes more clearly. I will use a nomenclature and symbolic representation, which I personally find more comfortable, but which differs slightly from that adopted by modern logic (Copi, 319). It is, of course, to modern logicians that we owe these valuable clarifying formulas.
Let p, q, r, s be any theses, which will be conjoined or disjoined; their antitheses notp, notq, etc., may be symbolized by a so-called ‘curl’ (a curved minus sign like this: ~), as in ~p, ~q, etc. We may write: ‘p and q’ symbolically as ‘p + q’ (with plus sign) or as ‘pq’ (with no separation) or as ‘p.q’ (the dot suggesting a product). Also, we may write ‘p or q’, taken in the weakest ‘and/or’ sense, that ‘one of the theses must be true’, as ‘p v q’ (v for versus, supposedly) or as ‘p,q’ (note the comma); note that some computer programming languages use a vertical bar (like this: ½), instead. Brackets ‘{}’ are used to signify a clause within a larger sentence.
Note that the results for other forms of disjunction, like ‘or else’ or ‘either-or’, are often different; these will not be discussed here.
There are two sets of logical composition processes for us to consider:
a. ‘Addition‘, which is merging of conjunctions, or of disjunctions, with others of the same sign; the reverse process of separation, where it is feasible, might be called ‘subtraction’ (symbolized by a minus sign: –); and
b. ‘Multiplication‘, which is merging a mix of conjunctions and disjunctions with each other; the reverse direction, where it is feasible, might be called ‘division’.
Two or more propositions which are added together are said to form a single, composite proposition. A proposition which is not itself a composite of others is called elementary. Specifically, a proposition consisting of a conjunction of others is called a compound; this is one form of composition.
Note well that this logic is limited to the one sense of disjunction, and to fully problematic bases. Other manners of disjunction, such as ‘two (or more) theses must be true’ and ‘one (or more) theses must be false’, and more specific bases, each have their own logic. Also, we are here going to deal with disjunction with minimal reference to modality, although a more modal approach would be more precise and interesting. Consideration of conditional disjunction would cause the study to spill over into the interplay of hypotheticals with the processes here considered.
So the present research is limited, because its purpose is utilitarian. A fuller theory of logical composition requires additional work. However, the material dealt with here has indirect applications. Many theorems can be derived from those here described. We can, for instance, change the polarity of theses or logical relations in various ways. We can also expect that some of the laws of ‘at least one thesis must be true’ logic, carry over into ‘more than one thesis must be true’ logic.
The theorems below are presented as usually reversible eductions, meaning that given the form on the left, the form on the right follows at will, and usually vice versa. However, many of them can also be classed as deductive processes, and will reappear in later chapters in that guise. Another way to view them is, as rules of transformation, like changes in what we regard as clauses.
The analogies between mathematics and logic should not be overrated; they only go so far. Logic may be regarded as the manipulation of concepts of any kind, whereas mathematics concerns specifically numerical concepts. Although there is some intervention of mathematics in logic, for the resolution of quantitative issues, and we may be said to think logically when engaged in mathematics, these sciences are very different fields of interest. They have rationalism in common, but their scopes are different and neither is really a subsidiary of the other.
a. Addition of conjuncts:
p + {q + r} = p + q + r
{p + q} + {r + s} = p + q + r + s
…and so on for any number of conjuncts. Proof is that p, q, r, s are all independently true, anyway, on both sides of the equations. The elimination of repetitives is a special case of addition: since p + p = p, it follows that p + {p + q} = p + q.
b. Addition of alternatives:
p v {q v r} = p v q v r
{p v q} v {r v s} = p v q v r v s
…and so on for any number of disjuncts. Proof is in such cases best sought by matrixual analysis; that is, testing each and every eventual combination of theses and antitheses, to see whether or not it obeys the demands of the given composite, then comparing the results on the two sides of the equation. Thus, with three theses:
p v {q v r} | p v q v r |
p + q + r | p + q + r |
p + q + notr | p + q + notr |
p + notq + r | p + notq + r |
p + notq + notr | p + notq + notr |
notp + q + r | notp + q + r |
notp + q + notr | notp + q + notr |
notp + notq + r | notp + notq + r |
(notp + notq + notr) | (notp + notq + notr) |
The conjunctions shown in brackets are those which, having been tried out on the given disjunctions, failed the test. Both sides evidently mean that, so far, any conjunction of p, q, r and their antitheses is a conceivable outcome, to the exception of ‘notp and notq and notr’. Equations involving more theses are similarly dealt with.
As with conjuncts, the elimination of repetitives is a special case of addition. Since p v p = p (meaning, p will be affirmed in either case), it follows that p v {p v q} = p v q. Note that in the case of ‘p or else p’, notp would follow; the form ‘either p or p’ is of course inconceivable.
c. With regard to subtraction, the equations above are to be reread from right to left.
Addition followed by subtraction is useful to remove a common factor from two brackets:
{p + q} + {p + r} = p + p + q + r = p + {q + r}
{p v q} v {p v r} = p v p v q v r = p v {q v r}
…or to reshuffle brackets:
{p + q} + {r + s} = p + q + r + s = {p + r} + {r + s}
{p v q} v {r v s} = p v q v r v s = {p v r} v {r v s}
d. But the idea of ‘subtraction’ more precisely fits the equation ‘p + {~q} = p – q’, of course. This suggests implications like the following, which shall be seen again in the context of ‘logical apodosis’:
{p v q} – q implies p
{p v q v r} – r implies p v q
…and so on for any number of theses. Note that these implications are valid only in one direction. For instance, in the first case, p alone cannot tell us whether q or notq is true, and therefore cannot yield the conclusion that ‘{p v q} and notq’ are both true.
Nor may one push the analogy to mathematics so far as to move q to the other side of the implication and claim that ‘p v q’ and ‘p + q’ are equal. It only follows that ~p + ~q together imply ~{p v q}, and ~p + {p v q} together imply ‘q’.
The significance of multiplication in practise, is to clarify the logically possible combinations of theses, into compounds or other composites, which are implied by various interplays of conjunction and disjunction. This is mixed-form logic. Any impossible combinations are put aside.
a. Conjunctive multiplication:
p + {q v r} = {p + q} v {p + r} = pq v pr
{p v q} + {r v s} = pr v ps v qr v qs
Proof is best sought by matrixual analysis. Thus, with three theses, we find that only three of the conjunctions in each matrix are allowed so far, and those three are the same on both sides. Each side excludes the five bracketed conjunctions. So the two statements are equivalent.
p + {q v r} | {p + q} v {p + r} |
p + q + r | p + q + r |
p + q + notr | p + q + notr |
p + notq + r | p + notq + r |
(p + notq + notr) | (p + notq + notr) |
(notp + q + r) | (notp + q + r) |
(notp + q + notr) | (notp + q + notr) |
(notp + notq + r) | (notp + notq + r) |
(notp + notq + notr) | (notp + notq + notr) |
Equations involving more theses are similarly dealt with. Note well that if the result of such a multiplication contains an inconsistent clause, it is simply canceled out; for instance, if q = ~p, then the ‘p + q + r’ and ‘p + q + notr’ combinations are automatically eliminated, leaving only ‘p + notq + r’ as possible.
Also note that ‘p + {p v q}’ implies p (with the status of q left open), since p is already affirmed independently; this incidentally limits the ‘p v q’ clause to the two roots ‘p + q’ and ‘p + ~q’. As for ‘{p v q} + {p v r}’, it does not imply p, since notp may concur with q and r, without disobeying the premise.
b. Disjunctive multiplication:
p v {q + r}
{p v q} + {p v r}
p + q + r
p + q + r
p + q + notr
p + q + notr
p + notq + r
p + notq + r
p + notq + notr
p + notq + notr
notp + q + r
notp + q + r
(notp + q + notr)
(notp + q + notr)
(notp + notq + r)
(notp + notq + r)
(notp + notq + notr)
(notp + notq + notr)