Chapter II: Problems in Soriteses

§ 1.

_Introductory._

The Problems we shall have to solve are of the following form:--

"Given three or more Propositions of Relation, which are proposed as Premisses: to ascertain what Conclusion, if any, is consequent from them."

We will limit ourselves, at present, to Problems which can be worked by the Formulæ of Fig. I. (See p. 75.) Those, that require _other_ Formulæ, are rather too hard for beginners.

Such Problems may be solved by either of two Methods, viz.

(1) The Method of Separate Syllogisms;
(2) The Method of Underscoring.

These shall be discussed separately.

pg088
§ 2.

_Solution by Method of Separate Syllogisms._

The Rules, for doing this, are as follows:--

(1) Name the 'Universe of Discourse'.

(2) Construct a Dictionary, making a, b, c, &c. represent
the Terms.

(3) Put the Proposed Premisses into subscript form.

(4) Select two which, containing between them a pair of
codivisional Classes, can be used as the Premisses of a
Syllogism.

(5) Find their Conclusion by Formula.

(6) Find a third Premiss which, along with this Conclusion,
can be used as the Premisses of a second Syllogism.

(7) Find a second Conclusion by Formula.

(8) Proceed thus, until all the proposed Premisses have
been used.

(9) Put the last Conclusion, which is the Complete
Conclusion of the Sorites, into concrete form.

[As an example of this process, let us take, as the proposed Set
of Premisses,

(1) "All the policemen on this beat sup with our cook;
(2) No man with long hair can fail to be a poet;
(3) Amos Judd has never been in prison;
(4) Our cook's 'cousins' all love cold mutton;
(5) None but policemen on this beat are poets;
(6) None but her 'cousins' ever sup with our cook;
(7) Men with short hair have all been in prison."

Univ. "men"; a = Amos Judd; b = cousins of our cook; c = having
been in prison; d = long-haired; e = loving cold mutton;
h = poets; k = policemen on this beat; l = supping with our cook
pg089
We now have to put the proposed Premisses into _subscript_ form.
Let us begin by putting them into _abstract_ form. The result is

(1) "All k are l;
(2) No d are h';
(3) All a are c';
(4) All b are e;
(5) No k' are h;
(6) No b' are l;
(7) All d' are c."

And it is now easy to put them into _subscript_ form, as
follows:--

(1) k_{1}l'_{0}
(2) dh'_{0}
(3) a_{1}c_{0}
(4) b_{1}e'_{0}
(5) k'h_{0}
(6) b'l_{0}
(7) d'_{1}c'_{0}

We now have to find a pair of Premisses which will yield a
Conclusion. Let us begin with No. (1), and look down the list,
till we come to one which we can take along with it, so as to
form Premisses belonging to Fig. I. We find that No. (5) will
do, since we can take k as our Eliminand. So our first syllogism
is

(1) k_{1}l'_{0}
(5) k'h_{0}
.'. l'h_{0} ... (8)

We must now begin again with l'h_{0} and find a Premiss to go
along with it. We find that No. (2) will do, h being our
Eliminand. So our next Syllogism is

(8) l'h_{0}
(2) dh'_{0}
.'. l'd_{0} ... (9)

We have now used up Nos. (1), (5), and (2), and must search
among the others for a partner for l'd_{0}. We find that No. (6)
will do. So we write

(9) l'd_{0}
(6) b'l_{0}
.'. db'_{0} ... (10)

Now what can we take along with db'_{0}? No. (4) will do.

(10) db'_{0}
(4) b_{1}e'_{0}
.'. de'_{0} ... (11)
pg090
Along with this we may take No. (7).

(11) de'_{0}
(7) d'_{1}c'_{0}
.'. c'e'_{0} ... (12)

And along with this we may take No. (3).

(12) c'e'_{0}
(3) a_{1}c_{0}
.'. a_{1}e'_{0}

This Complete Conclusion, translated into _abstract_ form, is

"All a are e";

and this, translated into _concrete_ form, is

"Amos Judd loves cold mutton."

In actually _working_ this Problem, the above explanations
would, of course, be omitted, and all, that would appear on
paper, would be as follows:--

(1) k_{1}l'_{0}
(2) dh'_{0}
(3) a_{1}c_{0}
(4) b_{1}e'_{0}
(5) k'h_{0}
(6) b'l_{0}
(7) d'_{1}c'_{0}

(1) k_{1}l'_{0}
(5) k'h_{0}
.'. l'h_{0} ... (8)

(8) l'h_{0}
(2) dh'_{0}
.'. l'd_{0} ... (9)

(9) l'd_{0}
(6) b'l_{0}
.'. db'_{0} ... (10)

(10) db'_{0}
(4) b_{1}e'_{0}
.'. de'_{0} ... (11)

(11) de'_{0}
(7) d'_{1}c'_{0}
.'. c'e'_{0} ... (12)

(12) c'e'_{0}
(3) a_{1}c_{0}
.'. a_{1}e'_{0}

Note that, in working a Sorites by this Process, we may begin
with _any_ Premiss we choose.]

pg091
§ 3.

_Solution by Method of Underscoring._

Consider the Pair of Premisses

xm_{0} + ym'_{0}

which yield the Conclusion xy_{0}

We see that, in order to get this Conclusion, we must eliminate m and m', and write x and y together in one expression.

Now, if we agree to _mark_ m and m' as eliminated, and to read the two expressions together, as if they were written in one, the two Premisses will then exactly represent the _Conclusion_, and we need not write it out separately.

Let us agree to mark the eliminated letters by _underscoring_ them, putting a _single_ score under the _first_, and a _double_ one under the _second_.

The two Premisses now become

xm_{0} + ym'_{0}
- =

which we read as "xy_{0}".

In copying out the Premisses for underscoring, it will be convenient to _omit all subscripts_. As to the "0's" we may always _suppose_ them written, and, as to the "1's", we are not concerned to know _which_ Terms are asserted to _exist_, except those which appear in the _Complete_ Conclusion; and for _them_ it will be easy enough to refer to the original list. pg092 [I will now go through the process of solving, by this method, the example worked in § 2.

The Data are

1 2 3 4
k_{1}l'_{0} + dh'_{0} + a_{1}c_{0} + b_{1}e'_{0} +

5 6 7
k'h_{0} + b'l_{0} + d'_{1}c'_{0}

The Reader should take a piece of paper, and write out this
solution for himself. The first line will consist of the above
Data; the second must be composed, bit by bit, according to the
following directions.

We begin by writing down the first Premiss, with its numeral
over it, but omitting the subscripts.

We have now to find a Premiss which can be combined with this,
_i.e._, a Premiss containing either k' or l. The first we find
is No. 5; and this we tack on, with a +.

To get the _Conclusion_ from these, k and k' must be eliminated,
and what remains must be taken as one expression. So we
_underscore_ them, putting a _single_ score under k, and a
_double_ one under k'. The result we read as l'h.

We must now find a Premiss containing either l or h'. Looking
along the row, we fix on No. 2, and tack it on.

Now these 3 Nullities are really equivalent to (l'h + dh'), in
which h and h' must be eliminated, and what remains taken as one
expression. So we _underscore_ them. The result reads as l'd.

We now want a Premiss containing l or d'. No. 6 will do.

These 4 Nullities are really equivalent to (l'd + b'l). So we
underscore l' and l. The result reads as db'.

We now want a Premiss containing d' or b. No. 4 will do.

Here we underscore b' and b. The result reads as de'.

We now want a Premiss containing d' or e. No. 7 will do.

Here we underscore d and d'. The result reads as c'e'.

We now want a Premiss containing c or e. No. 3 will do--in fact
_must_ do, as it is the only one left.

Here we underscore c' and c; and, as the whole thing now reads
as e'a, we tack on e'a_{0} as the _Conclusion_, with a ¶.

We now look along the row of Data, to see whether e' or a has
been given as _existent_. We find that a has been so given in
No. 3. So we add this fact to the Conclusion, which now stands
as ¶ e'a_{0} + a_{1}, _i.e._ ¶ a_{1}e'_{0}; i.e. "All a are e."

If the Reader has faithfully obeyed the above directions, his
written solution will now stand as follows:--

1 2 3 4
k_{1}l'_{0} + dh'_{0} + a_{1}c_{0} + b_{1}e'_{0} +

5 6 7
k'h_{0} + b'l_{0} + d'_{1}c'_{0}

1 5 2 6 4 7 3
kl' + k'h + dh' + b'l + be' + d'c' + ac
-- = - -= - = = = - =

¶ e'a_{0} + a_{1}

_i.e._ ¶ a_{1}e'_{0};

_i.e._ "All a are e."
pg093
The Reader should now take a second piece of paper, and copy the
Data only, and try to work out the solution for himself,
beginning with some other Premiss.

If he fails to bring out the Conclusion a_{1}e'_{0}, I would
advise him to take a third piece of paper, and _begin again_!]

I will now work out, in its briefest form, a Sorites of 5 Premisses, to serve as a model for the Reader to imitate in working examples.

(1) "I greatly value everything that John gives me;
(2) Nothing but this bone will satisfy my dog;
(3) I take particular care of everything that I greatly
value;
(4) This bone was a present from John;
(5) The things, of which I take particular care, are
things I do _not_ give to my dog".

Univ. "things"; a = given by John to me; b = given by me to my dog; c = greatly valued by me; d = satisfactory to my dog; e = taken particular care of by me; h = this bone.

1 2 3 4 5
a_{1}c'_{0} + h'd_{0} + c_{1}e'_{0} + h_{1}a'_{0} + e_{1}b_{0}

1 3 4 2 5
ac' + ce' + ha' + h'd + eb ¶ db_{0}
-- =- -= = =

i.e. "Nothing, that I give my dog, satisfies him," or, "My dog is not satisfied with _anything_ that I give him!"

[Note that, in working a Sorites by this process, we may begin
with _any_ Premiss we choose. For instance, we might begin with
No. 5, and the result would then be

5 3 1 4 2
eb + ce' + ac' + ha' + h'd ¶ bd_{0}]
- -= -= -= =

[Work Examples § =4=, 25-30 (p. 100); § =5=, 25-30 (p. 102);
§ =6=, 13-15 (p. 106); § =7=, 13-15 (p. 108); § =8=, 1-4, 13,
14, 19, 24 (pp. 110, 111); § =9=, 1-4, 26, 27, 40, 48 (pp. 112,
116, 119, 121).]

pg094 The Reader, who has successfully grappled with all the Examples hitherto set, and who thirsts, like Alexander the Great, for "more worlds to conquer," may employ his spare energies on the following 17 Examination-Papers. He is recommended not to attempt more than _one_ Paper on any one day. The answers to the questions about words and phrases may be found by referring to the Index at p. 197.

I. § =4=, 31 (p. 100); § =5=, 31-34 (p. 102); § =6=, 16, 17 (p.
106); § =7=, 16 (p. 108); § =8=, 5, 6 (p. 110); § =9=, 5, 22,
42 (pp. 112, 115, 119). What is 'Classification'? And what is
a 'Class'?

II. § =4=, 32 (p. 100); § =5=, 35-38 (pp. 102, 103); § =6=, 18
(p. 107); § =7=, 17, 18 (p. 108); § =8=, 7, 8 (p. 110);
§ =9=, 6, 23, 43 (pp. 112, 115, 119). What are 'Genus',
'Species', and 'Differentia'?

III. § =4=, 33 (p. 100); § =5=, 39-42 (p. 103); § =6=, 19, 20 (p.
107); § =7=, 19 (p. 109); § =8=, 9, 10 (p. 111); § =9=, 7,
24, 44 (pp. 113, 116, 120). What are 'Real' and 'Imaginary'
Classes?

IV. § =4=, 34 (p. 100); § =5=, 43-46 (p. 103); § =6=, 21 (p.
107); § =7=, 20, 21 (p. 109); § =8=, 11, 12 (p. 111); § =9=,
8, 25, 45 (pp. 113, 116, 120). What is 'Division'? When are
Classes said to be 'Codivisional'?

V. § =4=, 35 (p. 100); § =5=, 47-50 (p. 103); § =6=, 22, 23 (p.
107); § =7=, 22 (p. 109); § =8=, 15, 16 (p. 111); § =9=, 9,
28, 46 (pp. 113, 116, 120). What is 'Dichotomy'? What
arbitrary rule does it sometimes require?
pg095
VI. § =4=, 36 (p. 100); § =5=, 51-54 (p. 103); § =6=, 24 (p.
107); § =7=, 23, 24 (p. 109); § =8=, 17 (p. 111); § =9=, 10,
29, 47 (pp. 113, 117, 120). What is a 'Definition'?

VII. § =4=, 37 (p. 100); § =5=, 55-58 (pp. 103, 104); § =6=, 25,
26 (p. 107); § =7=, 25 (p. 109); § =8=, 18 (p. 111); § =9=,
11, 30, 49 (pp. 113, 117, 121). What are the 'Subject' and
the 'Predicate' of a Proposition? What is its 'Normal' form?

VIII. § =4=, 38 (p. 100); § =5=, 59-62 (p. 104); § =6=, 27 (p.
107); § =7=, 26, 27 (p. 109); § =8=, 20 (p. 111); § =9=, 12,
31, 50 (pp. 113, 117, 121). What is a Proposition 'in _I_'?
'In _E_'? And 'in _A_'?

IX. § =4=, 39 (p. 100); § =5=, 63-66 (p. 104); § =6=, 28, 29 (p.
107); § =7=, 28 (p. 109); § =8=, 21 (p. 111); § =9=, 13, 32,
51 (pp. 114, 117, 121). What is the 'Normal' form of a
Proposition of Existence?

X. § =4=, 40 (p. 100); § =5=, 67-70 (p. 104); § =6=, 30 (p.
107); § =7=, 29, 30 (p. 109); § =8=, 22 (p. 111); § =9=, 14,
33, 52 (pp. 114, 117, 122). What is the 'Universe of
Discourse'?

XI. § =4=, 41 (p. 100); § =5=, 71-74 (p. 104); § =6=, 31, 32 (p.
107); § =7=, 31 (p. 109); § =8=, 23 (p. 111); § =9=, 15, 34,
53 (pp. 114, 118, 122). What is implied, in a Proposition of
Relation, as to the Reality of its Terms?

XII. § =4=, 42 (p. 100); § =5=, 75-78 (p. 105); § =6=, 33 (p.
107); § =7=, 32, 33 (pp. 109, 110); § =8=, 25 (p. 111);
§ =9=, 16, 35, 54 (pp. 114, 118, 122). Explain the phrase
"sitting on the fence".

XIII. § =5=, 79-83 (p. 105); § =6=, 34, 35 (p. 107); § =7=, 34 (p.
110); § =8=, 26 (p. 111); § =9=, 17, 36, 55 (pp. 114, 118,
122). What are 'Converse' Propositions?

XIV. § =5=, 84-88 (p. 105); § =6=, 36 (p. 107); § =7=, 35, 36 (p.
110); § =8=, 27 (p. 111); § =9=, 18, 37, 56 (pp. 114, 118,
123). What are 'Concrete' and 'Abstract' Propositions?
pg096
XV. § =5=, 89-93 (p. 105); § =6=, 37, 38 (p. 107); § =7=, 37 (p.
110); § =8=, 28 (p. 111); § =9=, 19, 38, 57 (pp. 115, 118,
123). What is a 'Syllogism'? And what are its 'Premisses' and
its 'Conclusion'?

XVI. § =5=, 94-97 (p. 106); § =6=, 39 (p. 107); § =7=, 38, 39 (p.
110); § =8=, 29 (p. 111); § =9=, 20, 39, 58 (pp. 115, 119,
123). What is a 'Sorites'? And what are its 'Premisses',
its 'Partial Conclusions', and its 'Complete Conclusion'?

XVII. § =5=, 98-101 (p. 106); § =6=, 40 (p. 107); § =7=, 40 (p.
110); § =8=, 30 (p. 111); § =9=, 21, 41, 59, 60 (pp. 115,
119, 124). What are the 'Universe of Discourse', the
'Eliminands', and the 'Retinends', of a Syllogism? And of a
Sorites?

pg097