← Table of contents
Symbolic Logic

Part 3 — CHAPTER I.

Reading edition

INTRODUCTORY

When a Trio of Biliteral Propositions of Relation is such that

(1) all their six Terms are Species of the same Genus, (2) every two of them contain between them a Pair of codivisional Classes, (3) the three Propositions are so related that, if the first two were true, the third would be true,

the Trio is called a ‘Syllogism’; the Genus, of which each of the six Terms is a Species, is called its ‘Universe of Discourse’, or, more briefly, its ‘Univ.’; the first two Propositions are called its ‘Premisses’, and the third its ‘Conclusion’; also the Pair of codivisional Terms in the Premisses are called its ‘Eliminands’, and the other two its ‘Retinends’.

The Conclusion of a Syllogism is said to be ‘consequent’ from its Premisses: hence it is usual to prefix to it the word “Therefore” (or the Symbol “∴”).

pg057[Note that the ‘Eliminands’ are so called because they are eliminated, and do not appear in the Conclusion; and that the ‘Retinends’ are so called because they are retained, and do appear in the Conclusion.

Note also that the question, whether the Conclusion is or is not consequent from the Premisses, is not affected by the actual truth or falsity of any of the Trio, but depends entirely on their relationship to each other.

As a specimen-Syllogism, let us take the Trio

“No x-Things are m-Things; No y-Things are m′-Things. No x-Things are y-Things.”

which we may write, as explained at p. 26, thus:—

“No x are m; No y are m′. No x are y”.

Here the first and second contain the Pair of codivisional Classes m and m′; the first and third contain the Pair x and x; and the second and third contain the Pair y and y.

Also the three Propositions are (as we shall see hereafter) so related that, if the first two were true, the third would also be true.

Hence the Trio is a Syllogism; the two Propositions, “No x are m” and “No y are m′”, are its Premisses; the Proposition “No x are y” is its Conclusion; the Terms m and m′ are its Eliminands; and the Terms x and y are its Retinends.

Hence we may write it thus:—

“No x are m; No y are m′. ∴ No x are y”.

As a second specimen, let us take the Trio

“All cats understand French; Some chickens are cats. Some chickens understand French”.

These, put into normal form, are

“All cats are creatures understanding French; Some chickens are cats. Some chickens are creatures understanding French”.

Here all the six Terms are Species of the Genus “creatures.”

Also the first and second Propositions contain the Pair of codivisional Classes “cats” and “cats”; the first and third contain the Pair “creatures understanding French” and “creatures understanding French”; and the second and third contain the Pair “chickens” and “chickens”.

pg058Also the three Propositions are (as we shall see at p. 64) so related that, if the first two were true, the third would be true. (The first two are, as it happens, not strictly true in our planet. But there is nothing to hinder them from being true in some other planet, say Mars or Jupiter—in which case the third would also be true in that planet, and its inhabitants would probably engage chickens as nursery-governesses. They would thus secure a singular contingent privilege, unknown in England, namely, that they would be able, at any time when provisions ran short, to utilise the nursery-governess for the nursery-dinner!)

Hence the Trio is a Syllogism; the Genus “creatures” is its ‘Univ.’; the two Propositions, “All cats understand French“ and ”Some chickens are cats”, are its Premisses, the Proposition “Some chickens understand French” is its Conclusion; the Terms “cats” and “cats” are its Eliminands; and the Terms, “creatures understanding French” and “chickens”, are its Retinends.

Hence we may write it thus:—

“All cats understand French; Some chickens are cats; ∴ Some chickens understand French”.]

pg059CHAPTER II.

PROBLEMS IN SYLLOGISMS.

§ 1.

Introductory.

When the Terms of a Proposition are represented by words, it is said to be ‘concrete’; when by letters, ‘abstract.’

To translate a Proposition from concrete into abstract form, we fix on a Univ., and regard each Term as a Species of it, and we choose a letter to represent its Differentia.

[For example, suppose we wish to translate “Some soldiers are brave” into abstract form. We may take “men” as Univ., and regard “soldiers” and “brave men” as Species of the Genus “men”; and we may choose x to represent the peculiar Attribute (say “military”) of “soldiers,” and y to represent “brave.” Then the Proposition may be written “Some military men are brave men”; i.e. “Some x-men are y-men”; i.e. (omitting “men,” as explained at p. 26) “Some x are y.”

In practice, we should merely say “Let Univ. be “men”, x = soldiers, y = brave”, and at once translate “Some soldiers are brave” into “Some x are y.”]

The Problems we shall have to solve are of two kinds, viz.

(1) “Given a Pair of Propositions of Relation, which contain between them a pair of codivisional Classes, and which are proposed as Premisses: to ascertain what Conclusion, if any, is consequent from them.”

(2) “Given a Trio of Propositions of Relation, of which every two contain a pair of codivisional Classes, and which are proposed as a Syllogism: to ascertain whether the proposed Conclusion is consequent from the proposed Premisses, and, if so, whether it is complete.”

These Problems we will discuss separately.

pg060§ 2.

Given a Pair of Propositions of Relation, which contain between them a pair of codivisional Classes, and which are proposed as Premisses: to ascertain what Conclusion, if any, is consequent from them.

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

(1) Determine the ‘Universe of Discourse’.

(2) Construct a Dictionary, making m and m (or m and m′) represent the pair of codivisional Classes, and x (or x′) and y (or y′) the other two.

(3) Translate the proposed Premisses into abstract form.

(4) Represent them, together, on a Triliteral Diagram.

(5) Ascertain what Proposition, if any, in terms of x and y, is also represented on it.

(6) Translate this into concrete form.

It is evident that, if the proposed Premisses were true, this other Proposition would also be true. Hence it is a Conclusion consequent from the proposed Premisses.

[Let us work some examples.

(1)

“No son of mine is dishonest; People always treat an honest man with respect”.

Taking “men” as Univ., we may write these as follows:—

“No sons of mine are dishonest men; All honest men are men treated with respect”.

We can now construct our Dictionary, viz. m = honest; x = sons of mine; y = treated with respect.

(Note that the expression “x = sons of mine” is an abbreviated form of “x = the Differentia of ‘sons of mine’, when regarded as a Species of ‘men’”.)

The next thing is to translate the proposed Premisses into abstract form, as follows:—

“No x are m′; All m are y”.

Diagram representing x m prime does not exist and all m are y
Diagram representing x m prime does not exist and all m are y

pg061Next, by the process described at p. 50, we represent these on a Triliteral Diagram, thus:—

Diagram representing x y prime does not exist
Diagram representing x y prime does not exist

Next, by the process described at p. 53, we transfer to a Biliteral Diagram all the information we can.

The result we read as “No x are y′” or as “No y′ are x,” whichever we prefer. So we refer to our Dictionary, to see which will look best; and we choose

“No x are y′”,

which, translated into concrete form, is

“No son of mine fails to be treated with respect”.

(2)

“All cats understand French; Some chickens are cats”.

Taking “creatures” as Univ., we write these as follows:—

“All cats are creatures understanding French; Some chickens are cats”.

We can now construct our Dictionary, viz. m = cats; x = understanding French; y = chickens.

The proposed Premisses, translated into abstract form, are

“All m are x; Some y are m”.

In order to represent these on a Triliteral Diagram, we break up the first into the two Propositions to which it is equivalent, and thus get the three Propositions

(1) “Some m are x; (2) No m are x′; (3) Some y are m”.

Diagram representing x m and y m exist and x prime m does not exist
Diagram representing x m and y m exist and x prime m does not exist

The Rule, given at p. 50, would make us take these in the order 2, 1, 3.

This, however, would produce the result

Alternative diagram representing x m and y m exist and x prime m does not exist
Alternative diagram representing x m and y m exist and x prime m does not exist

pg062So it would be better to take them in the order 2, 3, 1. Nos. (2) and (3) give us the result here shown; and now we need not trouble about No. (1), as the Proposition “Some m are x” is already represented on the Diagram.

Diagram representing x y exists
Diagram representing x y exists

Transferring our information to a Biliteral Diagram, we get

This result we can read either as “Some x are y” or “Some y are x”.

After consulting our Dictionary, we choose

“Some y are x”,

which, translated into concrete form, is

“Some chickens understand French.”

(3)

“All diligent students are successful; All ignorant students are unsuccessful”.

Let Univ. be “students”; m = successful; x = diligent; y = ignorant.

These Premisses, in abstract form, are

“All x are m; All y are m′”.

These, broken up, give us the four Propositions

(1) “Some x are m; (2) No x are m′; (3) Some y are m′; (4) No y are m”.

Diagram representing four propositions
Diagram representing four propositions

which we will take in the order 2, 4, 1, 3.

Representing these on a Triliteral Diagram, we get

Diagram representing all x are y prime and all y are x prime
Diagram representing all x are y prime and all y are x prime

And this information, transferred to a Biliteral Diagram, is

Here we get two Conclusions, viz.

“All x are y′; All y are x′.”

pg063And these, translated into concrete form, are

“All diligent students are (not-ignorant, i.e.) learned; All ignorant students are (not-diligent, i.e.) idle”. (See p. 4.)

(4)

“Of the prisoners who were put on their trial at the last Assizes, all, against whom the verdict ‘guilty’ was returned, were sentenced to imprisonment; Some, who were sentenced to imprisonment, were also sentenced to hard labour”.

Let Univ. be “the prisoners who were put on their trial at the last Assizes”; m = who were sentenced to imprisonment; x = against whom the verdict ‘guilty’ was returned; y = who were sentenced to hard labour.

The Premisses, translated into abstract form, are

“All x are m; Some m are y”.

Breaking up the first, we get the three

(1) “Some x are m; (2) No x are m′; (3) Some m are y”.

Diagram representing x m and y m exist and x m does not exist
Diagram representing x m and y m exist and x m does not exist

Representing these, in the order 2, 1, 3, on a Triliteral Diagram, we get

Here we get no Conclusion at all.

You would very likely have guessed, if you had seen only the Premisses, that the Conclusion would be

“Some, against whom the verdict ‘guilty’ was returned, were sentenced to hard labour”.

But this Conclusion is not even true, with regard to the Assizes I have here invented.

“Not true!” you exclaim. “Then who were they, who were sentenced to imprisonment and were also sentenced to hard labour? They must have had the verdict ‘guilty’ returned against them, or how could they be sentenced?”

Well, it happened like this, you see. They were three ruffians, who had committed highway-robbery. When they were put on their trial, they pleaded ‘guilty’. So no verdict was returned at all; and they were sentenced at once.]

I will now work out, in their briefest form, as models for the Reader to imitate in working examples, the above four concrete Problems.

pg064(1) [see p. 60]

“No son of mine is dishonest; People always treat an honest man with respect.”

Univ. “men”; m = honest; x = my sons; y = treated with respect.

“No x are m′; All m are y.” ∴ “No x are y′.”

Diagram representing x m prime does not exist and all m are y
Diagram representing x m prime does not exist and all m are y
Diagram representing x y prime does not exist
Diagram representing x y prime does not exist

i.e. “No son of mine ever fails to be treated with respect.”

(2) [see p. 61]

“All cats understand French; Some chickens are cats”.

Univ. “creatures”; m = cats; x = understanding French; y = chickens.

“All m are x; Some y are m.” ∴ “Some y are x.”

Diagram representing all m are x and y m exists
Diagram representing all m are x and y m exists
Diagram representing x y exists
Diagram representing x y exists

i.e. “Some chickens understand French.”

(3) [see p. 62]

“All diligent students are successful; All ignorant students are unsuccessful”.

Univ. “students”; m = successful; x = diligent; y = ignorant.

“All x are m; All y are m′.” ∴ “All x are y′; All y are x′.”

Diagram representing all x are m and all y are m prime
Diagram representing all x are m and all y are m prime
Diagram representing all x are y prime and all y are x prime
Diagram representing all x are y prime and all y are x prime

i.e. “All diligent students are learned; and all ignorant students are idle”.

pg065(4) [see p. 63]

“Of the prisoners who were put on their trial at the last Assizes, all, against whom the verdict ‘guilty’ was returned, were sentenced to imprisonment;

Some, who were sentenced to imprisonment, were also sentenced to hard labour”.

Univ. “prisoners who were put on their trial at the last Assizes”, m = sentenced to imprisonment; x = against whom the verdict ‘guilty’ was returned; y = sentenced to hard labour.

“All x are m; Some m are y.” There is no Conclusion.

Diagram representing all x are m and y m exists
Diagram representing all x are m and y m exists

[Review Tables VII, VIII (pp. 48, 49). Work Examples § 1, 17–21 (p. 97); § 4, 1–6 (p. 100); § 5, 1–6 (p. 101).]

pg066§ 3.

Given a Trio of Propositions of Relation, of which every two contain a Pair of codivisional Classes, and which are proposed as a Syllogism; to ascertain whether the proposed Conclusion is consequent from the proposed Premisses, and, if so, whether it is complete.

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

(1) Take the proposed Premisses, and ascertain, by the process described at p. 60, what Conclusion, if any, is consequent from them.

(2) If there be no Conclusion, say so.

(3) If there be a Conclusion, compare it with the proposed Conclusion, and pronounce accordingly.

I will now work out, in their briefest form, as models for the Reader to imitate in working examples, six Problems.

(1)

“All soldiers are strong; All soldiers are brave. Some strong men are brave.”

Univ. “men”; m = soldiers; x = strong; y = brave.

pg067 “All m are x; All m are y. Some x are y.” ∴ “Some x are y.”

Diagram representing all m are x and all m are y
Diagram representing all m are x and all m are y
Diagram representing x y exists
Diagram representing x y exists

Hence proposed Conclusion is right.

(2)

“I admire these pictures; When I admire anything I wish to examine it thoroughly. I wish to examine some of these pictures thoroughly.”

Univ. “things”; m = admired by me; x = these pictures; y = things which I wish to examine thoroughly.

“All x are m; All m are y. Some x are y.” ∴ “All x are y.”

Diagram representing all x are m and all m are y
Diagram representing all x are m and all m are y
Diagram representing all x are y
Diagram representing all x are y

Hence proposed Conclusion is incomplete, the complete one being “I wish to examine all these pictures thoroughly”.

(3)

“None but the brave deserve the fair; Some braggarts are cowards. Some braggarts do not deserve the fair.”

Univ. “persons”; m = brave; x = deserving of the fair; y = braggarts.

“No m′ are x; Some y are m′. Some y are x′.” ∴ “Some y are x′.”

Diagram representing x m prime does not exist and y m prime exists
Diagram representing x m prime does not exist and y m prime exists
Diagram representing x prime y exists
Diagram representing x prime y exists

Hence proposed Conclusion is right.

pg068(4)

“All soldiers can march; Some babies are not soldiers. Some babies cannot march”.

Univ. “persons”; m = soldiers; x = able to march; y = babies.

“All m are x; Some y are m′. Some y are x′.” There is no Conclusion.

Diagram representing all m are x and y m prime exists
Diagram representing all m are x and y m prime exists

(5)

“All selfish men are unpopular; All obliging men are popular. All obliging men are unselfish”.

Univ. “men”; m = popular; x = selfish; y = obliging.

“All x are m′; All y are m. All y are x′.” ∴ “All x are y′; All y are x′.”

Diagram representing all x are m prime and all y are x prime
Diagram representing all x are m prime and all y are x prime
Diagram representing all x are y prime and all y are x prime
Diagram representing all x are y prime and all y are x prime

Hence proposed Conclusion is incomplete, the complete one containing, in addition, “All selfish men are disobliging”.

(6)

”No one, who means to go by the train and cannot get a conveyance, and has not enough time to walk to the station, can do without running;

This party of tourists mean to go by the train and cannot get a conveyance, but they have plenty of time to walk to the station.

This party of tourists need not run.”

Univ. “persons meaning to go by the train, and unable to get a conveyance”; m = having enough time to walk to the station; x = needing to run; y = these tourists.

pg069 “No m′ are x′; All y are m. All y are x′.” There is no Conclusion.

Diagram representing x prime m prime does not exist and all y are m
Diagram representing x prime m prime does not exist and all y are m

[Here is another opportunity, gentle Reader, for playing a trick on your innocent friend. Put the proposed Syllogism before him, and ask him what he thinks of the Conclusion.

He will reply “Why, it’s perfectly correct, of course! And if your precious Logic-book tells you it isn’t, don’t believe it! You don’t mean to tell me those tourists need to run? If I were one of them, and knew the Premisses to be true, I should be quite clear that I needn’t run—and I should walk!”

And you will reply “But suppose there was a mad bull behind you?”

And then your innocent friend will say “Hum! Ha! I must think that over a bit!”

You may then explain to him, as a convenient test of the soundness of a Syllogism, that, if circumstances can be invented which, without interfering with the truth of the Premisses, would make the Conclusion false, the Syllogism must be unsound.]

[Review Tables V–VIII (pp. 46–49). Work Examples § 4, 7–12 (p. 100); § 5, 7–12 (p. 101); § 6, 1–10 (p. 106); § 7, 1–6 (pp. 107, 108).]

pg070BOOK VI.

THE METHOD OF SUBSCRIPTS.

Explore with AITake your curiosity a little further.

Reading settings