Symbolic Logic

By Lewis Carroll

The Project Gutenberg EBook of Symbolic Logic, by Lewis Carroll

This eBook is for the use of anyone anywhere at no cost and with
almost no restrictions whatsoever.  You may copy it, give it away or
re-use it under the terms of the Project Gutenberg License included
with this eBook or online at www.gutenberg.org


Title: Symbolic Logic

Author: Lewis Carroll

Release Date: May 5, 2009 [EBook #28696]

Language: English


*** START OF THIS PROJECT GUTENBERG EBOOK SYMBOLIC LOGIC ***




Produced by Tony Browne, Geetu Melwani, Greg Weeks, L.
Lynn Smith and the Online Distributed Proofreading Team
at https://www.pgdp.net






                                                                   pg-i

SYMBOLIC LOGIC

By Lewis Carroll
                                                                   pg-ii
                                                                   pg-iii
                                                                   pg-iv

A Syllogism worked out.

That story of yours, about your once meeting the sea-serpent, always
sets me off yawning;

I never yawn, unless when I'm listening to something totally devoid of
interest.

The Premisses, separately.

    ·---------------·           ·---------------·
    |( )    |    ( )|           |       |       |
    |   ·---|---·   |           |   ·---|---·   |
    |   |  (#)  |   |           |   |   |( )|   |
    |---|---|---|---|           |---|---|---|---|
    |   |   |   |   |           |   |   |( )|   |
    |   ·---|---·   |           |   ·---|---·   |
    |       |       |           |       |       |
    ·---------------·           ·---------------·

The Premisses, combined.

    ·---------------·
    |( )    |    ( )|
    |   ·---|---·   |
    |   |(#)|( )|   |
    |---|---|---|---|
    |   |   |( )|   |
    |   ·---|---·   |
    |       |       |
    ·---------------·

The Conclusion.

    ·-------·
    |(#)|( )|
    |---|---|
    |   |   |
    ·-------·

That story of yours, about your once meeting the sea-serpent, is totally
devoid of interest.

                                                                   pg-v


                           SYMBOLIC LOGIC


                              _PART I_

                             ELEMENTARY



                                 BY

                            LEWIS CARROLL


                           SECOND THOUSAND

                           FOURTH EDITION


                        _PRICE TWO SHILLINGS_


                               London
                     MACMILLAN AND CO., LIMITED
                   NEW YORK: THE MACMILLAN COMPANY
                                1897

                        _All rights reserved_


                                                                   pg-vi

                   RICHARD CLAY AND SONS, LIMITED,
                          LONDON AND BUNGAY

                                                                   pg-vii


ADVERTISEMENT.


An envelope, containing two blank Diagrams (Biliteral and Triliteral)
and 9 counters (4 Red and 5 Grey), may be had, from Messrs. Macmillan,
for 3_d._, by post 4_d._

       *       *       *       *       *

I shall be grateful to any Reader of this book who will point out any
mistakes or misprints he may happen to notice in it, or any passage
which he thinks is not clearly expressed.

       *       *       *       *       *

I have a quantity of MS. in hand for Parts II and III, and hope to be
able----should life, and health, and opportunity, be granted to me, to
publish them in the course of the next few years. Their contents will be
as follows:--

_PART II. ADVANCED._

Further investigations in the subjects of Part I. Propositions of other
forms (such as "Not-all x are y"). Triliteral and Multiliteral
Propositions (such as "All abc are de"). Hypotheticals. Dilemmas. &c.
&c.

_Part III. TRANSCENDENTAL._

Analysis of a Proposition into its Elements. Numerical and Geometrical
Problems. The Theory of Inference. The Construction of Problems. And
many other _Curiosa Logica_.

                                                                   pg-viii


PREFACE TO THE FOURTH EDITION.


The chief alterations, since the First Edition, have been made in the
Chapter on 'Classification' (pp. 2, 3) and the Book on 'Propositions'
(pp. 10 to 19). The chief additions have been the questions on words and
phrases, added to the Examination-Papers at p. 94, and the Notes
inserted at pp. 164, 194.

In Book I, Chapter II, I have adopted a new definition of
'Classification', which enables me to regard the whole Universe as a
'Class,' and thus to dispense with the very awkward phrase 'a Set of
Things.'

In the Chapter on 'Propositions of Existence' I have adopted a new
'normal form,' in which the Class, whose existence is affirmed or
denied, is regarded as the _Predicate_, instead of the _Subject_, of the
Proposition, thus evading a very subtle difficulty which besets the
other form. These subtle difficulties seem to lie at the root of every
Tree of Knowledge, and they are _far_ more hopeless to grapple with than
any that occur in its higher branches. For example, the difficulties of
the Forty-Seventh Proposition of Euclid are mere child's play compared
with the mental torture endured in the effort to think out the essential
nature of a straight Line. And, in the present work, the difficulties of
the "5 Liars" Problem, at p. 192, are "trifles, light as air," compared
with the bewildering question "What is a Thing?"

In the Chapter on 'Propositions of Relation' I have inserted a new
Section, containing the proof that a Proposition, beginning with "All,"
is a _Double_ Proposition (a fact that is quite independent of the
arbitrary rule, laid down in the next Section, that such a Proposition
is to be understood as implying the actual _existence_ of its Subject).
This proof was given, in the earlier editions, incidentally, in the
course of the discussion of the Biliteral Diagram: but its _proper_
place, in this treatise, is where I have now introduced it.
                                                                   pg-ix
In the Sorites-Examples, I have made a good many verbal alterations, in
order to evade a difficulty, which I fear will have perplexed some of
the Readers of the first three Editions. Some of the Premisses were so
worded that their Terms were not Specieses of the Univ. named in the
Dictionary, but of a larger Class, of which the Univ. was only a
portion. In all such cases, it was intended that the Reader should
perceive that what was asserted of the larger Class was thereby asserted
of the Univ., and should ignore, as superfluous, all that it asserted of
its _other_ portion. Thus, in Ex. 15, the Univ. was stated to be "ducks
in this village," and the third Premiss was "Mrs. Bond has no gray
ducks," i.e. "No gray ducks are ducks belonging to Mrs. Bond." Here the
Terms are _not_ Specieses of the Univ., but of the larger Class "ducks,"
of which the Univ. is only a portion: and it was intended that the
Reader should perceive that what is here asserted of "ducks" is thereby
asserted of "ducks in this village." and should treat this Premiss as if
it were "Mrs. Bond has no gray ducks in this village," and should
ignore, as superfluous, what it asserts as to the _other_ portion of the
Class "ducks," viz. "Mrs. Bond has no gray ducks _out of_ this village".

In the Appendix I have given a new version of the Problem of the "Five
Liars." My object, in doing so, is to escape the subtle and mysterious
difficulties which beset all attempts at regarding a Proposition as
being its own Subject, or a Set of Propositions as being Subjects for
one another. It is certainly, a most bewildering and unsatisfactory
theory: one cannot help feeling that there is a great lack of
_substance_ in all this shadowy host----that, as the procession of
phantoms glides before us, there is not _one_ that we can pounce upon,
and say "_Here_ is a Proposition that _must_ be either true or
false!"----that it is but a Barmecide Feast, to which we have been
bidden----and that its prototype is to be found in that mythical island,
whose inhabitants "earned a precarious living by taking in each others'
washing"! By simply translating "telling 2 Truths" into "taking _both_
of 2 condiments (salt and mustard)," "telling 2 Lies" into "taking
_neither_ of them" and "telling a Truth and a Lie (order not specified)"
into "taking only _one_ condiment (it is not specified _which_)," I have
escaped all those metaphysical puzzles, and have produced a Problem
which, when translated into a Set of symbolized Premisses, furnishes the
very same _Data_ as were furnished by the Problem of the "Five Liars."
                                                                   pg-x
The coined words, introduced in previous editions, such as "Eliminands"
and "Retinends", perhaps hardly need any apology: they were
indispensable to my system: but the new plural, here used for the first
time, viz. "Soriteses", will, I fear, be condemned as "bad English",
unless I say a word in its defence. We have _three_ singular nouns, in
English, of plural _form_, "series", "species", and "Sorites": in all
three, the awkwardness, of using the same word for both singular and
plural, must often have been felt: this has been remedied, in the case
of "series" by coining the plural "serieses", which has already found
its way into the dictionaries: so I am no rash innovator, but am merely
"following suit", in using the new plural "Soriteses".

In conclusion, let me point out that even those, who are obliged to
study _Formal_ Logic, with a view to being able to answer
Examination-Papers in that subject, will find the study of _Symbolic_
Logic most helpful for this purpose, in throwing light upon many of the
obscurities with which Formal Logic abounds, and in furnishing a
delightfully easy method of _testing_ the results arrived at by the
cumbrous processes which Formal Logic enforces upon its votaries.

This is, I believe, the very first attempt (with the exception of my own
little book, _The Game of Logic_, published in 1886, a very incomplete
performance) that has been made to _popularise_ this fascinating
subject. It has cost me _years_ of hard work: but if it should prove, as
I hope it may, to be of _real_ service to the young, and to be taken up,
in High Schools and in private families, as a valuable addition to their
stock of healthful mental recreations, such a result would more than
repay ten times the labour that I have expended on it.

                                                                L. C.

29, BEDFORD STREET, STRAND.
    _Christmas, 1896._

                                                                   pg-xi


INTRODUCTION.

_TO LEARNERS._

[N.B. Some remarks, addressed to _Teachers_, will be found in the
Appendix, at p. 165.]


The Learner, who wishes to try the question _fairly_, whether this
little book does, or does not, supply the materials for a most
interesting mental recreation, is _earnestly_ advised to adopt the
following Rules:--

(1) Begin at the _beginning_, and do not allow yourself to gratify a
mere idle curiosity by dipping into the book, here and there. This would
very likely lead to your throwing it aside, with the remark "This is
_much_ too hard for me!", and thus losing the chance of adding a very
_large_ item to your stock of mental delights. This Rule (of not
_dipping_) is very _desirable_ with _other_ kinds of books----such as
novels, for instance, where you may easily spoil much of the enjoyment
you would otherwise get from the story, by dipping into it further on,
so that what the author meant to be a pleasant surprise comes to you as
a matter of course. Some people, I know, make a practice of looking into
Vol. III first, just to see how the story ends: and perhaps it _is_ as
well just to know that all ends _happily_----that the much-persecuted
lovers _do_ marry after all, that he is proved to be quite innocent of
the murder, that the wicked cousin is completely foiled in his plot and
gets the punishment he deserves, and that the rich uncle in India (_Qu._
Why in _India_? _Ans._ Because, somehow, uncles never _can_ get rich
anywhere else) dies at exactly the right moment----before taking the
trouble to read Vol. I. This, I say, is _just_ permissible with a
_novel_, where Vol. III has a _meaning_, even for those who have not
read the earlier part of the story; but, with a _scientific_ book, it is
sheer insanity: you will find the latter part _hopelessly_
unintelligible, if you read it before reaching it in regular course.
                                                                   pg-xii
(2) Don't begin any fresh Chapter, or Section, until you are certain
that you _thoroughly_ understand the whole book _up to that point_, and
that you have worked, correctly, most if not all of the examples which
have been set. So long as you are conscious that all the land you have
passed through is absolutely _conquered_, and that you are leaving no
unsolved difficulties _behind_ you, which will be sure to turn up again
later on, your triumphal progress will be easy and delightful.
Otherwise, you will find your state of puzzlement get worse and worse as
you proceed, till you give up the whole thing in utter disgust.

(3) When you come to any passage you don't understand, _read it again_:
if you _still_ don't understand it, _read it again_: if you fail, even
after _three_ readings, very likely your brain is getting a little
tired. In that case, put the book away, and take to other occupations,
and next day, when you come to it fresh, you will very likely find that
it is _quite_ easy.

(4) If possible, find some genial friend, who will read the book along
with you, and will talk over the difficulties with you. _Talking_ is a
wonderful smoother-over of difficulties. When _I_ come upon
anything----in Logic or in any other hard subject----that entirely
puzzles me, I find it a capital plan to talk it over, _aloud_, even when
I am all alone. One can explain things so _clearly_ to one's self! And
then, you know, one is so _patient_ with one's self: one _never_ gets
irritated at one's own stupidity!

If, dear Reader, you will faithfully observe these Rules, and so give my
little book a really _fair_ trial, I promise you, most confidently, that
you will find Symbolic Logic to be one of the most, if not _the_ most,
fascinating of mental recreations! In this First Part, I have carefully
avoided all difficulties which seemed to me to be beyond the grasp of an
intelligent child of (say) twelve or fourteen years of age. I have
myself taught most of its contents, _vivâ voce_, to _many_ children, and
have found them take a real intelligent interest in the subject. For
those, who succeed in mastering Part I, and who begin, like Oliver,
"asking for more," I hope to provide, in Part II, some _tolerably_ hard
nuts to crack----nuts that will require all the nut-crackers they happen
to possess!
                                                                   pg-xiii
Mental recreation is a thing that we all of us need for our mental
health; and you may get much healthy enjoyment, no doubt, from Games,
such as Back-gammon, Chess, and the new Game "Halma". But, after all,
when you have made yourself a first-rate player at any one of these
Games, you have nothing real to _show_ for it, as a _result!_ You
enjoyed the Game, and the victory, no doubt, _at the time_: but you have
no _result_ that you can treasure up and get real _good_ out of. And,
all the while, you have been leaving unexplored a perfect _mine_ of
wealth. Once master the machinery of Symbolic Logic, and you have a
mental occupation always at hand, of absorbing interest, and one that
will be of real _use_ to you in _any_ subject you may take up. It will
give you clearness of thought----the ability to _see your way_ through a
puzzle----the habit of arranging your ideas in an orderly and
get-at-able form----and, more valuable than all, the power to detect
_fallacies_, and to tear to pieces the flimsy illogical arguments, which
you will so continually encounter in books, in newspapers, in speeches,
and even in sermons, and which so easily delude those who have never
taken the trouble to master this fascinating Art. _Try it._ That is all
I ask of you!

                                                                L. C.

29, BEDFORD STREET, STRAND.
    _February 21, 1896._

                                                                   pg-xiv
                                                                   pg-xv

CONTENTS.


=BOOK I.=

=THINGS AND THEIR ATTRIBUTES.=


CHAPTER I.

_INTRODUCTORY._

                                                               PAGE
'=Things='                                                       1

'=Attributes='                                                   "

'=Adjuncts='                                                     "


CHAPTER II.

_CLASSIFICATION._

'=Classification='                                               1½

'=Class='                                                        "

'=Peculiar=' Attributes                                          "

'=Genus='                                                        "

'=Species='                                                      "

'=Differentia='                                                  "

'=Real=' and '=Unreal=', or '=Imaginary=', Classes               2

'=Individual='                                                   "

A Class regarded as a single Thing                               2½

                                                                   pg-xvi
CHAPTER III.

_DIVISION._


§ 1.

_Introductory._

'=Division='                                                     3

'=Codivisional=' Classes                                         "


§ 2.

_Dichotomy._

'=Dichotomy='                                                    3½

Arbitrary limits of Classes                                      "

Subdivision of Classes                                           4


CHAPTER IV.

_NAMES._

'=Name='                                                         4½

'=Real=' and '=Unreal=' Names                                    "

Three ways of expressing a Name                                  "

Two senses in which a plural Name may be used                    5


CHAPTER V.

_DEFINITIONS._

'=Definition='                                                   6

Examples worked as models                                        "

                                                                   pg-xvii
=BOOK II.=

=PROPOSITIONS.=


CHAPTER I.

_PROPOSITIONS GENERALLY._


§ 1.

_Introductory._

Technical meaning of "some"                                      8

'=Proposition='                                                  "

'=Normal form=' of a Proposition                                 "

'=Subject=', '=Predicate=', and '=Terms='                        9


§ 2.

_Normal form of a Proposition._

Its four parts:--

  (1) '=Sign of Quantity='                                       9

  (2) Name of Subject                                            "

  (3) '=Copula='                                                 "

  (4) Name of Predicate                                          "


§ 3.

_Various kinds of Propositions._

Three kinds of Propositions:--

  (1) Begins with "Some". Called a '=Particular=' Proposition:
      also a Proposition '=in I='                               10

  (2) Begins with "No". Called a '=Universal Negative='
      Proposition: also a Proposition '=in E='                   "

  (3) Begins with "All". Called a '=Universal Affirmative='
      Proposition: also a Proposition '=in A='                   "
                                                                   pg-xviii
A Proposition, whose Subject is an Individual, is to be
regarded as Universal                                            "

Two kinds of Propositions, 'Propositions of Existence',
and 'Propositions of Relation'                                   "


CHAPTER II.

_PROPOSITIONS OF EXISTENCE._


'=Proposition of Existence ='                                   11


CHAPTER III.

_PROPOSITIONS OF RELATION._


§ 1.

_Introductory._

'=Proposition of Relation='                                     12

'=Universe of Discourse=,' or '=Univ.='                          "


§ 2.

_Reduction of a Proposition of Relation
to Normal form._

Rules                                                           13

Examples worked                                                  "


§ 3.

_A Proposition of Relation, beginning with "All",
is a Double Proposition._

Its equivalence to _two_ Propositions                           17

                                                                   pg-xix
§ 4.

_What is implied, in a Proposition of Relation,
as to the Reality of its Terms?_

Propositions beginning with "Some"                              19

       "            "       "No"                                 "

       "            "       "All"                                "


§ 5.

_Translation of a Proposition of Relation into
one or more Propositions of Existence._

Rules                                                           20

Examples worked                                                  "


=BOOK III.=

=THE BILITERAL DIAGRAM.=


CHAPTER I.

_SYMBOLS AND CELLS._

The Diagram assigned to a certain Set of Things, viz. our
Univ.                                                           22

Univ. divided into 'the x-Class' and 'the x'-Class'             23

The North and South Halves assigned to these two Classes         "

The x-Class subdivided into 'the xy-Class' and 'the xy'-Class'   "

The North-West and North-East Cells assigned to these
two Classes                                                      "

The x'-Class similarly divided                                   "

The South-West and South-East Cells similarly assigned           "

The West and East Halves have thus been assigned to
'the y-Class' and 'the y'-Class'                                24

=Table I.= Attributes of Classes, and Compartments, or
Cells, assigned to them                                         25

                                                                   pg-xx
CHAPTER II.

_COUNTERS._


Meaning of a Red Counter placed in a Cell                       26

    "       "      "        "   on a Partition                   "

American phrase "=sitting on the fence="                         "

Meaning of a Grey Counter placed in a Cell                       "


CHAPTER III.

_REPRESENTATION OF PROPOSITIONS._


§ 1.

_Introductory._

The word "Things" to be henceforwards omitted                   27

'=Uniliteral=' Proposition                                       "

'=Biliteral='       do.                                          "

Proposition '=in terms of=' certain Letters                      "


§ 2.

_Representation of Propositions of Existence._

The Proposition "Some x exist"                                  28

Three other similar Propositions                                 "

The Proposition "No x exist"                                     "

Three other similar Propositions                                29

The Proposition "Some xy exist"                                  "

Three other similar Propositions                                 "

The Proposition "No xy exist"                                    "

Three other similar Propositions                                 "

The Proposition "No x exist" is _Double_, and is equivalent
to the two Propositions "No xy exist" and "No xy' exist"        30

                                                                   pg-xxi
§ 3.

_Representation of Propositions of Relations._

The Proposition "Some x are y"                                   "

Three other similar Propositions                                 "

The Proposition "Some y are x"                                  31

Three other similar Propositions                                 "

Trio of equivalent Propositions, viz.
"Some xy exist" = "Some x are y" = "Some y are x"                "

'=Converse=' Propositions, and '=Conversion='                    "

Three other similar Trios                                       32

The Proposition "No x are y"                                     "

Three other similar Propositions                                 "

The Proposition "No y are x"                                     "

Three other similar Propositions                                 "

Trio of equivalent Propositions, viz.
"No xy exist" = "No x are y" = "No y are x"                     33

Three other similar Trios                                        "

The Proposition "All x are y" is _Double_, and is equivalent
to the two Propositions "Some x are y" and "No x are _y'_"       "

Seven other similar Propositions                                34

=Tables II, III.= Representation of Propositions of
Existence and Relation                                      34, 35


CHAPTER IV.

_INTERPRETATION OF BILITERAL DIAGRAM, WHEN MARKED WITH COUNTERS._

                   ·-------·
                   |(.)|   |
Interpretation of  |---|---|                                    36
                   |   |   |
                   ·-------·

And of three other similar arrangements                          "
                                                                   pg-xxii
                   ·-------·
                   |( )|   |
Interpretation of  |---|---|                                     "
                   |   |   |
                   ·-------·

And of three other similar arrangements                          "

                   ·-------·
                   |  (.)  |
Interpretation of  |---|---|                                    37
                   |   |   |
                   ·-------·

And of three other similar arrangements                          "

                   ·-------·
                   |(.)|(.)|
Interpretation of  |---|---|                                     "
                   |   |   |
                   ·-------·

And of three other similar arrangements                          "

                   ·-------·
                   |( )|( )|
Interpretation of  |---|---|                                     "
                   |   |   |
                   ·-------·

And of three other similar arrangements                          "

                   ·-------·
                   |(.)|( )|
Interpretation of  |---|---|                                     "
                   |   |   |
                   ·-------·

And of seven other similar arrangements                         38


=BOOK IV.=

=THE TRILITERAL DIAGRAM.=


CHAPTER I.

_SYMBOLS AND CELLS._

Change of Biliteral into Triliteral Diagram                     39

The xy-Class subdivided into 'the xym-Class' and
'the xym'-Class'                                                40
                                                                   pg-xxiii
The Inner and Outer Cells of the North-West Quarter
assigned to these Classes                                        "

The xy'-Class, the x'y-Class, and the
x'y'-Class similarly subdivided                                  "

The Inner and Outer Cells of the North-East, the South-West,
and the South-East Quarter similarly assigned                    "

The Inner Square and the Outer Border have thus been assigned
to 'the m-Class' and 'the _m'_-Class'                            "

Rules for finding readily the Compartment, or Cell,
assigned to any given Attribute or Attributes                    "

=Table IV.= Attributes of Classes, and Compartments,
or Cells, assigned to them                                      42


CHAPTER II.

_REPRESENTATION OF PROPOSITIONS IN TERMS
OF x AND m, OR OF y AND m._


§ 1.

_Representation of Propositions of Existence in terms
of x and m, or of y and m._

The Proposition "Some xm exist"                                 43

Seven other similar Propositions                                 "

The Proposition "No xm exist"                                   44

Seven other similar Propositions                                 "


§ 2.

_Representation of Propositions of Relation in terms
of x and m, or of y and m._

The Pair of Converse Propositions
"Some x are m" = "Some m are x"                                  "

Seven other similar Pairs                                        "

The Pair of Converse Propositions
"No x are m" = "No m are x"                                      "

Seven other similar Pairs                                        "

The Proposition "All x are m"                                   45

Fifteen other similar Propositions                               "

=Tables V, VI, VII, VIII.= Representations of
Propositions in terms of x and m, or of
y and m                                                   46 to 49

                                                                   pg-xxiv
CHAPTER III.

_REPRESENTATION OF TWO PROPOSITIONS
OF RELATION, ONE IN TERMS OF x AND m,
AND THE OTHER IN TERMS OF y AND m,
ON THE SAME DIAGRAM._

The Digits "I" and "O" to be used instead of Red and
Grey Counters                                                   50

Rules                                                            "

Examples worked                                                  "


CHAPTER IV.

_INTERPRETATION, IN TERMS OF x AND y,
OF TRILITERAL DIAGRAM, WHEN MARKED
WITH COUNTERS OR DIGITS._

Rules                                                           53

Examples worked                                                 54


=BOOK V.=

=SYLLOGISMS.=


CHAPTER I.

_INTRODUCTORY._

'=Syllogism='                                                   56

'=Premisses='                                                    "

'=Conclusion='                                                   "

'=Eliminands='                                                  57

'=Retinends='                                                    "

'=Consequent='                                                   "

The Symbol ".'."                                                 "

Specimen-Syllogisms                                              "

                                                                   pg-xxv
CHAPTER II.

_PROBLEMS IN SYLLOGISMS._


§ 1.

_Introductory._

'=Concrete=' and '=Abstract=' Propositions                      59

Method of translating a Proposition from concrete into
abstract form                                                    "

Two forms of Problems                                            "


§ 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._

Rules                                                           60

Examples worked fully                                            "

The same worked briefly, as models                              64


§ 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._

Rules                                                           66

Examples worked briefly, as models                               "

                                                                   pg-xxvi
=BOOK VI.=

=THE METHOD OF SUBSCRIPTS.=


CHAPTER I.

_INTRODUCTORY._

Meaning of x_{1}, xy_{1}, &c.                                   70

'=Entity='                                                       "

Meaning of x_{0}, xy_{0}, &c.                                    "

'=Nullity='                                                      "

The Symbols "+" and "¶"                                          "

'=Like=' and '=unlike=' Signs                                    "


CHAPTER II.

_REPRESENTATION OF PROPOSITIONS OF RELATION._

The Pair of Converse Propositions
"Some x are y" = "Some y are x"                                 71

Three other similar Pairs                                        "

The Pair of Converse Propositions
"No x are y" = "No y are x"                                      "

Three other similar Pairs                                        "

The Proposition "All x are y"                                   72

The Proposition "All x are y" is _Double_,
and is equivalent to the two Propositions "Some x
exist" and "No x and y'"                                         "

Seven other similar Propositions                                 "

Rule for translating "All x are y" from abstract
into subscript form, and _vice versâ_                            "

                                                                   pg-xxvii
CHAPTER III.

_SYLLOGISMS._


§ 1.

_Representation of Syllogisms._

Rules                                                           73


§ 2.

_Formulæ for Syllogisms._

Three Formulæ worked out:--

  Fig. I. xm_{0} + ym'_{0} ¶ xy_{0}                             75

  its two Variants (a) and (b)                                   "

  Fig. II. xm_{0} + ym_{1} ¶ x'y_{1}                            76

  Fig. III. xm_{0} + ym_{0} + m_{1} ¶ x'y'_{1}                  77

=Table IX.= Formulæ and Rules                                   78

Examples worked briefly, as models                               "


§ 3.

_Fallacies._

'=Fallacy='                                                     81

Method of finding Forms of Fallacies                            82

Forms best stated in _words_                                     "

Three Forms of Fallacies:--

  (1) Fallacy of Like Eliminands not asserted to exist           "

  (2) Fallacy of Unlike Eliminands with an Entity-Premiss       83

  (3) Fallacy of two Entity-Premisses                            "


§ 4.

_Method of proceeding with a given Pair of Propositions._

Rules                                                           84

                                                                   pg-xxviii
=BOOK VII.=

=SORITESES.=


CHAPTER I.

_INTRODUCTORY._


'=Sorites='                                                     85

'=Premisses='                                                    "

'=Partial Conclusion='                                           "

'=Complete Conclusion=' (or '=Conclusion=')                      "

'=Eliminands='                                                   "

'=Retinends='                                                    "

'=consequent='                                                   "

The Symbol ".'."                                                 "

Specimen-Soriteses                                              86


CHAPTER II.

_PROBLEMS IN SORITESES._


§ 1.

_Introductory._

Form of Problem                                                 87

Two Methods of Solution                                          "


§ 2.

_Solution by Method of Separate Syllogisms._

Rules                                                           88

Example worked                                                   "

                                                                   pg-xxix
§ 3.

_Solution by Method of Underscoring._

'=Underscoring='                                                91

Subscripts to be omitted                                         "

Example worked fully                                            92

Example worked briefly, as model                                93

Seventeen Examination-Papers                                    94


=BOOK VIII.=

=EXAMPLES, WITH ANSWERS AND SOLUTIONS.=


CHAPTER I.

_EXAMPLES._


§ 1.

_Propositions of Relation, to be reduced to normal form_        97


§ 2.

_Pairs of Abstract Propositions, one in terms of x and m,
and the other in terms of y and m, to be represented on
the same Triliteral Diagram_                                    98


§ 3.

_Marked Triliteral Diagrams, to be interpreted in terms
of x and y_                                                     99


§ 4.

_Pairs of Abstract Propositions, proposed as Premisses:
Conclusions to be found_                                       100

                                                                   pg-xxx
§ 5.

_Pairs of Concrete Propositions, proposed as Premisses:
Conclusions to be found_                                       101


§ 6.

_Trios of Abstract Propositions, proposed as Syllogisms:
to be examined_                                                106


§ 7.

_Trios of Concrete Propositions, proposed as Syllogisms:
to be examined_                                                107


§ 8.

_Sets of Abstract Propositions, proposed as Premisses for
Soriteses: Conclusions to be found_                            110


§ 9.

_Sets of Concrete Propositions, proposed as Premisses for
Soriteses: Conclusions to be found_                            112


CHAPTER II.

_ANSWERS._

Answers to

  § 1                                                          125

  § 2                                                          126

 §§ 3, 4                                                       127

  § 5                                                          128

  § 6                                                          130

  § 7                                                          131

 §§ 8, 9                                                       132

                                                                   pg-xxxi
CHAPTER III.

_SOLUTIONS._


§ 1.

_Propositions of Relation reduced to normal form._

Solutions for § 1                                              134


§ 2.

_Method of Diagrams._

Solutions for

  § 4 Nos. 1 to 12                                             136

  § 5  "   1 to 12                                             138

  § 6  "   1 to 10                                             141

  § 7  "   1 to 6                                              144


§ 3.

_Method of Subscripts._

Solutions for

  § 4                                                          146

  § 5 Nos. 13 to 24                                            147

 §§ 6, 7, 8, 9                                          148 to 157


=NOTES=                                                        164


=APPENDIX, ADDRESSED TO TEACHERS=                              165


=NOTES TO APPENDIX=                                            195


=INDEX.=

  § 1. Tables                                                  197

  § 2. Words &c. explained                                      "
                                                                   pg-xxxii
                                                                   pg001


BOOK I.

THINGS AND THEIR ATTRIBUTES.



CHAPTER I.

_INTRODUCTORY._


The Universe contains '=Things=.'

    [For example, "I," "London," "roses," "redness," "old English
    books," "the letter which I received yesterday."]

Things have '=Attributes=.'

    [For example, "large," "red," "old," "which I received
    yesterday."]

One Thing may have many Attributes; and one Attribute may belong to many
Things.

    [Thus, the Thing "a rose" may have the Attributes "red,"
    "scented," "full-blown," &c.; and the Attribute "red" may belong
    to the Things "a rose," "a brick," "a ribbon," &c.]

Any Attribute, or any Set of Attributes, may be called an '=Adjunct=.'

    [This word is introduced in order to avoid the constant
    repetition of the phrase "Attribute or Set of Attributes."

    Thus, we may say that a rose has the Attribute "red" (or the
    Adjunct "red," whichever we prefer); or we may say that it has
    the Adjunct "red, scented and full-blown."]

                                                                   pg001½

CHAPTER II.

_CLASSIFICATION._


'Classification,' or the formation of Classes, is a Mental Process, in
which we imagine that we have put together, in a group, certain Things.
Such a group is called a '=Class=.'

This Process may be performed in three different ways, as follows:--

(1) We may imagine that we have put together all Things. The Class so
formed (i.e. the Class "Things") contains the whole Universe.

(2) We may think of the Class "Things," and may imagine that we have
picked out from it all the Things which possess a certain Adjunct _not_
possessed by the whole Class. This Adjunct is said to be '=peculiar=' to
the Class so formed. In this case, the Class "Things" is called a
'=Genus=' with regard to the Class so formed: the Class, so formed, is
called a '=Species=' of the Class "Things": and its peculiar Adjunct is
called its '=Differentia='.
                                                                   pg002
As this Process is entirely _Mental_, we can perform it whether there
_is_, or _is not_, an _existing_ Thing which possesses that Adjunct. If
there _is_, the Class is said to be '=Real='; if not, it is said to be
'=Unreal=', or '=Imaginary=.'

    [For example, we may imagine that we have picked out, from the
    Class "Things," all the Things which possess the Adjunct
    "material, artificial, consisting of houses and streets"; and we
    may thus form the Real Class "towns." Here we may regard
    "Things" as a _Genus_, "Towns" as a _Species_ of Things, and
    "material, artificial, consisting of houses and streets" as its
    _Differentia_.

    Again, we may imagine that we have picked out all the Things
    which possess the Adjunct "weighing a ton, easily lifted by a
    baby"; and we may thus form the _Imaginary_ Class "Things that
    weigh a ton and are easily lifted by a baby."]

(3) We may think of a certain Class, _not_ the Class "Things," and may
imagine that we have picked out from it all the Members of it which
possess a certain Adjunct _not_ possessed by the whole Class. This
Adjunct is said to be '=peculiar=' to the smaller Class so formed. In
this case, the Class thought of is called a '=Genus=' with regard to the
smaller Class picked out from it: the smaller Class is called a
'=Species=' of the larger: and its peculiar Adjunct is called its
'=Differentia='.

    [For example, we may think of the Class "towns," and imagine
    that we have picked out from it all the towns which possess the
    Attribute "lit with gas"; and we may thus form the Real Class
    "towns lit with gas." Here we may regard "Towns" as a _Genus_,
    "Towns lit with gas" as a _Species_ of Towns, and "lit with gas"
    as its _Differentia_.

    If, in the above example, we were to alter "lit with gas" into
    "paved with gold," we should get the _Imaginary_ Class "towns
    paved with gold."]

A Class, containing only _one_ Member is called an '=Individual=.'

    [For example, the Class "towns having four million inhabitants,"
    which Class contains only _one_ Member, viz. "London."]
                                                                   pg002½
Hence, any single Thing, which we can name so as to distinguish it from
all other Things, may be regarded as a one-Member Class.

    [Thus "London" may be regarded as the one-Member Class, picked
    out from the Class "towns," which has, as its Differentia,
    "having four million inhabitants."]

A Class, containing two or more Members, is sometimes regarded as _one
single Thing_. When so regarded, it may possess an Adjunct which is
_not_ possessed by any Member of it taken separately.

    [Thus, the Class "The soldiers of the Tenth Regiment," when
    regarded as _one single Thing_, may possess the Attribute
    "formed in square," which is _not_ possessed by any Member of it
    taken separately.]

                                                                   pg003

CHAPTER III.

_DIVISION._


§ 1.

_Introductory._

'Division' is a Mental Process, in which we think of a certain Class of
Things, and imagine that we have divided it into two or more smaller
Classes.

    [Thus, we might think of the Class "books," and imagine that we
    had divided it into the two smaller Classes "bound books" and
    "unbound books," or into the three Classes, "books priced at
    less than a shilling," "shilling-books," "books priced at more
    than a shilling," or into the twenty-six Classes, "books whose
    names begin with _A_," "books whose names begin with _B_," &c.]

A Class, that has been obtained by a certain Division, is said to be
'codivisional' with every Class obtained by that Division.

    [Thus, the Class "bound books" is codivisional with each of the
    two Classes, "bound books" and "unbound books."

    Similarly, the Battle of Waterloo may be said to have been
    "contemporary" with every event that happened in 1815.]

Hence a Class, obtained by Division, is codivisional with itself.

    [Thus, the Class "bound books" is codivisional with itself.

    Similarly, the Battle of Waterloo may be said to have been
    "contemporary" with itself.]

                                                                   pg003½
§ 2.

_Dichotomy._

If we think of a certain Class, and imagine that we have picked out from
it a certain smaller Class, it is evident that the _Remainder_ of the
large Class does _not_ possess the Differentia of that smaller Class.
Hence it may be regarded as _another_ smaller Class, whose Differentia
may be formed, from that of the Class first picked out, by prefixing the
word "not"; and we may imagine that we have _divided_ the Class first
thought of into _two_ smaller Classes, whose Differentiæ are
_contradictory_. This kind of Division is called '=Dichotomy='.

    [For example, we may divide "books" into the two Classes whose
    Differentiæ are "old" and "not-old."]

In performing this Process, we may sometimes find that the Attributes we
have chosen are used so loosely, in ordinary conversation, that it is
not easy to decide _which_ of the Things belong to the one Class and
_which_ to the other. In such a case, it would be necessary to lay down
some arbitrary _rule_, as to _where_ the one Class should end and the
other begin.

    [Thus, in dividing "books" into "old" and "not-old," we may say
    "Let all books printed before A.D. 1801, be regarded as 'old,'
    and all others as 'not-old'."]

Henceforwards let it be understood that, if a Class of Things be divided
into two Classes, whose Differentiæ have contrary meanings, each
Differentia is to be regarded as equivalent to the other with the word
"not" prefixed.

    [Thus, if "books" be divided into "old" and "new" the Attribute
    "old" is to be regarded as equivalent to "not-new," and the
    Attribute "new" as equivalent to "not-old."]
                                                                   pg004
After dividing a Class, by the Process of _Dichotomy_, into two smaller
Classes, we may sub-divide each of these into two still smaller Classes;
and this Process may be repeated over and over again, the number of
Classes being doubled at each repetition.

    [For example, we may divide "books" into "old" and "new" (i.e.
    "_not_-old"): we may then sub-divide each of these into
    "English" and "foreign" (i.e. "_not_-English"), thus getting
    _four_ Classes, viz.

        (1) old English;
        (2) old foreign;
        (3) new English;
        (4) new foreign.

    If we had begun by dividing into "English" and "foreign," and
    had then sub-divided into "old" and "new," the four Classes
    would have been

        (1) English old;
        (2) English new;
        (3) foreign old;
        (4) foreign new.

    The Reader will easily see that these are the very same four
    Classes which we had before.]

                                                                   pg004½

CHAPTER IV.

_NAMES._


The word "Thing", which conveys the idea of a Thing, _without_ any idea
of an Adjunct, represents _any_ single Thing. Any other word (or
phrase), which conveys the idea of a Thing, _with_ the idea of an
Adjunct represents _any_ Thing which possesses that Adjunct; i.e., it
represents any Member of the Class to which that Adjunct is _peculiar_.

Such a word (or phrase) is called a '=Name='; and, if there be an
existing Thing which it represents, it is said to be a Name of that
Thing.

    [For example, the words "Thing," "Treasure," "Town," and the
    phrases "valuable Thing," "material artificial Thing consisting
    of houses and streets," "Town lit with gas," "Town paved with
    gold," "old English Book."]

Just as a Class is said to be _Real_, or _Unreal_, according as there
_is_, or _is not_, an existing Thing in it, so also a Name is said to be
_Real_, or _Unreal_, according as there _is_, or _is not_, an existing
Thing represented by it.

    [Thus, "Town lit with gas" is a _Real_ Name: "Town paved with
    gold" is an _Unreal_ Name.]

Every Name is either a Substantive only, or else a phrase consisting of
a Substantive and one or more Adjectives (or phrases used as
Adjectives).

Every Name, except "Thing", may usually be expressed in three different
forms:--

    (_a_) The Substantive "Thing", and one or more
    Adjectives (or phrases used as Adjectives) conveying
    the ideas of the Attributes;
                                                                   pg005
    (_b_) A Substantive, conveying the idea of a Thing with
    the ideas of _some_ of the Attributes, and one or more
    Adjectives (or phrases used as Adjectives) conveying
    the ideas of the _other_ Attributes;

    (_c_) A Substantive conveying the idea of a Thing with
    the ideas of _all_ the Attributes.

    [Thus, the phrase "material living Thing, belonging to the
    Animal Kingdom, having two hands and two feet" is a Name
    expressed in Form (_a_).

    If we choose to roll up together the Substantive "Thing" and the
    Adjectives "material, living, belonging to the Animal Kingdom,"
    so as to make the new Substantive "Animal," we get the phrase
    "Animal having two hands and two feet," which is a Name
    (representing the same Thing as before) expressed in Form (_b_).

    And, if we choose to roll up the whole phrase into one word, so
    as to make the new Substantive "Man," we get a Name (still
    representing the very same Thing) expressed in Form (_c_).]

A Name, whose Substantive is in the _plural_ number, may be used to
represent either

    (1) Members of a Class, _regarded as separate Things_;
    or (2) a whole Class, _regarded as one single Thing_.

    [Thus, when I say "Some soldiers of the Tenth Regiment are
    tall," or "The soldiers of the Tenth Regiment are brave," I am
    using the Name "soldiers of the Tenth Regiment" in the _first_
    sense; and it is just the same as if I were to point to each of
    them _separately_, and to say "_This_ soldier of the Tenth
    Regiment is tall," "_That_ soldier of the Tenth Regiment is
    tall," and so on.

    But, when I say "The soldiers of the Tenth Regiment are formed
    in square," I am using the phrase in the _second_ sense; and it
    is just the same as if I were to say "The _Tenth Regiment_ is
    formed in square."]

                                                                   pg006

CHAPTER V.

_DEFINITIONS._


It is evident that every Member of a _Species_ is _also_ a Member of the
_Genus_ out of which that Species has been picked, and that it possesses
the _Differentia_ of that Species. Hence it may be represented by a Name
consisting of two parts, one being a Name representing any Member of the
_Genus_, and the other being the _Differentia_ of that Species. Such a
Name is called a '=Definition=' of any Member of that Species, and to
give it such a Name is to '=define=' it.

    [Thus, we may define a "Treasure" as a "valuable Thing." In this
    case we regard "Things" as the _Genus_, and "valuable" as the
    _Differentia_.]

The following Examples, of this Process, may be taken as models for
working others.

    [Note that, in each Definition, the Substantive, representing a
    Member (or Members) of the _Genus_, is printed in Capitals.]

1. Define "a Treasure."

_Ans._ "a valuable THING."

2. Define "Treasures."

_Ans._ "valuable THINGS."

3. Define "a Town."

_Ans._ "a material artificial THING, consisting of houses and streets."
                                                                   pg007
4. Define "Men."

_Ans._ "material, living THINGS, belonging to the Animal Kingdom, having
two hands and two feet";

or else

"ANIMALS having two hands and two feet."

5. Define "London."

_Ans._ "the material artificial THING, which consists of houses and
streets, and has four million inhabitants";

or else

"the TOWN which has four million inhabitants."

    [Note that we here use the article "the" instead of "a", because
    we happen to know that there is only _one_ such Thing.

    The Reader can set himself any number of Examples of this
    Process, by simply choosing the Name of any common Thing (such
    as "house," "tree," "knife"), making a Definition for it, and
    then testing his answer by referring to any English Dictionary.]

                                                                   pg008


BOOK II.

PROPOSITIONS.



CHAPTER I.

_PROPOSITIONS GENERALLY._


§ 1.

_Introductory._

Note that the word "some" is to be regarded, henceforward, as meaning
"one or more."

The word 'Proposition,' as used in ordinary conversation, may be applied
to _any_ word, or phrase, which conveys any information whatever.

    [Thus the words "yes" and "no" are Propositions in the ordinary
    sense of the word; and so are the phrases "you owe me five
    farthings" and "I don't!"

    Such words as "oh!" or "never!", and such phrases as "fetch me
    that book!" "which book do you mean?" do not seem, at first
    sight, to convey any _information_; but they can easily be
    turned into equivalent forms which do so, viz. "I am surprised,"
    "I will never consent to it," "I order you to fetch me that
    book," "I want to know which book you mean."]

But a '=Proposition=,' as used in this First Part of "Symbolic Logic,"
has a peculiar form, which may be called its '=Normal form='; and if any
Proposition, which we wish to use in an argument, is not in normal form,
we must reduce it to such a form, before we can use it.
                                                                   pg009
A '=Proposition=,' when in normal form, asserts, as to certain two
Classes, which are called its '=Subject=' and '=Predicate=,' either

    (1) that _some_ Members of its Subject are Members
    of its Predicate;

    or (2) that _no_ Members of its Subject are Members
    of its Predicate;

    or (3) that _all_ Members of its Subject are Members
    of its Predicate.

The Subject and the Predicate of a Proposition are called its '=Terms=.'

Two Propositions, which convey the _same_ information, are said to be
'=equivalent='.

    [Thus, the two Propositions, "I see John" and "John is seen by
    me," are equivalent.]


§ 2.

_Normal form of a Proposition._

A Proposition, in normal form, consists of four parts, viz.--

    (1) The word "some," or "no," or "all." (This word,
    which tells us _how many_ Members of the Subject
    are also Members of the Predicate, is called the
    '=Sign of Quantity=.')

    (2) Name of Subject.

    (3) The verb "are" (or "is"). (This is called the
    '=Copula=.')

    (4) Name of Predicate.

                                                                   pg010
§ 3.

_Various kinds of Propositions._

A Proposition, that begins with "Some", is said to be '=Particular=.' It
is also called 'a Proposition =in I=.'

    [Note, that it is called 'Particular,' because it refers to a
    _part_ only of the Subject.]

A Proposition, that begins with "No", is said to be '=Universal
Negative=.' It is also called 'a Proposition =in E=.'

A Proposition, that begins with "All", is said to be '=Universal
Affirmative=.' It is also called 'a Proposition =in A=.'

    [Note, that they are called 'Universal', because they refer to
    the _whole_ of the Subject.]

A Proposition, whose Subject is an _Individual_, is to be regarded as
_Universal_.

    [Let us take, as an example, the Proposition "John is not well".
    This of course implies that there is an _Individual_, to whom
    the speaker refers when he mentions "John", and whom the
    listener _knows_ to be referred to. Hence the Class "men
    referred to by the speaker when he mentions 'John'" is a
    one-Member Class, and the Proposition is equivalent to "_All_
    the men, who are referred to by the speaker when he mentions
    'John', are not well."]

Propositions are of two kinds, 'Propositions of Existence' and
'Propositions of Relation.'

These shall be discussed separately.

                                                                   pg011

CHAPTER II.

_PROPOSITIONS OF EXISTENCE._


A '=Proposition of Existence=', when in normal form, has, for its
_Subject_, the Class "existing Things".

Its Sign of Quantity is "Some" or "No".

    [Note that, though its Sign of Quantity tells us _how many_
    existing Things are Members of its Predicate, it does _not_ tell
    us the _exact_ number: in fact, it only deals with _two_
    numbers, which are, in ascending order, "0" and "1 or more."]

It is called "a Proposition of Existence" because its effect is to
assert the _Reality_ (i.e. the real _existence_), or else the
_Imaginariness_, of its Predicate.

    [Thus, the Proposition "Some existing Things are honest men"
    asserts that the Class "honest men" is _Real_.

    This is the _normal_ form; but it may also be expressed in any
    one of the following forms:--

        (1) "Honest men exist";
        (2) "Some honest men exist";
        (3) "The Class 'honest men' exists";
        (4) "There are honest men";
        (5) "There are some honest men".

    Similarly, the Proposition "No existing Things are men fifty
    feet high" asserts that the Class "men 50 feet high" is
    _Imaginary_.

    This is the _normal_ form; but it may also be expressed in any
    one of the following forms:--

        (1) "Men 50 feet high do not exist";
        (2) "No men 50 feet high exist";
        (3) "The Class 'men 50 feet high' does not exist";
        (4) "There are not any men 50 feet high";
        (5) "There are no men 50 feet high."]

                                                                   pg012

CHAPTER III.

_PROPOSITIONS OF RELATION._


§ 1.

_Introductory._

A =Proposition of Relation=, of the kind to be here discussed, has, for
its Terms, two Specieses of the same Genus, such that each of the two
Names conveys the idea of some Attribute _not_ conveyed by the other.

    [Thus, the Proposition "Some merchants are misers" is of the
    right kind, since "merchants" and "misers" are Specieses of the
    same Genus "men"; and since the Name "merchants" conveys the
    idea of the Attribute "mercantile", and the name "misers" the
    idea of the Attribute "miserly", each of which ideas is _not_
    conveyed by the other Name.

    But the Proposition "Some dogs are setters" is _not_ of the
    right kind, since, although it is true that "dogs" and "setters"
    are Specieses of the same Genus "animals", it is _not_ true that
    the Name "dogs" conveys the idea of any Attribute not conveyed
    by the Name "setters". Such Propositions will be discussed in
    Part II.]

The Genus, of which the two Terms are Specieses, is called the
'=Universe of Discourse=,' or (more briefly) the '=Univ.='

The Sign of Quantity is "Some" or "No" or "All".

    [Note that, though its Sign of Quantity tells us _how many_
    Members of its Subject are _also_ Members of its Predicate, it
    does not tell us the _exact_ number: in fact, it only deals with
    _three_ numbers, which are, in ascending order, "0", "1 or
    more", "the total number of Members of the Subject".]

It is called "a Proposition of Relation" because its effect is to assert
that a certain _relationship_ exists between its Terms.

                                                                   pg013
§ 2.

_Reduction of a Proposition of Relation to Normal form._

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

(1) Ascertain what is the _Subject_ (i.e., ascertain what Class we are
_talking about_);

(2) If the verb, governed by the Subject, is _not_ the verb "are" (or
"is"), substitute for it a phrase beginning with "are" (or "is");

(3) Ascertain what is the _Predicate_ (i.e., ascertain what Class it is,
which is asserted to contain _some_, or _none_, or _all_, of the Members
of the Subject);

(4) If the Name of each Term is _completely expressed_ (i.e. if it
contains a Substantive), there is no need to determine the 'Univ.'; but,
if either Name is _incompletely expressed_, and contains _Attributes_
only, it is then necessary to determine a 'Univ.', in order to insert
its Name as the Substantive.

(5) Ascertain the _Sign of Quantity_;

(6) Arrange in the following order:--

    Sign of Quantity,
    Subject,
    Copula,
    Predicate.

    [Let us work a few Examples, to illustrate these Rules.


    (1)

    "Some apples are not ripe."

    (1) The Subject is "apples."

    (2) The Verb is "are."

    (3) The Predicate is "not-ripe * * *." (As no Substantive is
    expressed, and we have not yet settled what the Univ. is to be,
    we are forced to leave a blank.)

    (4) Let Univ. be "fruit."

    (5) The Sign of Quantity is "some."

    (6) The Proposition now becomes

        "Some | apples | are | not-ripe fruit."

                                                                   pg014
    (2)

    "None of my speculations have brought me as much as 5 per cent."

    (1) The Subject is "my speculations."

    (2) The Verb is "have brought," for which we substitute the
    phrase "are * * * that have brought".

    (3) The Predicate is "* * * that have brought &c."

    (4) Let Univ. be "transactions."

    (5) The Sign of Quantity is "none of."

    (6) The Proposition now becomes

        "None of | my speculations | are | transactions
        that have brought me as much as 5 per cent."


    (3)

    "None but the brave deserve the fair."

    To begin with, we note that the phrase "none but the brave" is
    equivalent to "no _not_-brave."

    (1) The Subject has for its _Attribute_ "not-brave." But no
    _Substantive_ is supplied. So we express the Subject as
    "not-brave * * *."

    (2) The Verb is "deserve," for which we substitute the phrase
    "are deserving of".

    (3) The Predicate is "* * * deserving of the fair."

    (4) Let Univ. be "persons."

    (5) The Sign of Quantity is "no."

    (6) The Proposition now becomes

        "No | not-brave persons | are | persons deserving
        of the fair."


    (4)

    "A lame puppy would not say "thank you" if you offered to lend
    it a skipping-rope."

    (1) The Subject is evidently "lame puppies," and all the rest of
    the sentence must somehow be packed into the Predicate.

    (2) The Verb is "would not say," &c., for which we may
    substitute the phrase "are not grateful for."

    (3) The Predicate may be expressed as "* * * not grateful for
    the loan of a skipping-rope."

    (4) Let Univ. be "puppies."

    (5) The Sign of Quantity is "all."

    (6) The Proposition now becomes

        "All | lame puppies | are | puppies not grateful
        for the loan of a skipping-rope."

                                                                   pg015
    (5)

    "No one takes in the _Times_, unless he is well-educated."

    (1) The Subject is evidently persons who are not well-educated
    ("no _one_" evidently means "no _person_").

    (2) The Verb is "takes in," for which we may substitute the
    phrase "are persons taking in."

    (3) The Predicate is "persons taking in the _Times_."

    (4) Let Univ. be "persons."

    (5) The Sign of Quantity is "no."

    (6) The Proposition now becomes

        "No | persons who are not well-educated | are |
        persons taking in the _Times_."


    (6)

    "My carriage will meet you at the station."

    (1) The Subject is "my carriage." This, being an 'Individual,'
    is equivalent to the Class "my carriages." (Note that this Class
    contains only _one_ Member.)

    (2) The Verb is "will meet", for which we may substitute the
    phrase "are * * * that will meet."

    (3) The Predicate is "* * * that will meet you at the station."

    (4) Let Univ. be "things."

    (5) The Sign of Quantity is "all."

    (6) The Proposition now becomes

        "All | my carriages | are | things that will meet
         you at the station."


    (7)

    "Happy is the man who does not know what 'toothache' means!"

    (1) The Subject is evidently "the man &c." (Note that in this
    sentence, the _Predicate_ comes first.) At first sight, the
    Subject seems to be an '_Individual_'; but on further
    consideration, we see that the article "the" does _not_ imply
    that there is only _one_ such man. Hence the phrase "the man
    who" is equivalent to "all men who".

    (2) The Verb is "are."

    (3) The Predicate is "happy * * *."

    (4) Let Univ. be "men."

    (5) The Sign of Quantity is "all."

    (6) The Proposition now becomes

        "All | men who do not know what 'toothache'
        means | are | happy men."

                                                                   pg016
    (8)

    "Some farmers always grumble at the weather, whatever it may
    be."

    (1) The Subject is "farmers."

    (2) The Verb is "grumble," for which we substitute the phrase
    "are * * * who grumble."

    (3) The Predicate is "* * * who always grumble &c."

    (4) Let Univ. be "persons."

    (5) The Sign of Quantity is "some."

    (6) The Proposition now becomes

        "Some | farmers | are | persons who always
        grumble at the weather, whatever it may be."


    (9)

    "No lambs are accustomed to smoke cigars."

    (1) The Subject is "lambs."

    (2) The Verb is "are."

    (3) The Predicate is "* * * accustomed &c."

    (4) Let Univ. be "animals."

    (5) The Sign of Quantity is "no."

    (6) The Proposition now becomes

        "No | lambs | are | animals accustomed to smoke
        cigars."


    (10)

    "I ca'n't understand examples that are not arranged in regular
    order, like those I am used to."

    (1) The Subject is "examples that," &c.

    (2) The Verb is "I ca'n't understand," which we must alter, so
    as to have "examples," instead of "I," as the nominative case.
    It may be expressed as "are not understood by me."

    (3) The Predicate is "* * * not understood by me."

    (4) Let Univ. be "examples."

    (5) The Sign of Quantity is "all."

    (6) The Proposition now becomes

        "All | examples that are not arranged in regular
        order like those I am used to | are | examples not
        understood by me."]

                                                                   pg017
§ 3.

_A Proposition of Relation, beginning with "All", is a Double
Proposition._

A Proposition of Relation, beginning with "All", asserts (as we already
know) that "_All_ Members of the Subject are Members of the Predicate".
This evidently contains, as a _part_ of what it tells us, the smaller
Proposition "_Some_ Members of the Subject are Members of the
Predicate".

    [Thus, the Proposition "_All_ bankers are rich men" evidently
    contains the smaller Proposition "_Some_ bankers are rich men".]

The question now arises "What is the _rest_ of the information which
this Proposition gives us?"

In order to answer this question, let us begin with the smaller
Proposition, "_Some_ Members of the Subject are Members of the
Predicate," and suppose that this is _all_ we have been told; and let us
proceed to inquire what _else_ we need to be told, in order to know that
"_All_ Members of the Subject are Members of the Predicate".

    [Thus, we may suppose that the Proposition "_Some_ bankers are
    rich men" is all the information we possess; and we may proceed
    to inquire what _other_ Proposition needs to be added to it, in
    order to make up the entire Proposition "_All_ bankers are rich
    men".]

Let us also suppose that the 'Univ.' (i.e. the Genus, of which both the
Subject and the Predicate are Specieses) has been divided (by the
Process of _Dichotomy_) into two smaller Classes, viz.

    (1) the Predicate;

    (2) the Class whose Differentia is _contradictory_ to that of
    the Predicate.

    [Thus, we may suppose that the Genus "men," (of which both
    "bankers" and "rich men" are Specieses) has been divided into
    the two smaller Classes, "rich men", "poor men".]
                                                                   pg018
Now we know that _every_ Member of the Subject is (as shown at p. 6) a
Member of the Univ. Hence _every_ Member of the Subject is either in
Class (1) or else in Class (2).

    [Thus, we know that _every_ banker is a Member of the Genus
    "men". Hence, _every_ banker is either in the Class "rich men",
    or else in the Class "poor men".]

Also we have been told that, in the case we are discussing, _some_
Members of the Subject are in Class (1). What _else_ do we need to be
told, in order to know that _all_ of them are there? Evidently we need
to be told that _none_ of them are in Class (2); i.e. that _none_ of
them are Members of the Class whose Differentia is _contradictory_ to
that of the Predicate.

    [Thus, we may suppose we have been told that _some_ bankers are
    in the Class "rich men". What _else_ do we need to be told, in
    order to know that _all_ of them are there? Evidently we need to
    be told that _none_ of them are in the Class "_poor_ men".]

Hence a Proposition of Relation, beginning with "All", is a _Double_
Proposition, and is '=equivalent=' to (i.e. gives the same information
as) the _two_ Propositions

    (1) "_Some_ Members of the Subject are Members of the
    Predicate";

    (2) "_No_ Members of the Subject are Members of the
    Class whose Differentia is _contradictory_ to that of
    the Predicate".

    [Thus, the Proposition "_All_ bankers are rich men" is a
    _Double_ Proposition, and is equivalent to the _two_
    Propositions

        (1) "_Some_ bankers are rich men";

        (2) "_No_ bankers are _poor_ men".]

                                                                   pg019
§ 4.

_What is implied, in a Proposition of Relation, as to the Reality of its
Terms?_

Note that the rules, here laid down, are _arbitrary_, and only apply to
Part I of my "Symbolic Logic."

A Proposition of Relation, beginning with "Some", is henceforward to be
understood as asserting that there are _some existing Things_, which,
being Members of the Subject, are also Members of the Predicate; i.e.
that _some existing Things_ are Members of _both_ Terms at once. Hence
it is to be understood as implying that _each_ Term, taken by itself, is
_Real_.

    [Thus, the Proposition "Some rich men are invalids" is to be
    understood as asserting that _some existing Things_ are "rich
    invalids". Hence it implies that _each_ of the two Classes,
    "rich men" and "invalids", taken by itself, is _Real_.]

A Proposition of Relation, beginning with "No", is henceforward to be
understood as asserting that there are _no existing Things_ which, being
Members of the Subject, are also Members of the Predicate; i.e. that _no
existing Things_ are Members of _both_ Terms at once. But this implies
nothing as to the _Reality_ of either Term taken by itself.

    [Thus, the Proposition "No mermaids are milliners" is to be
    understood as asserting that _no existing Things_ are
    "mermaid-milliners". But this implies nothing as to the
    _Reality_, or the _Unreality_, of either of the two Classes,
    "mermaids" and "milliners", taken by itself. In this case as it
    happens, the Subject is _Imaginary_, and the Predicate _Real_.]

A Proposition of Relation, beginning with "All", contains (see § 3) a
similar Proposition beginning with "Some". Hence it is to be understood
as implying that _each_ Term, taken by itself, is _Real_.

    [Thus, the Proposition "All hyænas are savage animals" contains
    the Proposition "Some hyænas are savage animals". Hence it
    implies that _each_ of the two Classes, "hyænas" and "savage
    animals", taken by itself, is _Real_.]

                                                                   pg020
§ 5.

_Translation of a Proposition of Relation into one or more Propositions
of Existence._

We have seen that a Proposition of Relation, beginning with "Some,"
asserts that _some existing Things_, being Members of its Subject, are
_also_ Members of its Predicate. Hence, it asserts that some existing
Things are Members of _both_; i.e. it asserts that some existing Things
are Members of the Class of Things which have _all_ the Attributes of
the Subject and the Predicate.

Hence, to translate it into a Proposition of Existence, we take
"existing Things" as the new _Subject_, and Things, which have _all_ the
Attributes of the Subject and the Predicate, as the new Predicate.

Similarly for a Proposition of Relation beginning with "No".

A Proposition of Relation, beginning with "All", is (as shown in § 3)
equivalent to _two_ Propositions, one beginning with "Some" and the
other with "No", each of which we now know how to translate.

    [Let us work a few Examples, to illustrate these Rules.

    (1)

        "Some apples are not ripe."

    Here we arrange thus:--

        "Some"                     _Sign of Quantity_.
        "existing Things"          _Subject_.
        "are"                      _Copula_.
        "not-ripe apples"          _Predicate_.

    or thus:--

        "Some | existing Things | are | not-ripe apples."
                                                                   pg021
    (2)

        "Some farmers always grumble at the weather, whatever
        it may be."

    Here we arrange thus:--

        "Some | existing Things | are | farmers who always
        grumble at the weather, whatever it may be."

    (3)

        "No lambs are accustomed to smoke cigars."

    Here we arrange thus:--

        "No | existing Things |are | lambs accustomed to
        smoke cigars."

    (4)

        "None of my speculations have brought me as much
        as 5 per cent."

    Here we arrange thus:--

        "No | existing Things | are | speculations of mine,
        which have brought me as much as 5 per cent."

    (5)

        "None but the brave deserve the fair."

    Here we note, to begin with, that the phrase "none but the
    brave" is equivalent to "no not-brave men." We then arrange
    thus:--

        "No | existing Things | are | not-brave men deserving
        of the fair."

    (6)

        "All bankers are rich men."

    This is equivalent to the two Propositions "Some bankers are
    rich men" and "No bankers are poor men."

    Here we arrange thus:--

        "Some | existing Things | are | rich bankers";
            and
        "No | existing Things | are | poor bankers."]


    [Work Examples § =1=, 1-4 (p. 97).]

                                                                   pg022


BOOK III.

THE BILITERAL DIAGRAM.

    ·-------------·
    |      |      |
    |  xy  |  xy' |
    |      |      |
    |------|------|
    |      |      |
    |  x'y | x'y' |
    |      |      |
    ·-------------·



CHAPTER I.

_SYMBOLS AND CELLS._


First, let us suppose that the above Diagram is an enclosure assigned to
a certain Class of Things, which we have selected as our 'Universe of
Discourse.' or, more briefly, as our 'Univ'.

    [For example, we might say "Let Univ. be 'books'"; and we might
    imagine the Diagram to be a large table, assigned to all
    "books."]

    [The Reader is strongly advised, in reading this Chapter, _not_
    to refer to the above Diagram, but to draw a large one for
    himself, _without any letters_, and to have it by him while he
    reads, and keep his finger on that particular _part_ of it,
    about which he is reading.]
                                                                   pg023
Secondly, let us suppose that we have selected a certain Adjunct, which
we may call "x," and have divided the large Class, to which we have
assigned the whole Diagram, into the two smaller Classes whose
Differentiæ are "x" and "not-x" (which we may call "x'"), and that we
have assigned the _North_ Half of the Diagram to the one (which we may
call "the Class of x-Things," or "the x-Class"), and the _South_ Half to
the other (which we may call "the Class of x'-Things," or "the
x'-Class").

    [For example, we might say "Let x mean 'old,' so that x' will
    mean 'new'," and we might suppose that we had divided books into
    the two Classes whose Differentiæ are "old" and "new," and had
    assigned the _North_ Half of the table to "_old_ books" and the
    _South_ Half to "_new_ books."]

Thirdly, let us suppose that we have selected another Adjunct, which we
may call "y", and have subdivided the x-Class into the two Classes whose
Differentiæ are "y" and "y'", and that we have assigned the North-_West_
Cell to the one (which we may call "the xy-Class"), and the North-_East_
Cell to the other (which we may call "the xy'-Class").

    [For example, we might say "Let y mean 'English,' so that y'
    will mean 'foreign'", and we might suppose that we had
    subdivided "old books" into the two Classes whose Differentiæ
    are "English" and "foreign", and had assigned the North-_West_
    Cell to "old _English_ books", and the North-_East_ Cell to "old
    _foreign_ books."]

Fourthly, let us suppose that we have subdivided the x'-Class in the
same manner, and have assigned the South-_West_ Cell to the x'y-Class,
and the South-_East_ Cell to the x'y'-Class.

    [For example, we might suppose that we had subdivided "new
    books" into the two Classes "new _English_ books" and "new
    _foreign_ books", and had assigned the South-_West_ Cell to the
    one, and the South-_East_ Cell to the other.]

It is evident that, if we had begun by dividing for y and y', and had
then subdivided for x and x', we should have got the _same_ four
Classes. Hence we see that we have assigned the _West_ Half to the
y-Class, and the _East_ Half to the y'-Class.
                                                                   pg024
    [Thus, in the above Example, we should find that we had assigned
    the _West_ Half of the table to "_English_ books" and the _East_
    Half to "_foreign_ books."

        ·-------------------·
        |   old   |   old   |
        | English | foreign |
        |  books  |  books  |
        |---------|---------|
        |   new   |   new   |
        | English | foreign |
        |  books  |  books  |
        ·-------------------·

    We have, in fact, assigned the four Quarters of the table to
    four different Classes of books, as here shown.]

The Reader should carefully remember that, in such a phrase as "the
x-Things," the word "Things" means that particular _kind_ of Things, to
which the whole Diagram has been assigned.

    [Thus, if we say "Let Univ. be 'books'," we mean that we have
    assigned the whole Diagram to "books." In that case, if we took
    "x" to mean "old", the phrase "the x-Things" would mean "the old
    books."]

The Reader should not go on to the next Chapter until he is _quite
familiar_ with the _blank_ Diagram I have advised him to draw.

He ought to be able to name, _instantly_, the _Adjunct_ assigned to any
Compartment named in the right-hand column of the following Table.

Also he ought to be able to name, _instantly_, the _Compartment_
assigned to any Adjunct named in the left-hand column.

To make sure of this, he had better put the book into the hands of some
genial friend, while he himself has nothing but the blank Diagram, and
get that genial friend to question him on this Table, _dodging_ about as
much as possible. The Questions and Answers should be something like
this:--

                                                                   pg025
                     TABLE I.

    ·----------------------------------------·
    | _Adjuncts_ | _Compartments, or Cells,_ |
    |    _of_    |    _assigned to them._    |
    | _Classes._ |                           |
    |------------|---------------------------|
    | x          | North Half.               |
    | x'         | South   "                 |
    | y          | West    "                 |
    | y'         | East    "                 |
    |------------|---------------------------|
    | xy         | North-West Cell.          |
    | xy'        |   "   East  "             |
    | x'y        | South-West  "             |
    | x'y'       |   "   East  "             |
    ·----------------------------------------·

    Q. "Adjunct for West Half?"
    A. "y."
    Q. "Compartment for xy'?"
    A. "North-East Cell."
    Q. "Adjunct for South-West Cell?"
    A. "x'y."
       &c., &c.

After a little practice, he will find himself able to do without the
blank Diagram, and will be able to see it _mentally_ ("in my mind's eye,
Horatio!") while answering the questions of his genial friend. When
_this_ result has been reached, he may safely go on to the next Chapter.

                                                                   pg026

CHAPTER II.

_COUNTERS._


Let us agree that a _Red_ Counter, placed within a Cell, shall mean
"This Cell is _occupied_" (i.e. "There is at least _one_ Thing in it").

Let us also agree that a _Red_ Counter, placed on the partition between
two Cells, shall mean "The Compartment, made up of these two Cells, is
_occupied_; but it is not known _whereabouts_, in it, its occupants
are." Hence it may be understood to mean "At least _one_ of these two
Cells is occupied: possibly _both_ are."

Our ingenious American cousins have invented a phrase to describe the
condition of a man who has not yet made up his mind _which_ of two
political parties he will join: such a man is said to be "=sitting on
the fence=." This phrase exactly describes the condition of the Red
Counter.

Let us also agree that a _Grey_ Counter, placed within a Cell, shall
mean "This Cell is _empty_" (i.e. "There is _nothing_ in it").

    [The Reader had better provide himself with 4 Red Counters and 5
    Grey ones.]

                                                                   pg027

CHAPTER III.

_REPRESENTATION OF PROPOSITIONS._


§ 1.

_Introductory._

Henceforwards, in stating such Propositions as "Some x-Things exist" or
"No x-Things are y-Things", I shall omit the word "Things", which the
Reader can supply for himself, and shall write them as "Some x exist" or
"No x are y".

    [Note that the word "Things" is here used with a special
    meaning, as explained at p. 23.]

A Proposition, containing only _one_ of the Letters used as Symbols for
Attributes, is said to be '=Uniliteral='.

    [For example, "Some x exist", "No y' exist", &c.]

A Proposition, containing _two_ Letters, is said to be ='Biliteral'=.

    [For example, "Some xy' exist", "No x' are y", &c.]

A Proposition is said to be '=in terms of=' the Letters it contains,
whether with or without accents.

    [Thus, "Some xy' exist", "No x' are y", &c., are said to be _in
    terms of_ x and y.]

                                                                   pg028
§ 2.

_Representation of Propositions of Existence._

Let us take, first, the Proposition "Some x exist".

    [Note that this Proposition is (as explained at p. 12)
    equivalent to "Some existing Things are x-Things."]

This tells us that there is at least _one_ Thing in the North Half; that
is, that the North Half is _occupied_. And this we can evidently
represent by placing a _Red_ Counter (here represented by a _dotted_
circle) on the partition which divides the North Half.

    ·-------·
    |  (.)  |
    |---|---|
    |   |   |
    ·-------·

    [In the "books" example, this Proposition would be "Some old
    books exist".]

Similarly we may represent the three similar Propositions "Some x'
exist", "Some y exist", and "Some y' exist".

    [The Reader should make out all these for himself. In the
    "books" example, these Propositions would be "Some new books
    exist", &c.]

Let us take, next, the Proposition "No x exist".

This tells us that there is _nothing_ in the North Half; that is, that
the North Half is _empty_; that is, that the North-West Cell and the
North-East Cell are both of them _empty_. And this we can represent by
placing _two Grey_ Counters in the North Half, one in each Cell.

    ·-------·
    |( )|( )|
    |---|---|
    |   |   |
    ·-------·

    [The Reader may perhaps think that it would be enough to place a
    _Grey_ Counter on the partition in the North Half, and that,
    just as a _Red_ Counter, so placed, would mean "This Half is
    _occupied_", so a _Grey_ one would mean "This Half is _empty_".

    This, however, would be a mistake. We have seen that a _Red_
    Counter, so placed, would mean "At least _one_ of these two
    Cells is occupied: possibly _both_ are." Hence a _Grey_ one
    would merely mean "At least _one_ of these two Cells is empty:
    possibly _both_ are". But what we have to represent is, that
    both Cells are _certainly_ empty: and this can only be done by
    placing a _Grey_ Counter in _each_ of them.

    In the "books" example, this Proposition would be "No old books
    exist".]
                                                                   pg029
Similarly we may represent the three similar Propositions "No x' exist",
"No y exist", and "No y' exist".

    [The Reader should make out all these for himself. In the
    "books" example, these three Propositions would be "No new books
    exist", &c.]

Let us take, next, the Proposition "Some xy exist".

This tells us that there is at least _one_ Thing in the North-West Cell;
that is, that the North-West Cell is _occupied_. And this we can
represent by placing a _Red_ Counter in it.

    ·-------·
    |(.)|   |
    |---|---|
    |   |   |
    ·-------·

    [In the "books" example, this Proposition would be "Some old
    English books exist".]

Similarly we may represent the three similar Propositions "Some xy'
exist", "Some x'y exist", and "Some x'y' exist".

    [The Reader should make out all these for himself. In the
    "books" example, these three Propositions would be "Some old
    foreign books exist", &c.]

Let us take, next, the Proposition "No xy exist".

This tells us that there is _nothing_ in the North-West Cell; that is,
that the North-West Cell is _empty_. And this we can represent by
placing a _Grey_ Counter in it.

    ·-------·
    |( )|   |
    |---|---|
    |   |   |
    ·-------·

    [In the "books" example, this Proposition would be "No old
    English books exist".]

Similarly we may represent the three similar Propositions "No xy'
exist", "No x'y exist", and "No x'y' exist".

    [The Reader should make out all these for himself. In the
    "books" example, these three Propositions would be "No old
    foreign books exist", &c.]
                                                                   pg030
We have seen that the Proposition "No x exist" may be represented by
placing _two Grey_ Counters in the North Half, one in each Cell.

    ·-------·
    |( )|( )|
    |---|---|
    |   |   |
    ·-------·

We have also seen that these two _Grey_ Counters, taken _separately_,
represent the two Propositions "No xy exist" and "No xy' exist".

Hence we see that the Proposition "No x exist" is a _Double_
Proposition, and is equivalent to the _two_ Propositions "No xy exist"
and "No xy' exist".

    [In the "books" example, this Proposition would be "No old books
    exist".

    Hence this is a _Double_ Proposition, and is equivalent to the
    _two_ Propositions "No old _English_ books exist" and "No old
    _foreign_ books exist".]


§ 3.

_Representation of Propositions of Relation._

Let us take, first, the Proposition "Some x are y".

This tells us that at least _one_ Thing, in the _North_ Half, is also in
the _West_ Half. Hence it must be in the space _common_ to them, that
is, in the _North-West Cell_. Hence the North-West Cell is _occupied_.
And this we can represent by placing a _Red_ Counter in it.

    ·-------·
    |(.)|   |
    |---|---|
    |   |   |
    ·-------·

    [Note that the _Subject_ of the Proposition settles which _Half_
    we are to use; and that the _Predicate_ settles in which
    _portion_ of it we are to place the Red Counter.

    In the "books" example, this Proposition would be "Some old
    books are English".]

Similarly we may represent the three similar Propositions "Some x are
y'", "Some x' are y", and "Some x' are y'".

    [The Reader should make out all these for himself. In the
    "books" example, these three Propositions would be "Some old
    books are foreign", &c.]
                                                                   pg031
Let us take, next, the Proposition "Some y are x".

This tells us that at least _one_ Thing, in the _West_ Half, is also in
the _North_ Half. Hence it must be in the space _common_ to them, that
is, in the _North-West Cell_. Hence the North-West Cell is _occupied_.
And this we can represent by placing a _Red_ Counter in it.

    ·-------·
    |(.)|   |
    |---|---|
    |   |   |
    ·-------·

    [In the "books" example, this Proposition would be "Some English
    books are old".]

Similarly we may represent the three similar Propositions "Some y are
x'", "Some y' are x", and "Some y' are x'".

    [The Reader should make out all these for himself. In the
    "books" example, these three Propositions would be "Some English
    books are new", &c.]

We see that this _one_ Diagram has now served to represent no less than
_three_ Propositions, viz.

    (1) "Some xy exist;
    (2)  Some x are y;
    (3)  Some y are x".

    ·-------·
    |(.)|   |
    |---|---|
    |   |   |
    ·-------·

Hence these three Propositions are equivalent.

    [In the "books" example, these Propositions would be

        (1) "Some old English books exist;
        (2)  Some old books are English;
        (3)  Some English books are old".]

The two equivalent Propositions, "Some x are y" and "Some y are x", are
said to be '=Converse=' to each other; and the Process, of changing one
into the other, is called '=Converting=', or '=Conversion='.

    [For example, if we were told to convert the Proposition

    "Some apples are not ripe,"

    we should first choose our Univ. (say "fruit"), and then
    complete the Proposition, by supplying the Substantive "fruit"
    in the Predicate, so that it would be

    "Some apples are not-ripe fruit";

    and we should then convert it by interchanging its Terms, so
    that it would be

    "Some not-ripe fruit are apples".]
                                                                   pg032
Similarly we may represent the three similar Trios of equivalent
Propositions; the whole Set of _four_ Trios being as follows:--

    (1) "Some xy exist" = "Some x are y" = "Some y are x".
    (2) "Some xy' exist" = "Some x are y'" = "Some y' are x".
    (3) "Some x'y exist" = "Some x' are y" = "Some y are x'".
    (4) "Some x'y' exist" = "Some x' are y'" = "Some y' are x'".

Let us take, next, the Proposition "No x are y".

This tell us that no Thing, in the _North_ Half, is also in the _West_
Half. Hence there is _nothing_ in the space _common_ to them, that is,
in the _North-West Cell_. Hence the North-West Cell is _empty_. And this
we can represent by placing a _Grey_ Counter in it.

    ·-------·
    |( )|   |
    |---|---|
    |   |   |
    ·-------·

    [In the "books" example, this Proposition would be "No old books
    are English".]

Similarly we may represent the three similar Propositions "No x are y'",
and "No x' are y", and "No x' are y'".

    [The Reader should make out all these for himself. In the
    "books" example, these three Propositions would be "No old books
    are foreign", &c.]

Let us take, next, the Proposition "No y are x".

This tells us that no Thing, in the _West_ Half, is also in the _North_
Half. Hence there is _nothing_ in the space _common_ to them, that is,
in the _North-West Cell_. That is, the North-West Cell is _empty_. And
this we can represent by placing a _Grey_ Counter in it.

    ·-------·
    |( )|   |
    |---|---|
    |   |   |
    ·-------·

    [In the "books" example, this Proposition would be "No English
    books are old".]

Similarly we may represent the three similar Propositions "No y are x'",
"No y' are x", and "No y' are x'".

    [The Reader should make out all these for himself. In the
    "books" example, these three Propositions would be "No English
    books are new", &c.]
                                                                   pg033
    ·-------·
    |( )|   |
    |---|---|
    |   |   |
    ·-------·

We see that this _one_ Diagram has now served to present no less than
_three_ Propositions, viz.

    (1) "No xy exist;
    (2)  No x are y;
    (3)  No y are x."

Hence these three Propositions are equivalent.

    [In the "books" example, these Propositions would be

        (1) "No old English books exist;
        (2)  No old books are English;
        (3)  No English books are old".]

The two equivalent Propositions, "No x are y" and "No y are x", are said
to be 'Converse' to each other.

    [For example, if we were told to convert the Proposition

    "No porcupines are talkative",

    we should first choose our Univ. (say "animals"), and then
    complete the Proposition, by supplying the Substantive "animals"
    in the Predicate, so that it would be

    "No porcupines are talkative animals", and we should then
    convert it, by interchanging its Terms, so that it would be

    "No talkative animals are porcupines".]

Similarly we may represent the three similar Trios of equivalent
Propositions; the whole Set of _four_ Trios being as follows:--

    (1) "No xy exist" = "No x are y" = "No y are x".
    (2) "No xy' exist" = "No x are y'" = "No y' are x".
    (3) "No x'y exist" = "No x' are y" = "No y are x'".
    (4) "No x'y' exist" = "No x' are y'" = "No y' are x'".

Let us take, next, the Proposition "All x are y".

We know (see p. 17) that this is a _Double_ Proposition, and equivalent
to the _two_ Propositions "Some x are y" and "No x are y'", each of
which we already know how to represent.

    ·-------·
    |(.)|( )|
    |---|---|
    |   |   |
    ·-------·

    [Note that the _Subject_ of the given Proposition settles which
    _Half_ we are to use; and that its _Predicate_ settles in which
    _portion_ of that Half we are to place the Red Counter.]

                                                                   pg034
                           TABLE II.

    ·-----------------------------------------------------·
    |               | ·-------· |             | ·-------· |
    |               | |  (.)  | |             | |( )|( )| |
    | Some x exist  | |---|---| | No x exist  | |---|---| |
    |               | |   |   | |             | |   |   | |
    |               | ·-------· |             | ·-------· |
    |---------------|-----------|-------------|-----------|
    |               | ·-------· |             | ·-------· |
    |               | |   |   | |             | |   |   | |
    | Some x' exist | |---|---| | No x' exist | |---|---| |
    |               | |  (.)  | |             | |( )|( )| |
    |               | ·-------· |             | ·-------· |
    |---------------|-----------|-------------|-----------|
    |               | ·-------· |             | ·-------· |
    |               | |   |   | |             | |( )|   | |
    | Some y exist  | |(.)|---| | No y exist  | |---|---| |
    |               | |   |   | |             | |( )|   | |
    |               | ·-------· |             | ·-------· |
    |---------------|-----------|-------------|-----------|
    |               | ·-------· |             | ·-------· |
    |               | |   |   | |             | |   |( )| |
    | Some y' exist | |---|(.)| | No y' exist | |---|---| |
    |               | |   |   | |             | |   |( )| |
    |               | ·-------· |             | ·-------· |
    ·-----------------------------------------------------·

Similarly we may represent the seven similar Propositions "All x are
y'", "All x' are y", "All x' are y'", "All y are x", "All y are x'",
"All y' are x", and "All y' are x'".

Let us take, lastly, the Double Proposition "Some x are y and some are
y'", each part of which we already know how to represent.

    ·-------·
    |(.)|(.)|
    |---|---|
    |   |   |
    ·-------·

Similarly we may represent the three similar Propositions, "Some x' are
y and some are y'", "Some y are x and some are x'", "Some y' are x and
some are x'".

The Reader should now get his genial friend to question him, severely,
on these two Tables. The _Inquisitor_ should have the Tables before him:
but the _Victim_ should have nothing but a blank Diagram, and the
Counters with which he is to represent the various Propositions named by
his friend, e.g. "Some y exist", "No y' are x", "All x are y", &c. &c.

                                                                   pg035
                               TABLE III.

    ·-------------------------------------------------------------·
    |                  | ·-------· |                  | ·-------· |
    | Some xy exist    | |(.)|   | |                  | |(.)|( )| |
    |  = Some x are y  | |---|---| |  All x are y     | |---|---| |
    |  = Some y are x  | |   |   | |                  | |   |   | |
    |                  | ·-------· |                  | ·-------· |
    |------------------|-----------|------------------|-----------|
    |                  | ·-------· |                  | ·-------· |
    | Some xy' exist   | |   |(.)| |                  | |( )|(.)| |
    |  = Some x are y' | |---|---| |  All x are y'    | |---|---| |
    |  = Some y' are x | |   |   | |                  | |   |   | |
    |                  | ·-------· |                  | ·-------· |
    |------------------|-----------|------------------|-----------|
    |                  | ·-------· |                  | ·-------· |
    | Some x'y exist   | |   |   | |                  | |   |   | |
    |  = Some x' are y | |---|---| |  All x' are y    | |---|---| |
    |  = Some y are x' | |(.)|   | |                  | |(.)|( )| |
    |                  | ·-------· |                  | ·-------· |
    |------------------|-----------|------------------|-----------|
    |                  | ·-------· |                  | ·-------· |
    | Some x'y' exist  | |   |   | |                  | |   |   | |
    |  = Some x' are y'| |---|---| |  All x' are y'   | |---|---| |
    |  = Some y' are x'| |   |(.)| |                  | |( )|(.)| |
    |                  | ·-------· |                  | ·-------· |
    ·-------------------------------------------------------------·

    ·-------------------------------------------------------------·
    |                  | ·-------· |                  | ·-------· |
    | No xy exist      | |( )|   | |                  | |(.)|   | |
    |  = No x are y    | |---|---| |  All y are x     | |---|---| |
    |  = No y are x    | |   |   | |                  | |( )|   | |
    |                  | ·-------· |                  | ·-------· |
    |------------------|-----------|------------------|-----------|
    |                  | ·-------· |                  | ·-------· |
    | No xy' exist     | |   |( )| |                  | |( )|   | |
    |  = No x are y'   | |---|---| |  All y are x'    | |---|---| |
    |  = No y' are x   | |   |   | |                  | |(.)|   | |
    |                  | ·-------· |                  | ·-------· |
    |------------------|-----------|------------------|-----------|
    |                  | ·-------· |                  | ·-------· |
    | No x'y exist     | |   |   | |                  | |   |(.)| |
    |  = No x' are y   | |---|---| |  All y' are x    | |---|---| |
    |  = No y are x'   | |( )|   | |                  | |   |( )| |
    |                  | ·-------· |                  | ·-------· |
    |------------------|-----------|------------------|-----------|
    |                  | ·-------· |                  | ·-------· |
    | No x'y' exist    | |   |   | |                  | |   |( )| |
    |  = No x' are y'  | |---|---| |  All y' are x'   | |---|---| |
    |  = No y' are x'  | |   |( )| |                  | |   |(.)| |
    |                  | ·-------· |                  | ·-------· |
    ·-------------------------------------------------------------·

    ·-------------------------------------------------------------·
    |                  | ·-------· |                  | ·-------· |
    |                  | |(.)|(.)| |                  | |(.)|   | |
    | Some x are y,    | |---|---| | Some y are x     | |---|---| |
    | and some are y'  | |   |   | | and some are x'  | |(.)|   | |
    |                  | ·-------· |                  | ·-------· |
    |------------------|-----------|------------------|-----------|
    |                  | ·-------· |                  | ·-------· |
    |                  | |   |   | |                  | |   |(.)| |
    | Some x' are y,   | |---|---| | Some y' are x    | |---|---| |
    | and some are y'  | |(.)|(.)| | and some are x'  | |   |(.)| |
    |                  | ·-------· |                  | ·-------· |
        ·-------------------------------------------------------------·

                                                                   pg036

CHAPTER IV.

_INTERPRETATION OF BILITERAL DIAGRAM WHEN MARKED WITH COUNTERS._


The Diagram is supposed to be set before us, with certain Counters
placed upon it; and the problem is to find out what Proposition, or
Propositions, the Counters represent.

As the process is simply the reverse of that discussed in the previous
Chapter, we can avail ourselves of the results there obtained, as far as
they go.

First, let us suppose that we find a _Red_ Counter placed in the
North-West Cell.

    ·-------·
    |(.)|   |
    |---|---|
    |   |   |
    ·-------·

We know that this represents each of the Trio of equivalent Propositions

"Some xy exist" = "Some x are y" = "Some y are x".

Similarly we may interpret a _Red_ Counter, when placed in the
North-East, or South-West, or South-East Cell.

Next, let us suppose that we find a _Grey_ Counter placed in the
North-West Cell.

    ·-------·
    |( )|   |
    |---|---|
    |   |   |
    ·-------·

We know that this represents each of the Trio of equivalent Propositions

"No xy exist" = "No x are y" = "No y are x".

Similarly we may interpret a _Grey_ Counter, when placed in the
North-East, or South-West, or South-East Cell.
                                                                   pg037
Next, let us suppose that we find a _Red_ Counter placed on the
partition which divides the North Half.

    ·-------·
    |  (.)  |
    |---|---|
    |   |   |
    ·-------·

We know that this represents the Proposition "Some x exist."

Similarly we may interpret a _Red_ Counter, when placed on the partition
which divides the South, or West, or East Half.

       *       *       *       *       *

Next, let us suppose that we find _two Red_ Counters placed in the North
Half, one in each Cell.

    ·-------·
    |(.)|(.)|
    |---|---|
    |   |   |
    ·-------·

We know that this represents the _Double_ Proposition "Some x are y and
some are y'".

Similarly we may interpret _two Red_ Counters, when placed in the South,
or West, or East Half.

       *       *       *       *       *

Next, let us suppose that we find _two Grey_ Counters placed in the
North Half, one in each Cell.

    ·-------·
    |( )|( )|
    |---|---|
    |   |   |
    ·-------·

We know that this represents the Proposition "No x exist".

Similarly we may interpret _two Grey_ Counters, when placed in the
South, or West, or East Half.

       *       *       *       *       *

Lastly, let us suppose that we find a _Red_ and a _Grey_ Counter placed
in the North Half, the _Red_ in the North-_West_ Cell, and the _Grey_ in
the North-_East_ Cell.

    ·-------·
    |(.)|( )|
    |---|---|
    |   |   |
    ·-------·

We know that this represents the Proposition, "All x are y".

    [Note that the _Half_, occupied by the two Counters, settles
    what is to be the _Subject_ of the Proposition, and that the
    _Cell_, occupied by the _Red_ Counter, settles what is to be its
    _Predicate_.]
                                                                   pg038
Similarly we may interpret a _Red_ and a _Grey_ counter, when placed in
any one of the seven similar positions

    Red in North-East, Grey in North-West;
    Red in South-West, Grey in South-East;
    Red in South-East, Grey in South-West;
    Red in North-West, Grey in South-West;
    Red in South-West, Grey in North-West;
    Red in North-East, Grey in South-East;
    Red in South-East, Grey in North-East.

Once more the genial friend must be appealed to, and requested to
examine the Reader on Tables II and III, and to make him not only
_represent_ Propositions, but also _interpret_ Diagrams when marked with
Counters.

The Questions and Answers should be like this:--

    Q. Represent "No x' are y'."
    A. Grey Counter in S.E. Cell.
    Q. Interpret Red Counter on E. partition.
    A. "Some y' exist."
    Q. Represent "All y' are x."
    A. Red in N.E. Cell; Grey in S.E.
    Q. Interpret Grey Counter in S.W. Cell.
    A. "No x'y exist" = "No x' are y" = "No y are x'".
                        &c., &c.

At first the Examinee will need to have the Board and Counters before
him; but he will soon learn to dispense with these, and to answer with
his eyes shut or gazing into vacancy.


    [Work Examples § =1=, 5-8 (p. 97).]

                                                                   pg039


BOOK IV.

THE TRILITERAL DIAGRAM.


    ·-----------------·       ·-----------------·
    |        |        |       | xy     |    xy' |
    |        |        |       | m'     |     m' |
    |   xy   |   xy'  |       |   ·----|----·   |
    |        |        |       |   | xy | xy'|   |
    |        |        |       |   | m  | m  |   |
    |--------|--------|       |---|----|----|---|
    |        |        |       |   |x'y |x'y'|   |
    |        |        |       |   | m  | m  |   |
    |  x'y   |  x'y'  |       |   ·----|----·   |
    |        |        |       | x'y    |   x'y' |
    |        |        |       | m'     |     m' |
    ·-----------------·       ·-----------------·



CHAPTER I.

_SYMBOLS AND CELLS._


First, let us suppose that the above _left_-hand Diagram is the
Biliteral Diagram that we have been using in Book III., and that we
change it into a _Triliteral_ Diagram by drawing an _Inner Square_, so
as to divide each of its 4 Cells into 2 portions, thus making 8 Cells
altogether. The _right_-hand Diagram shows the result.

    [The Reader is strongly advised, in reading this Chapter, _not_
    to refer to the above Diagrams, but to make a large copy of the
    right-hand one for himself, _without any letters_, and to have
    it by him while he reads, and keep his finger on that particular
    _part_ of it, about which he is reading.]
                                                                   pg040
Secondly, let us suppose that we have selected a certain Adjunct, which
we may call "m", and have subdivided the xy-Class into the two Classes
whose Differentiæ are m and m', and that we have assigned the N.W.
_Inner_ Cell to the one (which we may call "the Class of xym-Things", or
"the xym-Class"), and the N.W. _Outer_ Cell to the other (which we may
call "the Class of xym'-Things", or "the xym'-Class").

    [Thus, in the "books" example, we might say "Let m mean 'bound',
    so that m' will mean 'unbound'", and we might suppose that we
    had subdivided the Class "old English books" into the two
    Classes, "old English bound books" and "old English unbound
    books", and had assigned the N.W. _Inner_ Cell to the one, and
    the N.W. _Outer_ Cell to the other.]

Thirdly, let us suppose that we have subdivided the xy'-Class, the
x'y-Class, and the x'y'-Class in the same manner, and have, in each
case, assigned the _Inner_ Cell to the Class possessing the Attribute m,
and the _Outer_ Cell to the Class possessing the Attribute m'.

    [Thus, in the "books" example, we might suppose that we had
    subdivided the "new English books" into the two Classes, "new
    English bound books" and "new English unbound books", and had
    assigned the S.W. _Inner_ Cell to the one, and the S.W. _Outer_
    Cell to the other.]

It is evident that we have now assigned the _Inner Square_ to the
m-Class, and the _Outer Border_ to the m'-Class.

    [Thus, in the "books" example, we have assigned the _Inner
    Square_ to "bound books" and the _Outer Border_ to "unbound
    books".]

When the Reader has made himself familiar with this Diagram, he ought to
be able to find, in a moment, the Compartment assigned to a particular
_pair_ of Attributes, or the Cell assigned to a particular _trio_ of
Attributes. The following Rules will help him in doing this:--

    (1) Arrange the Attributes in the order x, y, m.
                                                                   pg041
    (2) Take the _first_ of them and find the Compartment
    assigned to it.

    (3) Then take the _second_, and find what _portion_ of that
    compartment is assigned to it.

    (4) Treat the _third_, if there is one, in the same way.

    [For example, suppose we have to find the Compartment assigned
    to ym. We say to ourselves "y has the _West_ Half; and m has the
    _Inner_ portion of that West Half."

    Again, suppose we have to find the Cell assigned to x'ym'. We
    say to ourselves "x' has the _South_ Half; y has the _West_
    portion of that South Half, i.e. has the _South-West Quarter_;
    and m' has the _Outer_ portion of that South-West Quarter."]

The Reader should now get his genial friend to question him on the Table
given on the next page, in the style of the following specimen-Dialogue.

    Q. Adjunct for South Half, Inner Portion?
    A. x'm.
    Q. Compartment for m'?
    A. The Outer Border.
    Q. Adjunct for North-East Quarter, Outer Portion?
    A. xy'm'.
    Q. Compartment for ym?
    A. West Half, Inner Portion.
    Q. Adjunct for South Half?
    A. x'.
    Q. Compartment for x'y'm?
    A. South-East Quarter, Inner Portion.
                   &c. &c.

                                                                   pg042
                       TABLE IV.

    ·-----------------------------------------------·
    | Adjunct  |                                    |
    |   of     |  Compartments, or Cells, assigned  |
    | Classes. |             to them.               |
    |----------|------------------------------------|
    | x        | North Half.                        |
    | x'       | South  "                           |
    | y        | West   "                           |
    | y'       | East   "                           |
    | m        | Inner Square.                      |
    | m'       | Outer Border.                      |
    |----------|------------------------------------|
    | xy       | North-West Quarter.                |
    | xy'      |   "   East    "                    |
    | x'y      | South-West    "                    |
    | x'y'     |   "   East    "                    |
    | xm       | North Half, Inner Portion.         |
    | xm'      |   "    "    Outer    "             |
    | x'm      | South  "    Inner    "             |
    | x'm'     |   "    "    Outer    "             |
    | ym       | West   "    Inner    "             |
    | ym'      |  "     "    Outer    "             |
    | y'm      | East   "    Inner    "             |
    | y'm'     |   "    "    Outer    "             |
    |----------|------------------------------------|
    | xym      | North-West Quarter, Inner Portion. |
    | xym'     |   "     "     "     Outer    "     |
    | xy'm     |   "   East    "     Inner    "     |
    | xy'm'    |   "     "     "     Outer    "     |
    | x'ym     | South-West    "     Inner    "     |
    | x'ym'    |   "     "     "     Outer    "     |
    | x'y'm    |   "   East    "     Inner    "     |
    | x'y'm'   |   "     "     "     Outer    "     |
    ·-----------------------------------------------·

                                                                   pg043

CHAPTER II.

_REPRESENTATION OF PROPOSITIONS IN TERMS OF x AND m, OR OF y AND m._


§ 1.

_Representation of Propositions of Existence in terms of x and m, or of
y and m._

Let us take, first, the Proposition "Some xm exist".

    [Note that the _full_ meaning of this Proposition is (as
    explained at p. 12) "Some existing Things are xm-Things".]

This tells us that there is at least _one_ Thing in the Inner portion of
the North Half; that is, that this Compartment is _occupied_. And this
we can evidently represent by placing a _Red_ Counter on the partition
which divides it.

    ·---------------·
    |       |       |
    |   ·---|---·   |
    |   |  (.)  |   |
    |---|---|---|---|
    |   |   |   |   |
    |   ·---|---·   |
    |       |       |
    ·---------------·

    [In the "books" example, this Proposition would mean "Some old
    bound books exist" (or "There are some old bound books").]

Similarly we may represent the seven similar Propositions, "Some xm'
exist", "Some x'm exist", "Some x'm' exist", "Some ym exist", "Some ym'
exist", "Some y'm exist", and "Some y'm' exist".
                                                                   pg044
Let us take, next, the Proposition "No xm exist".

This tells us that there is _nothing_ in the Inner portion of the North
Half; that is, that this Compartment is _empty_. And this we can
represent by placing _two Grey_ Counters in it, one in each Cell.

    ·---------------·
    |       |       |
    |   ·---|---·   |
    |   |( )|( )|   |
    |---|---|---|---|
    |   |   |   |   |
    |   ·---|---·   |
    |       |       |
    ·---------------·

Similarly we may represent the seven similar Propositions, in terms of x
and m, or of y and m, viz. "No xm' exist", "No x'm exist", &c.

       *       *       *       *       *

These sixteen Propositions of Existence are the only ones that we shall
have to represent on this Diagram.


§ 2.

_Representation of Propositions of Relation in terms of x and m, or of y
and m._

Let us take, first, the Pair of Converse Propositions

    "Some x are m" = "Some m are x."

We know that each of these is equivalent to the Proposition of Existence
"Some xm exist", which we already know how to represent.

    ·---------------·
    |       |       |
    |   ·---|---·   |
    |   |  (.)  |   |
    |---|---|---|---|
    |   |   |   |   |
    |   ·---|---·   |
    |       |       |
    ·---------------·

Similarly for the seven similar Pairs, in terms of x and m, or of y and
m.

Let us take, next, the Pair of Converse Propositions

    "No x are m" = "No m are x."

We know that each of these is equivalent to the Proposition of Existence
"No xm exist", which we already know how to represent.

    ·---------------·
    |       |       |
    |   ·---|---·   |
    |   |( )|( )|   |
    |---|---|---|---|
    |   |   |   |   |
    |   ·---|---·   |
    |       |       |
    ·---------------·

Similarly for the seven similar Pairs, in terms of x and m, or of y and
m.
                                                                   pg045
Let us take, next, the Proposition "All x are m."

    ·---------------·
    |( )    |    ( )|
    |   ·---|---·   |
    |   |  (.)  |   |
    |---|---|---|---|
    |   |   |   |   |
    |   ·---|---·   |
    |       |       |
    ·---------------·

We know (see p. 18) that this is a _Double_ Proposition, and equivalent
to the _two_ Propositions "Some x are m" and "No x are m' ", each of
which we already know how to represent.

Similarly for the fifteen similar Propositions, in terms of x and m, or
of y and m.

These thirty-two Propositions of Relation are the only ones that we
shall have to represent on this Diagram.

The Reader should now get his genial friend to question him on the
following four Tables.

The Victim should have nothing before him but a blank Triliteral
Diagram, a Red Counter, and 2 Grey ones, with which he is to represent
the various Propositions named by the Inquisitor, _e.g._ "No y' are m",
"Some xm' exist", &c., &c.
                                                                   pg046
                              TABLE V.

    ·---------------------------------------------------------·
    | ·---------------·  Some xm exist    | ·---------------· |
    | |       |       |   = Some x are m  | |       |       | |
    | |   ·---|---·   |   = Some m are x  | |   ·---|---·   | |
    | |   |  (.)  |   |                   | |   |( )|( )|   | |
    | |---|---|---|---| ·-----------------· |---|---|---|---| |
    | |   |   |   |   | | No xm exist       |   |   |   |   | |
    | |   ·---|---·   | |  = No x are m     |   ·---|---·   | |
    | |       |       | |  = No m are x     |       |       | |
    | ·---------------· |                   ·---------------· |
    |---------------------------------------------------------|
    | ·---------------·  Some xm' exist   | ·---------------· |
    | |      (.)      |   = Some x are m' | |( )    |    ( )| |
    | |   ·---|---·   |   = Some m' are x | |   ·---|---·   | |
    | |   |   |   |   |                   | |   |   |   |   | |
    | |---|---|---|---| ·-----------------· |---|---|---|---| |
    | |   |   |   |   | | No xm' exist      |   |   |   |   | |
    | |   ·---|---·   | |  = No x are m'    |   ·---|---·   | |
    | |       |       | |  = No m' are x    |       |       | |
    | ·---------------· |                   ·---------------· |
    |---------------------------------------------------------|
    | ·---------------·  Some x'm exist   | ·---------------· |
    | |       |       |   = Some x' are m | |       |       | |
    | |   ·---|---·   |   = Some m are x' | |   ·---|---·   | |
    | |   |   |   |   |                   | |   |   |   |   | |
    | |---|---|---|---| ·-----------------· |---|---|---|---| |
    | |   |  (.)  |   | | No x'm exist      |   |( )|( )|   | |
    | |   ·---|---·   | |  = No x' are m    |   ·---|---·   | |
    | |       |       | |  = No m are x'    |       |       | |
    | ·---------------· |                   ·---------------· |
    |---------------------------------------------------------|
    | ·---------------·  Some x'm' exist  | ·---------------· |
    | |       |       |   = Some x' are m'| |       |       | |
    | |   ·---|---·   |   = Some m' are x'| |   ·---|---·   | |
    | |   |   |   |   |                   | |   |   |   |   | |
    | |---|---|---|---| ·-----------------· |---|---|---|---| |
    | |   |   |   |   | | No x'm' exist     |   |   |   |   | |
    | |   ·---|---·   | |  = No x' are m'   |   ·---|---·   | |
    | |      (.)      | |  = No m' are x'   |( )    |    ( )| |
    | ·---------------· |                   ·---------------· |
    ·---------------------------------------------------------·
                                                                   pg047
                            TABLE VI.

    ·---------------------------------------------------------·
    | ·---------------·  Some ym exist    | ·---------------· |
    | |       |       |   = Some y are m  | |       |       | |
    | |   ·---|---·   |   = Some m are y  | |   ·---|---·   | |
    | |   |   |   |   |                   | |   |( )|   |   | |
    | |---|(.)|---|---| ·-----------------· |---|---|---|---| |
    | |   |   |   |   | | No ym exist       |   |( )|   |   | |
    | |   ·---|---·   | |  = No y are m     |   ·---|---·   | |
    | |       |       | |  = No m are y     |       |       | |
    | ·---------------· |                   ·---------------· |
    |---------------------------------------------------------|
    | ·---------------·  Some ym' exist   | ·---------------· |
    | |       |       |   = Some y are m' | |( )    |       | |
    | |   ·---|---·   |   = Some m' are y | |   ·---|---·   | |
    | |   |   |   |   |                   | |   |   |   |   | |
    | |(.)|---|---|---| ·-----------------· |---|---|---|---| |
    | |   |   |   |   | | No ym' exist      |   |   |   |   | |
    | |   ·---|---·   | |  = No y are m'    |   ·---|---·   | |
    | |       |       | |  = No m' are y    |( )    |       | |
    | ·---------------· |                   ·---------------· |
    |---------------------------------------------------------|
    | ·---------------·  Some y'm exist   | ·---------------· |
    | |       |       |   = Some y' are m | |       |       | |
    | |   ·---|---·   |   = Some m are y' | |   ·---|---·   | |
    | |   |   |   |   |                   | |   |   |( )|   | |
    | |---|---|(.)|---| ·-----------------· |---|---|---|---| |
    | |   |   |   |   | | No y'm exist      |   |   |( )|   | |
    | |   ·---|---·   | |  = No y' are m    |   ·---|---·   | |
    | |       |       | |  = No m are y'    |       |       | |
    | ·---------------· |                   ·---------------· |
    |---------------------------------------------------------|
    | ·---------------·  Some y'm' exist  | ·---------------· |
    | |       |       |   = Some y' are m'| |       |    ( )| |
    | |   ·---|---·   |   = Some m' are y'| |   ·---|---·   | |
    | |   |   |   |   |                   | |   |   |   |   | |
    | |---|---|---|(.)| ·-----------------· |---|---|---|---| |
    | |   |   |   |   | | No y'm' exist     |   |   |   |   | |
    | |   ·---|---·   | |  = No y' are m'   |   ·---|---·   | |
    | |       |       | |  = No m' are y'   |       |    ( )| |
    | ·---------------· |                   ·---------------· |
    ·---------------------------------------------------------·
                                                                   pg048
                             TABLE VII.

    ·---------------------------------------------------------·
    | ·---------------·                   | ·---------------· |
    | |( )    |    ( )|  All x are m      | |      (.)      | |
    | |   ·---|---·   |                   | |   ·---|---·   | |
    | |   |  (.)  |   |                   | |   |( )|( )|   | |
    | |---|---|---|---| ·-----------------· |---|---|---|---| |
    | |   |   |   |   | |                   |   |   |   |   | |
    | |   ·---|---·   | |     All x are m'  |   ·---|---·   | |
    | |       |       | |                   |       |       | |
    | ·---------------· |                   ·---------------· |
    |---------------------------------------------------------|
    | ·---------------·                   | ·---------------· |
    | |       |       |  All x' are m     | |       |       | |
    | |   ·---|---·   |                   | |   ·---|---·   | |
    | |   |   |   |   |                   | |   |   |   |   | |
    | |---|---|---|---| ·-----------------· |---|---|---|---| |
    | |   |  (.)  |   | |                   |   |( )|( )|   | |
    | |   ·---|---·   | |    All x' are m'  |   ·---|---·   | |
    | |( )    |    ( )| |                   |      (.)      | |
    | ·---------------· |                   ·---------------· |
    |---------------------------------------------------------|
    | ·---------------·                   | ·---------------· |
    | |       |       |  All m are x      | |       |       | |
    | |   ·---|---·   |                   | |   ·---|---·   | |
    | |   |  (.)  |   |                   | |   |( )|( )|   | |
    | |---|---|---|---| ·-----------------· |---|---|---|---| |
    | |   |( )|( )|   | |                   |   |  (.)  |   | |
    | |   ·---|---·   | |     All m are x'  |   ·---|---·   | |
    | |       |       | |                   |       |       | |
    | ·---------------· |                   ·---------------· |
    |---------------------------------------------------------|
    | ·---------------·                   | ·---------------· |
    | |      (.)      |  All m' are x     | |( )    |    ( )| |
    | |   ·---|---·   |                   | |   ·---|---·   | |
    | |   |   |   |   |                   | |   |   |   |   | |
    | |---|---|---|---| ·-----------------· |---|---|---|---| |
    | |   |   |   |   | |                   |   |   |   |   | |
    | |   ·---|---·   | |    All m' are x'  |   ·---|---·   | |
    | |( )    |    ( )| |                   |      (.)      | |
    | ·---------------· |                   ·---------------· |
    ·---------------------------------------------------------·
                                                                   pg049
                            TABLE VIII.

    ·---------------------------------------------------------·
    | ·---------------·                   | ·---------------· |
    | |( )    |       |  All y are m      | |       |       | |
    | |   ·---|---·   |                   | |   ·---|---·   | |
    | |   |   |   |   |                   | |   |( )|   |   | |
    | |---|(.)|---|---| ·-----------------· |(.)|---|---|---| |
    | |   |   |   |   | |                   |   |( )|   |   | |
    | |   ·---|---·   | |     All y are m'  |   ·---|---·   | |
    | |( )    |       | |                   |       |       | |
    | ·---------------· |                   ·---------------· |
    |---------------------------------------------------------|
    | ·---------------·                   | ·---------------· |
    | |       |    ( )|  All y' are m     | |       |       | |
    | |   ·---|---·   |                   | |   ·---|---·   | |
    | |   |   |   |   |                   | |   |   |( )|   | |
    | |---|---|(.)|---| ·-----------------· |---|---|---|(.)| |
    | |   |   |   |   | |                   |   |   |( )|   | |
    | |   ·---|---·   | |    All y' are m'  |   ·---|---·   | |
    | |       |    ( )| |                   |       |       | |
    | ·---------------· |                   ·---------------· |
    |---------------------------------------------------------|
    | ·---------------·                   | ·---------------· |
    | |       |       |  All m are y      | |       |       | |
    | |   ·---|---·   |                   | |   ·---|---·   | |
    | |   |   |( )|   |                   | |   |( )|   |   | |
    | |---|(.)|---|---| ·-----------------· |---|---|(.)|---| |
    | |   |   |( )|   | |                   |   |( )|   |   | |
    | |   ·---|---·   | |     All m are y'  |   ·---|---·   | |
    | |       |       | |                   |       |       | |
    | ·---------------· |                   ·---------------· |
    |---------------------------------------------------------|
    | ·---------------·                   | ·---------------· |
    | |       |    ( )|  All m' are y     | |( )    |       | |
    | |   ·---|---·   |                   | |   ·---|---·   | |
    | |   |   |   |   |                   | |   |   |   |   | |
    | |(.)|---|---|---| ·-----------------· |---|---|---|(.)| |
    | |   |   |   |   | |                   |   |   |   |   | |
    | |   ·---|---·   | |    All m' are y'  |   ·---|---·   | |
    | |       |    ( )| |                   |( )    |       | |
    | ·---------------· |                   ·---------------· |
    ·---------------------------------------------------------·

                                                                   pg050

CHAPTER III.

_REPRESENTATION OF TWO PROPOSITIONS OF RELATION, ONE IN TERMS OF x AND
m, AND THE OTHER IN TERMS OF y AND m, ON THE SAME DIAGRAM._


The Reader had better now begin to draw little Diagrams for himself, and
to mark them with the Digits "I" and "O", instead of using the Board and
Counters: he may put a "I" to represent a _Red_ Counter (this may be
interpreted to mean "There is at least _one_ Thing here"), and a "O" to
represent a _Grey_ Counter (this may be interpreted to mean "There is
_nothing_ here").

The Pair of Propositions, that we shall have to represent, will always
be, one in terms of x and m, and the other in terms of y and m.

When we have to represent a Proposition beginning with "All", we break
it up into the _two_ Propositions to which it is equivalent.

When we have to represent, on the same Diagram, Propositions, of which
some begin with "Some" and others with "No", we represent the _negative_
ones _first_. This will sometimes save us from having to put a "I" "on a
fence" and afterwards having to shift it into a Cell.

    [Let us work a few examples.

    (1)

        "No x are m';
         No y' are m".

    Let us first represent "No x are m'". This gives us Diagram a.

    Then, representing "No y' are m" on the same Diagram, we get
    Diagram b.
                                                                   pg051
                a                        b
        ·---------------·        ·---------------·
        |(O)    |    (O)|        |(O)    |    (O)|
        |   ·---|---·   |        |   ·---|---·   |
        |   |   |   |   |        |   |   |(O)|   |
        |---|---|---|---|        |---|---|---|---|
        |   |   |   |   |        |   |   |(O)|   |
        |   ·---|---·   |        |   ·---|---·   |
        |       |       |        |       |       |
        ·---------------·        ·---------------·

    (2)

        "Some m are x;
         No m are y".

    If, neglecting the Rule, we were begin with "Some m are x", we
    should get Diagram a.

    And if we were then to take "No m are y", which tells us that
    the Inner N.W. Cell is _empty_, we should be obliged to take the
    "I" off the fence (as it no longer has the choice of _two_
    Cells), and to put it into the Inner N.E. Cell, as in Diagram c.

    This trouble may be saved by beginning with "No m are y", as in
    Diagram b.

    And _now_, when we take "Some m are x", there is no fence to sit
    on! The "I" has to go, at once, into the N.E. Cell, as in
    Diagram c.

                a                    b                    c
        ·---------------·    ·---------------·    ·---------------·
        |       |       |    |       |       |    |       |       |
        |   ·---|---·   |    |   ·---|---·   |    |   ·---|---·   |
        |   |  (I)  |   |    |   |(O)|   |   |    |   |(O)|(I)|   |
        |---|---|---|---|    |---|---|---|---|    |---|---|---|---|
        |   |   |   |   |    |   |(O)|   |   |    |   |(O)|   |   |
        |   ·---|---·   |    |   ·---|---·   |    |   ·---|---·   |
        |       |       |    |       |       |    |       |       |
        ·---------------·    ·---------------·    ·---------------·

    (3)

        "No x' are m';
         All m are y".

    Here we begin by breaking up the Second into the two
    Propositions to which it is equivalent. Thus we have _three_
    Propositions to represent, viz.--

        (1) "No x' are m';
        (2)  Some m are y;
        (3)  No m are y'".

    These we will take in the order 1, 3, 2.

    First we take No. (1), viz. "No x' are m'". This gives us
    Diagram a.
                                                                   pg052
    Adding to this, No. (3), viz. "No m are y'", we get Diagram b.

    This time the "I", representing No. (2), viz. "Some m are y,"
    has to sit on the fence, as there is no "O" to order it off!
    This gives us Diagram c.

                a                    b                    c
        ·---------------·    ·---------------·    ·---------------·
        |       |       |    |       |       |    |       |       |
        |   ·---|---·   |    |   ·---|---·   |    |   ·---|---·   |
        |   |   |   |   |    |   |   |(O)|   |    |   |   |(O)|   |
        |---|---|---|---|    |---|---|---|---|    |---|(I)|---|---|
        |   |   |   |   |    |   |   |(O)|   |    |   |   |(O)|   |
        |   ·---|---·   |    |   ·---|---·   |    |   ·---|---·   |
        |(O)    |    (O)|    |(O)    |    (O)|    |(O)    |    (O)|
        ·---------------·    ·---------------·    ·---------------·

    (4)

        "All m are x;
         All y are m".

    Here we break up _both_ Propositions, and thus get _four_ to
    represent, viz.--

        (1) "Some m are x;
        (2)  No m are x';
        (3)  Some y are m;
        (4)  No y are m'".

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

    First we take No. (2), viz. "No m are x'". This gives us Diagram
    a.

    To this we add No. (4), viz. "No y are m'", and thus get Diagram
    b.

    If we were to add to this No. (1), viz. "Some m are x", we
    should have to put the "I" on a fence: so let us try No. (3)
    instead, viz. "Some y are m". This gives us Diagram c.

    And now there is no need to trouble about No. (1), as it would
    not add anything to our information to put a "I" on the fence.
    The Diagram _already_ tells us that "Some m are x".]

            a                    b                    c
    ·---------------·    ·---------------·    ·---------------·
    |       |       |    |(O)    |       |    |(O)    |       |
    |   ·---|---·   |    |   ·---|---·   |    |   ·---|---·   |
    |   |   |   |   |    |   |   |   |   |    |   |(I)|   |   |
    |---|---|---|---|    |---|---|---|---|    |---|---|---|---|
    |   |(O)|(O)|   |    |   |(O)|(O)|   |    |   |(O)|(O)|   |
    |   ·---|---·   |    |   ·---|---·   |    |   ·---|---·   |
    |       |       |    |(O)    |       |    |(O)    |       |
    ·---------------·    ·---------------·    ·---------------·


    [Work Examples § =1=, 9-12 (p. 97); § =2=, 1-20 (p. 98).]

                                                                   pg053

CHAPTER IV.

_INTERPRETATION, IN TERMS OF x AND y, OF TRILITERAL DIAGRAM, WHEN MARKED
WITH COUNTERS OR DIGITS._


The problem before us is, given a marked Triliteral Diagram, to
ascertain _what_ Propositions of Relation, in terms of x and y, are
represented on it.

The best plan, for a _beginner_, is to draw a _Biliteral_ Diagram
alongside of it, and to transfer, from the one to the other, all the
information he can. He can then read off, from the Biliteral Diagram,
the required Propositions. After a little practice, he will be able to
dispense with the Biliteral Diagram, and to read off the result from the
Triliteral Diagram itself.

To _transfer_ the information, observe the following Rules:--

    (1) Examine the N.W. Quarter of the Triliteral Diagram.

    (2) If it contains a "I", in _either_ Cell, it is certainly
    _occupied_, and you may mark the N.W. Quarter of the
    Biliteral Diagram with a "I".

    (3) If it contains _two_ "O"s, one in _each_ Cell, it is
    certainly _empty_, and you may mark the N.W. Quarter of the
    Biliteral Diagram with a "O".
                                                                   pg054
    (4) Deal in the same way with the N.E., the S.W., and the
    S.E. Quarter.

    [Let us take, as examples, the results of the four Examples
    worked in the previous Chapters.

               (1)
        ·---------------·
        |(O)    |    (O)|
        |   ·---|---·   |
        |   |   |(O)|   |
        |---|---|---|---|
        |   |   |(O)|   |
        |   ·---|---·   |
        |       |       |
        ·---------------·

    In the N.W. Quarter, only _one_ of the two Cells is marked as
    _empty_: so we do not know whether the N.W. Quarter of the
    Biliteral Diagram is _occupied_ or _empty_: so we cannot mark
    it.

        ·-------·
        |   |(O)|
        |---|---|
        |   |   |
        ·-------·

    In the N.E. Quarter, we find _two_ "O"s: so _this_ Quarter is
    certainly _empty_; and we mark it so on the Biliteral Diagram.

    In the S.W. Quarter, we have no information _at all_.

    In the S.E. Quarter, we have not enough to use.

    We may read off the result as "No x are y'", or "No y' are x,"
    whichever we prefer.

               (2)
        ·---------------·
        |       |       |
        |   ·---|---·   |
        |   |(O)|(I)|   |
        |---|---|---|---|
        |   |(O)|   |   |
        |   ·---|---·   |
        |       |       |
        ·---------------·

    In the N.W. Quarter, we have not enough information to use.

    In the N.E. Quarter, we find a "I". This shows us that it is
    _occupied_: so we may mark the N.E. Quarter on the Biliteral
    Diagram with a "I".

        ·-------·
        |   |(I)|
        |---|---|
        |   |   |
        ·-------·

    In the S.W. Quarter, we have not enough information to use.

    In the S.E. Quarter, we have none at all.

    We may read off the result as "Some x are y'", or "Some y' are
    x", whichever we prefer.
                                                                   pg055
               (3)
        ·---------------·
        |       |       |
        |   ·---|---·   |
        |   |   |(O)|   |
        |---|(I)|---|---|
        |   |   |(O)|   |
        |   ·---|---·   |
        |(O)    |    (O)|
        ·---------------·

    In the N.W. Quarter, we have _no_ information. (The "I", sitting
    on the fence, is of no use to us until we know on _which_ side
    he means to jump down!)

    In the N.E. Quarter, we have not enough information to use.

    Neither have we in the S.W. Quarter.

        ·-------·
        |   |   |
        |---|---|
        |   |(O)|
        ·-------·

    The S.E. Quarter is the only one that yields enough information
    to use. It is certainly _empty_: so we mark it as such on the
    Biliteral Diagram.

    We may read off the results as "No x' are y'", or "No y' are
    x'", whichever we prefer.

               (4)
        ·---------------·
        |(O)    |       |
        |   ·---|---·   |
        |   |(I)|   |   |
        |---|---|---|---|
        |   |(O)|(O)|   |
        |   ·---|---·   |
        |(O)    |       |
        ·---------------·

    The N.W. Quarter is _occupied_, in spite of the "O" in the Outer
    Cell. So we mark it with a "I" on the Biliteral Diagram.

    The N.E. Quarter yields no information.

        ·-------·
        |(I)|   |
        |---|---|
        |   |   |
        ·-------·

    The S.W. Quarter is certainly _empty_. So we mark it as such on
    the Biliteral Diagram.

        ·-------·
        |(I)|   |
        |---|---|
        |(O)|   |
        ·-------·

    The S.E. Quarter does not yield enough information to use.

    We read off the result as "All y are x."]


    [Review Tables V, VI (pp. 46, 47). Work Examples § =1=, 13-16
    (p. 97); § =2=, 21-32 (p. 98); § =3=, 1-20 (p. 99).]

                                                                   pg056


BOOK V.

SYLLOGISMS.



CHAPTER I.

_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".
                                                                   pg058
    Also 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".]

                                                                   pg059

CHAPTER 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".

                                                                   pg061
    Next, by the process described at p. 50, we represent these on a
    Triliteral Diagram, thus:--

        ·---------------·
        |(O)    |    (O)|
        |   ·---|---·   |
        |   |   |(O)|   |
        |---|(I)|---|---|
        |   |   |(O)|   |
        |   ·---|---·   |
        |       |       |
        ·---------------·

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

        ·-------·
        |   |(O)|
        |---|---|
        |   |   |
        ·-------·

    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".

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

    This, however, would produce the result

        ·-----------------·
        |        |        |
        |   ·----|----·   |
        |   |(I)(I)   |   |
        |   |----|----|   |
        |   |(O) | (O)|   |
        |   ·----|----·   |
        |        |        |
        ·-----------------·

                                                                   pg062
    So 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.

        ·---------------·
        |       |       |
        |   ·---|---·   |
        |   |(I)|   |   |
        |---|---|---|---|
        |   |(O)|(O)|   |
        |   ·---|---·   |
        |       |       |
        ·---------------·

    Transferring our information to a Biliteral Diagram, we get

        ·-------·
        |(I)|   |
        |---|---|
        |   |   |
        ·-------·

    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".

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

    Representing these on a Triliteral Diagram, we get

        ·---------------·
        |(O)    |    (O)|
        |   ·---|---·   |
        |   |(O)|(I)|   |
        |---|---|---|---|
        |   |(O)|   |   |
        |   ·---|---·   |
        |(I)    |       |
        ·---------------·

    And this information, transferred to a Biliteral Diagram, is

        ·-------·
        |(O)|(I)|
        |---|---|
        |(I)|   |
        ·-------·

    Here we get _two_ Conclusions, viz.

        "All x are y';
         All y are x'."
                                                                   pg063
    And 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".

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

        ·---------------·
        |(O)    |    (O)|
        |   ·---|---·   |
        |   |  (I)  |   |
        |---|(I)|---|---|
        |   |   |   |   |
        |   ·---|---·   |
        |       |       |
        ·---------------·

    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';      |(O)    |    (O)|  |   |(O)|
     All m are y."     |   ·---|---·   |  |---|---|
                       |   |   |(O)|   |  |   |   |
                       |---|(I)|---|---|  ·-------·
                       |   |   |(O)|   |
                       |   ·---|---·   |  .'. "No x are y'."
                       |       |       |
                       ·---------------·

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;      |       |       |  |(I)|   |
     Some y are m."    |   ·---|---·   |  |---|---|
                       |   |(I)|   |   |  |   |   |
                       |---|---|---|---|  ·-------·
                       |   |(O)|(O)|   |
                       |   ·---|---·   |  .'. "Some y are x."
                       |       |       |
                       ·---------------·

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;      |(O)    |    (O)|  |(O)|(I)|
     All y are m'."    |   ·---|---·   |  |---|---|
                       |   |(O)|(I)|   |  |(I)|   |
                       |---|---|---|---|  ·-------·
                       |   |(O)|   |   |
                       |   ·---|---·   |  .'. "All x are y';
                       |(I)    |       |         All y are x'."
                       ·---------------·

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;      |(O)    |    (O)|
     Some m are y."    |   ·---|---·   |
                       |   |  (I)  |   |
                       |---|(I)|---|---|
                       |   |   |   |   |
                       |   ·---|---·   |  There is no
                       |       |       |  Conclusion.
                       ·---------------·


    [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;      |       |       |  |(I)|   |
     All m are y.      |   ·---|---·   |  |---|---|
       Some x are y."  |   |(I)|(O)|   |  |   |   |
                       |---|---|---|---|  ·-------·
                       |   |(O)|(O)|   |
                       |   ·---|---·   |  .'. "Some x are y."
                       |       |       |
                       ·---------------·

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;      |(O)    |    (O)|  |(I)|(O)|
     All m are y.      |   ·---|---·   |  |---|---|
       Some x are y."  |   |(I)|(O)|   |  |   |   |
                       |---|---|---|---|  ·-------·
                       |   |   |(O)|   |
                       |   ·---|---·   |  .'. "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;      |(O)    |    (O)|  |   |   |
     Some y are m'.    |   ·---|---·   |  |---|---|
       Some y are x'." |   |   |   |   |  |(I)|   |
                       |---|---|---|---|  ·-------·
                       |   |   |   |   |
                       |   ·---|---·   |  .'. "Some y are x'."
                       |(I)    |       |
                       ·---------------·

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'." |   |  (I)  |   |
                       |(I)|---|---|---|
                       |   |(O)|(O)|   |
                       |   ·---|---·   |  There is no
                       |       |       |  Conclusion.
                       ·---------------·

(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';     |(O)    |    (I)|  |(O)|(I)|
     All y are m.      |   ·---|---·   |  |---|---|
       All y are x'."  |   |(O)|(O)|   |  |(I)|   |
                       |---|---|---|---|  ·-------·
                       |   |(I)|   |   |
                       |   ·---|---·   |  .'. "All x are y';
                       |(O)    |       |         All y are x'."
                       ·---------------·

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';     |(O)    |       |
     All y are m.      |   ·---|---·   |
       All y are x'."  |   |   |   |   |
                       |---|(I)|---|---|
                       |   |   |   |   |
                       |   ·---|---·   |  There is no
                       |(O)    |    (O)|  Conclusion.
                       ·---------------·

    [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).]

                                                                   pg070


BOOK VI.

THE METHOD OF SUBSCRIPTS.



CHAPTER I.

_INTRODUCTORY._


Let us agree that "x_{1}" shall mean "Some existing Things have the
Attribute x", i.e. (more briefly) "Some x exist"; also that "xy_{1}"
shall mean "Some xy exist", and so on. Such a Proposition may be called
an '=Entity=.'

    [Note that, when there are _two_ letters in the expression, it
    does not in the least matter which stands _first_: "xy_{1}" and
    "yx_{1}" mean exactly the same.]

Also that "x_{0}" shall mean "No existing Things have the Attribute x",
i.e. (more briefly) "No x exist"; also that "xy_{0}" shall mean "No xy
exist", and so on. Such a Proposition may be called a '=Nullity='.

Also that "+" shall mean "and".

    [Thus "ab_{1} + cd_{0}" means "Some ab exist and no cd exist".]

Also that "¶" shall mean "would, if true, prove".

    [Thus, "x_{0} ¶ xy_{0}" means "The Proposition 'No x exist'
    would, if true, prove the Proposition 'No xy exist'".]

When two Letters are both of them accented, or both _not_ accented, they
are said to have '=Like Signs=', or to be '=Like=': when one is
accented, and the other not, they are said to have '=Unlike Signs=', or
to be '=Unlike='.

                                                                   pg071

CHAPTER II.

_REPRESENTATION OF PROPOSITIONS OF RELATION._


Let us take, first, the Proposition "Some x are y".

This, we know, is equivalent to the Proposition of Existence "Some xy
exist". (See p. 31.) Hence it may be represented by the expression
"xy_{1}".

The Converse Proposition "Some y are x" may of course be represented by
the _same_ expression, viz. "xy_{1}".

Similarly we may represent the three similar Pairs of Converse
Propositions, viz.--

    "Some x are y'"  = "Some y' are x",
    "Some x' are y"  = "Some y are x'",
    "Some x' are y'" = "Some y' are x'".

Let us take, next, the Proposition "No x are y".

This, we know, is equivalent to the Proposition of Existence "No xy
exist". (See p. 33.) Hence it may be represented by the expression
"xy_{0}".

The Converse Proposition "No y are x" may of course be represented by
the _same_ expression, viz. "xy_{0}".

Similarly we may represent the three similar Pairs of Converse
Propositions, viz.--

    "No x are y'"  = "No y' are x",
    "No x' are y"  = "No y are x'",
    "No x' are y'" = "No y' are x'".
                                                                   pg072
Let us take, next, the Proposition "All x are y".

Now it is evident that the Double Proposition of Existence "Some x exist
and no xy' exist" tells us that _some_ x-Things exist, but that _none_
of them have the Attribute y': that is, it tells us that _all_ of them
have the Attribute y: that is, it tells us that "All x are y".

Also it is evident that the expression "x_{1} + xy'_{0}" represents this
Double Proposition.

Hence it also represents the Proposition "All x are y".

    [The Reader will perhaps be puzzled by the statement that the
    Proposition "All x are y" is equivalent to the Double
    Proposition "Some x exist and no xy' exist," remembering that it
    was stated, at p. 33, to be equivalent to the Double Proposition
    "Some x are y and no x are y'" (i.e. "Some xy exist and no xy'
    exist"). The explanation is that the Proposition "Some xy exist"
    contains _superfluous information_. "Some x exist" is enough for
    our purpose.]

This expression may be written in a shorter form, viz. "x_{1}y'_{0}",
since _each_ Subscript takes effect back to the _beginning_ of the
expression.

Similarly we may represent the seven similar Propositions "All x are
y'", "All x' are y", "All x' are y'", "All y are x", "All y are x'",
"All y' are x", and "All y' are x'".

    [The Reader should make out all these for himself.]

It will be convenient to remember that, in translating a Proposition,
beginning with "All", from abstract form into subscript form, or _vice
versâ_, the Predicate _changes sign_ (that is, changes from positive to
negative, or else from negative to positive).

    [Thus, the Proposition "All y are x'" becomes "y_{1}x_{0}",
    where the Predicate changes from x' to x.

    Again, the expression "x'_{1}y'_{0}" becomes "All x' are y",
    where the Predicate changes for y' to y.]

                                                                   pg073

CHAPTER III.

_SYLLOGISMS._


§ 1.

_Representation of Syllogisms._


We already know how to represent each of the three Propositions of a
Syllogism in subscript form. When that is done, all we need, besides, is
to write the three expressions in a row, with "+" between the Premisses,
and "¶" before the Conclusion.

    [Thus the Syllogism

        "No x are m';
         All m are y.
             .'. No x are y'."

    may be represented thus:--

        xm'_{0} + m_{1}y'_{0} ¶ xy'_{0}

    When a Proposition has to be translated from concrete form into
    subscript form, the Reader will find it convenient, just at
    first, to translate it into _abstract_ form, and _thence_ into
    subscript form. But, after a little practice, he will find it
    quite easy to go straight from concrete form to subscript form.]

                                                                   pg074
§ 2.

_Formulæ for solving Problems in Syllogisms._

When once we have found, by Diagrams, the Conclusion to a given Pair of
Premisses, and have represented the Syllogism in subscript form, we have
a _Formula_, by which we can at once find, without having to use
Diagrams again, the Conclusion to any _other_ Pair of Premisses having
the _same_ subscript forms.

    [Thus, the expression

        xm_{0} + ym'_{0} ¶ xy_{0}

    is a Formula, by which we can find the Conclusion to any Pair of
    Premisses whose subscript forms are

        xm_{0} + ym'_{0}

    For example, suppose we had the Pair of Propositions

        "No gluttons are healthy;
         No unhealthy men are strong".

    proposed as Premisses. Taking "men" as our 'Universe', and
    making m = healthy; x = gluttons; y = strong; we might translate
    the Pair into abstract form, thus:--

        "No x are m;
         No m' are y".

    These, in subscript form, would be

        xm_{0} + m'y_{0}

    which are identical with those in our _Formula_. Hence we at
    once know the Conclusion to be

        xy_{0}

    that is, in abstract form,

        "No x are y";

    that is, in concrete form,

        "No gluttons are strong".]

I shall now take three different forms of Pairs of Premisses, and work
out their Conclusions, once for all, by Diagrams; and thus obtain some
useful Formulæ. I shall call them "Fig. I", "Fig. II", and "Fig. III".
                                                                   pg075
Fig. I.

This includes any Pair of Premisses which are both of them Nullities,
and which contain Unlike Eliminands.

The simplest case is

                       ·---------------·  ·-------·
    xm_{0} + ym'_{0}   |(O)    |       |  |(O)|   |
                       |   ·---|---·   |  |---|---|
                       |   |(O)|(O)|   |  |   |   |
                       |---|---|---|---|  ·-------·
                       |   |   |   |   |
                       |   ·---|---·   |  .'. xy_{0}
                       |(O)    |       |
                       ·---------------·

In this case we see that the Conclusion is a Nullity, and that the
Retinends have kept their Signs.

And we should find this Rule to hold good with _any_ Pair of Premisses
which fulfil the given conditions.

    [The Reader had better satisfy himself of this, by working out,
    on Diagrams, several varieties, such as

        m_{1}x_{0} + ym'_{0} (which ¶ xy_{0})
        xm'_{0} + m_{1}y_{0} (which ¶ xy_{0})
        x'm_{0} + ym'_{0} (which ¶ x'y_{0})
        m'_{1}x'_{0} + m_{1}y'_{0} (which ¶ x'y'_{0}).]

If either Retinend is asserted in the _Premisses_ to exist, of course it
may be so asserted in the _Conclusion_.

Hence we get two _Variants_ of Fig. I, viz.

(a) where _one_ Retinend is so asserted;

(b) where _both_ are so asserted.

    [The Reader had better work out, on Diagrams, examples of these
    two Variants, such as

        m_{1}x_{0} + y_{1}m'_{0} (which proves y_{1}x_{0})
        x_{1}m'_{0} + m_{1}y_{0} (which proves x_{1}y_{0})
        x'_{1}m_{0} + y_{1}m'_{0} (which proves x'_{1}y_{0} + y_{1}x'_{0}).]

The Formula, to be remembered, is

    xm_{0} + ym'_{0} ¶ xy_{0}

with the following two Rules:--

    (1) _Two Nullities, with Unlike Eliminands, yield a Nullity,
    in which both Retinends keep their Signs._
                                                                   pg076
    (2) _A Retinend, asserted in the Premisses to exist, may be
    so asserted in the Conclusion._

    [Note that Rule (1) is merely the Formula expressed in words.]


Fig. II.

This includes any Pair of Premisses, of which one is a Nullity and the
other an Entity, and which contain Like Eliminands.

The simplest case is

    xm_{0} + ym_{1}

    ·---------------·  ·-------·
    |       |       |  |   |   |
    |   ·---|---·   |  |---|---|
    |   |(O)|(O)|   |  |(I)|   |
    |---|---|---|---|  ·-------·
    |   |(I)|   |   |
    |   ·---|---·   |  .'. x'y_{1}
    |       |       |
    ·---------------·

In this case we see that the Conclusion is an Entity, and that the
Nullity-Retinend has changed its Sign.

And we should find this Rule to hold good with _any_ Pair of Premisses
which fulfil the given conditions.

    [The Reader had better satisfy himself of this, by working out,
    on Diagrams, several varieties, such as

        x'm_{0} + ym_{1} (which ¶ xy_{1})
        x_{1}m'_{0} + y'm'_{1} (which ¶ x'y'_{1})
        m_{1}x_{0} + y'm_{1} (which ¶ x'y'_{1}).]

The Formula, to be remembered, is,

    xm_{0} + ym_{1} ¶ x'y_{1}

with the following Rule:--

    _A Nullity and an Entity, with Like Eliminands, yield an
    Entity, in which the Nullity-Retinend changes its Sign._

    [Note that this Rule is merely the Formula expressed in words.]

                                                                   pg077
Fig. III.

This includes any Pair of Premisses which are both of them Nullities,
and which contain Like Eliminands asserted to exist.

The simplest case is

    xm_{0} + ym_{0} + m_{1}

    [Note that "m_{1}" is here stated _separately_, because it does
    not matter in which of the two Premisses it occurs: so that this
    includes the _three_ forms "m_{1}x_{0} + ym_{0}", "xm_{0} +
    m_{1}y_{0}", and "m_{1}x_{0} + m_{1}y_{0}".]

    ·---------------·  ·-------·
    |       |       |  |   |   |
    |   ·---|---·   |  |---|---|
    |   |(O)|(O)|   |  |   |(I)|
    |---|---|---|---|  ·-------·
    |   |(O)|(I)|   |
    |   ·---|---·   |  .'. x'y'_{1}
    |       |       |
    ·---------------·

In this case we see that the Conclusion is an Entity, and that _both_
Retinends have changed their Signs.

And we should find this Rule to hold good with _any_ Pair of Premisses
which fulfil the given conditions.

    [The Reader had better satisfy himself of this, by working out,
    on Diagrams, several varieties, such as

        x'm_{0} + m_{1}y_{0} (which ¶ xy'_{1})
        m'_{1}x_{0} + m'y'_{0} (which ¶ x'y_{1})
        m_{1}x'_{0} + m_{1}y'_{0} (which ¶ xy_{1}).]

The Formula, to be remembered, is

    xm_{0} + ym_{0} + m_{1} ¶ x'y'_{1}

with the following Rule (which is merely the Formula expressed in
words):--

    _Two Nullities, with Like Eliminands asserted to exist, yield
    an Entity, in which both Retinends change their Signs._

       *       *       *       *       *

In order to help the Reader to remember the peculiarities and Formulæ of
these three Figures, I will put them all together in one Table.
                                                                   pg078
                            TABLE IX.
     _______________________________________________________
    |                                                       |
    |                       Fig. I.                         |
    |                                                       |
    |               xm_{0} + ym'_{0} ¶ xy_{0}               |
    |                                                       |
    |    Two Nullities, with Unlike Eliminands, yield a     |
    |    Nullity, in which both Retinends keep their Signs. |
    |                                                       |
    |  A Retinend, asserted in the Premisses to exist, may  |
    |  be so asserted in the Conclusion.                    |
    |_______________________________________________________|
    |                                                       |
    |                       Fig. II.                        |
    |                                                       |
    |               xm_{0} + ym_{1} ¶ x'y_{1}               |
    |                                                       |
    |    A Nullity and an Entity, with Like Eliminands,     |
    |    yield an Entity, in which the Nullity-Retinend     |
    |    changes its Sign.                                  |
    |_______________________________________________________|
    |                                                       |
    |                      Fig. III.                        |
    |                                                       |
    |          xm_{0} + ym_{0} + m_{1} ¶ x'y'_{1}           |
    |                                                       |
    |  Two Nullities, with Like Eliminands asserted         |
    |  to exist, yield an Entity, in which both Retinends   |
    |  change their Signs.                                  |
    |_______________________________________________________|

I will now work out, by these Formulæ, as models for the Reader to
imitate, some Problems in Syllogisms which have been already worked, by
Diagrams, in Book V., Chap. II.

(1) [see p. 64]

    "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.

    xm'_{0} + m_{1}y'_{0} ¶ xy'_{0} [Fig. I.

_i.e._ "No son of mine ever fails to be treated with respect."
                                                                   pg079
(2) [see p. 64]

    "All cats understand French;
     Some chickens are cats."

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

    m_{1}x'_{0} + ym_{1} ¶ xy_{1} [Fig. II.

_i.e._ "Some chickens understand French."

(3) [see p. 64]

    "All diligent students are successful;
     All ignorant students are unsuccessful."

Univ. "students"; m = successful; x = diligent; y = ignorant.

    x_{1}m'_{0} + y_{1}m_{0} ¶ x_{1}y_{0} + y_{1}x_{0} [Fig. I (b).

_i.e._ "All diligent students are learned; and all ignorant students are
idle."

(4) [see p. 66]

    "All soldiers are strong;
     All soldiers are brave.
         Some strong men are brave."

Univ. "men"; m = soldiers; x = strong; y = brave.

    m_{1}x'_{0} + m_{1}y'_{0} ¶ xy_{1} [Fig. III.

Hence proposed Conclusion is right.

(5) [see p. 67]

    "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; y = things which I wish to
examine thoroughly.

    x_{1}m'_{0} + m_{1}y'_{0} ¶ x_{1}y'_{0} [Fig. I (a).

Hence proposed Conclusion, xy_{1}, is _incomplete_, the _complete_ one
being "I wish to examine _all_ these pictures thoroughly."
                                                                   pg080
(6) [see p. 67]

    "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.

    m'x_{0} + ym'_{1} ¶ x'y_{1} [Fig. II.

Hence proposed Conclusion is right.

(7) [see p. 69]

    "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.

m'x'_{0} + y_{1}m'_{0} do not come under any of the three Figures. Hence
it is necessary to return to the Method of Diagrams, as shown at p. 69.

Hence there is no Conclusion.


    [Work Examples § =4=, 12-20 (p. 100); § =5=, 13-24 (pp. 101,
    102); § =6=, 1-6 (p. 106); § =7=, 1-3 (pp. 107, 108). Also read
    Note (A), at p. 164.]

                                                                   pg081
§ 3.

_Fallacies._

Any argument which _deceives_ us, by seeming to prove what it does not
really prove, may be called a '=Fallacy=' (derived from the Latin verb
_fallo_ "I deceive"): but the particular kind, to be now discussed,
consists of a Pair of Propositions, which are proposed as the Premisses
of a Syllogism, but yield no Conclusion.

When each of the proposed Premisses is a Proposition in _I_, or _E_, or
_A_, (the only kinds with which we are now concerned,) the Fallacy may
be detected by the 'Method of Diagrams,' by simply setting them out on a
Triliteral Diagram, and observing that they yield no information which
can be transferred to the Biliteral Diagram.

But suppose we were working by the 'Method of _Subscripts_,' and had to
deal with a Pair of proposed Premisses, which happened to be a
'Fallacy,' how could we be certain that they would not yield any
Conclusion?

Our best plan is, I think, to deal with _Fallacies_ in the same was as
we have already dealt with _Syllogisms_: that is, to take certain forms
of Pairs of Propositions, and to work them out, once for all, on the
Triliteral Diagram, and ascertain that they yield _no_ Conclusion; and
then to record them, for future use, as _Formulæ for Fallacies_, just as
we have already recorded our three _Formulæ for Syllogisms_.
                                                                   pg082
Now, if we were to record the two Sets of Formulæ in the _same_ shape,
viz. by the Method of Subscripts, there would be considerable risk of
confusing the two kinds. Hence, in order to keep them distinct, I
propose to record the Formulæ for _Fallacies_ in _words_, and to call
them "Forms" instead of "Formulæ."

Let us now proceed to find, by the Method of Diagrams, three "Forms of
Fallacies," which we will then put on record for future use. They are as
follows:--

    (1) Fallacy of Like Eliminands not asserted to exist.
    (2) Fallacy of Unlike Eliminands with an Entity-Premiss.
    (3) Fallacy of two Entity-Premisses.

These shall be discussed separately, and it will be seen that each fails
to yield a Conclusion.

(1) _Fallacy of Like Eliminands not asserted to exist._

It is evident that neither of the given Propositions can be an _Entity_,
since that kind asserts the _existence_ of both of its Terms (see p.
20). Hence they must both be _Nullities_.

Hence the given Pair may be represented by (xm_{0} + ym_{0}), with or
without x_{1}, y_{1}.

These, set out on Triliteral Diagrams, are

     xm_{0} + ym_{0}        x_{1}m_{0} + ym_{0}
    ·---------------·        ·---------------·
    |       |       |        |      (I)      |
    |   ·---|---·   |        |   ·---|---·   |
    |   |(O)|(O)|   |        |   |(O)|(O)|   |
    |---|---|---|---|        |---|---|---|---|
    |   |(O)|   |   |        |   |(O)|   |   |
    |   ·---|---·   |        |   ·---|---·   |
    |       |       |        |       |       |
    ·---------------·        ·---------------·

   xm_{0} + y_{1}m_{0}    x_{1}m_{0} + y_{1}m_{0}
    ·---------------·        ·---------------·
    |       |       |        |      (I)      |
    |   ·---|---·   |        |   ·---|---·   |
    |   |(O)|(O)|   |        |   |(O)|(O)|   |
    |(I)|---|---|---|        |(I)|---|---|---|
    |   |(O)|   |   |        |   |(O)|   |   |
    |   ·---|---·   |        |   ·---|---·   |
    |       |       |        |       |       |
    ·---------------·        ·---------------·
                                                                   pg083
(2) _Fallacy of Unlike Eliminands with an Entity-Premiss._

Here the given Pair may be represented by (xm_{0} + ym'_{1}) with or
without x_{1} or m_{1}.

These, set out on Triliteral Diagrams, are

     xm_{0} + ym'_{1}    x_{1}m_{0} + ym'_{1}    m_{1}x_{0} + ym'_{1}
    ·---------------·     ·---------------·       ·---------------·
    |       |       |     |      (I)      |       |       |       |
    |   ·---|---·   |     |   ·---|---·   |       |   ·---|---·   |
    |   |(O)|(O)|   |     |   |(O)|(O)|   |       |   |(O)|(O)|   |
    |(I)|---|---|---|     |(I)|---|---|---|       |(I)|---|---|---|
    |   |   |   |   |     |   |   |   |   |       |   |  (I)  |   |
    |   ·---|---·   |     |   ·---|---·   |       |   ·---|---·   |
    |       |       |     |       |       |       |       |       |
    ·---------------·     ·---------------·       ·---------------·

(3) _Fallacy of two Entity-Premisses._

Here the given Pair may be represented by either (xm_{1} + ym_{1}) or
(xm_{1} + ym'_{1}).

These, set out on Triliteral Diagrams, are

     xm_{1} + ym_{1}    xm_{1} + ym'_{1}
    ·---------------·  ·---------------·
    |       |       |  |       |       |
    |   ·---|---·   |  |   ·---|---·   |
    |   |  (I)  |   |  |   |  (I)  |   |
    |---|(I)|---|---|  |(I)|---|---|---|
    |   |   |   |   |  |   |   |   |   |
    |   ·---|---·   |  |   ·---|---·   |
    |       |       |  |       |       |
    ·---------------·  ·---------------·

                                                                   pg084
§ 4.

_Method of proceeding with a given Pair of Propositions._

Let us suppose that we have before us a Pair of Propositions of
Relation, which contain between them a Pair of codivisional Classes, and
that we wish to ascertain what Conclusion, if any, is consequent from
them. We translate them, if necessary, into subscript-form, and then
proceed as follows:--

(1) We examine their Subscripts, in order to see whether they are

    (a) a Pair of Nullities;
    or (b) a Nullity and an Entity;
    or (c) a Pair of Entities.

(2) If they are a Pair of Nullities, we examine their Eliminands, in
order to see whether they are Unlike or Like.

If their Eliminands are _Unlike_, it is a case of Fig. I. We then
examine their Retinends, to see whether one or both of them are asserted
to _exist_. If one Retinend is so asserted, it is a case of Fig. I (a);
if both, it is a case of Fig. I (b).

If their Eliminands are Like, we examine them, in order to see whether
either of them is asserted to exist. If so, it is a case of Fig. III.;
if not, it is a case of "Fallacy of Like Eliminands not asserted to
exist."

(3) If they are a Nullity and an Entity, we examine their Eliminands, in
order to see whether they are Like or Unlike.

If their Eliminands are Like, it is a case of Fig. II.; if _Unlike_, it
is a case of "Fallacy of Unlike Eliminands with an Entity-Premiss."

(4) If they are a Pair of Entities, it is a case of "Fallacy of two
Entity-Premisses."


    [Work Examples § =4=, 1-11 (p. 100); § =5=, 1-12 (p. 101);
    § =6=, 7-12 (p. 106); § =7=, 7-12 (p. 108).]

                                                                   pg085


BOOK VII.

SORITESES.



CHAPTER I.

_INTRODUCTORY._


When a Set of three or more Biliteral Propositions are such that all
their Terms are Species of the same Genus, and are also so related that
two of them, taken together, yield a Conclusion, which, taken with
another of them, yields another Conclusion, and so on, until all have
been taken, it is evident that, if the original Set were true, the last
Conclusion would _also_ be true.

Such a Set, with the last Conclusion tacked on, is called a '=Sorites=';
the original Set of Propositions is called its '=Premisses='; each of
the intermediate Conclusions is called a '=Partial Conclusion=' of the
Sorites; the last Conclusion is called its '=Complete Conclusion=,' or,
more briefly, its '=Conclusion='; the Genus, of which all the Terms are
Species, is called its '=Universe of Discourse=', or, more briefly, its
'=Univ.='; the Terms, used as Eliminands in the Syllogisms, are called
its '=Eliminands='; and the two Terms, which are retained, and therefore
appear in the Conclusion, are called its '=Retinends='.

    [Note that each _Partial_ Conclusion contains one or two
    _Eliminands_; but that the _Complete_ Conclusion contains
    _Retinends_ only.]

The Conclusion is said to be '=consequent=' from the Premisses; for
which reason it is usual to prefix to it the word "Therefore" (or the
symbol ".'.").

    [Note 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 one of the Propositions which make up
    the Sorites, by depends entirely on their _relationship to one
    another_.
                                                                   pg086
    As a specimen-Sorites, let us take the following Set of 5
    Propositions:--

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

    Here the first and second, taken together, yield "No a are c'".

    This, taken along with the third, yields "No a are d'".

    This, taken along with the fourth, yields "No d' are e'".

    And this, taken along with the fifth, yields "All h are d".

    Hence, if the original Set were true, this would _also_ be true.

    Hence the original Set, with this tacked on, is a _Sorites_; the
    original Set is its _Premisses_; the Proposition "All h are d"
    is its _Conclusion_; the Terms a, b, c, e are its _Eliminands_;
    and the Terms d and h are its _Retinends_.

    Hence we may write the whole Sorites thus:--

        "No a are b';
         All b are c;
         All c are d;
         No e' are a';
         All h are e'.
             .'. All h are d".

    In the above Sorites, the 3 Partial Conclusions are the
    Positions "No a are e'", "No a are d'", "No d' are e'"; but, if
    the Premisses were arranged in other ways, other Partial
    Conclusions might be obtained. Thus, the order 41523 yields the
    Partial Conclusions "No c' are b'", "All h are b", "All h are
    c". There are altogether _nine_ Partial Conclusions to this
    Sorites, which the Reader will find it an interesting task to
    make out for himself.]

                                                                   pg087

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


BOOK VIII.

EXAMPLES, ANSWERS, AND SOLUTIONS.

    [N.B. Reference tags for Examples, Answers & Solutions will be
    found in the right margin.]



CHAPTER I.

_EXAMPLES._


§ 1.                                                               EX1

_Propositions of Relation, to be reduced to normal form._

 1. I have been out for a walk.

 2. I am feeling better.

 3. No one has read the letter but John.

 4. Neither you nor I are old.

 5. No fat creatures run well.

 6. None but the brave deserve the fair.

 7. No one looks poetical unless he is pale.

 8. Some judges lose their tempers.

 9. I never neglect important business.

10. What is difficult needs attention.

11. What is unwholesome should be avoided.

12. All the laws passed last week relate to excise.

13. Logic puzzles me.

14. There are no Jews in the house.

15. Some dishes are unwholesome if not well-cooked.

16. Unexciting books make one drowsy.

17. When a man knows what he's about, he can detect a sharper.

18. You and I know what we're about.

19. Some bald people wear wigs.

20. Those who are fully occupied never talk about their grievances.

21. No riddles interest me if they can be solved.

                                                                   pg098
§ 2.                                                               EX2

_Pairs of Abstract Propositions, one in terms of x and m, and the other
in terms of y and m, to be represented on the same Triliteral Diagram._

 1. No x are m;
    No m' are y.

 2. No x' are m';
    All m' are y.

 3. Some x' are m;
    No m are y.

 4. All m are x;
    All m' are y'.

 5. All m' are x;
    All m' are y'.

 6. All x' are m';
    No y' are m.

 7. All x are m;
    All y' are m'.

 8. Some m' are x';
    No m are y.

 9. All m are x';
    No m are y.

10. No m are x';
    No y are m'.

11. No x' are m';
    No m are y.

12. Some x are m;
    All y' are m.

13. All x' are m;
    No m are y.

14. Some x are m';
    All m are y.

15. No m' are x';
    All y are m.

16. All x are m';
    No y are m.

17. Some m' are x;
    No m' are y'.

18. All x are m';
    Some m' are y'.

19. All m are x;
    Some m are y'.

20. No x' are m;
    Some y are m.

21. Some x' are m';
    All y' are m.

22. No m are x;
    Some m are y.

23. No m' are x;
    All y are m'.

24. All m are x;
    No y' are m'.

25. Some m are x;
    No y' are m.

26. All m' are x';
    Some y are m'.

27. Some m are x';
    No y' are m'.

28. No x are m';
    All m are y'.

29. No x' are m;
    No m are y'.

30. No x are m;
    Some y' are m'.

31. Some m' are x;
    All y' are m;

32. All x are m';
    All y are m.

                                                                   pg099
§ 3.                                                               EX3

_Marked Triliteral Diagrams, to be interpreted in terms of x and y._

        1
·---------------·
|(O)    |       |
|   ·---|---·   |
|   |(I)|(O)|   |
|---|---|---|---|
|   |   |(O)|   |
|   ·---|---·   |
|(O)    |       |
·---------------·

        2
·---------------·
|(O)    |       |
|   ·---|---·   |
|   |   |(O)|   |
|---|---|---|(I)|
|   |   |(O)|   |
|   ·---|---·   |
|(O)    |       |
·---------------·

        3
·---------------·
|       |    (O)|
|   ·---|---·   |
|   |(O)|(O)|   |
|---|---|---|---|
|   |   |(I)|   |
|   ·---|---·   |
|       |    (O)|
·---------------·

        4
·---------------·
|(O)    |    (O)|
|   ·---|---·   |
|   |(O)|   |   |
|---|---|(I)|---|
|   |(O)|   |   |
|   ·---|---·   |
|       |       |
·---------------·

        5
·---------------·
|       |    (I)|
|   ·---|---·   |
|   |   |(O)|   |
|---|---|---|---|
|   |   |(O)|   |
|   ·---|---·   |
|(O)    |    (O)|
·---------------·

        6
·---------------·
|(O)    |    (O)|
|   ·---|---·   |
|   |   |   |   |
|---|---|---|---|
|   |   |(O)|   |
|   ·---|---·   |
|(I)    |    (O)|
·---------------·

        7
·---------------·
|(O)    |    (O)|
|   ·---|---·   |
|   |(I)|(O)|   |
|---|---|---|---|
|   |   |(O)|   |
|   ·---|---·   |
|       |       |
·---------------·

        8
·---------------·
|(I)    |       |
|   ·---|---·   |
|   |(O)|   |   |
|---|---|---|---|
|   |(O)|(I)|   |
|   ·---|---·   |
|(O)    |       |
·---------------·

        9
·---------------·
|       |       |
|   ·---|---·   |
|   |(O)|   |   |
|---|---|---|---|
|   |(O)|(I)|   |
|   ·---|---·   |
|(O)    |    (O)|
·---------------·

       10
·---------------·
|(O)    |    (O)|
|   ·---|---·   |
|   |(O)|(I)|   |
|---|---|---|---|
|   |(O)|   |   |
|   ·---|---·   |
|       |       |
·---------------·

       11
·---------------·
|(O)    |    (O)|
|   ·---|---·   |
|   |  (I)  |   |
|---|---|---|---|
|   |(O)|   |   |
|   ·---|---·   |
|       |    (O)|
·---------------·

       12
·---------------·
|(O)    |       |
|   ·---|---·   |
|   |   |   |   |
|---|(I)|---|---|
|   |   |   |   |
|   ·---|---·   |
|(O)    |    (I)|
·---------------·

       13
·---------------·
|(O)    |    (I)|
|   ·---|---·   |
|   |   |(O)|   |
|---|---|---|---|
|   |   |(O)|   |
|   ·---|---·   |
|(O)    |       |
·---------------·

       14
·---------------·
|(O)    |    (O)|
|   ·---|---·   |
|   |   |(O)|   |
|---|---|---|---|
|   |   |(O)|   |
|   ·---|---·   |
|      (I)      |
·---------------·

       15
·---------------·
|       |       |
|   ·---|---·   |
|   |(I)|   |   |
|---|---|---|---|
|   |(O)|(O)|   |
|   ·---|---·   |
|       |       |
·---------------·

       16
·---------------·
|(I)    |       |
|   ·---|---·   |
|   |   |   |   |
|---|---|---|---|
|   |(O)|   |   |
|   ·---|---·   |
|(O)    |    (O)|
·---------------·

       17
·---------------·
|       |    (O)|
|   ·---|---·   |
|   |   |(I)|   |
|---|---|---|---|
|   |(O)|(O)|   |
|   ·---|---·   |
|(I)    |    (O)|
·---------------·

       18
·---------------·
|(O)    |    (O)|
|   ·---|---·   |
|   |(O)|(I)|   |
|---|---|---|---|
|   |(O)|   |   |
|   ·---|---·   |
|(I)    |       |
·---------------·

       19
·---------------·
|(O)    |    (O)|
|   ·---|---·   |
|   |(I)|(O)|   |
|---|---|---|---|
|   |   |(O)|   |
|   ·---|---·   |
|       |    (I)|
·---------------·

       20
·---------------·
|(O)    |       |
|   ·---|---·   |
|   |(O)|(O)|   |
|---|---|---|---|
|   |(I)|   |   |
|   ·---|---·   |
|(O)    |       |
·---------------·

                                                                   pg100
§ 4.                                                               EX4

_Pairs of Abstract Propositions, proposed as Premisses: Conclusions to
be found._

 1. No m are x';
    All m' are y.

 2. No m' are x;
    Some m' are y'.

 3. All m' are x;
    All m' are y'.

 4. No x' are m';
    All y' are m.

 5. Some m are x';
    No y are m.

 6. No x' are m;
    No m are y.

 7. No m are x';
    Some y' are m.

 8. All m' are x';
    No m' are y.

 9. Some x' are m';
    No m are y'.

10. All x are m;
    All y' are m'.

11. No m are x;
    All y' are m'.

12. No x are m;
    All y are m.

13. All m' are x;
    No y are m.

14. All m are x;
    All m' are y.

15. No x are m;
    No m' are y.

16. All x are m';
    All y are m.

17. No x are m;
    All m' are y.

18. No x are m';
    No m are y.

19. All m are x;
    All m are y'.

20. No m are x;
    All m' are y.

21. All x are m;
    Some m' are y.

22. Some x are m;
    All y are m.

23. All m are x;
    Some y are m.

24. No x are m;
    All y are m.

25. Some m are x';
    All y' are m'.

26. No m are x';
    All y are m.

27. All x are m';
    All y' are m.

28. All m are x';
    Some m are y.

29. No m are x;
    All y are m'.

30. All x are m';
    Some y are m.

31. All x are m;
    All y are m.

32. No x are m';
    All m are y.

33. No m are x;
    No m are y.

34. No m are x';
    Some y are m.

35. No m are x;
    All y are m.

36. All m are x';
    Some y are m.

37. All m are x;
    No y are m.

38. No m are x;
    No m' are y.

39. Some m are x';
    No m are y.

40. No x' are m;
    All y' are m.

41. All x are m';
    No y are m'.

42. No m' are x;
    No y are m.

                                                                   pg101
§ 5.                                                               EX5

_Pairs of Concrete Propositions, proposed as Premisses: Conclusions to
be found._

  1. I have been out for a walk;
     I am feeling better.

  2. No one has read the letter but John;
     No one, who has _not_ read it, knows what it is about.

  3. Those who are not old like walking;
     You and I are young.

  4. Your course is always honest;
     Your course is always the best policy.

  5. No fat creatures run well;
     Some greyhounds run well.

  6. Some, who deserve the fair, get their deserts;
     None but the brave deserve the fair.

  7. Some Jews are rich;
     All Esquimaux are Gentiles.

  8. Sugar-plums are sweet;
     Some sweet things are liked by children.

  9. John is in the house;
     Everybody in the house is ill.

 10. Umbrellas are useful on a journey;
     What is useless on a journey should be left behind.

 11. Audible music causes vibration in the air;
     Inaudible music is not worth paying for.

 12. Some holidays are rainy;
     Rainy days are tiresome.

 13. No Frenchmen like plumpudding;
     All Englishmen like plumpudding.

 14. No portrait of a lady, that makes her simper or scowl, is
       satisfactory;
     No photograph of a lady ever fails to make her simper or scowl.

 15. All pale people are phlegmatic;
     No one looks poetical unless he is pale.

 16. No old misers are cheerful;
     Some old misers are thin.

 17. No one, who exercises self-control, fails to keep his temper;
     Some judges lose their tempers.
                                                                   pg102
 18. All pigs are fat;
     Nothing that is fed on barley-water is fat.

 19. All rabbits, that are not greedy, are black;
     No old rabbits are free from greediness.

 20. Some pictures are not first attempts;
     No first attempts are really good.

 21. I never neglect important business;
     Your business is unimportant.

 22. Some lessons are difficult;
     What is difficult needs attention.

 23. All clever people are popular;
     All obliging people are popular.

 24. Thoughtless people do mischief;
     No thoughtful person forgets a promise.

 25. Pigs cannot fly;
     Pigs are greedy.

 26. All soldiers march well;
     Some babies are not soldiers.

 27. No bride-cakes are wholesome;
     What is unwholesome should be avoided.

 28. John is industrious;
     No industrious people are unhappy.

 29. No philosophers are conceited;
     Some conceited persons are not gamblers.

 30. Some excise laws are unjust;
     All the laws passed last week relate to excise.

 31. No military men write poetry;
     None of my lodgers are civilians.

 32. No medicine is nice;
     Senna is a medicine.

 33. Some circulars are not read with pleasure;
     No begging-letters are read with pleasure.

 34. All Britons are brave;
     No sailors are cowards.

 35. Nothing intelligible ever puzzles _me_;
     Logic puzzles me.

 36. Some pigs are wild;
     All pigs are fat.
                                                                   pg103
 37. All wasps are unfriendly;
     All unfriendly creatures are unwelcome.

 38. No old rabbits are greedy;
     All black rabbits are greedy.

 39. Some eggs are hard-boiled;
     No eggs are uncrackable.

 40. No antelope is ungraceful;
     Graceful creatures delight the eye.

 41. All well-fed canaries sing loud;
     No canary is melancholy if it sings loud.

 42. Some poetry is original;
     No original work is producible at will.

 43. No country, that has been explored, is infested by dragons;
     Unexplored countries are fascinating.

 44. No coals are white;
     No niggers are white.

 45. No bridges are made of sugar;
     Some bridges are picturesque.

 46. No children are patient;
     No impatient person can sit still.

 47. No quadrupeds can whistle;
     Some cats are quadrupeds.

 48. Bores are terrible;
     You are a bore.

 49. Some oysters are silent;
     No silent creatures are amusing.

 50. There are no Jews in the house;
     No Gentiles have beards a yard long.

 51. Canaries, that do not sing loud, are unhappy;
     No well-fed canaries fail to sing loud.

 52. All my sisters have colds;
     No one can sing who has a cold.

 53. All that is made of gold is precious;
     Some caskets are precious.

 54. Some buns are rich;
     All buns are nice.

 55. All my cousins are unjust;
     All judges are just.
                                                                   pg104
 56. Pain is wearisome;
     No pain is eagerly wished for.

 57. All medicine is nasty;
     Senna is a medicine.

 58. Some unkind remarks are annoying;
     No critical remarks are kind.

 59. No tall men have woolly hair;
     Niggers have woolly hair.

 60. All philosophers are logical;
     An illogical man is always obstinate.

 61. John is industrious;
     All industrious people are happy.

 62. These dishes are all well-cooked;
     Some dishes are unwholesome if not well-cooked.

 63. No exciting books suit feverish patients;
     Unexciting books make one drowsy.

 64. No pigs can fly;
     All pigs are greedy.

 65. When a man knows what he's about, he can detect a sharper;
     You and I know what we're about.

 66. Some dreams are terrible;
     No lambs are terrible.

 67. No bald creature needs a hairbrush;
     No lizards have hair.

 68. All battles are noisy;
     What makes no noise may escape notice.

 69. All my cousins are unjust;
     No judges are unjust.

 70. All eggs can be cracked;
     Some eggs are hard-boiled.

 71. Prejudiced persons are untrustworthy;
     Some unprejudiced persons are disliked.

 72. No dictatorial person is popular;
     She is dictatorial.

 73. Some bald people wear wigs;
     All your children have hair.

 74. No lobsters are unreasonable;
     No reasonable creatures expect impossibilities.
                                                                   pg105
 75. No nightmare is pleasant;
     Unpleasant experiences are not eagerly desired.

 76. No plumcakes are wholesome;
     Some wholesome things are nice.

 77. Nothing that is nice need be shunned;
     Some kinds of jam are nice.

 78. All ducks waddle;
     Nothing that waddles is graceful.

 79. Sandwiches are satisfying;
     Nothing in this dish is unsatisfying.

 80. No rich man begs in the street;
     Those who are not rich should keep accounts.

 81. Spiders spin webs;
     Some creatures, that do not spin webs, are savage.

 82. Some of these shops are not crowded;
     No crowded shops are comfortable.

 83. Prudent travelers carry plenty of small change;
     Imprudent travelers lose their luggage.

 84. Some geraniums are red;
     All these flowers are red.

 85. None of my cousins are just;
     All judges are just.

 86. No Jews are mad;
     All my lodgers are Jews.

 87. Busy folk are not always talking about their grievances;
     Discontented folk are always talking about their grievances.

 88. None of my cousins are just;
     No judges are unjust.

 89. All teetotalers like sugar;
     No nightingale drinks wine.

 90. No riddles interest me if they can be solved;
     All these riddles are insoluble.

 91. All clear explanations are satisfactory;
     Some excuses are unsatisfactory.

 92. All elderly ladies are talkative;
     All good-tempered ladies are talkative.

 93. No kind deed is unlawful;
     What is lawful may be done without scruple.
                                                                   pg106
 94. No babies are studious;
     No babies are good violinists.

 95. All shillings are round;
     All these coins are round.

 96. No honest men cheat;
     No dishonest men are trustworthy.

 97. None of my boys are clever;
     None of my girls are greedy.

 98. All jokes are meant to amuse;
     No Act of Parliament is a joke.

 99. No eventful tour is ever forgotten;
     Uneventful tours are not worth writing a book about.

100. All my boys are disobedient;
     All my girls are discontented.

101. No unexpected pleasure annoys me;
     Your visit is an unexpected pleasure.


§ 6.                                                               EX6

_Trios of Abstract Propositions, proposed as Syllogisms: to be
examined._

 1. Some x are m;    No m are y'.     Some x are y.

 2. All x are m;     No y are m'.     No y are x'.

 3. Some x are m';   All y' are m.    Some x are y.

 4. All x are m;     No y are m.      All x are y'.

 5. Some m' are x';  No m' are y.     Some x' are y'.

 6. No x' are m;     All y are m'.    All y are x'.

 7. Some m' are x';  All y' are m'.   Some x' are y'.

 8. No m' are x';    All y' are m'.   All y' are x.

 9. Some m are x';   No m are y.      Some x' are y'.

10. All m' are x';   All m' are y.    Some y are x'.

11. All x are m';    Some y are m.    Some y are x'.

12. No x are m;      No m' are y'.    No x are y'.

13. No x are m;      All y' are m.    All y' are x'.

14. All m' are x';   All m' are y.    Some y are x'.

15. Some m are x';   All y are m'.    Some x' are y'.

16. No x' are m;     All y' are m'.   Some y' are x.

17. No m' are x;     All m' are y'.   Some x' are y'.
                                                                   pg107
18. No x' are m;     Some m are y.    Some x are y.

19. Some m are x;    All m are y.     Some y are x'.

20. No x' are m';    Some m' are y'.  Some x are y'.

21. No m are x;      All m are y'.    Some x' are y'.

22. All x' are m;    Some y are m'.   All x' are y'.

23. All m are x;     No m' are y'.    No x' are y'.

24. All x are m';    All m' are y.    All x are y.

25. No x are m';     All m are y.     No x are y'.

26. All m are x';    All y are m.     All y are x'.

27. All x are m;     No m are y'.     All x are y.

28. All x are m;     No y' are m'.    All x are y.

29. No x' are m;     No m' are y'.    No x' are y'.

30. All x are m;     All m are y'.    All x are y'.

31. All x' are m';   No y' are m'.    All x' are y.

32. No x are m;      No y' are m'.    No x are y'.

33. All m are x';    All y' are m.    All y' are x'.

34. All x are m';    Some y are m'.   Some y are x.

35. Some x are m;    All m are y.     Some x are y.

36. All m are x';    All y are m.     All y are x'.

37. No m are x';     All m are y'.    Some x are y'.

38. No x are m;      No m are y'.     No x are y'.

39. No m are x;      Some m are y'.   Some x' are y'.

40. No m are x';     Some y are m.    Some x are y.


§ 7.                                                               EX7

_Trios of Concrete Propositions, proposed as Syllogisms: to be
examined._

 1. No doctors are enthusiastic;
    You are enthusiastic.
      You are not a doctor.

 2. Dictionaries are useful;
    Useful books are valuable.
      Dictionaries are valuable.

 3. No misers are unselfish;
    None but misers save egg-shells.
      No unselfish people save egg-shells.

 4. Some epicures are ungenerous;
    All my uncles are generous.
      My uncles are not epicures.
                                                                   pg108
 5. Gold is heavy;
    Nothing but gold will silence him.
      Nothing light will silence him.

 6. Some healthy people are fat;
    No unhealthy people are strong.
      Some fat people are not strong.

 7. "I saw it in a newspaper."
    "All newspapers tell lies."
      It was a lie.

 8. Some cravats are not artistic;
    I admire anything artistic.
      There are some cravats that I do not admire.

 9. His songs never last an hour;
    A song, that lasts an hour, is tedious.
      His songs are never tedious.

10. Some candles give very little light;
    Candles are _meant_ to give light.
      Some things, that are meant to give light, give very little.

11. All, who are anxious to learn, work hard;
    Some of these boys work hard.
      Some of these boys are anxious to learn.

12. All lions are fierce;
    Some lions do not drink coffee.
      Some creatures that drink coffee are not fierce.

13. No misers are generous;
    Some old men are ungenerous.
      Some old men are misers.

14. No fossil can be crossed in love;
    An oyster may be crossed in love.
      Oysters are not fossils.

15. All uneducated people are shallow;
    Students are all educated.
      No students are shallow.

16. All young lambs jump;
    No young animals are healthy, unless they jump.
      All young lambs are healthy.

17. Ill-managed business is unprofitable;
    Railways are never ill-managed.
      All railways are profitable.

18. No Professors are ignorant;
    All ignorant people are vain.
      No professors are vain.
                                                                   pg109
19. A prudent man shuns hyænas;
    No banker is imprudent.
      No banker fails to shun hyænas.

20. All wasps are unfriendly;
    No puppies are unfriendly.
      Puppies are not wasps.

21. No Jews are honest;
    Some Gentiles are rich.
      Some rich people are dishonest.

22. No idlers win fame;
    Some painters are not idle.
      Some painters win fame.

23. No monkeys are soldiers;
    All monkeys are mischievous.
      Some mischievous creatures are not soldiers.

24. All these bonbons are chocolate-creams;
    All these bonbons are delicious.
      Chocolate-creams are delicious.

25. No muffins are wholesome;
    All buns are unwholesome.
      Buns are not muffins.

26. Some unauthorised reports are false;
    All authorised reports are trustworthy.
      Some false reports are not trustworthy.

27. Some pillows are soft;
    No pokers are soft.
      Some pokers are not pillows.

28. Improbable stories are not easily believed;
    None of his stories are probable.
      None of his stories are easily believed.

29. No thieves are honest;
    Some dishonest people are found out.
      Some thieves are found out.

30. No muffins are wholesome;
    All puffy food is unwholesome.
      All muffins are puffy.

31. No birds, except peacocks, are proud of their tails;
    Some birds, that are proud of their tails, cannot sing.
      Some peacocks cannot sing.

32. Warmth relieves pain;
    Nothing, that does not relieve pain, is useful in toothache.
      Warmth is useful in toothache.
                                                                   pg110
33. No bankrupts are rich;
    Some merchants are not bankrupts.
      Some merchants are rich.

34. Bores are dreaded;
    No bore is ever begged to prolong his visit.
      No one, who is dreaded, is ever begged to prolong his visit.

35. All wise men walk on their feet;
    All unwise men walk on their hands.
      No man walks on both.

36. No wheelbarrows are comfortable;
    No uncomfortable vehicles are popular.
      No wheelbarrows are popular.

37. No frogs are poetical;
    Some ducks are unpoetical.
      Some ducks are not frogs.

38. No emperors are dentists;
    All dentists are dreaded by children.
      No emperors are dreaded by children.

39. Sugar is sweet;
    Salt is not sweet.
      Salt is not sugar.

40. Every eagle can fly;
    Some pigs cannot fly.
      Some pigs are not eagles.


§ 8.                                                               EX8

_Sets of Abstract Propositions, proposed as Premisses for Soriteses:
Conclusions to be found._

    [N.B. At the end of this Section instructions are given for
    varying these Examples.]


      1.
 1. No c are d;
 2. All a are d;
 3. All b are c.

      2.
 1. All d are b;
 2. No a are c';
 3. No b are c.

      3.
 1. No b are a;
 2. No c are d';
 3. All d are b.

      4.
 1. No b are c;
 2. All a are b;
 3. No c' are d.

      5.
 1. All b' are a';
 2. No b are c;
 3. No a' are d.

      6.
 1. All a are b';
 2. No b' are c;
 3. All d are a.

      7.
 1. No d are b';
 2. All b are a;
 3. No c are d'.

      8.
 1. No b' are d;
 2. No a' are b;
 3. All c are d.
                                                                   pg111
      9.
 1. All b' are a;
 2. No a are d;
 3. All b are c.

     10.
 1. No c are d;
 2. All b are c;
 3. No a are d'.

     11.
 1. No b are c;
 2. All d are a;
 3. All c' are a'.

     12.
 1. No c are b';
 2. All c' are d';
 3. All b are a.

     13.
 1. All d are e;
 2. All c are a;
 3. No b are d';
 4. All e are a'.

     14.
 1. All e are b;
 2. All a are e;
 3. All d are b';
 4. All a' are c;

     15.
 1. No b' are d;
 2. All e are c;
 3. All b are a;
 4. All d' are c'.

     16.
 1. No a' are e;
 2. All d are c';
 3. All a are b;
 4. All e' are d.

     17.
 1. All d are c;
 2. All a are e;
 3. No b are d';
 4. All c are e'.

     18.
 1. All a are b;
 2. All d are e;
 3. All a' are c';
 4. No b are e.

     19.
 1. No b are c;
 2. All e are h;
 3. All a are b;
 4. No d are h;
 5. All e' are c.

     20.
 1. No d are h';
 2. No c are e;
 3. All h are b;
 4. No a are d';
 5. No b are e'.

     21.
 1. All b are a;
 2. No d are h;
 3. No c are e;
 4. No a are h';
 5. All c' are b.

     22.
 1. All e are d';
 2. No b' are h';
 3. All c' are d;
 4. All a are e;
 5. No c are h.

     23.
 1. All b' are a';
 2. No d are e';
 3. All h are b';
 4. No c are e;
 5. All d' are a.

     24.
 1. All h' are k';
 2. No b' are a;
 3. All c are d;
 4. All e are h';
 5. No d are k';
 6. No b are c'.

     25.
 1. All a are d;
 2. All k are b;
 3. All e are h;
 4. No a' are b;
 5. All d are c;
 6. All h are k.

     26.
 1. All a' are h;
 2. No d' are k';
 3. All e are b';
 4. No h are k;
 5. All a are e;
 6. No b' are d.

     27.
 1. All c are d';
 2. No h are b;
 3. All a' are k;
 4. No c are e';
 5. All b' are d;
 6. No a are c'.

     28.
 1. No a' are k;
 2. All e are b;
 3. No h are k';
 4. No d' are c;
 5. No a are b;
 6. All c' are h.

     29.
 1. No e are k;
 2. No b' are m;
 3. No a are c';
 4. All h' are e;
 5. All d are k;
 6. No c are b;
 7. All d' are l;
 8. No h are m'.

     30.
 1. All n are m;
 2. All a' are e;
 3. No c' are l;
 4. All k are r';
 5. No a are h';
 6. No d are l';
 7. No c are n';
 8. All e are b;
 9. All m are r;
10. All h are d.

    [N.B. In each Example, in Sections 8 and 9, it is possible to
    begin with _any_ Premiss, at pleasure, and thus to get as many
    different Solutions (all of course yielding the _same_ Complete
    Conclusion) as there are Premisses in the Example. Hence § 8
    really contains 129 different Examples, and § 9 contains 273.]

                                                                   pg112
§ 9.                                                               EX9

_Sets of Concrete Propositions, proposed as Premisses for Soriteses:
Conclusions to be found._

 =1.=

(1) Babies are illogical;

(2) Nobody is despised who can manage a crocodile;

(3) Illogical persons are despised.

Univ. "persons"; a = able to manage a crocodile; b = babies;
c = despised; d = logical.

 =2.=

(1) My saucepans are the only things I have that are made of tin;

(2) I find all _your_ presents very useful;

(3) None of my saucepans are of the slightest use.

Univ. "things of mine"; a = made of tin; b = my saucepans; c = useful;
d = your presents.

 =3.=

(1) No potatoes of mine, that are new, have been boiled;

(2) All my potatoes in this dish are fit to eat;

(3) No unboiled potatoes of mine are fit to eat.

Univ. "my potatoes"; a = boiled; b = eatable; c = in this dish; d = new.

 =4.=

(1) There are no Jews in the kitchen;

(2) No Gentiles say "shpoonj";

(3) My servants are all in the kitchen.

Univ. "persons"; a = in the kitchen; b = Jews; c = my servants;
d = saying "shpoonj."

 =5.=

(1) No ducks waltz;

(2) No officers ever decline to waltz;

(3) All my poultry are ducks.

Univ. "creatures"; a = ducks; b = my poultry; c = officers; d = willing
to waltz.

 =6.=

(1) Every one who is sane can do Logic;

(2) No lunatics are fit to serve on a jury;

(3) None of _your_ sons can do Logic.

Univ. "persons"; a = able to do Logic; b = fit to serve on a jury;
c = sane; d = your sons.
                                                                   pg113
 =7.=

(1) There are no pencils of mine in this box;

(2) No sugar-plums of mine are cigars;

(3) The whole of my property, that is not in this box, consists of
      cigars.

Univ. "things of mine"; a = cigars; b = in this box; c = pencils;
d = sugar-plums.

 =8.=

(1) No experienced person is incompetent;

(2) Jenkins is always blundering;

(3) No competent person is always blundering.

Univ. "persons"; a = always blundering; b = competent; c = experienced;
d = Jenkins.

 =9.=

(1) No terriers wander among the signs of the zodiac;

(2) Nothing, that does not wander among the signs of the zodiac, is a
      comet;

(3) Nothing but a terrier has a curly tail.

Univ. "things"; a = comets; b = curly-tailed; c = terriers;
d = wandering among the signs of the zodiac.

=10.=

(1) No one takes in the _Times_, unless he is well-educated;

(2) No hedge-hogs can read;

(3) Those who cannot read are not well-educated.

Univ. "creatures"; a = able to read; b = hedge-hogs; c = taking in the
Times; d = well-educated.

=11.=

(1) All puddings are nice;

(2) This dish is a pudding;

(3) No nice things are wholesome.

Univ. "things"; a = nice; b = puddings; c = this dish; d = wholesome.

=12.=

(1) My gardener is well worth listening to on military subjects;

(2) No one can remember the battle of Waterloo, unless he is very old;

(3) Nobody is really worth listening to on military subjects, unless he
      can remember the battle of Waterloo.

Univ. "persons"; a = able to remember the battle of Waterloo; b = my
gardener; c = well worth listening to on military subjects; d = very
old.
                                                                   pg114
=13.=

(1) All humming-birds are richly coloured;

(2) No large birds live on honey;

(3) Birds that do not live on honey are dull in colour.

Univ. "birds"; a = humming-birds; b = large; c = living on honey;
d = richly coloured.

=14.=

(1) No Gentiles have hooked noses;

(2) A man who is a good hand at a bargain always makes money;

(3) No Jew is ever a bad hand at a bargain.

Univ. "persons"; a = good hands at a bargain; b = hook-nosed; c = Jews;
d = making money.

=15.=

(1) All ducks in this village, that are branded 'B,' belong to Mrs.
      Bond;

(2) Ducks in this village never wear lace collars, unless they are
      branded 'B';

(3) Mrs. Bond has no gray ducks in this village.

Univ. "ducks in this village"; a = belonging to Mrs. Bond; b = branded
'B'; c = gray; d = wearing lace-collars.

=16.=

(1) All the old articles in this cupboard are cracked;

(2) No jug in this cupboard is new;

(3) Nothing in this cupboard, that is cracked, will hold water.

Univ. "things in this cupboard"; a = able to hold water; b = cracked;
c = jugs; d = old.

=17.=

(1) All unripe fruit is unwholesome;

(2) All these apples are wholesome;

(3) No fruit, grown in the shade, is ripe.

Univ. "fruit"; a = grown in the shade; b = ripe; c = these apples;
d = wholesome.

=18.=

(1) Puppies, that will not lie still, are always grateful for the loan
      of a skipping-rope;

(2) A lame puppy would not say "thank you" if you offered to lend it a
      skipping-rope.

(3) None but lame puppies ever care to do worsted-work.

Univ. "puppies"; a = caring to do worsted-work; b = grateful for the
loan of a skipping-rope; c = lame; d = willing to lie still.
                                                                   pg115
=19.=

(1) No name in this list is unsuitable for the hero of a romance;

(2) Names beginning with a vowel are always melodious;

(3) No name is suitable for the hero of a romance, if it begins with a
      consonant.

Univ. "names"; a = beginning with a vowel; b = in this list;
c = melodious; d = suitable for the hero of a romance.

=20.=

(1) All members of the House of Commons have perfect self-command;

(2) No M.P., who wears a coronet, should ride in a donkey-race;

(3) All members of the House of Lords wear coronets.

Univ. "M.P.'s"; a = belonging to the House of Commons; b = having
perfect self-command; c = one who may ride in a donkey-race; d = wearing
a coronet.

=21.=

(1) No goods in this shop, that have been bought and paid for, are still
      on sale;

(2) None of the goods may be carried away, unless labeled "sold";

(3) None of the goods are labeled "sold," unless they have been bought
      and paid for.

Univ. "goods in this shop"; a = allowed to be carried away; b = bought
and paid for; c = labeled "sold"; d = on sale.

=22.=

(1) No acrobatic feats, that are not announced in the bills of a circus,
      are ever attempted there;

(2) No acrobatic feat is possible, if it involves turning a quadruple
      somersault;

(3) No impossible acrobatic feat is ever announced in a circus bill.

Univ. "acrobatic feats"; a = announced in the bills of a circus;
b = attempted in a circus; c = involving the turning of a quadruple
somersault; d = possible.

=23.=

(1) Nobody, who really appreciates Beethoven, fails to keep silence
      while the Moonlight-Sonata is being played;

(2) Guinea-pigs are hopelessly ignorant of music;

(3) No one, who is hopelessly ignorant of music, ever keeps silence
      while the Moonlight-Sonata is being played.

Univ. "creatures"; a = guinea-pigs; b = hopelessly ignorant of music;
c = keeping silence while the Moonlight-Sonata is being played;
d = really appreciating Beethoven.
                                                                   pg116
=24.=

(1) Coloured flowers are always scented;

(2) I dislike flowers that are not grown in the open air;

(3) No flowers grown in the open air are colourless.

Univ. "flowers"; a = coloured; b = grown in the open air; c = liked by
me; d = scented.

=25.=

(1) Showy talkers think too much of themselves;

(2) No really well-informed people are bad company;

(3) People who think too much of themselves are not good company.

Univ. "persons"; a = good company; b = really well-informed; c = showy
talkers; d = thinking too much of one's self.

=26.=

(1) No boys under 12 are admitted to this school as boarders;

(2) All the industrious boys have red hair;

(3) None of the day-boys learn Greek;

(4) None but those under 12 are idle.

Univ. "boys in this school"; a = boarders; b = industrious; c = learning
Greek; d = red-haired; e = under 12.

=27.=

(1) The only articles of food, that my doctor allows me, are such as are
      not very rich;

(2) Nothing that agrees with me is unsuitable for supper;

(3) Wedding-cake is always very rich;

(4) My doctor allows me all articles of food that are suitable for
      supper.

Univ. "articles of food"; a = agreeing with me; b = allowed by my
doctor; c = suitable for supper; d = very rich; e = wedding-cake.

=28.=

(1) No discussions in our Debating-Club are likely to rouse the British
      Lion, so long as they are checked when they become too noisy;

(2) Discussions, unwisely conducted, endanger the peacefulness of our
      Debating-Club;

(3) Discussions, that go on while Tomkins is in the Chair, are likely to
      rouse the British Lion;

(4) Discussions in our Debating-Club, when wisely conducted, are always
      checked when they become too noisy.

Univ. "discussions in our Debating-Club"; a = checked when too noisy;
b = dangerous to the peacefulness of our Debating-Club; c = going on
while Tomkins is in the chair; d = likely to rouse the British Lion;
e = wisely conducted.
                                                                   pg117
=29.=

(1) All my sons are slim;

(2) No child of mine is healthy who takes no exercise;

(3) All gluttons, who are children of mine, are fat;

(4) No daughter of mine takes any exercise.

Univ. "my children"; a = fat; b = gluttons; c = healthy; d = sons;
e = taking exercise.

=30.=

(1) Things sold in the street are of no great value;

(2) Nothing but rubbish can be had for a song;

(3) Eggs of the Great Auk are very valuable;

(4) It is only what is sold in the street that is really _rubbish_.

Univ. "things"; a = able to be had for a song; b = eggs of the Great
Auk; c = rubbish; d = sold in the street; e = very valuable.

=31.=

(1) No books sold here have gilt edges, except what are in the front
      shop;

(2) All the _authorised_ editions have red labels;

(3) All the books with red labels are priced at 5s. and upwards;

(4) None but _authorised_ editions are ever placed in the front shop.

Univ. "books sold here"; a = authorised editions; b = gilt-edged;
c = having red labels; d = in the front shop; e = priced at 5s. and
upwards.

=32.=

(1) Remedies for bleeding, which fail to check it, are a mockery;

(2) Tincture of Calendula is not to be despised;

(3) Remedies, which will check the bleeding when you cut your finger,
      are useful;

(4) All mock remedies for bleeding are despicable.

Univ. "remedies for bleeding"; a = able to check bleeding;
b = despicable; c = mockeries; d = Tincture of Calendula; e = useful
when you cut your finger.

=33.=

(1) None of the unnoticed things, met with at sea, are mermaids;

(2) Things entered in the log, as met with at sea, are sure to be worth
      remembering;

(3) I have never met with anything worth remembering, when on a voyage;

(4) Things met with at sea, that are noticed, are sure to be recorded in
      the log;

Univ. "things met with at sea"; a = entered in log; b = mermaids;
c = met with by me; d = noticed; e = worth remembering.
                                                                   pg118
=34.=

(1) The only books in this library, that I do _not_ recommend for
      reading, are unhealthy in tone;

(2) The bound books are all well-written;

(3) All the romances are healthy in tone;

(4) I do not recommend you to read any of the unbound books.

Univ. "books in this library"; a = bound; b = healthy in tone;
c = recommended by me; d = romances; e = well-written.

=35.=

(1) No birds, except ostriches, are 9 feet high;

(2) There are no birds in this aviary that belong to any one but _me_;

(3) No ostrich lives on mince-pies;

(4) I have no birds less than 9 feet high.

Univ. "birds"; a = in this aviary; b = living on mince-pies; c = my;
d = 9 feet high; e = ostriches.

=36.=

(1) A plum-pudding, that is not really solid, is mere porridge;

(2) Every plum-pudding, served at my table, has been boiled in a cloth;

(3) A plum-pudding that is mere porridge is indistinguishable from soup;

(4) No plum-puddings are really solid, except what are served at _my_
      table.

Univ. "plum-puddings"; a = boiled in a cloth; b = distinguishable from
soup; c = mere porridge; d = really solid; e = served at my table.

=37.=

(1) No interesting poems are unpopular among people of real taste;

(2) No modern poetry is free from affectation;

(3) All _your_ poems are on the subject of soap-bubbles;

(4) No affected poetry is popular among people of real taste;

(5) No ancient poem is on the subject of soap-bubbles.

Univ. "poems"; a = affected; b = ancient; c = interesting; d = on the
subject of soap-bubbles; e = popular among people of real taste;
h = written by you.

=38.=

(1) All the fruit at this Show, that fails to get a prize, is the
      property of the Committee;

(2) None of my peaches have got prizes;

(3) None of the fruit, sold off in the evening, is unripe;

(4) None of the ripe fruit has been grown in a hot-house;

(5) All fruit, that belongs to the Committee, is sold off in the
      evening.

Univ. "fruit at this Show"; a = belonging to the Committee; b = getting
prizes; c = grown in a hot-house; d = my peaches; e = ripe; h = sold off
in the evening.
                                                                   pg119
=39.=

(1) Promise-breakers are untrustworthy;

(2) Wine-drinkers are very communicative;

(3) A man who keeps his promises is honest;

(4) No teetotalers are pawnbrokers;

(5) One can always trust a very communicative person.

Univ. "persons"; a = honest; b = pawnbrokers; c = promise-breakers;
d = trustworthy; e = very communicative; h = wine-drinkers.

=40.=

(1) No kitten, that loves fish, is unteachable;

(2) No kitten without a tail will play with a gorilla;

(3) Kittens with whiskers always love fish;

(4) No teachable kitten has green eyes;

(5) No kittens have tails unless they have whiskers.

Univ. "kittens"; a = green-eyed; b = loving fish; c = tailed;
d = teachable; e = whiskered; h = willing to play with a gorilla.


=41.=

(1) All the Eton men in this College play cricket;

(2) None but the Scholars dine at the higher table;

(3) None of the cricketers row;

(4) _My_ friends in this College all come from Eton;

(5) All the Scholars are rowing-men.

Univ. "men in this College"; a = cricketers; b = dining at the higher
table; c = Etonians; d = my friends; e = rowing-men; h = Scholars.

=42.=

(1) There is no box of mine here that I dare open;

(2) My writing-desk is made of rose-wood;

(3) All my boxes are painted, except what are here;

(4) There is no box of mine that I dare not open, unless it is full of
      live scorpions;

(5) All my rose-wood boxes are unpainted.

Univ. "my boxes"; a = boxes that I dare open; b = full of live
scorpions; c = here; d = made of rose-wood; e = painted;
h = writing-desks.

=43.=

(1) Gentiles have no objection to pork;

(2) Nobody who admires pigsties ever reads Hogg's poems;

(3) No Mandarin knows Hebrew;

(4) Every one, who does not object to pork, admires pigsties;

(5) No Jew is ignorant of Hebrew.

Univ. "persons"; a = admiring pigsties; b = Jews; c = knowing Hebrew;
d = Mandarins; e = objecting to pork; h = reading Hogg's poems.
                                                                   pg120
=44.=

(1) All writers, who understand human nature, are clever;

(2) No one is a true poet unless he can stir the hearts of men;

(3) Shakespeare wrote "Hamlet";

(4) No writer, who does not understand human nature, can stir the hearts
      of men;

(5) None but a true poet could have written "Hamlet.";

Univ. "writers"; a = able to stir the hearts of men; b = clever;
c = Shakespeare; d = true poets; e = understanding human nature;
h = writer of 'Hamlet.'

=45.=

(1) I despise anything that cannot be used as a bridge;

(2) Everything, that is worth writing an ode to, would be a welcome gift
      to me;

(3) A rainbow will not bear the weight of a wheel-barrow;

(4) Whatever can be used as a bridge will bear the weight of a
      wheel-barrow;

(5) I would not take, as a gift, a thing that I despise.

Univ. "things"; a = able to bear the weight of a wheel-barrow;
b = acceptable to me; c = despised by me; d = rainbows; e = useful as a
bridge; h = worth writing an ode to.

=46.=

(1) When I work a Logic-example without grumbling, you may be sure
      it is one that I can understand;

(2) These Soriteses are not arranged in regular order, like the examples
      I am used to;

(3) No easy example ever make my head ache;

(4) I ca'n't understand examples that are not arranged in regular order,
      like those I am used to;

(5) I never grumble at an example, unless it gives me a headache.

Univ. "Logic-examples worked by me"; a = arranged in regular order, like
the examples I am used to; b = easy; c = grumbled at by me; d = making
my head ache; e = these Soriteses; h = understood by me.

=47.=

(1) Every idea of mine, that cannot be expressed as a Syllogism, is
      really ridiculous;

(2) None of my ideas about Bath-buns are worth writing down;

(3) No idea of mine, that fails to come true, can be expressed as a
      Syllogism;

(4) I never have any really ridiculous idea, that I do not at once refer
      to my solicitor;

(5) My dreams are all about Bath-buns;

(6) I never refer any idea of mine to my solicitor, unless it is worth
      writing down.

Univ. "my ideas"; a = able to be expressed as a Syllogism; b = about
Bath-buns; c = coming true; d = dreams; e = really ridiculous
h = referred to my solicitor; k = worth writing down.
                                                                   pg121
=48.=

(1) None of the pictures here, except the battle-pieces, are valuable;

(2) None of the unframed ones are varnished;

(3) All the battle-pieces are painted in oils;

(4) All those that have been sold are valuable;

(5) All the English ones are varnished;

(6) All those in frames have been sold.

Univ. "the pictures here"; a = battle-pieces; b = English; c = framed;
d = oil-paintings; e = sold; h = valuable; k = varnished.

=49.=

(1) Animals, that do not kick, are always unexcitable;

(2) Donkeys have no horns;

(3) A buffalo can always toss one over a gate;

(4) No animals that kick are easy to swallow;

(5) No hornless animal can toss one over a gate;

(6) All animals are excitable, except buffaloes.

Univ. "animals"; a = able to toss one over a gate; b = buffaloes;
c = donkeys; d = easy to swallow; e = excitable; h = horned;
k = kicking.

=50.=

(1) No one, who is going to a party, ever fails to brush his hair;

(2) No one looks fascinating, if he is untidy;

(3) Opium-eaters have no self-command;

(4) Every one, who has brushed his hair, looks fascinating;

(5) No one wears white kid gloves, unless he is going to a party;

(6) A man is always untidy, if he has no self-command.

Univ. "persons"; a = going to a party; b = having brushed one's hair;
c = having self-command; d = looking fascinating; e = opium-eaters;
h = tidy; k = wearing white kid gloves.

=51.=

(1) No husband, who is always giving his wife new dresses, can be a
      cross-grained man;

(2) A methodical husband always comes home for his tea;

(3) No one, who hangs up his hat on the gas-jet, can be a man that is
      kept in proper order by his wife;

(4) A good husband is always giving his wife new dresses;

(5) No husband can fail to be cross-grained, if his wife does not keep
      him in proper order;

(6) An unmethodical husband always hangs up his hat on the gas-jet.

Univ. "husbands"; a = always coming home for his tea; b = always giving
his wife new dresses; c = cross-grained; d = good; e = hanging up his
hat on the gas-jet; h = kept in proper order; k = methodical.
                                                                   pg122
=52.=

(1) Everything, not absolutely ugly, may be kept in a drawing-room;

(2) Nothing, that is encrusted with salt, is ever quite dry;

(3) Nothing should be kept in a drawing-room, unless it is free from
      damp;

(4) Bathing-machines are always kept near the sea;

(5) Nothing, that is made of mother-of-pearl, can be absolutely ugly;

(6) Whatever is kept near the sea gets encrusted with salt.

Univ. "things"; a = absolutely ugly; b = bathing-machines; c = encrusted
with salt; d = kept near the sea; e = made of mother-of-pearl; h = quite
dry; k = things that may be kept in a drawing-room.

=53.=

(1) I call no day "unlucky," when Robinson is civil to me;

(2) Wednesdays are always cloudy;

(3) When people take umbrellas, the day never turns out fine;

(4) The only days when Robinson is uncivil to me are Wednesdays;

(5) Everybody takes his umbrella with him when it is raining;

(6) My "lucky" days always turn out fine.

Univ. "days"; a = called by me 'lucky'; b = cloudy; c = days when people
take umbrellas; d = days when Robinson is civil to me; e = rainy;
h = turning out fine; k = Wednesdays.

=54.=

(1) No shark ever doubts that it is well fitted out;

(2) A fish, that cannot dance a minuet, is contemptible;

(3) No fish is quite certain that it is well fitted out, unless it has
      three rows of teeth;

(4) All fishes, except sharks, are kind to children;

(5) No heavy fish can dance a minuet;

(6) A fish with three rows of teeth is not to be despised.

Univ. "fishes"; a = able to dance a minuet; b = certain that he is well
fitted out; c = contemptible; d = having 3 rows of teeth; e = heavy;
h = kind to children; k = sharks.

=55.=

(1) All the human race, except my footmen, have a certain amount of
      common-sense;

(2) No one, who lives on barley-sugar, can be anything but a mere baby;

(3) None but a hop-scotch player knows what real happiness is;

(4) No mere baby has a grain of common sense;

(5) No engine-driver ever plays hop-scotch;

(6) No footman of mine is ignorant of what true happiness is.

Univ. "human beings"; a = engine-drivers; b = having common sense;
c = hop-scotch players; d = knowing what real happiness is; e = living
on barley-sugar; h = mere babies; k = my footmen.
                                                                   pg123
=56.=

(1) I trust every animal that belongs to me;

(2) Dogs gnaw bones;

(3) I admit no animals into my study, unless they will beg when told to
      do so;

(4) All the animals in the yard are mine;

(5) I admit every animal, that I trust, into my study;

(6) The only animals, that are really willing to beg when told to do so,
      are dogs.

Univ. "animals"; a = admitted to my study; b = animals that I trust;
c = dogs; d = gnawing bones; e = in the yard; h = my; k = willing to beg
when told.

=57.=

(1) Animals are always mortally offended if I fail to notice them;

(2) The only animals that belong to _me_ are in that field;

(3) No animal can guess a conundrum, unless it has been properly trained
      in a Board-School;

(4) None of the animals in that field are badgers;

(5) When an animal is mortally offended, it always rushes about wildly
      and howls;

(6) I never notice any animal, unless it belongs to me;

(7) No animal, that has been properly trained in a Board-School, ever
      rushes about wildly and howls.

Univ. "animals"; a = able to guess a conundrum; b = badgers; c = in that
field; d = mortally offended; e = my; h = noticed by me; k = properly
trained in a Board-School; l = rushing about wildly and howling.

=58.=

(1) I never put a cheque, received by me, on that file, unless I am
      anxious about it;

(2) All the cheques received by me, that are not marked with a cross,
      are payable to bearer;

(3) None of them are ever brought back to me, unless they have been
      dishonoured at the Bank;

(4) All of them, that are marked with a cross, are for amounts of over
      £100;

(5) All of them, that are not on that file, are marked "not negotiable";

(6) No cheque of yours, received by me, has ever been dishonoured;

(7) I am never anxious about a cheque, received by me, unless it should
      happen to be brought back to me;

(8) None of the cheques received by me, that are marked "not
      negotiable," are for amounts of over £100.

Univ. "cheques received by me"; a = brought back to me; b = cheques that
I am anxious about; c = honoured; d = marked with a cross; e = marked
'not negotiable'; h = on that file; k = over £100; l = payable to
bearer; m = your.
                                                                   pg124
=59.=

(1) All the dated letters in this room are written on blue paper;

(2) None of them are in black ink, except those that are written in the
      third person;

(3) I have not filed any of them that I can read;

(4) None of them, that are written on one sheet, are undated;

(5) All of them, that are not crossed, are in black ink;

(6) All of them, written by Brown, begin with "Dear Sir";

(7) All of them, written on blue paper, are filed;

(8) None of them, written on more than one sheet, are crossed;

(9) None of them, that begin with "Dear Sir," are written in the
      third person.

Univ. "letters in this room"; a = beginning with "Dear Sir";
b = crossed; c = dated; d = filed; e = in black ink; h = in third
person; k = letters that I can read; l = on blue paper; m = on one
sheet; n = written by Brown.

=60.=

 (1) The only animals in this house are cats;

 (2) Every animal is suitable for a pet, that loves to gaze at the moon;

 (3) When I detest an animal, I avoid it;

 (4) No animals are carnivorous, unless they prowl at night;

 (5) No cats fails to kill mice;

 (6) No animals ever take to me, except what are in this house;

 (7) Kangaroos are not suitable for pets;

 (8) None but carnivora kill mice;

 (9) I detest animals that do not take to me;

(10) Animals, that prowl at night, always love to gaze at the moon.

Univ. "animals"; a = avoided by me; b = carnivora; c = cats;
d = detested by me; e = in this house; h = kangaroos; k = killing mice;
l = loving to gaze at the moon; m = prowling at night; n = suitable for
pets; r = taking to me.

                                                                   pg125

CHAPTER II.

_ANSWERS._


_Answers to § 1._                                                  AN1

 1. "All"                                            _Sign of Quantity._
    "persons represented by the Name 'I'" (or "I's") _Subject._
    "are"                                            _Copula._
    "persons who have been out for a walk"           _Predicate._

 or, more briefly,

    "All | 'I's | are | persons who have been out for a walk".

 2. "All | 'I's | are | persons who feel better".

 3. "No | persons who are not 'John' | are | persons who have read the
    letter".

 4. "No | Members of the Class 'you and I' | are | old persons".

 5. "No | fat creatures | are | creatures that run well".

 6. "No | not-brave persons | are | persons deserving of the fair".

 7. "No | not-pale persons | are | persons who look poetical".

 8. "Some | judges | are | persons who lose their tempers".

 9. "All | 'I's | are | persons who do not neglect important business".

10. "All | difficult things | are | things that need attention".

11. "All | unwholesome things | are | things that should be avoided".

12. "All | laws passed last week | are | laws relating to excise".

13. "All | logical studies | are | things that puzzle me".

14. "No | persons in the house | are | Jews".

15. "Some | not well-cooked dishes | are | unwholesome dishes".

16. "All | unexciting books | are | books that make one drowsy".

17. "All | men who know what they're about | are | men who can detect
    a sharper".

18. "All | Members of the Class 'you and I' | are | persons who know
    what they're about".

19. "Some | bald persons | are | persons accustomed to wear wigs".

20. "All | fully occupied persons | are | persons who do not talk about
    their grievances".

21. "No | riddles that can be solved | are | riddles that interest me".

                                                                   pg126
_Answers to § 2._                                                  AN2

        1
·---------------·
|(O)    |       |
|   ·---|---·   |
|   |(O)|(O)|   |
|---|---|---|---|
|   |   |   |   |
|   ·---|---·   |
|(O)    |       |
·---------------·

        2
·---------------·
|(I)    |    (O)|
|   ·---|---·   |
|   |   |   |   |
|---|---|---|---|
|   |   |   |   |
|   ·---|---·   |
|(O)    |    (O)|
·---------------·

        3
·---------------·
|       |       |
|   ·---|---·   |
|   |(O)|   |   |
|---|---|---|---|
|   |(O)|(I)|   |
|   ·---|---·   |
|       |       |
·---------------·

        4
·---------------·
|(O)    |       |
|   ·---|---·   |
|   |  (I)  |   |
|---|---|---|(I)|
|   |(O)|(O)|   |
|   ·---|---·   |
|(O)    |       |
·---------------·

        5
·---------------·
|(O)    |    (I)|
|   ·---|---·   |
|   |   |   |   |
|---|---|---|---|
|   |   |   |   |
|   ·---|---·   |
|(O)    |    (O)|
·---------------·

        6
·---------------·
|       |       |
|   ·---|---·   |
|   |   |(O)|   |
|---|---|---|---|
|   |(O)|(O)|   |
|   ·---|---·   |
|      (I)      |
·---------------·

        7
·---------------·
|(O)    |    (O)|
|   ·---|---·   |
|   |(I)|(O)|   |
|---|---|---|---|
|   |   |(O)|   |
|   ·---|---·   |
|       |    (I)|
·---------------·

        8
·---------------·
|       |       |
|   ·---|---·   |
|   |(O)|   |   |
|---|---|---|---|
|   |(O)|   |   |
|   ·---|---·   |
|      (I)      |
·---------------·

        9
·---------------·
|       |       |
|   ·---|---·   |
|   |(O)|(O)|   |
|---|---|---|---|
|   |(O)|(I)|   |
|   ·---|---·   |
|       |       |
·---------------·

       10
·---------------·
|(O)    |       |
|   ·---|---·   |
|   |   |   |   |
|---|---|---|---|
|   |(O)|(O)|   |
|   ·---|---·   |
|(O)    |       |
·---------------·

       11
·---------------·
|       |       |
|   ·---|---·   |
|   |(O)|   |   |
|---|---|---|---|
|   |(O)|   |   |
|   ·---|---·   |
|(O)    |    (O)|
·---------------·

       12
·---------------·
|       |    (O)|
|   ·---|---·   |
|   |  (I)  |   |
|---|---|(I)|---|
|   |   |   |   |
|   ·---|---·   |
|       |    (O)|
·---------------·

       13
·---------------·
|       |       |
|   ·---|---·   |
|   |   |(O)|   |
|---|---|---|---|
|   |(I)|(O)|   |
|   ·---|---·   |
|(O)    |    (O)|
·---------------·

       14
·---------------·
|      (I)      |
|   ·---|---·   |
|   |   |(O)|   |
|---|(I)|---|---|
|   |   |(O)|   |
|   ·---|---·   |
|       |       |
·---------------·

       15
·---------------·
|(O)    |       |
|   ·---|---·   |
|   |   |   |   |
|---|(I)|---|---|
|   |   |   |   |
|   ·---|---·   |
|(O)    |    (O)|
·---------------·

       16
·---------------·
|      (I)      |
|   ·---|---·   |
|   |(O)|(O)|   |
|---|---|---|---|
|   |(O)|   |   |
|   ·---|---·   |
|       |       |
·---------------·

       17
·---------------·
|(I)    |    (O)|
|   ·---|---·   |
|   |   |   |   |
|---|---|---|---|
|   |   |   |   |
|   ·---|---·   |
|       |    (O)|
·---------------·

       18
·---------------·
|      (I)      |
|   ·---|---·   |
|   |(O)|(O)|   |
|---|---|---|(I)|
|   |   |   |   |
|   ·---|---·   |
|       |       |
·---------------·

       19
·---------------·
|       |       |
|   ·---|---·   |
|   |   |(I)|   |
|---|---|---|---|
|   |(O)|(O)|   |
|   ·---|---·   |
|       |       |
·---------------·

       20
·---------------·
|       |       |
|   ·---|---·   |
|   |(I)|   |   |
|---|---|---|---|
|   |(O)|(O)|   |
|   ·---|---·   |
|       |       |
·---------------·

       21
·---------------·
|       |    (O)|
|   ·---|---·   |
|   |   |   |   |
|---|---|(I)|---|
|   |   |   |   |
|   ·---|---·   |
|(I)    |    (O)|
·---------------·

       22
·---------------·
|       |       |
|   ·---|---·   |
|   |(O)|(O)|   |
|---|---|---|---|
|   |(I)|   |   |
|   ·---|---·   |
|       |       |
·---------------·

       23
·---------------·
|(O)    |    (O)|
|   ·---|---·   |
|   |(O)|   |   |
|---|---|---|---|
|   |(O)|   |   |
|   ·---|---·   |
|(I)    |       |
·---------------·

       24
·---------------·
|       |    (O)|
|   ·---|---·   |
|   |  (I)  |   |
|---|---|---|---|
|   |(O)|(O)|   |
|   ·---|---·   |
|       |    (O)|
·---------------·
                                                                   pg127
       25
·---------------·
|       |       |
|   ·---|---·   |
|   |(I)|(O)|   |
|---|---|---|---|
|   |   |(O)|   |
|   ·---|---·   |
|       |       |
·---------------·

       26
·---------------·
|(O)    |    (O)|
|   ·---|---·   |
|   |   |   |   |
|---|---|---|---|
|   |   |   |   |
|   ·---|---·   |
|(I)    |       |
·---------------·

       27
·---------------·
|       |    (O)|
|   ·---|---·   |
|   |   |   |   |
|---|---|---|---|
|   |  (I)  |   |
|   ·---|---·   |
|       |    (O)|
·---------------·

       28
·---------------·
|(O)    |    (O)|
|   ·---|---·   |
|   |(O)|   |   |
|---|---|(I)|---|
|   |(O)|   |   |
|   ·---|---·   |
|       |       |
·---------------·

       29
·---------------·
|       |       |
|   ·---|---·   |
|   |   |(O)|   |
|---|---|---|---|
|   |(O)|(O)|   |
|   ·---|---·   |
|       |       |
·---------------·

       30
·---------------·
|       |       |
|   ·---|---·   |
|   |(O)|(O)|   |
|---|---|---|(I)|
|   |   |   |   |
|   ·---|---·   |
|       |       |
·---------------·

       31
·---------------·
|(I)    |    (O)|
|   ·---|---·   |
|   |   |   |   |
|---|---|(I)|---|
|   |   |   |   |
|   ·---|---·   |
|       |    (O)|
·---------------·

       32
·---------------·
|(O)    |    (I)|
|   ·---|---·   |
|   |(O)|(O)|   |
|---|---|---|---|
|   |(I)|   |   |
|   ·---|---·   |
|(O)    |       |
·---------------·


_Answers to § 3._                                                  AN3

 1. Some xy exist, or some x are y, or some y are x.

 2. No information.

 3. All y' are x'.

 4. No xy exist, &c.

 5. All y' are x.

 6. All x' are y.

 7. All x are y.

 8. All x' are y', and all y are x.

 9. All x' are y'.

10. All x are y'.

11. No information.

12. Some x'y' exist, &c.

13. Some xy' exist, &c.

14. No xy' exist, &c.

15. Some xy exist, &c.

16. All y are x.

17. All x' are y, and all y' are x.

18. All x are y', and all y are x'.

19. All x are y, and all y' are x'.

20. All y are x'.


_Answers to § 4._                                                  AN4

 1. No x' are y'.

 2. Some x' are y'.

 3. Some x are y'.

 4. [No Concl. Fallacy of Like Eliminands not asserted to exist.]

 5. Some x' are y'.

 6. [No Concl. Fallacy of Like Eliminands not asserted to exist.]

 7. Some x are y'.

 8. Some x' are y'.

 9. [No Concl. Fallacy of Unlike Eliminands with an Entity-Premiss.]

10. All x are y, and all y' are x'.

11. [No Concl. Fallacy of Like Eliminands not asserted to exist.]

12. All y are x'.

13. No x' are y.

14. No x' are y'.

15. No x are y.

16. All x are y', and all y are x'.
                                                                   pg128
17. No x are y'.

18. No x are y.

19. Some x are y'.

20. No x are y'.

21. Some y are x'.

22. [No Concl. Fallacy of Unlike Eliminands with an Entity-Premiss.]

23. Some x are y.

24. All y are x'.

25. Some y are x'.

26. All y are x.

27. All x are y, and all y' are x'.

28. Some y are x'.

29. [No Concl. Fallacy of Like Eliminands not asserted to exist.]

30. Some y are x'.

31. [No Concl. Fallacy of Like Eliminands not asserted to exist.]

32. No x are y'.

33. [No Concl. Fallacy of Like Eliminands not asserted to exist.]

34. Some x are y.

35. All y are x'.

36. Some y are x'.

37. Some x are y'.

38. No x are y.

39. Some x' are y'.

40. All y' are x.

41. All x are y'.

42. No x are y.


_Answers to § 5._                                                  AN5

  1. Somebody who has been out for a walk is feeling better.

  2. No one but John knows what the letter is about.

  3. You and I like walking.

  4. Honesty is sometimes the best policy.

  5. Some greyhounds are not fat.

  6. Some brave persons get their deserts.

  7. Some rich persons are not Esquimaux.

  8. [No Concl. Fallacy of Unlike Eliminands with an Entity-Premiss.]

  9. John is ill.

 10. Some things, that are not umbrellas, should be left behind on a
     journey.

 11. No music is worth paying for, unless it causes vibration in the
     air.

 12. Some holidays are tiresome.

 13. Englishmen are not Frenchmen.

 14. No photograph of a lady is satisfactory.

 15. No one looks poetical unless he is phlegmatic.

 16. Some thin persons are not cheerful.

 17. Some judges do not exercise self-control.

 18. Pigs are not fed on barley-water.

 19. Some black rabbits are not old.
                                                                   pg129
 20. [No Concl. Fallacy of Unlike Eliminands with an Entity-Premiss.]

 21. [No Concl. Fallacy of Like Eliminands not asserted to exist.]

 22. Some lessons need attention.

 23. [No Concl. Fallacy of Like Eliminands not asserted to exist.]

 24. No one, who forgets a promise, fails to do mischief.

 25. Some greedy creatures cannot fly.

 26. [No Concl. Fallacy of Unlike Eliminands with an Entity-Premiss.]

 27. No bride-cakes are things that need not be avoided.

 28. John is happy.

 29. Some people, who are not gamblers, are not philosophers.

 30. [No Concl. Fallacy of Unlike Eliminands with an Entity-Premiss.]

 31. None of my lodgers write poetry.

 32. Senna is not nice.

 33. [No Concl. Fallacy of Unlike Eliminands with an Entity-Premiss.]

 34. [No Concl. Fallacy of Like Eliminands not asserted to exist.]

 35. Logic is unintelligible.

 36. Some wild creatures are fat.

 37. All wasps are unwelcome.

 38. All black rabbits are young.

 39. Some hard-boiled things can be cracked.

 40. No antelopes fail to delight the eye.

 41. All well-fed canaries are cheerful.

 42. Some poetry is not producible at will.

 43. No country infested by dragons fails to be fascinating.

 44. [No Concl. Fallacy of Like Eliminands not asserted to exist.]

 45. Some picturesque things are not made of sugar.

 46. No children can sit still.

 47. Some cats cannot whistle.

 48. You are terrible.

 49. Some oysters are not amusing.

 50. Nobody in the house has a beard a yard long.

 51. Some ill-fed canaries are unhappy.

 52. My sisters cannot sing.

 53. [No Concl. Fallacy of Unlike Eliminands with an Entity-Premiss.]

 54. Some rich things are nice.

 55. My cousins are none of them judges, and judges are none of them
     cousins of mine.

 56. Something wearisome is not eagerly wished for.

 57. Senna is nasty.

 58. [No Concl. Fallacy of Unlike Eliminands with an Entity-Premiss.]

 59. Niggers are not any of them tall.

 60. Some obstinate persons are not philosophers.

 61. John is happy.

 62. Some unwholesome dishes are not present here (i.e. cannot be
     spoken of as "these").

 63. No books suit feverish patients unless they make one drowsy.

 64. Some greedy creatures cannot fly.

 65. You and I can detect a sharper.

 66. Some dreams are not lambs.
                                                                   pg130
 67. No lizard needs a hairbrush.

 68. Some things, that may escape notice, are not battles.

 69. My cousins are not any of them judges.

 70. Some hard-boiled things can be cracked.

 71. [No Concl. Fallacy of Unlike Eliminands with an Entity-Premiss.]

 72. She is unpopular.

 73. Some people, who wear wigs, are not children of yours.

 74. No lobsters expect impossibilities.

 75. No nightmare is eagerly desired.

 76. Some nice things are not plumcakes.

 77. Some kinds of jam need not be shunned.

 78. All ducks are ungraceful.

 79. [No Concl. Fallacy of Like Eliminands not asserted to exist.]

 80. No man, who begs in the street, should fail to keep accounts.

 81. Some savage creatures are not spiders.

 82. [No Concl. Fallacy of Unlike Eliminands with an Entity-Premiss.]

 83. No travelers, who do not carry plenty of small change, fail to lose
     their luggage.

 84. [No Concl. Fallacy of Unlike Eliminands with an Entity-Premiss.]

 85. Judges are none of them cousins of mine.

 86. All my lodgers are sane.

 87. Those who are busy are contented, and discontented people are not
     busy.

 88. None of my cousins are judges.

 89. No nightingale dislikes sugar.

 90. [No Concl. Fallacy of Like Eliminands not asserted to exist.]

 91. Some excuses are not clear explanations.

 92. [No Concl. Fallacy of Like Eliminands not asserted to exist.]

 93. No kind deed need cause scruple.

 94. [No Concl. Fallacy of Like Eliminands not asserted to exist.]

 95. [No Concl. Fallacy of Like Eliminands not asserted to exist.]

 96. No cheats are trustworthy.

 97. No clever child of mine is greedy.

 98. Some things, that are meant to amuse, are not Acts of Parliament.

 99. No tour, that is ever forgotten, is worth writing a book about.

100. No obedient child of mine is contented.

101. Your visit does not annoy me.


_Answers to § 6._                                                  AN6

 1. Conclusion right.

 2. No Concl. Fallacy of Like Eliminands not asserted to exist.

 3. Concl. right.

 4. Concl. right.

 5. Concl. right.

 6. No Concl. Fallacy of Like Eliminands not asserted to exist.

 7. No Concl. Fallacy of Unlike Eliminands with an Entity-Premiss.

 8. Concl. right.

 9. Concl. right.

10. Concl. right.

11. Concl. right.

12. Concl. right.

13. Concl. right.

14. Concl. right.

15. Concl. right.
                                                                   pg131
16. No Concl. Fallacy of Like Eliminands not asserted to exist.

17. Concl. right.

18. Concl. right.

19. Concl. right.

20. Concl. right.

21. Concl. right.

22. Concl. wrong: the right one is "Some x are y."

23. Concl. right.

24. Concl. right.

25. Concl. right.

26. Concl. right.

27. Concl. right.

28. No Concl. Fallacy of Like Eliminands not asserted to exist.

29. Concl. right.

30. Concl. right.

31. Concl. right.

32. Concl. right.

33. Concl. right.

34. No Concl. Fallacy of Unlike Eliminands with an Entity-Premiss.

35. Concl. right.

36. Concl. right.

37. Concl. right.

38. No Concl. Fallacy of Like Eliminands not asserted to exist.

39. Concl. right.

40. Concl. right.


_Answers to § 7._                                                  AN7

 1. Concl. right.

 2. Concl. right.

 3. Concl. right.

 4. Concl. wrong: right one is "Some epicures are not uncles of mine."

 5. Concl. right.

 6. No Concl. Fallacy of Unlike Eliminands with an Entity-Premiss.

 7. Concl. wrong: right one is "The publication, in which I saw it,
    tells lies."

 8. No Concl. Fallacy of Unlike Eliminands with an Entity-Premiss.

 9. Concl. wrong: right one is "Some tedious songs are not his."

10. Concl. right.

11. No Concl. Fallacy of Unlike Eliminands with an Entity-Premiss.

12. Concl. wrong: right one is "Some fierce creatures do not drink
    coffee."

13. No Concl. Fallacy of Unlike Eliminands with an Entity-Premiss.

14. Concl. right.

15. Concl. wrong: right one is "Some shallow persons are not students."

16. No Concl. Fallacy of Like Eliminands not asserted to exist.

17. Concl. wrong: right one is "Some business, other than railways,
    is unprofitable."

18. Concl. wrong: right one is "Some vain persons are not Professors."

19. Concl. right.

20. Concl. wrong: right one is "Wasps are not puppies."

21. No Concl. Fallacy of Unlike Eliminands with an Entity-Premiss.

22. No Concl. Same Fallacy.

23. Concl. right.

24. Concl. wrong: right one is "Some chocolate-creams are delicious."

25. No Concl. Fallacy of Like Eliminands not asserted to exist.

26. No Concl. Fallacy of Unlike Eliminands with an Entity-Premiss.

27. Concl. wrong: right one is "Some pillows are not pokers."

28. Concl. right.

29. No Concl. Fallacy of Unlike Eliminands with an Entity-Premiss.

30. No Concl. Fallacy of Like Eliminands not asserted to exist.

31. Concl. right.

32. No Concl. Fallacy of Like Eliminands not asserted to exist.

33. No Concl. Fallacy of Unlike Eliminands with an Entity-Premiss.
                                                                   pg132
34. Concl. wrong: right one is "Some dreaded persons are not
    begged to prolong their visits."

35. Concl. wrong: right one is "No man walks on neither."

36. Concl. right.

37. No Concl. Fallacy of Unlike Eliminands with an Entity-Premiss.

38. Concl. wrong: right one is "Some persons, dreaded by children,
    are not emperors."

39. Concl. incomplete: the omitted portion is "Sugar is not salt."

40. Concl. right.


_Answers to § 8._                                                  AN8

 1. a_{1}b_{0} + b_{1}a_{0}.

 2. d_{1}a_{0}.

 3. ac_{0}.

 4. a_{1}d_{0}.

 5. cd_{0}.

 6. d_{1}c_{0}.

 7. a'c_{0}.

 8. c_{1}a'_{0}.

 9. c'd_{0}.

10. b_{1}a_{0}.

11. d_{1}b_{0}.

12. a'd_{0}.

13. e_{1}b_{0}.

14. d_{1}e'_{0}.

15. e_{1}a'_{0}.

16. b'c_{0}.

17. a_{1}b_{0}.

18. d_{1}c_{0}.

19. a_{1}d_{0}.

20. ac_{0}.

21. de_{0}.

22. a_{1}b'_{0}.

23. h_{1}c_{0}.

24. e_{1}a_{0}.

25. e_{1}c'_{0}.

26. e_{1}c'_{0}.

27. hk'_{0}.

28. e_{1}d'_{0}.

29. l'a_{0}.

30. k_{1}b'_{0}.


_Answers to § 9._                                                  AN9

 1. Babies cannot manage crocodiles.

 2. _Your_ presents to me are not made of tin.

 3. All my potatoes in this dish are old ones.

 4. My servants never say "shpoonj."

 5. My poultry are not officers.

 6. None of _your_ sons are fit to serve on a jury.

 7. No pencils of mine are sugar-plums.

 8. Jenkins is inexperienced.

 9. No comet has a curly tail.

10. No hedge-hog takes in the _Times_.

11. This dish is unwholesome.

12. My gardener is very old.

13. All humming-birds are small.

14. No one with a hooked nose ever fails to make money.

15. No gray ducks in this village wear lace collars.

16. No jug in this cupboard will hold water.

17. These apples were grown in the sun.

18. Puppies, that will not lie still, never care to do worsted work.

19. No name in this list is unmelodious.

20. No M.P. should ride in a donkey-race, unless he has perfect
    self-command.

21. No goods in this shop, that are still on sale, may be carried away.
                                                                   pg133
22. No acrobatic feat, which involves turning a quadruple somersault, is
    ever attempted in a circus.

23. Guinea-pigs never really appreciate Beethoven.

24. No scentless flowers please me.

25. Showy talkers are not really well-informed.

26. None but red-haired boys learn Greek in this school.

27. Wedding-cake always disagrees with me.

28. Discussions, that go on while Tomkins is in the chair, endanger the
    peacefulness of our Debating-Club.

29. All gluttons, who are children of mine, are unhealthy.

30. An egg of the Great Auk is not to be had for a song.

31. No books sold here have gilt edges, unless they are priced at 5s.
    and upwards.

32. When you cut your finger, you will find Tincture of Calendula
    useful.

33. _I_ have never come across a mermaid at sea.

34. All the romances in this library are well-written.

35. No bird in this aviary lives on mince-pies.

36. No plum-pudding, that has not been boiled in a cloth, can be
    distinguished from soup.

37. All _your_ poems are uninteresting.

38. None of my peaches have been grown in a hot-house.

39. No pawnbroker is dishonest.

40. No kitten with green eyes will play with a gorilla.

41. All _my_ friends dine at the lower table.

42. My writing-desk is full of live scorpions.

43. No Mandarin ever reads Hogg's poems.

44. Shakespeare was clever.

45. Rainbows are not worth writing odes to.

46. These Sorites-examples are difficult.

47. All my dreams come true.

48. All the English pictures here are painted in oils.

49. Donkeys are not easy to swallow.

50. Opium-eaters never wear white kid gloves.

51. A good husband always comes home for his tea.

52. Bathing-machines are never made of mother-of-pearl.

53. Rainy days are always cloudy.

54. No heavy fish is unkind to children.

55. No engine-driver lives on barley-sugar.

56. All the animals in the yard gnaw bones.

57. No badger can guess a conundrum.

58. No cheque of yours, received by me, is payable to order.

59. I cannot read any of Brown's letters.

60. I always avoid a kangaroo.

                                                                   pg134

CHAPTER III.

_SOLUTIONS._


§ 1.

_Propositions of Relation reduced to normal form._


_Solutions for § 1._                                               SL1

1. The Univ. is "persons." The Individual "I" may be regarded as a
Class, of persons, whose peculiar Attribute is "represented by the Name
'I'", and may be called the Class of "I's". It is evident that this
Class cannot possibly contain more than one Member: hence the Sign of
Quantity is "all". The verb "have been" may be replaced by the phrase
"are persons who have been". The Proposition may be written thus:--

"All"                                       _Sign of Quantity_.
"I's"                                       _Subject_.
"are"                                       _Copula_.
"persons who have been out for a walk"      _Predicate_.

or, more briefly,

    "All | I's | are | persons who have been out for a walk".

2. The Univ. and the Subject are the same as in Ex. 1. The Proposition
may be written

    "All | I's | are | persons who feel better".

3. Univ. is "persons". The Subject is evidently the Class of persons
from which John is _excluded_; _i.e._ it is the Class containing all
persons who are _not_ "John".

The Sign of Quantity is "no".

The verb "has read" may be replaced by the phrase "are persons who have
read".

The Proposition may be written

    "No | persons who are not 'John' | are | persons who have read the
    letter".

4. Univ. is "persons". The Subject is evidently the Class of persons
whose only two Members are "you and I".

Hence the Sign of Quantity is "no".

The Proposition may be written

    "No | Members of the Class 'you and I' | are | old persons".
                                                                   pg135
5. Univ. is "creatures". The verb "run well" may be replaced by the
phrase "are creatures that run well".

The Proposition may be written

    "No | fat creatures | are | creatures that run well".

6. Univ. is "persons". The Subject is evidently the Class of persons who
are _not_ brave.

The verb "deserve" may be replaced by the phrase "are deserving of".

The Proposition may be written

    "No | not-brave persons | are | persons deserving of the fair".

7. Univ. is "persons". The phrase "looks poetical" evidently belongs to
the _Predicate_; and the _Subject_ is the Class, of persons, whose
peculiar Attribute is "_not_-pale".

The Proposition may be written

    "No | not-pale persons | are | persons who look poetical".

8. Univ. is "persons".

The Proposition may be written

    "Some | judges | are | persons who lose their tempers".

9. Univ. is "persons". The phrase "never neglect" is merely a stronger
form of the phrase "am a person who does not neglect".

The Proposition may be written

    "All | 'I's' | are | persons who do not neglect important business".

10. Univ. is "things". The phrase "what is difficult" (_i.e._ "that
which is difficult") is equivalent to the phrase "all difficult things".

The Proposition may be written

    "All | difficult things | are | things that need attention".

11. Univ. is "things". The phrase "what is unwholesome" may be
interpreted as in Ex. 10.

The Proposition may be written

    "All | unwholesome things | are | things that should be avoided".

12. Univ. is "laws". The Predicate is evidently a Class whose peculiar
Attribute is "relating to excise".

The Proposition may be written

    "All | laws passed last week | are | laws relating to excise".

13. Univ. is "things". The Subject is evidently the Class, of studies,
whose peculiar Attribute is "logical"; hence the Sign of Quantity is
"all".

The Proposition may be written

    "All | logical studies | are | things that puzzle me".

14. Univ. is "persons". The Subject is evidently "persons in the house".

The Proposition may be written

    "No | persons in the house | are | Jews".

15. Univ. is "dishes". The phrase "if not well-cooked" is equivalent to
the Attribute "not well-cooked".

The Proposition may be written

    "Some | not well-cooked dishes | are | unwholesome dishes".
                                                                   pg136
16. Univ. is "books". The phrase "make one drowsy" may be replaced by
the phrase "are books that make one drowsy".

The Sign of Quantity is evidently "all".

The Proposition may be written

    "All | unexciting books | are | books that make one drowsy".

17. Univ. is "men". The Subject is evidently "a man who knows what he's
about"; and the word "when" shows that the Proposition is asserted of
_every_ such man, _i.e._ of _all_ such men. The verb "can" may be
replaced by "are men who can".

The Proposition may be written

    "All | men who know what they're about | are | men who can detect a
    sharper".

18. The Univ. and the Subject are the same as in Ex. 4.

The Proposition may be written

    "All | Members of the Class 'you and I' | are | persons who know
    what they're about".

19. Univ. is "persons". The verb "wear" may be replaced by the phrase
"are accustomed to wear".

The Proposition may be written

    "Some | bald persons | are | persons accustomed to wear wigs".

20. Univ. is "persons". The phrase "never talk" is merely a stronger
form of "are persons who do not talk".

The Proposition may be written

    "All | fully occupied persons | are | persons who do not talk about
    their grievances".

21. Univ. is "riddles". The phrase "if they can be solved" is equivalent
to the Attribute "that can be solved".

The Proposition may be written

    "No | riddles that can be solved | are | riddles that interest me".


§ 2.

_Method of Diagrams._


_Solutions for § 4, Nos. 1-12._                                    SL4-A

                    ·---------------·  ·-------·
 1. No m are x';    |       |    (O)|  |   |   |
    All m' are y.   |   ·---|---·   |  |---|---|
                    |   |   |   |   |  |   |(O)|
                    |(I)|---|---|---|  ·-------·
                    |   |(O)|(O)|   |
                    |   ·---|---·   |  .'. No x' are y'.
                    |       |    (O)|
                    ·---------------·
                                                                   pg137
                    ·---------------·  ·-------·
 2. No m' are x;    |(O)    |    (O)|  |   |   |
    Some m' are y'. |   ·---|---·   |  |---|---|
                    |   |   |   |   |  |   |(I)|
                    |---|---|---|---|  ·-------·
                    |   |   |   |   |
                    |   ·---|---·   |  .'. Some x are y'.
                    |       |    (I)|
                    ·---------------·

                    ·---------------·  ·-------·
 3. All m' are x;   |(O)    |    (I)|  |   |(I)|
    All m' are y'.  |   ·---|---·   |  |---|---|
                    |   |   |   |   |  |   |   |
                    |---|---|---|---|  ·-------·
                    |   |   |   |   |
                    |   ·---|---·   |  .'. Some x are y'.
                    |(O)    |    (O)|
                    ·---------------·

                    ·---------------·
 4. No x' are m';   |       |    (O)|
    All y' are m.   |   ·---|---·   |
                    |   |   |   |   |
                    |---|---|(I)|---|  There is no Conclusion.
                    |   |   |   |   |
                    |   ·---|---·   |
                    |(O)    |    (O)|
                    ·---------------·

                    ·---------------·  ·-------·
 5. Some m are x';  |       |       |  |   |   |
    No y are m.     |   ·---|---·   |  |---|---|
                    |   |(O)|   |   |  |   |(I)|
                    |---|---|---|---|  ·-------·
                    |   |(O)|(I)|   |
                    |   ·---|---·   |  .'. Some x' are y'.
                    |       |       |
                    ·---------------·

                    ·---------------·
 6. No x' are m;    |       |       |
    No m are y.     |   ·---|---·   |
                    |   |(O)|   |   |
                    |---|---|---|---|  There is no Conclusion.
                    |   |(O)|(O)|   |
                    |   ·---|---·   |
                    |       |       |
                    ·---------------·

                    ·---------------·  ·-------·
 7. No m are x';    |       |       |  |   |(I)|
    Some y' are m.  |   ·---|---·   |  |---|---|
                    |   |   |(I)|   |  |   |   |
                    |---|---|---|---|  ·-------·
                    |   |(O)|(O)|   |
                    |   ·---|---·   |  .'. Some x are y'.
                    |       |       |
                    ·---------------·

                    ·---------------·  ·-------·
 8. All m' are x';  |(O)    |    (O)|  |   |   |
    No m' are y.    |   ·---|---·   |  |---|---|
                    |   |   |   |   |  |   |(I)|
                    |---|---|---|---|  ·-------·
                    |   |   |   |   |
                    |   ·---|---·   |  .'. Some x' are y'.
                    |(O)    |    (I)|
                    ·---------------·
                                                                   pg138
                    ·---------------·
 9. Some x' are m'; |       |       |
    No m are y'.    |   ·---|---·   |
                    |   |   |(O)|   |
                    |---|---|---|---|  There is no Conclusion.
                    |   |   |(O)|   |
                    |   ·---|---·   |
                    |      (I)      |
                    ·---------------·

                    ·---------------·  ·-------·
10. All x are m;    |(O)    |    (O)|  |(I)|(O)|
    All y' are m'.  |   ·---|---·   |  |---|---|
                    |   |(I)|(O)|   |  |   |(I)|
                    |---|---|---|---|  ·-------·
                    |   |   |(O)|   |
                    |   ·---|---·   |  .'. All x are y;
                    |       |    (I)|      All y' are x'.
                    ·---------------·

                    ·---------------·
11. No m are x;     |       |       |
    All y' are m'.  |   ·---|---·   |
                    |   |(O)|(O)|   |
                    |---|---|---|(I)|  There is no Conclusion.
                    |   |   |(O)|   |
                    |   ·---|---·   |
                    |       |       |
                    ·---------------·

                    ·---------------·  ·-------·
12. No x are m;     |(O)    |       |  |(O)|   |
    All y are m.    |   ·---|---·   |  |---|---|
                    |   |(O)|(O)|   |  |(I)|   |
                    |---|---|---|---|  ·-------·
                    |   |(I)|   |   |
                    |   ·---|---·   |  .'. All y are x'.
                    |(O)    |       |
                    ·---------------·


_Solutions for § 5, Nos. 1-12._                                    SL5-A

 1. I have been out for a walk;
    I am feeling better.

Univ. is "persons"; m = the Class of I's; x = persons who have been out
for a walk; y = persons who are feeling better.

                    ·---------------·  ·-------·
    All m are x;    |       |       |  |(I)|   |
    All m are y.    |   ·---|---·   |  |---|---|
                    |   |(I)|(O)|   |  |   |   |
                    |---|---|---|---|  ·-------·
                    |   |(O)|(O)|   |
                    |   ·---|---·   |  .'. Some x are y.
                    |       |       |
                    ·---------------·

i.e. Somebody, who has been out for a walk, is feeling better.
                                                                   pg139
 2. No one has read the letter but John;
    No one, who has _not_ read it, knows what it is about.

Univ. is "persons"; m = persons who have read the letter; x = the Class
of Johns; y = persons who know what the letter is about.

                    ·---------------·  ·-------·
    No x' are m;    |(O)    |       |  |   |   |
    No m' are y.    |   ·---|---·   |  |---|---|
                    |   |   |   |   |  |(O)|   |
                    |---|---|---|---|  ·-------·
                    |   |(O)|(O)|   |
                    |   ·---|---·   |  .'. No x' are y.
                    |(O)    |       |
                    ·---------------·

i.e. No one, but John, knows what the letter is about.

 3. Those who are not old like walking;
    You and I are young.

Univ. is "persons"; m = old; x = persons who like walking; y = you and
I.

                    ·---------------·  ·-------·
    All m' are x;   |(I)    |       |  |(I)|   |
    All y are m'.   |   ·---|---·   |  |---|---|
                    |   |(O)|   |   |  |(O)|   |
                    |---|---|---|---|  ·-------·
                    |   |(O)|   |   |
                    |   ·---|---·   |  .'. All y are x.
                    |(O)    |    (O)|
                    ·---------------·

i.e. You and I like walking.

 4. Your course is always honest;
    Your course is always the best policy.

Univ. is "courses"; m = your; x = honest; y = courses which are the best
policy.

                    ·---------------·  ·-------·
    All m are x;    |       |       |  |(I)|   |
    All m are y.    |   ·---|---·   |  |---|---|
                    |   |(I)|(O)|   |  |   |   |
                    |---|---|---|---|  ·-------·
                    |   |(O)|(O)|   |
                    |   ·---|---·   |  .'. Some x are y.
                    |       |       |
                    ·---------------·

i.e. Honesty is sometimes the best policy.

 5. No fat creatures run well;
    Some greyhounds run well.

Univ. is "creatures"; m = creatures that run well; x = fat;
y = greyhounds.

                    ·---------------·  ·-------·
    No x are m;     |       |       |  |   |   |
    Some y are m.   |   ·---|---·   |  |---|---|
                    |   |(O)|(O)|   |  |(I)|   |
                    |---|---|---|---|  ·-------·
                    |   |(I)|   |   |
                    |   ·---|---·   |  .'. Some y are x'.
                    |       |       |
                    ·---------------·

i.e. Some greyhounds are not fat.
                                                                   pg140
 6. Some, who deserve the fair, get their deserts;
    None but the brave deserve the fair.

Univ. is "persons"; m = persons who deserve the fair; x = persons who
get their deserts; y = brave.

                    ·---------------·  ·-------·
    Some m are x;   |       |       |  |(I)|   |
    No y' are m.    |   ·---|---·   |  |---|---|
                    |   |(I)|(O)|   |  |   |   |
                    |---|---|---|---|  ·-------·
                    |   |   |(O)|   |
                    |   ·---|---·   |  .'. Some y are x.
                    |       |       |
                    ·---------------·

i.e. Some brave persons get their deserts.

 7. Some Jews are rich;
    All Esquimaux are Gentiles.

Univ. is "persons"; m = Jews; x = rich; y = Esquimaux.

                    ·---------------·  ·-------·
    Some m are x;   |       |       |  |   |(I)|
    All y are m'.   |   ·---|---·   |  |---|---|
                    |   |(O)|(I)|   |  |   |   |
                    |(I)|---|---|---|  ·-------·
                    |   |(O)|   |   |
                    |   ·---|---·   |  .'. Some x are y'.
                    |       |       |
                    ·---------------·

i.e. Some rich persons are not Esquimaux.

 8. Sugar-plums are sweet;
    Some sweet things are liked by children.

Univ. is "things"; m = sweet; x = sugar-plums; y = things that are liked
by children.

                    ·---------------·
    All x are m;    |(O)    |    (O)|
    Some m are y.   |   ·---|---·   |
                    |   |  (I)  |   |
                    |---|(I)|---|---|
                    |   |   |   |   |
                    |   ·---|---·   |
                    |       |       |
                    ·---------------·

There is no Conclusion.

 9. John is in the house;
    Everybody in the house is ill.

Univ. is "persons"; m = persons in the house; x = the Class of Johns;
y = ill.

                    ·---------------·  ·-------·
    All x are m;    |(O)    |    (O)|  |(I)|(O)|
    All m are y.    |   ·---|---·   |  |---|---|
                    |   |(I)|(O)|   |  |   |   |
                    |---|---|---|---|  ·-------·
                    |   |   |(O)|   |
                    |   ·---|---·   |  .'. All x are y.
                    |       |       |
                    ·---------------·

i.e. John is ill.
                                                                   pg141
10. Umbrellas are useful on a journey;
    What is useless on a journey should be left behind.

Univ. is "things"; m = useful on a journey; x = umbrellas; y = things
that should be left behind.

                    ·---------------·  ·-------·
    All x are m;    |(O)    |    (O)|  |   |   |
    All m' are y.   |   ·---|---·   |  |---|---|
                    |   |  (I)  |   |  |(I)|   |
                    |---|---|---|---|  ·-------·
                    |   |   |   |   |
                    |   ·---|---·   |  .'. Some x' are y.
                    |(I)    |    (O)|
                    ·---------------·

i.e. Some things, that are not umbrellas, should be left behind on a
journey.

11. Audible music causes vibration in the air;
    Inaudible music is not worth paying for.

Univ. is "music"; m = audible; x = music that causes vibration in the
air; y = worth paying for.

                    ·---------------·  ·-------·
    All m are x;    |(O)    |       |  |   |   |
    All m' are y'.  |   ·---|---·   |  |---|---|
                    |   |  (I)  |   |  |(O)|   |
                    |---|---|---|(I)|  ·-------·
                    |   |(O)|(O)|   |
                    |   ·---|---·   |  .'. No x' are y.
                    |(O)    |       |
                    ·---------------·

i.e. No music is worth paying for, unless it causes vibration in the
air.

12. Some holidays are rainy;
    Rainy days are tiresome.

Univ. is "days"; m = rainy; x = holidays; y = tiresome.

                    ·---------------·  ·-------·
    Some x are m;   |       |       |  |(I)|   |
    All m are y.    |   ·---|---·   |  |---|---|
                    |   |(I)|(O)|   |  |   |   |
                    |---|---|---|---|  ·-------·
                    |   |   |(O)|   |
                    |   ·---|---·   |  .'. Some x are y.
                    |       |       |
                    ·---------------·

i.e. Some holidays are tiresome.


_Solutions for § 6, Nos. 1-10._                                    SL6-A

 1.

Some x are m; No m are y'. Some x are y.

·---------------·  ·-------·
|       |       |  |(I)|   |
|   ·---|---·   |  |---|---|
|   |(I)|(O)|   |  |   |   |
|---|---|---|---|  ·-------·
|   |   |(O)|   |
|   ·---|---·   |  Hence proposed Conclusion is right.
|       |       |
·---------------·
                                                                   pg142
 2.

All x are m; No y are m'. No y are x'.

·---------------·
|(O)    |    (O)|
|   ·---|---·   |
|   |  (I)  |   |
|---|---|---|---|  There is no Conclusion.
|   |   |   |   |
|   ·---|---·   |
|(O)    |       |
·---------------·

 3.

Some x are m'; All y' are m. Some x are y.

·---------------·  ·-------·
|(I)    |    (O)|  |(I)|   |
|   ·---|---·   |  |---|---|
|   |   |   |   |  |   |   |
|---|---|(I)|---|  ·-------·
|   |   |   |   |
|   ·---|---·   |  Hence proposed Conclusion is right.
|       |    (O)|
·---------------·

 4.

All x are m; No y are m. All x are y'.

·---------------·  ·-------·
|(O)    |    (O)|  |(O)|(I)|
|   ·---|---·   |  |---|---|
|   |(O)|(I)|   |  |   |   |
|---|---|---|---|  ·-------·
|   |(O)|   |   |
|   ·---|---·   |  Hence proposed Conclusion is right.
|       |       |
·---------------·

 5.

Some m' are x'; No m' are y. Some x' are y'.

·---------------·  ·-------·
|(O)    |       |  |   |   |
|   ·---|---·   |  |---|---|
|   |   |   |   |  |   |(I)|
|---|---|---|---|  ·-------·
|   |   |   |   |
|   ·---|---·   |  Hence proposed Conclusion is right.
|(O)    |    (I)|
·---------------·

 6.

No x' are m; All y are m'. All y are x.

·---------------·
|       |       |
|   ·---|---·   |
|   |(O)|   |   |
|(I)|---|---|---|  There is no Conclusion.
|   |(O)|(O)|   |
|   ·---|---·   |
|       |       |
·---------------·
                                                                   pg143
 7.

Some m' are x'; All y' are m'. Some x' are y'.

·---------------·
|       |       |
|   ·---|---·   |
|   |   |(O)|   |
|---|---|---|(I)|  There is no Conclusion.
|   |   |(O)|   |
|   ·---|---·   |
|      (I)      |
·---------------·

 8.

No m' are x'; All y' are m'. All y' are x.

·---------------·  ·-------·
|       |    (I)|  |   |(I)|
|   ·---|---·   |  |---|---|
|   |   |(O)|   |  |   |(O)|
|---|---|---|---|  ·-------·
|   |   |(O)|   |
|   ·---|---·   |  Hence proposed Conclusion is right.
|(O)    |    (O)|
·---------------·

 9.

Some m are x'; No m are y. Some x' are y'.

·---------------·  ·-------·
|       |       |  |   |   |
|   ·---|---·   |  |---|---|
|   |(O)|   |   |  |   |(I)|
|---|---|---|---|  ·-------·
|   |(O)|(I)|   |
|   ·---|---·   |  Hence proposed Conclusion is right.
|       |       |
·---------------·

10.

All m' are x'; All m are y. Some y are x'.

·---------------·  ·-------·
|(O)    |    (O)|  |   |   |
|   ·---|---·   |  |---|---|
|   |   |   |   |  |(I)|   |
|---|---|---|---|  ·-------·
|   |   |   |   |
|   ·---|---·   |  Hence proposed Conclusion is right.
|(I)    |    (O)|
·---------------·

                                                                   pg144
_Solutions for § 7, Nos. 1-6._                                     SL7-A

1.

No doctors are enthusiastic;
You are enthusiastic.
  You are not a doctor.

Univ. "persons"; m = enthusiastic; x = doctors; y = you.

                    ·---------------·  ·-------·
                    |(O)    |       |  |(O)|   |
                    |   ·---|---·   |  |---|---|
    No x are m;     |   |(O)|(O)|   |  |(I)|   |
    All y are m.    |---|---|---|---|  ·-------·
      All y are x'. |   |(I)|   |   |
                    |   ·---|---·   |  .'. All y are x'.
                    |(O)    |       |
                    ·---------------·

Hence proposed Conclusion is right.

2.

All dictionaries are useful;
Useful books are valuable.
  Dictionaries are valuable.

Univ. "books"; m = useful; x = dictionaries; y = valuable.

                    ·---------------·  ·-------·
                    |(O)    |    (O)|  |(I)|(O)|
                    |   ·---|---·   |  |---|---|
    All x are m;    |   |(I)|(O)|   |  |   |   |
    All m are y.    |---|---|---|---|  ·-------·
      All x are y.  |   |   |(O)|   |
                    |   ·---|---·   |  .'. All x are y.
                    |       |       |
                    ·---------------·

Hence proposed Conclusion is right.

3.

No misers are unselfish;
None but misers save egg-shells.
  No unselfish people save egg-shells.

Univ. "people"; m = misers; x = selfish; y = people who save egg-shells.

                    ·---------------·  ·-------·
                    |(O)    |       |  |   |   |
                    |   ·---|---·   |  |---|---|
    No m are x';    |   |   |   |   |  |(O)|   |
    No m' are y.    |---|---|---|---|  ·-------·
      No x' are y.  |   |(O)|(O)|   |
                    |   ·---|---·   |  .'. No x' are y.
                    |(O)    |       |
                    ·---------------·

Hence proposed Conclusion is right.
                                                                   pg145
4.

Some epicures are ungenerous;
All my uncles are generous.
  My uncles are not epicures.

Univ. "persons"; m = generous; x = epicures; y = my uncles.

                    ·---------------·  ·-------·
                    |(O)    |    (I)|  |   |(I)|
                    |   ·---|---·   |  |---|---|
    Some x are m'.  |   |   |   |   |  |   |   |
    All y are m.    |---|(I)|---|---|  ·-------·
      All y are x'. |   |   |   |   |
                    |   ·---|---·   |  .'. Some x are y'.
                    |(O)    |       |
                    ·---------------·

Hence proposed Conclusion is wrong, the right one being "Some epicures
are not uncles of mine."

5.

Gold is heavy;
Nothing but gold will silence him.
  Nothing light will silence him.

Univ. "things"; m = gold; x = heavy; y = able to silence him.

                    ·---------------·  ·-------·
                    |(O)    |       |  |   |   |
                    |   ·---|---·   |  |---|---|
    All m are x;    |   |  (I)  |   |  |(O)|   |
    No m' are y.    |---|---|---|---|  ·-------·
      No x' are y.  |   |(O)|(O)|   |
                    |   ·---|---·   |  .'. No x' are y.
                    |(O)    |       |
                    ·---------------·

Hence proposed Conclusion is right.

6.

Some healthy people are fat;
No unhealthy people are strong.
  Some fat people are not strong.

Univ. "persons"; m = healthy; x = fat; y = strong.

                    ·---------------·
                    |(O)    |       |
                    |   ·---|---·   |
    Some m are x;   |   |  (I)  |   |
    No m' are y.    |---|---|---|---|  There is no Conclusion.
      Some x are y'.|   |   |   |   |
                    |   ·---|---·   |
                    |(O)    |       |
                    ·---------------·

                                                                   pg146
§ 3.

_Method of Subscripts._


_Solutions for § 4._                                               SL4-B

 1. mx'_{0} + m'_{1}y'_{0} ¶ x'y'_{0} [Fig. I.
      i.e. "No x' are y'."

 2. m'x_{0} + m'y'_{1} ¶ x'y'_{1} [Fig. II.
      i.e. "Some x' are y'."

 3. m'_{1}x'_{0} + m'_{1}y_{0} ¶ xy'_{1} [Fig. III.
      i.e. "Some x are y'."

 4. x'm'_{0} + y'_{1}m'_{0} ¶ nothing.
    [Fallacy of Like Eliminands
      not asserted to exist.]

 5. mx'_{1} + ym_{0} ¶ x'y'_{1} [Fig. II.
      i.e. "Some x' are y'."

 6. x'm_{0} + my_{0} ¶ nothing.
    [Fallacy of Like Eliminands
      not asserted to exist.]

 7. mx'_{0} + y'm_{1} ¶ xy'_{1} [Fig. II.
      i.e. "Some x are y'."

 8. m'_{1}x_{0} + m'y_{0} ¶ x'y'_{1} [Fig. III.
      i.e. "Some x' are y'."

 9. x'm'_{1} + my_{0} ¶ nothing.
    [Fallacy of Unlike Eliminands
      with an Entity-Premiss.]

10. x_{1}m'_{0} + y'_{1}m_{0} ¶ x_{1}y'_{0} + y'_{1}x_{0} [Fig. I (b).
      i.e. "All x are y, and all y' are x'."

11. mx_{0} + y'_{1}m_{0} ¶ nothing.1
    [Fallacy of Like Eliminands
      not asserted to exist.]

12. xm_{0} + y_{1}m'_{0} ¶ y_{1}x_{0} [Fig. I (a).
      i.e. "All y are x'."

13. m'_{1}x'_{0} + ym_{0} ¶ x'y_{0} [Fig. I.
      i.e. "No x' are y."

14. m_{1}x'_{0} + m'_{1}y'_{0} ¶ x'y'_{0} [Fig. I.
      i.e. "No x' are y'."

15. xm_{0} + m'y_{0} ¶ xy_{0} [Fig. I.
      i.e. "No x are y."

16. x_{1}m_{0} + y_{1}m'_{0} ¶ (x_{1}y_{0} + y_{1}x_{0}) [Fig. I (b).
      i.e. "All x are y' and all y are x'."

17. xm_{0} + m'_{1}y'_{0} ¶ xy'_{0} [Fig. I.
      i.e. "No x are y'."

18. xm'_{0} + my_{0} ¶ xy_{0} [Fig. I.
      i.e. "No x are y."

19. m_{1}x'_{0} + m_{1}y_{0} ¶ xy'_{1} [Fig. III.
      i.e. "Some x are y'."

20. mx_{0} + m'_{1}y'_{0} ¶ xy'_{0} [Fig. I.
      i.e. "No x are y'."

21. x_{1}m'_{0} + m'y_{1} ¶ x'y_{1} [Fig. II.
      i.e. "Some x' are y."

22. xm_{1} + y_{1}m'_{0} ¶ nothing.
    [Fallacy of Unlike Eliminands
      with an Entity-Premiss.]

23. m_{1}x'_{0} + ym_{1} ¶ xy_{1} [Fig. II.
      i.e. "Some x are y."

24. xm_{0} + y_{1}m'_{0} ¶ y_{1}x_{0} [Fig. I (a).
      i.e. "All y are x'."

25. mx'_{1} + my'_{0} ¶ x'y_{1} [Fig. II.
      i.e. "Some x' are y."

26. mx'_{0} + y_{1}m'_{0} ¶ y_{1}x'_{0} [Fig. I (a).
      i.e. "All y are x."

27. x_{1}m_{0} + y'_{1}m'_{0} ¶ (x_{1}y'_{0} + y'_{1}x_{0}) [Fig. I (b).
      i.e. "All x are y, and all y' are x'."

28. m_{1}x_{0} + my_{1} ¶ x'y_{1} [Fig. II.
      i.e. "Some x' are y."

29. mx_{0} + y_{1}m_{0} ¶ nothing.
    [Fallacy of Like Eliminands
      not asserted to exist.]

30. x_{1}m_{0} + ym_{1} ¶ x'y_{1} [Fig. II.
      i.e. "Some y are x'."

31. x_{1}m'_{0} + y_{1}m'_{0} ¶ nothing.
    [Fallacy of Like Eliminands
      not asserted to exist.]
                                                                   pg147
32. xm'_{0} + m_{1}y'_{0} ¶ xy'_{0} [Fig. I.
      i.e. "No x are y'."

33. mx_{0} + my_{0} ¶ nothing.
    [Fallacy of Like Eliminands
      not asserted to exist.]

34. mx'_{0} + ym_{1} ¶ xy_{1} [Fig. II.
      i.e. "Some x are y."

35. mx_{0} + y_{1}m'_{0} ¶ y_{1}x_{0} [Fig. I (a).
      i.e. "All y are x'."

36. m_{1}x_{0} + ym_{1} ¶ x'y_{1} [Fig. II.
      i.e. "Some x' are y."

37. m_{1}x'_{0} + ym_{0} ¶ xy'_{1} [Fig. III.
      i.e. "Some x are y'."

38. mx_{0} + m'y_{0} ¶ xy_{0} [Fig. I.
      i.e. "No x are y."

39. mx'_{1} + my_{0} ¶ x'y'_{1} [Fig. II.
      i.e. "Some x' are y'."

40. x'm_{0} + y'_{1}m'_{0} ¶ y'_{1}x'_{0} [Fig. I (a).
      i.e. "All y' are x."

41. x_{1}m_{0} + ym'_{0} ¶ x_{1}y_{0} [Fig. I (a).
      i.e. "All x are y'."

42. m'x_{0} + ym_{0} ¶ xy_{0} [Fig. I.
      i.e. "No x are y."


_Solutions for § 5, Nos. 13-24._                                   SL5-B

13. No Frenchmen like plumpudding;
    All Englishmen like plumpudding.

Univ. "men"; m = liking plumpudding; x = French; y = English.

    xm_{0} + y_{1}m'_{0} ¶ y_{1}x_{0} [Fig. I (a).

i.e. Englishmen are not Frenchmen.

14. No portrait of a lady, that makes her simper or scowl, is
      satisfactory;
    No photograph of a lady ever fails to make her simper or scowl.

Univ. "portraits of ladies"; m = making the subject simper or scowl;
x = satisfactory; y = photographic.

    mx_{0} + ym'_{0} ¶ xy_{0} [Fig. I.

i.e. No photograph of a lady is satisfactory.

15. All pale people are phlegmatic;
    No one looks poetical unless he is pale.

Univ. "people"; m = pale; x = phlegmatic; y = looking poetical.

    m_{1}x'_{0} + m'y_{0} ¶ x'y_{0} [Fig. I.

i.e. No one looks poetical unless he is phlegmatic.

16. No old misers are cheerful;
    Some old misers are thin.

Univ. "persons"; m = old misers; x = cheerful; y = thin.

    mx_{0} + my_{1} ¶ x'y_{1} [Fig. II.

i.e. Some thin persons are not cheerful.

17. No one, who exercises self-control, fails to keep his temper;
    Some judges lose their tempers.

Univ. "persons"; m = keeping their tempers; x = exercising self-control;
y = judges.

    xm'_{0} + ym'_{1} ¶ x'y_{1} [Fig. II.

i.e. Some judges do not exercise self-control.
                                                                   pg148
18. All pigs are fat;
    Nothing that is fed on barley-water is fat.

Univ. is "things"; m = fat; x = pigs; y = fed on barley-water.

    x_{1}m'_{0} + ym_{0} ¶ x_{1}y_{0} [Fig. I (a).

i.e. Pigs are not fed on barley-water.

19. All rabbits, that are not greedy, are black;
    No old rabbits are free from greediness.

Univ. is "rabbits"; m = greedy; x = black; y = old.

   m'_{1}x'_{0} + ym'_{0} ¶ xy'_{1} [Fig. III.

i.e. Some black rabbits are not old.

20. Some pictures are not first attempts;
    No first attempts are really good.

Univ. is "things"; m = first attempts; x = pictures; y = really good.

    xm'_{1} + my_{0} ¶ nothing.

[Fallacy of Unlike Eliminands with an Entity-Premiss.]

21. I never neglect important business;
    Your business is unimportant.

Univ. is "business"; m = important; x = neglected by me; y = your.

    mx_{0} + y_{1}m_{0} ¶ nothing.

[Fallacy of Like Eliminands not asserted to exist.]

22. Some lessons are difficult;
    What is difficult needs attention.

Univ. is "things"; m = difficult; x = lessons; y = needing attention.

    xm_{1} + m_{1}y'_{0} ¶ xy_{1} [Fig. II.

i.e. Some lessons need attention.

23. All clever people are popular;
    All obliging people are popular.

Univ. is "people"; m = popular; x = clever; y = obliging.

    x_{1}m'_{0} + y_{1}m'_{0} ¶ nothing.

[Fallacy of Like Eliminands not asserted to exist.]

24. Thoughtless people do mischief;
    No thoughtful person forgets a promise.

Univ. is "persons"; m = thoughtful; x = mischievous; y = forgetful of
promises.

    m'_{1}x'_{0} + my_{0} ¶ x'y_{0}

i.e. No one, who forgets a promise, fails to do mischief.


_Solutions for § 6._                                               SL6-B

 1. xm_{1} + my'_{0} ¶ xy_{1} [Fig. II.] Concl. right.

 2. x_{1}m'_{0} + ym'_{0} Fallacy of Like Eliminands not asserted to exist.

 3. xm'_{1} + y'_{1}m'_{0} ¶ xy_{1} [Fig. II.] Concl. right.
                                                                   pg149
 4. x_{1}m'_{0} + ym_{0} ¶ x_{1}y_{0} [Fig. I (a).] Concl. right.

 5. m'x'_{1} + m'y_{0} ¶ x'y'_{1}     [Fig. II.]          "

 6. x'm_{0} + y_{1}m_{0} Fallacy of Like Eliminands not asserted to exist.

 7. m'x'_{1} + y'_{1}m_{0} Fallacy of Unlike Eliminands with an
      Entity-Premiss.

 8. m'x'_{0} + y'_{1}m_{0} ¶ y'_{1}x'_{0} [Fig. I (a).] Concl. right.

 9. mx'_{1} + my_{0} ¶ x'y'_{1}           [Fig. II.]          "

10. m'_{1}x_{0} + m'_{1}y'_{0} ¶ x'y_{1}  [Fig. III.]         "

11. x_{1}m_{0} + ym_{1} ¶ x'y_{1}         [Fig. II.]          "

12. xm_{0} + m'y'_{0} ¶ xy'_{0}           [Fig. I.]           "

13. xm_{0} + y'_{1}m'_{0} ¶ y'_{1}x_{0}   [Fig. I (a).]       "

14. m'_{1}x_{0} + m'_{1}y'_{0} ¶ x'y_{1}  [Fig. III.]         "

15. mx'_{1} + y_{1}m_{0} ¶ x'y'_{1}       [Fig. II.]          "

16. x'm_{0} + y'_{1}m_{0} Fallacy of Like Eliminands not asserted to exist.

17. m'x_{0} + m'_{1}y_{0} ¶ x'y'_{1} [Fig. III.] Concl. right.

18. x'm_{0} + my_{1} ¶ xy_{1}        [Fig. II.]        "

19. mx'_{1} + m_{1}y'_{0} ¶ x'y_{1}  [   "    ]        "

20. x'm'_{0} + m'y'_{1} ¶ xy'_{1}    [   "    ]        "

21. mx_{0} + m_{1}y_{0} ¶ x'y'_{1}   [Fig. III.]       "

22. x'_{1}m'_{0} + ym'_{1} ¶ xy_{1} [Fig. II.] Concl. wrong:
      the right one is "Some x are y."

23. m_{1}x'_{0} + m'y'_{0} ¶ x'y'_{0}       [Fig. I.] Concl. right.

24. x_{1}m_{0} + m'_{1}y'_{0} ¶ x_{1}y'_{0} [Fig. I (a).]   "

25. xm'_{0} + m_{1}y'_{0} ¶ xy'_{0}         [Fig. I.]       "

26. m_{1}x_{0} + y_{1}m'_{0} ¶ y_{1}x_{0}   [Fig. I (a).]   "

27. x_{1}m'_{0} + my'_{0} ¶ x_{1}y'_{0}     [     "     ]   "

28. x_{1}m'_{0} + y'm'_{0} Fallacy of Like Eliminands not asserted to
      exist.

29. x'm_{0} + m'y'_{0} ¶ x'y'_{0}           [Fig. I.] Concl. right.

30. x_{1}m'_{0} + m_{1}y_{0} ¶ x_{1}y_{0}   [Fig. I (a).]   "

31. x'_{1}m_{0} + y'm'_{0} ¶ x'_{1}y'_{0}   [     "     ]   "

32. xm_{0} + y'm'_{0} ¶ xy'_{0}             [Fig. I.]       "

33. m_{1}x_{0} + y'_{1}m'_{0} ¶ y'_{1}x_{0} [Fig. I (a).]   "

34. x_{1}m_{0} + ym'_{1} Fallacy of Unlike Eliminands with an
      Entity-Premiss.

35. xm_{1} + m_{1}y'_{0} ¶ xy_{1}         [Fig. II.]  Concl. right.

36. m_{1}x_{0} + y_{1}m'_{0} ¶ y_{1}x_{0} [Fig. I (a).]     "

37. mx'_{0} + m_{1}y_{0} ¶ xy'_{1}        [Fig. III.]       "

38. xm_{0} + my'_{0} Fallacy of Like Eliminands not asserted to exist.

39. mx_{0} + my'_{1} ¶ x'y'_{1} [Fig. II.] Concl. right.

40. mx'_{0} + ym_{1} ¶ xy_{1}   [Fig. II.]       "

                                                                   pg150
_Solutions for § 7._                                               SL7-B

 1. No doctors are enthusiastic;
    You are enthusiastic.
      You are not a doctor.

Univ. "persons"; m = enthusiastic; x = doctors; y = you.

    xm_{0} + y_{1}m'_{0} ¶ y_{1}x_{0} [Fig. I (a).

Conclusion right.

 2. Dictionaries are useful;
    Useful books are valuable.
      Dictionaries are valuable.

Univ. "books"; m = useful; x = dictionaries; y = valuable.

    x_{1}m'_{0} + m_{1}y'_{0} ¶ x_{1}y'_{0} [Fig. I (a).

Conclusion right.

 3. No misers are unselfish;
    None but misers save egg-shells.
      No unselfish people save egg-shells.

Univ. "people"; m = misers; x = selfish; y = people who save egg-shells.

    mx'_{0} + m'y_{0} ¶ x'y_{0} [Fig. I.

Conclusion right.

 4. Some epicures are ungenerous;
    All my uncles are generous.
      My uncles are not epicures.

Univ. "persons"; m = generous; x = epicures; y = my uncles.

    xm'_{1} + y_{1}m'_{0} ¶ xy'_{1} [Fig. II.

Conclusion wrong: right one is "Some epicures are not uncles of mine."

 5. Gold is heavy;
    Nothing but gold will silence him.
      Nothing light will silence him.

Univ. "things"; m = gold; x = heavy; y = able to silence him.

    m_{1}x'_{0} + m'y_{0} ¶ x'y_{0} [Fig. I.

Conclusion right.

 6. Some healthy people are fat;
    No unhealthy people are strong.
      Some fat people are not strong.

Univ. "people"; m = healthy; x = fat; y = strong.

    mx_{1} + m'y_{0}

No Conclusion. [Fallacy of Unlike Eliminands with an Entity-Premiss.]

 7. I saw it in a newspaper;
    All newspapers tell lies.
      It was a lie.

Univ. "publications"; m = newspapers; x = publications in which I saw
it; y = telling lies.

    x_{1}m'_{0} + m_{1}y'_{0} ¶ x_{1}y'_{0} [Fig. I (a).

Conclusion wrong: right one is "The publication, in which I saw it,
tells lies."
                                                                   pg151
 8. Some cravats are not artistic;
    I admire anything artistic.
      There are some cravats that I do not admire.

Univ. "things"; m = artistic; x = cravats; y = things that I admire.

    xm_{1} + m_{1}y_{0}

No Conclusion. [Fallacy of Unlike Eliminands with an Entity-Premiss.]

 9. His songs never last an hour.
    A song, that lasts an hour, is tedious.
      His songs are never tedious.

Univ. "songs"; m = lasting an hour; x = his; y = tedious.

    x_{1}m_{0} + m_{1}y'_{0} ¶ x'y_{1} [Fig. III.

Conclusion wrong: right one is "Some tedious songs are not his."

10. Some candles give very little light;
    Candles are meant to give light.
      Some things, that are meant to give light, give very little.

Univ. "things"; m = candles; x = giving &c.; y = meant &c.

    mx_{1} + m_{1}y'_{0} ¶ xy_{1} [Fig. II.

Conclusion right.

11. All, who are anxious to learn, work hard.
    Some of these boys work hard.
      Some of these boys are anxious to learn.

Univ. "persons"; m = hard-working; x = anxious to learn; y = these boys.

    x_{1}m'_{0} + ym_{1}

No Conclusion. [Fallacy of Unlike Eliminands with an Entity-Premiss.]

12. All lions are fierce;
    Some lions do not drink coffee.
      Some creatures that drink coffee are not fierce.

Univ. "creatures"; m = lions; x = fierce; y = creatures that drink
coffee.

    m_{1}x'_{0} + my'_{1} ¶ xy'_{1} [Fig. II.

Conclusion wrong: right one is "Some fierce creatures do not drink
coffee."

13. No misers are generous;
    Some old men are ungenerous.
      Some old men are misers.

Univ. "persons"; m = generous; x = misers; y = old men.

    xm_{0} + ym'_{1}

No Conclusion. [Fallacy of Unlike Eliminands with an Entity-Premiss.]

14. No fossil can be crossed in love;
    An oyster may be crossed in love.
      Oysters are not fossils.

Univ. "things"; m = things that can be crossed in love; x = fossils;
y = oysters.

    xm_{0} + y_{1}m'_{0} ¶ y_{1}x_{0} [Fig. I (a).

Conclusion right.
                                                                   pg152
15. All uneducated people are shallow;
      Students are all educated.
         No students are shallow.

Univ. "people"; m = educated; x = shallow; y = students.

    m'_{1}x'_{0} + y_{1}m'_{0} ¶ xy'_{1} [Fig. III.

Conclusion wrong: right one is "Some shallow people are not students."

16. All young lambs jump;
    No young animals are healthy, unless they jump.
      All young lambs are healthy.

Univ. "young animals"; m = young animals that jump; x = lambs;
y = healthy.

    x_{1}m'_{0} + m'y_{0}

No Conclusion. [Fallacy of Like Eliminands not asserted to exist.]

17. Ill-managed business is unprofitable;
    Railways are never ill-managed.
      All railways are profitable.

Univ. "business"; m = ill-managed; x = profitable; y = railways.

    m_{1}x_{0} + y_{1}m_{0} ¶ x'y'_{1} [Fig. III.

Conclusion wrong: right one is "Some business, other than railways, is
profitable."

18. No Professors are ignorant;
    All ignorant people are vain.
      No Professors are vain.

Univ. "people"; m = ignorant; x = Professors; y = vain.

    xm_{0} + m_{1}y'_{0} ¶ x'y_{1} [Fig. III.

Conclusion wrong: right one is "Some vain persons are not Professors."

19. A prudent man shuns hyænas.
    No banker is imprudent.
      No banker fails to shun hyænas.

Univ. "men"; m = prudent; x = shunning hyænas; y = bankers.

    m_{1}x'_{0} + ym'_{0} ¶ x'y_{0} [Fig. I.

Conclusion right.

20. All wasps are unfriendly;
    No puppies are unfriendly.
      No puppies are wasps.

Univ. "creatures"; m = friendly; x = wasps; y = puppies.

    x_{1}m_{0} + ym'_{0} ¶ x_{1}y_{0} [Fig. I (a).

Conclusion incomplete: complete one is "Wasps are not puppies".

21. No Jews are honest;
    Some Gentiles are rich.
      Some rich people are dishonest.

Univ. "persons"; m = Jews; x = honest; y = rich.

    mx_{0} + m'y_{1}

No Conclusion. [Fallacy of Unlike Eliminands with an Entity-Premiss.]
                                                                   pg153
22. No idlers win fame;
    Some painters are not idle.
      Some painters win fame.

Univ. "persons"; m = idlers; x = persons who win fame; y = painters.

    mx_{0} + ym'_{1}

No Conclusion. [Fallacy of Unlike Eliminands with an Entity-Premiss.]

23. No monkeys are soldiers;
    All monkeys are mischievous.
      Some mischievous creatures are not soldiers.

Univ. "creatures"; m = monkeys; x = soldiers; y = mischievous.

    mx_{0} + m_{1}y'_{0} ¶ x'y_{1} [Fig. III.

Conclusion right.

24. All these bonbons are chocolate-creams;
    All these bonbons are delicious.
         Chocolate-creams are delicious.

Univ. "food"; m = these bonbons; x = chocolate-creams; y = delicious.

    m_{1}x'_{0} + m_{1}y'_{0} ¶ xy_{1} [Fig. III.

Conclusion wrong, being in excess of the right one, which is "Some
chocolate-creams are delicious."

25. No muffins are wholesome;
    All buns are unwholesome.
      Buns are not muffins.

Univ. "food"; m = wholesome; x = muffins; y = buns.

    xm_{0} + y_{1}m_{0}

No Conclusion. [Fallacy of Like Eliminands not asserted to exist.]

26. Some unauthorised reports are false;
    All authorised reports are trustworthy.
      Some false reports are not trustworthy.

Univ. "reports"; m = authorised; x = true; y = trustworthy.

    m'x'_{1} + m_{1}y'_{0}

No Conclusion. [Fallacy of Unlike Eliminands with an Entity-Premiss.]

27. Some pillows are soft;
    No pokers are soft.
      Some pokers are not pillows.

Univ. "things"; m = soft; x = pillows; y = pokers.

    xm_{1} + ym_{0} ¶ xy'_{1} [Fig. II.

Conclusion wrong: right one is "Some pillows are not pokers."

28. Improbable stories are not easily believed;
    None of his stories are probable.
      None of his stories are easily believed.

Univ. "stories"; m = probable; x = easily believed; y = his.

    m'_{1}x_{0} + ym_{0} ¶ xy_{0} [Fig. I.

Conclusion right.
                                                                   pg154
29. No thieves are honest;
    Some dishonest people are found out.
      Some thieves are found out.

Univ. "people"; m = honest; x = thieves; y = found out.

    xm_{0} + m'y_{1}

No Conclusion. [Fallacy of Unlike Eliminands with an Entity-Premiss.]

30. No muffins are wholesome;
    All puffy food is unwholesome.
      All muffins are puffy.

Univ. is "food"; m = wholesome; x = muffins; y = puffy.

    xm_{0} + y_{1}m_{0}

No Conclusion. [Fallacy of Like Eliminands not asserted to exist.]

31. No birds, except peacocks, are proud of their tails;
    Some birds, that are proud of their tails, cannot sing.
      Some peacocks cannot sing.

Univ. "birds"; m = proud of their tails; x = peacocks; y = birds that
cannot sing.

    x'm_{0} + my'_{1} ¶ xy'_{1} [Fig. II.

Conclusion right.

32. Warmth relieves pain;
    Nothing, that does not relieve pain, is useful in toothache.
      Warmth is useful in toothache.

Univ. "applications"; m = relieving pain; x = warmth; y = useful in
toothache.

    x_{1}m'_{0} + m'y_{0}

No Conclusion. [Fallacy of Like Eliminands not asserted to exist.]

33. No bankrupts are rich;
    Some merchants are not bankrupts.
      Some merchants are rich.

Univ. "persons"; m = bankrupts; x = rich; y = merchants.

    mx_{0} + ym'_{1}

No Conclusion. [Fallacy of Unlike Eliminands with an Entity-Premiss.]

34. Bores are dreaded;
    No bore is ever begged to prolong his visit.
      No one, who is dreaded, is ever begged to prolong his visit.

Univ. "persons"; m = bores; x = dreaded; y = begged to prolong their
visits.

    m_{1}x'_{0} + my_{0} ¶ xy'_{1} [Fig. III.

Conclusion wrong: the right one is "Some dreaded persons are not begged
to prolong their visits."

35. All wise men walk on their feet;
    All unwise men walk on their hands.
      No man walks on both.

Univ. "men"; m = wise; x = walking on their feet; y = walking on their
hands.

    m_{1}x'_{0} + m'_{1}y'_{0} ¶ x'y'_{0} [Fig. I.

Conclusion wrong: right one is "No man walks on neither."
                                                                   pg155
36. No wheelbarrows are comfortable;
    No uncomfortable vehicles are popular.
      No wheelbarrows are popular.

Univ. "vehicles"; m = comfortable; x = wheelbarrows; y = popular.

    xm_{0} + m'x_{0} ¶ xy_{0} [Fig. I.

Conclusion right.

37. No frogs are poetical;
    Some ducks are unpoetical.
      Some ducks are not frogs.

Univ. "creatures"; m = poetical; x = frogs; y = ducks.

    xm_{0} + ym'_{1}

No Conclusion. [Fallacy of Unlike Eliminands with an Entity-Premiss.]

38. No emperors are dentists;
    All dentists are dreaded by children.
      No emperors are dreaded by children.

Univ. "persons"; m = dentists; x = emperors; y = dreaded by children.

    xm_{0} + m_{1}y'_{0} ¶ x'y_{1} [Fig. III.

Conclusion wrong: right one is "Some persons, dreaded by children, are
not emperors."

39. Sugar is sweet;
    Salt is not sweet.
      Salt is not sugar.

Univ. "things"; m = sweet; x = sugar; y = salt.

    x_{1}m'_{0} + y_{1}m_{0} ¶ (x_{1}y_{0} + y_{1}x_{0}) [Fig. I (b).

Conclusion incomplete: omitted portion is "Sugar is not salt."

40. Every eagle can fly;
    Some pigs cannot fly.
      Some pigs are not eagles.

Univ. "creatures"; m = creatures that can fly; x = eagles; y = pigs.

    x_{1}m'_{0} + ym'_{1} ¶ x'y_{1} [Fig. II.

Conclusion right.


_Solutions for § 8._                                               SL8

      1          2              3
 1. cd_{0} + a_{1}d'_{0} + b_{1}c'_{0};

     1    2     3
    cd + ad' + bc' ¶ ab_{0} + a_{1} + b_{1}
    --    =     =

    i.e. ¶ a_{1}b_{0} + b_{1}a_{0}

         1           2        3
 2. d_{1}b'_{0} + ac'_{0} + bc_{0};

     1     3    2
    db' + bc + ac' ¶ da_{0} + d_{1} i.e. ¶ d_{1}a_{0}
     -    =-    =

      1         2           3
 3. ba_{0} + cd'_{0} + d_{1}b'_{0};

     1    3     2
    ba + db' + cd' ¶ ac_{0}
    -    -=     =

      1           2           3
 4. bc_{0} + a_{1}b'_{0} + c'd_{0};

     1    2     3
    bc + ab' + c'd ¶ ad_{0} + a_{1} i.e. ¶ a_{1}d_{0}
    --    =    =
                                                                   pg156
         1          2         3         1     2    3
 5. b'_{1}a_{0} + bc_{0} + a'd_{0};    b'a + bc + a'd ¶ cd_{0}
                                       - -   =    =

        1           2           3
 6. a_{1}b_{0} + b'c_{0} + d_{1}a'_{0};

     1    2     3
    ab + b'c + da' ¶ cd_{0} + d_{1} i.e. ¶ d_{1}c_{0}
    --   =      =

       1           2           3        1     2     3
 7. db'_{0} + b_{1}a'_{0} + cd'_{0};   db' + ba' + cd' ¶ a'c_{0}
                                       --    =      =

       1         2           3
 8. b'd_{0} + a'b_{0} + c_{1}d'_{0};

     1     2     3
    b'd + a'b + cd' ¶ a'c_{0} + c_{1} i.e. ¶ c_{1}a'_{0}
    - -     =    =

       1             2           3
 9. b'_{1}a'_{0} + ad_{0} + b_{1}c'_{0};

     1      2    3
    b'a' + ad + bc' ¶ dc'_{0}
    - -    =    =

      1           2           3
10. cd_{0} + b_{1}c'_{0} + ad'_{0};

     1    2     3
    cd + bc' + ad' ¶ ba_{0} + b_{1} i.e. ¶ b_{1}a_{0}
    --    =     =

      1           2             3
11. bc_{0} + d_{1}a'_{0} + c'_{1}a_{0};

     1    3     2
    bc + c'a + da' ¶ bd_{0} + d_{1} i.e. ¶ d_{1}b_{0}
     -   = -    =

       1           2             3
12. cb'_{0} + c'_{1}d_{0} + b_{1}a'_{0};

     1     2     3
    cb' + c'd + ba' ¶ da'_{0}
    --    =     =

         1             2           3          4
13. d_{1}e'_{0} + c_{1}a'_{0} + bd'_{0} + e_{1}a_{0};

     1     3     4    2
    de' + bd' + ea + ca' ¶ bc_{0} + c_{1} i.e. ¶ c_{1}b_{0}
    --     =    =-    =

         1             2            3             4
14. c_{1}b'_{0} + a_{1}e'_{0} + d_{1}b_{0} + a'_{1}c'_{0};

     1     3    4      2
    cb' + db + a'c' + ae' ¶ de'_{0} + d_{1} i.e. ¶ d_{1}e'_{0}
    --     =   - =    =

       1           2             3             4
15. b'd_{0} + e_{1}c'_{0} + b_{1}a'_{0} + d'_{1}c_{0};

     1     3     4     2
    b'd + ba' + d'c + ec' ¶ a'e_{0} + e_{1} i.e. ¶ e_{1}a'_{0}
    - -   =     = -    =

       1          2             3             4
16. a'e_{0} + d_{1}c_{0} + a_{1}b'_{0} + e'_{1}d'_{0};

     1     3     4      2
    a'e + ab' + e'd' + dc ¶ b'c_{0}
    - -   =     = -    =

         1             2           3          4
17. d_{1}c'_{0} + a_{1}e'_{0} + bd'_{0} + c_{1}e_{0};

     1     3     4    2
    dc' + bd' + ce + ae' ¶ ba_{0} + a_{1} i.e. ¶ a_{1}b_{0}
    --     =    =-    =

         1             2             3          4
18. a_{1}b'_{0} + d_{1}e'_{0} + a'_{1}c_{0} + be_{0};

      1     3     4    2
     ab' + a'c + be + de' ¶ cd_{0} + d_{1} i.e. ¶ d_{1}c_{0}
     --    =     =-    =

      1           2             3          4           5
19. bc_{0} + e_{1}h'_{0} + a_{1}b'_{0} + dh_{0} + e'_{1}c'_{0};

      1    3     5      2     4
     bc + ab' + e'c' + eh' + dh ¶ ad_{0} + a_{1}
     --    =    - =    =-     =

     i.e. ¶ a_{1}d_{0}

      1         2           3           4         5
20. dh'_{0} + ce_{0} + h_{1}b'_{0} + ad'_{0} + be'_{0};

     1     3     4     5     2
    dh' + hb' + ad' + be' + ce ¶ ac_{0}
    --    =-     =    =-     =

         1          2        3         4           5
21. b_{1}a'_{0} + dh_{0} + ce_{0} + ah'_{0} + c'_{1}b'_{0};

      1     4     2     5     3
     ba' + ah' + dh + c'b' + ce ¶ de_{0}
     --    =-     =   - =    =

        1           2            3              4          5
22. e_{1}d_{0} + b'h'_{0} + c'_{1}d'_{0} + a_{1}e'_{0} + ch_{0};

     1     3     4     5     2
    ed + c'd' + ae' + ch + b'h' ¶ ab'_{0} + a_{1}
    --   - =     =    =-     =

    i.e. ¶ a_{1}b_{0}
                                                                   pg157
         1           2          3          4           5
23. b'_{1}a_{0} + de'_{0} + h_{1}b_{0} + ce_{0} + d'_{1}a'_{0};

     1     3     5     2     4
    b'a + hb + d'a' + de' + ce
    - -    =   - =    =-     =

    ¶ hc_{0} + h_{1} i.e. ¶ h_{1}c_{0}

         1           2           3            4           5           6
24. h'_{1}k_{0} + b'a_{0} + c_{1}d'_{0} + e_{1}h_{0} + dk'_{0} + bc'_{0};

     1     4    5     3     6     2
    h'k + eh + dk' + cd' + bc' + b'a ¶ ea_{0} + e_{1}
    - -    =   -=    -=    -=    =

    i.e. ¶ e_{1}a_{0}

         1             2             3           4
25. a_{1}d'_{0} + k_{1}b'_{0} + e_{1}h'_{0} + a'b_{0}

           5             6
    + d_{1}c'_{0} + h_{1}k'_{0};

     1     4     2     5     6     3
    ad' + a'b + kb' + dc' + hk' + eh' ¶ c'e_{0} + e_{1}
    --    = -   -=    =     -=     =

    i.e. ¶ e_{1}c'_{0}

         1            2           3          4           5
26. a'_{1}h'_{0} + d'k'_{0} + e_{1}b_{0} + hk_{0} + a_{1}c'_{0}
         6
    + b'd_{0};

      1     4     2     5     6     3
    a'h' + hk + d'k' + ac' + b'd + eb ¶ c'e_{0} + e_{1}
    - -    =-   - =    =     - =    =

    i.e. ¶ e_{1}c'_{0}

        1          2           3            4           5
27. e_{1}d_{0} + hb_{0} + a'_{1}k'_{0} + ce'_{0} + b'_{1}d'_{0}

         6
    + ac'_{0};

     1    4      5     2    6      3
    ed + ce' + b'd' + hb + ac' + a'k' ¶ hk'_{0}
    --   -=    - =     =   -=    =

       1           2           3         4        5
28. a'k_{0} + e_{1}b'_{0} + hk'_{0} + d'c_{0} + ab_{0}

           6
    + c'_{1}h'_{0};

     1     3     5    2     6      4
    a'k + hk' + ab + eb' + c'h' + d'c ¶ ed'_{0} + e_{1}
    - -   -=    =-    =    - =      =

    i.e. ¶ e_{1}d'_{0}

      1         2         3           4              5
29. ek_{0} + b'm_{0} + ac'_{0} + h'_{1}e'_{0} + d_{1}k'_{0}

        6           7            8
    + cb_{0} + d'_{1}l'_{0} + hm'_{0};

     1     4     5     7      8     2     6    3
    ek + h'e' + dk' + d'l' + hm' + b'm + cb + ac'
    --   - =    -=    =      =-    - =   -=    =

    ¶ l'a_{0}

         1             2            3          4          5
30. n_{1}m'_{0} + a'_{1}e'_{0} + c'l_{0} + k_{1}r_{0} + ah'_{0}

         6         7           8             9            10
    + dl'_{0} + cn'_{0} + e_{1}b'_{0} + m_{1}r'_{0} + h_{1}d'_{0};

     1     7     3     6     9     4   10     5      2     8
    nm' + cn' + c'l + dl' + mr' + kr + hd' + ah' + a'e' + eb'
    --    -=    = -   -=    =-     =   -=    -=    = -    =

    ¶ kb'_{0} + k_{1} i.e. ¶ k_{1}b'_{0}


_Solutions for § 9._                                               SL9

 1.

    1          2           3
b_{1}d_{0} + ac_{0} + d'_{1}c'_{0};

 1     3     2
bd + d'c' + ac ¶ ba_{0} + b_{1}, i.e. ¶ b_{1}a_{0}
 -   = -     =

i.e. Babies cannot manage crocodiles.

 2.

     1             2          3
a_{1}b'_{0} + d_{1}c'_{0} + bc_{0};

 1     3    2
ab' + bc + dc' ¶ ad_{0} + d_{1}, i.e. ¶ d_{1}a_{0}
 -    =-    =

i.e. _Your_ presents to me are not made of tin.
                                                                   pg158
 3.

  1           2           3
da_{0} + c_{1}b'_{0} + a'b_{0};

 1    3     2
da + a'b + cb' ¶ dc_{0} + c_{1}, i.e. ¶ c_{1}d_{0}
 -   = -    =

i.e. All my potatoes in this dish are old ones.

 4.

  1         2           3
ba_{0} + b'd_{0} + c_{1}a'_{0};

 1    2     3
ba + b'd + ca' ¶ dc_{0} + c_{1}, i.e. ¶ c_{1}d_{0}
--   =      =

i.e. My servants never say "shpoonj."

 5.

  1         2           3
ad_{0} + cd'_{0} + b_{1}a'_{0};

 1    2     3
ad + cd' + ba' ¶ cb_{0} + b_{1}, i.e. ¶ b_{1}c_{0}
--    =     =

i.e. My poultry are not officers.

 6.

     1           2        3       1     2     3
c_{1}a'_{0} + c'b_{0} + da_{0};  ca' + c'b + da ¶ bd_{0}
                                 --    =      =

i.e. None of your sons are fit to serve on a jury.

 7.

  1        2           3          1     3     2
cb_{0} + da_{0} + b'_{1}a'_{0};  cb + b'a' + da ¶ cd_{0}
                                  -   = -     =

i.e. No pencils of mine are sugarplums.

 8.

   1           2          3
cb'_{0} + d_{1}a'_{0} + ba_{0};

 1     3    2
cb' + ba + da' ¶ cd_{0} + d_{1}, i.e. ¶ d_{1}c_{0}
 -    =-    =

i.e. Jenkins is inexperienced.

 9.

  1         2         3       1    2     3
cd_{0} + d'a_{0} + c'b_{0};  cd + d'a + c'b ¶ ab_{0}
                             --   =     =

i.e. No comet has a curly tail.

10.

   1        2           3         1     3     2
d'c_{0} + ba_{0} + a'_{1}d_{0};  d'c + a'd + ba ¶ cb_{0}
                                 -     - =    =

i.e. No hedgehog takes in the _Times_.

11.

     1             2          3
b_{1}a'_{0} + c_{1}b'_{0} + ad_{0};

 1     2     3
ba' + cb' + ad ¶ cd_{0} + c_{1}, i.e. ¶ c_{1}d_{0}
--     =    =

i.e. This dish is unwholesome.

12.

     1           2         3
b_{1}c'_{0} + d'a_{0} + a'c_{0};

 1     3     2
bc' + a'c + d'a ¶ bd'_{0} + b_{1}, i.e. ¶ b_{1}d'_{0}
 -    - =     =

i.e. My gardener is very old.

13.

     1          2           3
a_{1}d'_{0} + bc_{0} + c'_{1}d_{0};

 1     3     2
ad' + c'd + bc ¶ ab_{0} + a_{1}, i.e. ¶ a_{1}b_{0}
 -    - =    =

i.e. All humming-birds are small.
                                                                   pg159
14.

   1           2           3       1     3     2
c'b_{0} + a_{1}d'_{0} + ca'_{0};  c'b + ca' + ad' ¶ bd'_{0}
                                  -     =-    =

i.e. No one with a hooked nose ever fails to make money.

15.

     1             2          3       1     2     3
b_{1}a'_{0} + b'_{1}d_{0} + ca_{0};  ba' + b'd + ca ¶ dc_{0}
                                     --    =      =

i.e. No gray ducks in this village wear lace collars.

16.

     1           2        3       1     2     3
d_{1}b'_{0} + cd'_{0} + ba_{0};  db' + cd' + ba ¶ ca_{0}
                                 --     =    =

i.e. No jug in this cupboard will hold water.

17.

     1             2          3
b'_{1}d_{0} + c_{1}d'_{0} + ab_{0};

 1     2     3
b'd + cd' + ab ¶ ca_{0} + c_{1}, i.e. ¶ c_{1}a_{0}
- -    =     =

i.e. These apples were grown in the sun.

18.

     1             2           3
d'_{1}b'_{0} + c_{1}b_{0} + c'a_{0};

  1     2    3
d'b' + cb + c'a ¶ d'a_{0} + d'_{1}, i.e. ¶ d'_{1}a_{0}
  -    -=   =

i.e. Puppies, that will not lie still, never care to do worsted-work.

19.

   1           2           3       1     3     2
bd'_{0} + a_{1}c'_{0} + a'd_{0};  bd' + a'd + ac' ¶ bc'_{0}
                                   -    - =   =

i.e. No name in this list is unmelodious.

20.

     1          2           3          1      3     2
a_{1}b'_{0} + dc_{0} + a'_{1}d'_{0};  ab' + a'd' + dc ¶ b'c_{0}
                                      -     = -    =

i.e. No M.P. should ride in a donkey-race, unless he has perfect
self-command.

21.

  1         2         3       1    3     2
bd_{0} + c'a_{0} + b'c_{0};  bd + b'c + c'a ¶ da_{0}
                             -    = -   =

i.e. No goods in this shop, that are still on sale, may be carried away.

22.

   1        2         3       1     3     2
a'b_{0} + cd_{0} + d'a_{0};  a'b + d'a + cd ¶ bc_{0}
                             -     - =    =

i.e. No acrobatic feat, which involves turning a quadruple somersault,
is ever attempted in a circus.

23.

   1           2          3
dc'_{0} + a_{1}b'_{0} + bc_{0};

 1     3    2
dc' + bc + ab' ¶ da_{0} + a_{1}, i.e. ¶ a_{1}d_{0}
 -    -=    =

i.e. Guinea-pigs never really appreciate Beethoven.
                                                                   pg160
24.

     1             2           3       1     3     2
a_{1}d'_{0} + b'_{1}c_{0} + ba'_{0};  ad' + ba' + b'c ¶ d'c_{0}
                                      -     -=    =

i.e. No scentless flowers please me.

25.

     1           2          3
c_{1}d'_{0} + ba'_{0} + d_{1}a_{0};

 1     3    2
cd' + da + ba' ¶ cb_{0} + c_{1}, i.e. ¶ c_{1}b_{0}
 -    =-    =

i.e. Showy talkers are not really well-informed.

26.

  1           2             3           4
ea_{0} + b_{1}d'_{0} + a'_{1}c_{0} + e'b'_{0};

 1    3      4     2
ea + a'c + e'b' + bd' ¶ cd'_{0}
--   =     = -    =

i.e. None but red-haired boys learn Greek in this school.

27.

    1           2           3             4
b_{1}d_{0} + ac'_{0} + e_{1}d'_{0} + c_{1}b'_{0};

 1    3     4     2
bd + ed' + cb' + ac' ¶ ea_{0} + e_{1}, i.e. ¶ e_{1}a_{0}
--    =    -=     =

i.e. Wedding-cake always disagrees with me.

28.

  1           2              3             4
ad_{0} + e'_{1}b'_{0} + c_{1}d'_{0} + e_{1}a'_{0};

 1    3     4     2
ad + cd' + ea' + e'b' ¶ cb'_{0} + c_{1}, i.e. ¶ c_{1}b'_{0}
--    =    -=    =

i.e. Discussions, that go on while Tomkins is in the chair, endanger the
peacefulness of our Debating-Club.

29.

    1           2           3           4
d_{1}a_{0} + e'c_{0} + b_{1}a'_{0} + d'e_{0};

 1    3     4     2
da + ba' + d'e + e'c ¶ bc_{0} + b_{1}, i.e. ¶ b_{1}c_{0}
--    =    = -   =

i.e. All gluttons in my family are unhealthy.

30.

    1           2           3             4
d_{1}e_{0} + c'a_{0} + b_{1}e'_{0} + c_{1}d'_{0};

 1    3     4     2
de + be' + cd' + c'a ¶ ba_{0} + b_{1}, i.e. ¶ b_{1}a_{0}
--    =    -=    =

i.e. An egg of the Great Auk is not to be had for a song.

31.

   1           2             3           4
d'b_{0} + a_{1}c'_{0} + c_{1}e'_{0} + a'd_{0};

 1     4     2     3
d'b + a'd + ac' + ce' ¶ be'_{0}
-     - =   =-    =

i.e. No books sold here have gilt edges unless they are priced at 5s.
and upwards.

32.

     1             2             3             4
a'_{1}c'_{0} + d_{1}b_{0} + a_{1}e'_{0} + c_{1}b'_{0};

 1      3     4     2
a'c' + ae' + cb' + db ¶ e'd_{0} + d_{1}, i.e. ¶ d_{1}e'_{0}
- -    =     =-     =

i.e. When you cut your finger, you will find Tincture of Calendula
useful.

33.

   1           2          3           4
d'b_{0} + a_{1}e'_{0} + ec_{0} + d_{1}a'_{0};

 1     4     2     3
d'b + da' + ae' + ec ¶ bc_{0}
-     =-    =-    =

i.e. _I_ have never come across a mermaid at sea.
                                                                   pg161
34.

     1             2             3             4
c'_{1}b_{0} + a_{1}e'_{0} + d_{1}b'_{0} + a'_{1}c_{0};

 1     3     4     2
c'b + db' + a'c + ae' ¶ de'_{0} + d_{1}, i.e. ¶ d_{1}e'_{0}
- -    =    - =   =

i.e. All the romances in this library are well-written.

35.

   1         2        3         4
e'd_{0} + c'a_{0} + eb_{0} + d'c_{0};

 1     3    4     2
e'd + eb + d'c + c'a ¶ ba_{0}
- -   =    = -   =

i.e. No bird in this aviary lives on mince-pies.

36.

     1              2            3           4
d'_{1}c'_{0} + e_{1}a'_{0} + c_{1}b_{0} + e'd_{0};

  1     3    4     2
d'c' + cb + e'd + ea' ¶ ba'_{0}
- -    =    - =   =

i.e. No plum-pudding, that has not been boiled in a cloth, can be
distinguished from soup.

37.

   1         2            3          4        5
ce'_{0} + b'a'_{0} + h_{1}d'_{0} + ae_{0} + bd_{0};

 1     4     2     5    3
ce' + ae + b'a' + bd + hd' ¶ ch_{0} + h_{1}, i.e. ¶ h_{1}c_{0}
 -    -=   - =    =-    =

i.e. All _your_ poems are uninteresting.

38.

     1           2         3        4           5
b'_{1}a'_{0} + db_{0} + he'_{0} + ec_{0} + a_{1}h'_{0};

  1     2    5     3     4
b'a' + db + ah' + he' + ec ¶ dc_{0}
- -     =   =-    =-    =

i.e. None of my peaches have been grown in a hothouse.

39.

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

 1     3     5     2     4
cd + c'a' + ed' + he' + h'b ¶ a'b_{0}
--   =      -=    -=    =

i.e. No pawnbroker is dishonest.

40.

   1         2           3          4         5
bd'_{0} + c'h_{0} + e_{1}b'_{0} + da_{0} + e'c_{0};

 1     3     4    5     2
bd' + eb' + da + e'c + c'h ¶ ah_{0}
--    -=    =    = -   =

i.e. No kitten with green eyes will play with a gorilla.

41.

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

 1     3    4     5     2
ca' + ae + dc' + he' + h'b ¶ db_{0} + d_{1}, i.e. ¶ d_{1}b_{0}
--    =-    =    -=    =

i.e. All _my_ friends in this College dine at the lower table.

42.

  1           2             3            4           5
ca_{0} + h_{1}d'_{0} + c'_{1}e'_{0} + b'a'_{0} + d_{1}e_{0};

 1    3       4     5    2
ca + c'e' + b'a' + de + hd' ¶ b'h_{0} + h_{1},
--   = -      =    -=    =

i.e. ¶ h_{1}b'_{0}

i.e. My writing-desk is full of live scorpions.

43.

    1           2        3           4            5
b'_{1}e_{0} + ah_{0} + dc_{0} + e'_{1}a'_{0} + bc'_{0}

 1     4      2    5     3
b'e + e'a' + ah + bc' + dc ¶ hd_{0}
- -   = -    =    =-     =

i.e. No Mandarin ever reads Hogg's poems.
                                                                   pg162
44.

     1           2           3           4         5
e_{1}b'_{0} + a'd_{0} + c_{1}h'_{0} + e'a_{0} + d'h_{0};

 1     4     2     5     3
eb' + e'a + a'd + d'h + ch' ¶ b'c_{0} + c_{1},
-     = -   = -   = -    =

i.e. ¶ c_{1}b'_{0}

i.e. Shakespeare was clever.

45.

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

 1      4     3    5    2
e'c' + ea' + da + cb + hb' ¶ dh_{0} + d_{1}, i.e. ¶ d_{1}h_{0}
- -    =-     =   =-    =

i.e. Rainbows are not worth writing odes to.

46.

     1             2          3           4           5
c'_{1}h'_{0} + e_{1}a_{0} + bd_{0} + a'_{1}h_{0} + d'c_{0};

  1     4     2    5     3
c'h' + a'h + ea + d'c + bd ¶ eb_{0} + e_{1}, i.e. ¶ e_{1}b_{0}
- -    - =    =   - =    =

i.e. These Sorites-examples are difficult.

47.

     1           2         3         4           5           6
a'_{1}e'_{0} + bk_{0} + c'a_{0} + eh'_{0} + d_{1}b'_{0} + k'h_{0};

  1     3     4     6     2    5
a'e' + c'a + eh' + k'h + bk + db' ¶ c'd_{0} + d_{1},
- -      =   =-    - =   -=    =

i.e. ¶ d_{1}c'_{0}

i.e. All my dreams come true.

48.

   1         2           3             4             5             6
a'h_{0} + c'k_{0} + a_{1}d'_{0} + e_{1}h'_{0} + b_{1}k'_{0} + c_{1}e'_{0};

 1     3     4     6     2     5
a'h + ad' + eh' + ce' + c'k + bk' ¶ d'b_{0} + b_{1},
- -   =     -=    -=    = -    =

i.e. ¶ b_{1}d'_{0}

i.e. All the English pictures here are painted in oils.

49.

     1            2             3          4         5           6
k'_{1}e_{0} + c_{1}h_{0} + b_{1}a'_{0} + kd_{0} + h'a_{0} + b'_{1}e'_{0};

 1     4     6     3     5     2
k'e + kd + b'e' + ba' + h'a + ch ¶ dc_{0} + c_{1},
- -   =    - =    =-    - =    =

i.e. ¶ c_{1}d_{0}

i.e. Donkeys are not easy to swallow.

50.

   1         2          3             4           5           6
ab'_{0} + h'd_{0} + e_{1}c_{0} + b_{1}d'_{0} + a'k_{0} + c'_{1}h_{0};

 1     4     2     5     6     3
ab' + bd' + h'd + a'k + c'h + ec ¶ ke_{0} + e_{1},
--    =-    - =   =     - =    =

i.e. ¶ e_{1}k_{0}

i.e. Opium-eaters never wear white kid gloves.

51.

  1           2          3           4           5            6
bc_{0} + k_{1}a'_{0} + eh_{0} + d_{1}b'_{0} + h'c'_{0} + k'_{1}e'_{0};

 1    4      5     3     6     2
bc + db' + h'c' + eh + k'e' + ka' ¶ da'_{0} + d_{1},
--    =    - =    -=   - =    =

i.e. ¶ d_{1}a'_{0}

i.e. A good husband always comes home for his tea.

52.

     1           2         3           4          5           6
a'_{1}k'_{0} + ch_{0} + h'k_{0} + b_{1}d'_{0} + ea_{0} + d_{1}c'_{0}

  1     3     2    6     4     5
a'k' + h'k + ch + dc' + bd' + ea ¶ be_{0} + b_{1},
- -    - =   -=   -=     =     =

i.e. ¶ b_{1}e_{0}

i.e. Bathing-machines are never made of mother-of-pearl.
                                                                   pg163
53.

   1           2            3             4              5
da'_{0} + k_{1}b'_{0} + c_{1}h_{0} + d'_{1}k'_{0} + e_{1}c'_{0}

       6
+ a_{1}h'_{0};

 1      4     2     6     3    5
da' + d'k' + kb' + ah' + ch + ec'
--    = -    =     =-    -=    =

¶ b'e_{0} + e_{1}, i.e. ¶ e_{1}b'_{0}

i.e. Rainy days are always cloudy.

54.

   1           2            3           4           5          6
kb'_{0} + a'_{1}c'_{0} + d'b_{0} + k'_{1}h'_{0} + ea_{0} + d_{1}c_{0};

 1     3      4     6     2     5
kb' + d'b + k'h' + dc + a'c' + ea
--    - =   =      =-   - =     =

¶ h'e_{0}

i.e. No heavy fish is unkind to children.

55.

     1            2         3        4        5         6
k'_{1}b'_{0} + eh'_{0} + c'd_{0} + hb_{0} + ac_{0} + kd'_{0};

  1     4    2     6     3     5
k'b' + hb + eh' + kd' + c'd + ac ¶ ea_{0}
- -    -=    =    =-    - =    =

i.e. No engine-driver lives on barley-sugar.

56.

     1             2           3           4             5
h_{1}b'_{0} + c_{1}d'_{0} + k'a_{0} + e_{1}h'_{0} + b_{1}a'_{0}

       6
+ k_{1}c'_{0};

 1     4     5     3     6     2
hb' + eh' + ba' + k'a + kc' + cd'
--     =    =-    - =   =-    =

¶ ed'_{0} + e_{1}, i.e. ¶ e_{1}d'_{0}

i.e. All the animals in the yard gnaw bones.

57.

     1              2           3        4           5           6
h'_{1}d'_{0} + e_{1}c'_{0} + k'a_{0} + cb_{0} + d_{1}l'_{0} + e'h_{0}

    7
+ kl_{0};

  1     5     7    3     6     2     4
h'd' + dl' + kl + k'a + e'h + ec' + cb ¶ ab_{0}
- -    =-    -=   =     - =   =-    =

i.e. No badger can guess a conundrum.

58.

   1           2           3           4             5            6
b'h_{0} + d'_{1}l'_{0} + ca_{0} + d_{1}k'_{0} + h'_{1}e'_{0} + mc'_{0}

     7        8
+ a'b_{0} + ek_{0};

 1     5      7     3    6     8    4      2
b'h + h'e' + a'b + ca + mc' + ek + dk' + d'l' ¶ ml'_{0}
- -   = -    - =   -=    =    =-   -=    =

i.e. No cheque of yours, received by me, is payable to order.

59.

     1           2        3         4           5              6
c_{1}l'_{0} + h'e_{0} + kd_{0} + mc'_{0} + b'_{1}e'_{0} + n_{1}a'_{0}

       7           8        9
+ l_{1}d'_{0} + m'b_{0} + ah_{0};

 1     4     7     3    8      5     2     9    6
cl' + mc' + ld' + kd + m'b + b'e' + h'e + ah + na'
--    -=    =-     =   = -   = -    - =   -=    =

¶ kn_{0}

i.e. I cannot read any of Brown's letters.

60.

     1             2             3           4         5         6
e_{1}c'_{0} + l_{1}n'_{0} + d_{1}a'_{0} + m'b_{0} + ck'_{0} + e'r_{0}

      7           8           9             10
+ h_{1}n_{0} + b'k_{0} + r'_{1}d'_{0} + m_{1}l'_{0};

 1     5     6     8     4     9      3    10     2     7
ec' + ck' + e'r + b'k + m'b + r'd' + da' + ml' + ln' + hn
--    =-    = -   - =   - =   = -    =     =-    =-     =

¶ a'h_{0} + h_{1}, i.e. ¶ h_{1}a'_{0}

i.e. I always avoid a kangaroo.

                                                                   pg164


NOTES.

(A) [See p. 80].


One of the favourite objections, brought against the Science of Logic by
its detractors, is that a Syllogism has no real validity as an argument,
since it involves the Fallacy of _Petitio Principii_ (i.e. "Begging the
Question", the essence of which is that the whole Conclusion is involved
in _one_ of the Premisses).

This formidable objection is refuted, with beautiful clearness and
simplicity, by these three Diagrams, which show us that, in each of the
three Figures, the Conclusion is really involved in the _two_ Premisses
taken together, each contributing its share.

Thus, in Fig. I., the Premiss xm_{0} empties the _Inner_ Cell of the
N.W. Quarter, while the Premiss ym_{0} empties its _Outer_ Cell. Hence
it needs the _two_ Premisses to empty the _whole_ of the N.W. Quarter,
and thus to prove the Conclusion xy_{0}.

Again, in Fig. II., the Premiss xm_{0} empties the Inner Cell of the
N.W. Quarter. The Premiss ym_{1} merely tells us that the Inner Portion
of the W. Half is _occupied_, so that we may place a 'I' in it,
_somewhere_; but, if this were the _whole_ of our information, we should
not know in _which_ Cell to place it, so that it would have to 'sit on
the fence': it is only when we learn, from the other Premiss, that the
_upper_ of these two Cells is _empty_, that we feel authorised to place
the 'I' in the _lower_ Cell, and thus to prove the Conclusion x'y_{1}.

Lastly, in Fig. III., the information, that m _exists_, merely
authorises us to place a 'I' _somewhere_ in the Inner Square----but it
has large choice of fences to sit upon! It needs the Premiss xm_{0} to
drive it out of the N. Half of that Square; and it needs the Premiss
ym_{0} to drive it out of the W. Half. Hence it needs the _two_
Premisses to drive it into the Inner Portion of the S.E. Quarter, and
thus to prove the Conclusion x'y'_{1}.

                                                                   pg165


APPENDIX,

ADDRESSED TO TEACHERS.


§ 1.

_Introductory._


There are several matters, too hard to discuss with _Learners_, which
nevertheless need to be explained to any _Teachers_, into whose hands
this book may fall, in order that they may thoroughly understand what my
Symbolic Method _is_, and in what respects it differs from the many
other Methods already published.

These matters are as follows:--

    The "Existential Import" of Propositions.
    The use of "is-not" (or "are-not") as a Copula.
    The theory "two Negative Premisses prove nothing."
    Euler's Method of Diagrams.
    Venn's Method of Diagrams.
    My Method of Diagrams.
    The Solution of a Syllogism by various Methods.
    My Method of treating Syllogisms and Sorites.
    Some account of Parts II, III.


§ 2.

_The "Existential Import" of Propositions._


The writers, and editors, of the Logical text-books which run in the
ordinary grooves----to whom I shall hereafter refer by the (I hope
inoffensive) title "The Logicians"----take, on this subject, what seems
to me to be a more humble position than is at all necessary. They speak
of the Copula of a Proposition "with bated breath", almost as if it were
a living, conscious Entity, capable of declaring for itself what it
chose to mean, and that we, poor human creatures, had nothing to do but
to ascertain _what_ was its sovereign will and pleasure, and submit to
it.
                                                                   pg166
In opposition to this view, I maintain that any writer of a book is
fully authorised in attaching any meaning he likes to any word or phrase
he intends to use. If I find an author saying, at the beginning of his
book, "Let it be understood that by the word '_black_' I shall always
mean '_white_', and that by the word '_white_' I shall always mean
'_black_'," I meekly accept his ruling, however injudicious I may think
it.

And so, with regard to the question whether a Proposition is or is not
to be understood as asserting the existence of its Subject, I maintain
that every writer may adopt his own rule, provided of course that it is
consistent with itself and with the accepted facts of Logic.

Let us consider certain views that may _logically_ be held, and thus
settle which of them may _conveniently_ be held; after which I shall
hold myself free to declare which of them _I_ intend to hold.

The _kinds_ of Propositions, to be considered, are those that begin with
"some", with "no", and with "all". These are usually called Propositions
"in _I_", "in _E_", and "in _A_".

First, then, a Proposition in _I_ may be understood as asserting, or
else as _not_ asserting, the existence of its Subject. (By "existence" I
mean of course whatever kind of existence suits its nature. The two
Propositions, "_dreams_ exist" and "_drums_ exist", denote two totally
different kinds of "existence". A _dream_ is an aggregate of ideas, and
exists only in the _mind of a dreamer_: whereas a _drum_ is an aggregate
of wood and parchment, and exists in _the hands of a drummer_.)

First, let us suppose that _I_ "asserts" (i.e. "asserts the existence of
its Subject").

Here, of course, we must regard a Proposition in _A_ as making the
_same_ assertion, since it necessarily _contains_ a Proposition in _I_.

We now have _I_ and _A_ "asserting". Does this leave us free to make
what supposition we choose as to _E_? My answer is "No. We are tied down
to the supposition that _E_ does _not_ assert." This can be proved as
follows:--

If possible, let _E_ "assert". Then (taking x, y, and z to represent
Attributes) we see that, if the Proposition "No xy are z" be true, some
things exist with the Attributes x and y: i.e. "Some x are y."
                                                                   pg167
Also we know that, if the Proposition "Some xy are z" be true, the same
result follows.

But these two Propositions are Contradictories, so that one or other of
them _must_ be true. Hence this result is _always_ true: i.e. the
Proposition "Some x are y" is _always_ true!

_Quod est absurdum._ (See Note (A), p. 195).

We see, then, that the supposition "_I_ asserts" necessarily leads to
"_A_ asserts, but _E_ does not". And this is the _first_ of the various
views that may conceivably be held.

Next, let us suppose that _I_ does _not_ "assert." And, along with this,
let us take the supposition that _E_ _does_ "assert."

Hence the Proposition "No x are y" means "Some x exist, and none of them
are y": i.e. "_all_ of them are _not_-y," which is a Proposition in _A_.
We also know, of course, that the Proposition "All x are not-y" proves
"No x are y." Now two Propositions, each of which proves the other, are
_equivalent_. Hence every Proposition in _A_ is equivalent to one in
_E_, and therefore "_asserts_".

Hence our _second_ conceivable view is "_E_ and _A_ assert, but _I_ does
not."

This view does not seen to involve any necessary contradiction with
itself or with the accepted facts of Logic. But, when we come to _test_
it, as applied to the actual _facts_ of life, we shall find I think,
that it fits in with them so badly that its adoption would be, to say
the least of it, singularly inconvenient for ordinary folk.

Let me record a little dialogue I have just held with my friend Jones,
who is trying to form a new Club, to be regulated on strictly _Logical_
principles.

_Author._ "Well, Jones! Have you got your new Club started yet?"

_Jones_ (_rubbing his hands_). "You'll be glad to hear that some of the
Members (mind, I only say '_some_') are millionaires! Rolling in gold,
my boy!"

_Author._ "That sounds well. And how many Members have entered?"

_Jones_ (_staring_). "None at all. We haven't got it started yet. What
makes you think we have?"

_Author._ "Why, I thought you said that some of the Members----"
                                                                   pg168
_Jones_ (_contemptuously_). "You don't seem to be aware that we're
working on strictly _Logical_ principles. A _Particular_ Proposition
does _not_ assert the existence of its Subject. I merely meant to say
that we've made a Rule not to admit _any_ Members till we have at least
_three_ Candidates whose incomes are over ten thousand a year!"

_Author._ "Oh, _that's_ what you meant, is it? Let's hear some more of
your Rules."

_Jones._ "Another is, that no one, who has been convicted seven times of
forgery, is admissible."

_Author._ "And here, again, I suppose you don't mean to assert there
_are_ any such convicts in existence?"

_Jones._ "Why, that's exactly what I _do_ mean to assert! Don't you know
that a Universal Negative _asserts_ the existence of its Subject? _Of
course_ we didn't make that Rule till we had satisfied ourselves that
there are several such convicts now living."

The Reader can now decide for himself how far this _second_ conceivable
view would fit in with the facts of life. He will, I think, agree with
me that Jones' view, of the 'Existential Import' of Propositions, would
lead to some inconvenience.

Thirdly, let us suppose that neither _I_ nor _E_ "asserts".

Now the supposition that the two Propositions, "Some x are y" and "No x
are not-y", do _not_ "assert", necessarily involves the supposition that
"All x are y" does _not_ "assert", since it would be absurd to suppose
that they assert, when combined, more than they do when taken
separately.

Hence the _third_ (and last) of the conceivable views is that neither
_I_, nor _E_, nor _A_, "asserts".

The advocates of this third view would interpret the Proposition "Some x
are y" to mean "If there _were_ any x in existence, some of them _would_
be y"; and so with _E_ and _A_.

It admits of proof that this view, as regards _A_, conflicts with the
accepted facts of Logic.

Let us take the Syllogism _Darapti_, which is universally accepted as
valid. Its form is

    "All m are x;
     All m are y.
         .'. Some y are x".
                                                                   pg169
This they would interpret as follows:--

    "If there were any m in existence, all of them would be x;
     If there were any m in existence, all of them would be y.
         .'. If there were any y in existence, some of them
               would be x".

That this Conclusion does _not_ follow has been so briefly and clearly
explained by Mr. Keynes (in his "Formal Logic", dated 1894, pp. 356,
357), that I prefer to quote his words:--

"_Let no proposition imply the existence either of its subject or of its
predicate._

"Take, as an example, a syllogism in _Darapti_:--

    '_All M is P_,
     _All M is S_,
          _.'. Some S is P_.'

"Taking S, M, P, as the minor, middle, and major terms respectively, the
conclusion will imply that, if there is an S, there is some P. Will the
premisses also imply this? If so, then the syllogism is valid; but not
otherwise.

"The conclusion implies that if S exists P exists; but, consistently
with the premisses, S may be existent while M and P are both
non-existent. An implication is, therefore, contained in the conclusion,
which is not justified by the premisses."

This seems to _me_ entirely clear and convincing. Still, "to make
sicker", I may as well throw the above (_soi-disant_) Syllogism into a
concrete form, which will be within the grasp of even a _non_-logical
Reader.

Let us suppose that a Boys' School has been set up, with the following
system of Rules:--

"All boys in the First (the highest) Class are to do French, Greek, and
Latin. All in the Second Class are to do Greek only. All in the Third
Class are to do Latin only."

Suppose also that there _are_ boys in the Third Class, and in the
Second; but that no boy has yet risen into the First.

It is evident that there are no boys in the School doing French: still
we know, by the Rules, what would happen if there _were_ any.
                                                                   pg170
We are authorised, then, by the _Data_, to assert the following two
Propositions:--

    "If there were any boys doing French, all of them would
       be doing Greek;
     If there were any boys doing French, all of them would
       be doing Latin."

And the Conclusion, according to "The Logicians" would be

    "If there were any boys doing Latin, some of them would
       be doing Greek."

Here, then, we have two _true_ Premisses and a _false_ Conclusion (since
we know that there _are_ boys doing Latin, and that _none_ of them are
doing Greek). Hence the argument is _invalid_.

Similarly it may be shown that this "non-existential" interpretation
destroys the validity of _Disamis_, _Datisi_, _Felapton_, and
_Fresison_.

Some of "The Logicians" will, no doubt, be ready to reply "But we are
not _Aldrichians_! Why should _we_ be responsible for the validity of
the Syllogisms of so antiquated an author as Aldrich?"

Very good. Then, for the _special_ benefit of these "friends" of mine
(with what ominous emphasis that name is sometimes used! "I must have a
private interview with _you_, my young _friend_," says the bland Dr.
Birch, "in my library, at 9 a.m. tomorrow. And you will please to be
_punctual_!"), for their _special_ benefit, I say, I will produce
_another_ charge against this "non-existential" interpretation.

It actually invalidates the ordinary Process of "Conversion", as applied
to Proposition in '_I_'.

_Every_ logician, Aldrichian or otherwise, accepts it as an established
fact that "Some x are y" may be legitimately converted into "Some y are
x."

But is it equally clear that the Proposition "If there _were_ any x,
some of them _would_ be y" may be legitimately converted into "If there
_were_ any y, some of them would be x"? I trow not.

The example I have already used----of a Boys' School with a non-existent
First Class----will serve admirably to illustrate this new flaw in the
theory of "The Logicians."
                                                                   pg171
Let us suppose that there is yet _another_ Rule in this School, viz. "In
each Class, at the end of the Term, the head boy and the second boy
shall receive prizes."

This Rule entirely authorises us to assert (in the sense in which "The
Logicians" would use the words) "Some boys in the First Class will
receive prizes", for this simply means (according to them) "If there
_were_ any boys in the First Class, some of them _would_ receive
prizes."

Now the Converse of this Proposition is, of course, "Some boys, who will
receive prizes, are in the First Class", which means (according to "The
Logicians") "If there _were_ any boys about to receive prizes, some of
them _would_ be in the First Class" (which Class we know to be _empty_).

Of this Pair of Converse Propositions, the first is undoubtedly _true_:
the second, _as_ undoubtedly, _false_.

It is always sad to see a batsman knock down his own wicket: one pities
him, as a man and a brother, but, as a _cricketer_, one can but
pronounce him "Out!"

We see, then, that, among all the conceivable views we have here
considered, there are only _two_ which can _logically_ be held, viz.

    _I_ and _A_ "assert", but _E_ does not.
    _E_ and _A_ "assert", but _I_ does not.

The _second_ of these I have shown to involve great practical
inconvenience.

The _first_ is the one adopted in this book. (See p. 19.)

Some further remarks on this subject will be found in Note (B), at p.
196.


§ 3.

_The use of "is-not" (or "are-not") as a Copula._


Is it better to say "John _is-not_ in-the-house" or "John _is_
not-in-the-house"? "Some of my acquaintances _are-not_
men-I-should-like-to-be-seen-with" or "Some of my acquaintances _are_
men-I-should-_not_-like-to-be-seen-with"? That is the sort of question
we have now to discuss.
                                                                   pg172
This is no question of Logical Right and Wrong: it is merely a matter of
_taste_, since the two forms mean exactly the same thing. And here,
again, "The Logicians" seem to me to take much too humble a position.
When they are putting the final touches to the grouping of their
Proposition, just before the curtain goes up, and when the
Copula----always a rather fussy 'heavy father', asks them "Am _I_ to
have the 'not', or will you tack it on to the Predicate?" they are much
too ready to answer, like the subtle cab-driver, "Leave it to _you_,
Sir!" The result seems to be, that the grasping Copula constantly gets a
"not" that had better have been merged in the Predicate, and that
Propositions are differentiated which had better have been recognised as
precisely similar. Surely it is simpler to treat "Some men are Jews" and
"Some men are Gentiles" as being both of them, _affirmative_
Propositions, instead of translating the latter into "Some men are-not
Jews", and regarding it as a _negative_ Propositions?

The fact is, "The Logicians" have somehow acquired a perfectly _morbid_
dread of negative Attributes, which makes them shut their eyes, like
frightened children, when they come across such terrible Propositions as
"All not-x are y"; and thus they exclude from their system many very
useful forms of Syllogisms.

Under the influence of this unreasoning terror, they plead that, in
Dichotomy by Contradiction, the _negative_ part is too large to deal
with, so that it is better to regard each Thing as either included in,
or excluded from, the _positive_ part. I see no force in this plea: and
the facts often go the other way. As a personal question, dear Reader,
if _you_ were to group your acquaintances into the two Classes, men that
you _would_ like to be seen with, and men that you would _not_ like to
be seen with, do you think the latter group would be so _very_ much the
larger of the two?

For the purposes of Symbolic Logic, it is so _much_ the most convenient
plan to regard the two sub-divisions, produced by Dichotomy, on the
_same_ footing, and to say, of any Thing, either that it "is" in the
one, or that it "is" in the other, that I do not think any Reader of
this book is likely to demur to my adopting that course.

                                                                   pg173
§ 4.

_The theory that "two Negative Premisses prove nothing"._


This I consider to be _another_ craze of "The Logicians", fully as
morbid as their dread of a negative Attribute.

It is, perhaps, best refuted by the method of _Instantia Contraria_.

Take the following Pairs of Premisses:--

    "None of my boys are conceited;
     None of my girls are greedy".

    "None of my boys are clever;
     None but a clever boy could solve this problem".

    "None of my boys are learned;
     Some of my boys are not choristers".

(This last Proposition is, in _my_ system, an _affirmative_ one, since I
should read it "are not-choristers"; but, in dealing with "The
Logicians," I may fairly treat it as a _negative_ one, since _they_
would read it "are-not choristers".)

If you, dear Reader, declare, after full consideration of these Pairs of
Premisses, that you cannot deduce a Conclusion from _any_ of
them----why, all I can say is that, like the Duke in Patience, you "will
have to be contented with our heart-felt sympathy"! [See Note (C), p.
196.]


§ 5.

_Euler's Method of Diagrams._


Diagrams seem to have been used, at first, to represent _Propositions_
only. In Euler's well-known Circles, each was supposed to contain a
class, and the Diagram consisted of two circles, which exhibited the
relations, as to inclusion and exclusion, existing between the two
Classes.

        _____
      _/ ___ \_
     /  / y \  \
    |   \___/   |
     \_   x   _/
       \_____/

Thus, the Diagram, here given, exhibits the two Classes, whose
respective Attributes are x and y, as so related to each other that the
following Propositions are all simultaneously true:--"All x are y", "No
x are not-y", "Some x are y", "Some y are not-x", "Some not-y are
not-x", and, of course, the Converses of the last four.
                                                                   pg174
        _____
      _/ ___ \_
     /  / y \  \
    |   \___/   |
     \_   x   _/
       \_____/

Similarly, with this Diagram, the following Propositions are true:--"All
y are x", "No y are not-x", "Some y are x", "Some x are not-y", "Some
not-x are not-y", and, of course, the Converses of the last four.

        _____           _____
      _/     \_       _/     \_
     /         \     /         \
    |     x     |   |     y     |
     \_       _/     \_       _/
       \_____/         \_____/

Similarly, with this Diagram, the following are true:--"All x are
not-y", "All y are not-x", "No x are y", "Some x are not-y", "Some y are
not-x", "Some not-x are not-y", and the Converses of the last four.

        _____   _____
      _/     \_/     \_
     /       / \       \
    |     x |   | y     |
     \_      \_/      _/
       \_____/ \_____/

Similarly, with this Diagram, the following are true:--"Some x are y",
"Some x are not-y", "Some not-x are y", "Some not-x are not-y", and of
course, their four Converses.

Note that _all_ Euler's Diagrams assert "Some not-x are not-y."
Apparently it never occured to him that it might _sometimes_ fail to be
true!

Now, to represent "All x are y", the _first_ of these Diagrams would
suffice. Similarly, to represent "No x are y", the _third_ would
suffice. But to represent any _Particular_ Proposition, at least _three_
Diagrams would be needed (in order to include all the possible cases),
and, for "Some not-x are not-y", all the _four_.


§ 6.

_Venn's Method of Diagrams._


Let us represent "not-x" by "x'".

Mr. Venn's Method of Diagrams is a great advance on the above Method.

He uses the last of the above Diagrams to represent _any_ desired
relation between x and y, by simply shading a Compartment known to be
_empty_, and placing a + in one known to be _occupied_.

Thus, he would represent the three Propositions "Some x are y", "No x
are y", and "All x are y", as follows:--

        _____   _____
      _/     \_/     \_
     /       / \       \
    |       | + |       |
     \_      \_/      _/
       \_____/ \_____/

        _____   _____
      _/     \_/     \_
     /       /#\       \
    |       |###|       |
     \_      \#/      _/
       \_____/ \_____/

        _____   _____
      _/#####\_/     \_
     /#######/ \       \
    |#######| + |       |
     \#######\_/      _/
       \#####/ \_____/
                                                                   pg175
It will be seen that, of the _four_ Classes, whose peculiar Sets of
Attributes are xy, xy', x'y, and x'y', only _three_ are here provided
with closed Compartments, while the _fourth_ is allowed the rest of the
Infinite Plane to range about in!

This arrangement would involve us in very serious trouble, if we ever
attempted to represent "No x' are y'." Mr. Venn _once_ (at p. 281)
encounters this awful task; but evades it, in a quite masterly fashion,
by the simple foot-note "We have not troubled to shade the outside of
this diagram"!

To represent _two_ Propositions (containing a common Term) _together_, a
_three_-letter Diagram is needed. This is the one used by Mr. Venn.

             _____
           _/     \_
         _/___ x ___\_
       _/|    \_/    |\_
      /   \_  / \  _/   \
     |      \|___|/      |
      \_  m   \_/   y  _/
        \_____/ \_____/

Here, again, we have only _seven_ closed Compartments, to accommodate
the _eight_ Classes whose peculiar Sets of Attributes are xym, xym', &c.

"With four terms in request," Mr. Venn says, "the most simple and
symmetrical diagram seems to me that produced by making four ellipses
intersect one another in the desired manner". This, however, provides
only _fifteen_ closed compartments.

         b  ____    ____  c
           /    \  /    \
    a  ___/___   \/   ___\___  d
      /   \   \  /\  /   /   \
     /     \   \/  \/   /     \
     \      \  /\  /\  /      /
      \      \/  \/  \/      /
       \     /\  /\  /\     /
        \    \ \/  \/ /    /
         \    \/\  /\/    /
          \   /\_\/_/\   /
           \__\______/__/

For _five_ letters, "the simplest diagram I can suggest," Mr. Venn says,
"is one like this (the small ellipse in the centre is to be regarded as
a portion of the _outside_ of c; i.e. its four component portions are
inside b and d but are no part of c). It must be admitted that such a
diagram is not quite so simple to draw as one might wish it to be; but
then consider what the alternative is of one undertakes to deal with
five terms and all their combinations--nothing short of the disagreeable
task of writing out, or in some way putting before us, all the 32
combinations involved."

                   b      c      d
                 ______  ____  ______
          ______/_     \/    \/     _\______
      a  /     /  \    /\    /\    /  \     \  e
        /     /    \  /  \  /  \  /    \     \
       /      \     \/    \/    \/     /      \
      /        \    /\    /\    /\    /        \
     /          \  /  \  /  \  /  \  /          \
    |            \/    \/ __ \/    \/            |
    |            /\    /\/  \/\    /\            |
    |           /  \  / /\  /\ \  /  \           |
    |          |    \/ |  \/  | \/    |          |
    |          |    /\ |  /\  | /\    |          |
    |           \  /  \ \/  \/ /  \  /           |
     \           \/    \/\__/\/    \/           /
      \          /\    /\    /\    /\          /
       \        /  \  /  \  /  \  /  \        /
        \      /    \/    \/    \/    \      /
         \     \    /\    /\    /\    /     /
          \     \  /  \  /  \  /  \  /     /
           \     \/    \/    \/    \/     /
            \    /\____/\____/\____/\    /
             \  /                    \  /
              \|                      |/
                \____________________/
                                                                   pg176
This Diagram gives us 31 closed compartments.

For _six_ letters, Mr. Venn suggests that we might use _two_ Diagrams,
like the above, one for the f-part, and the other for the not-f-part, of
all the other combinations. "This", he says, "would give the desired 64
subdivisions." This, however, would only give 62 closed Compartments,
and _one_ infinite area, which the two Classes, a'b'c'd'e'f and
a'b'c'd'e'f', would have to share between them.

Beyond _six_ letters Mr. Venn does not go.


§ 7.

_My Method of Diagrams._


My Method of Diagrams _resembles_ Mr. Venn's, in having separate
Compartments assigned to the various Classes, and in marking these
Compartments as _occupied_ or as _empty_; but it _differs_ from his
Method, in assigning a _closed_ area to the _Universe of Discourse_, so
that the Class which, under Mr. Venn's liberal sway, has been ranging at
will through Infinite Space, is suddenly dismayed to find itself
"cabin'd, cribb'd, confined", in a limited Cell like any other Class!
Also I use _rectilinear_, instead of _curvilinear_, Figures; and I mark
an _occupied_ Cell with a 'I' (meaning that there is at least _one_
Thing in it), and an _empty_ Cell with a 'O' (meaning that there is _no_
Thing in it).

For _two_ letters, I use this Diagram, in which the North Half is
assigned to 'x', the South to 'not-x' (or 'x''), the West to y, and the
East to y'. Thus the N.W. Cell contains the xy-Class, the N.E. Cell the
xy'-Class, and so on.

    ·-------·
    |   |   |
    |---|---|
    |   |   |
    ·-------·

For _three_ letters, I subdivide these four Cells, by drawing an _Inner_
Square, which I assign to m, the _Outer_ Border being assigned to m'. I
thus get _eight_ Cells that are needed to accommodate the eight Classes,
whose peculiar Sets of Attributes are xym, xym', &c.

    ·---------------·
    |       |       |
    |   ·---|---·   |
    |   |   |   |   |
    |---|---|---|---|
    |   |   |   |   |
    |   ·---|---·   |
    |       |       |
    ·---------------·

This last Diagram is the most complex that I use in the _Elementary_
Part of my 'Symbolic Logic.' But I may as well take this opportunity of
describing the more complex ones which will appear in Part II.
                                                                   pg177
For _four_ letters (which I call a, b, c, d) I use this Diagram;
assigning the North Half to a (and of course the _rest_ of the Diagram
to a'), the West Half to b, the Horizontal Oblong to c, and the Upright
Oblong to d. We have now got 16 Cells.

    ·---------------------·
    |          |          |
    |      ·---|---·      |
    |      |   |   |      |
    |  ·---|---|---|---·  |
    |  |   |   |   |   |  |
    |--|---|---|---|---|--|
    |  |   |   |   |   |  |
    |  ·---|---|---|---·  |
    |      |   |   |      |
    |      ·---|---·      |
    |          |          |
    ·---------------------·

For _five_ letters (adding e) I subdivide the 16 Cells of the previous
Diagram by _oblique_ partitions, assigning all the _upper_ portions to
e, and all the _lower_ portions to e'. Here, I admit, we lose the
advantage of having the e-Class all _together_, "in a ring-fence", like
the other 4 Classes. Still, it is very easy to find; and the operation,
of erasing it, is nearly as easy as that of erasing any other Class. We
have now got 32 Cells.

    ·---------------------·
    |    /     |       /  |
    |   /  ·---|---·  /   |
    |  /   | / | / | /    |
    |  ·---|---|---|---·  |
    |  | / | / | / | / |  |
    |--|---|---|---|---|--|
    |  | / | / | / | / |  |
    |  ·---|---|---|---·  |
    |    / | / | / |   /  |
    |   /  ·---|---·  /   |
    |  /       |     /    |
    ·---------------------·

For _six_ letters (adding h, as I avoid _tailed_ letters) I substitute
upright crosses for the oblique partitions, assigning the 4 portions,
into which each of the 16 Cells is thus divided, to the four Classes eh,
eh', e'h, e'h'. We have now got 64 Cells.

    #=============================#
    H     |        H        |     H
    H     |  #=====H=====#  |     H
    H     |  H  |  H  |  H  |     H
    H-----|--H--|--H--|--H--|-----H
    H     |  H  |  H  |  H  |     H
    H  #=====H=====H=====H=====#  H
    H  H  |  H  |  H  |  H  |  H  H
    H  H--|--H--|--H--|--H--|--H  H
    H  H  |  H  |  H  |  H  |  H  H
    H==H=====H=====H=====H=====H--H
    H  H  |  H  |  H  |  H  |  H  H
    H  H--|--H--|--H--|--H--|--H  H
    H  H  |  H  |  H  |  H  |  H  H
    H  #=====H=====H=====H=====#  H
    H     |  H  |  H  |  H  |     H
    H-----|--H--|--H--|--H--|-----H
    H     |  H  |  H  |  H  |     H
    H     |  #=====H=====#  |     H
    H     |        H        |     H
    #=============================#
                                                                   pg178
For _seven_ letters (adding k) I add, to each upright cross, a little
inner square. All these 16 little squares are assigned to the k-Class,
and all outside them to the k'-Class; so that 8 little Cells (into which
each of the 16 Cells is divided) are respectively assigned to the 8
Classes ehk, ehk', &c. We have now got 128 Cells.

    #=====================================================#
    H        |                 H                 |        H
    H        |     #===========H===========#     |        H
    H        |     H     |     H     |     H     |        H
    H     ·--|--·  H  ·--|--·  H  ·--|--·  H  ·--|--·     H
    H     |  |  |  H  |  |  |  H  |  |  |  H  |  |  |     H
    H-----|--|--|--H--|--|--|--H--|--|--|--H--|--|--|-----H
    H     |  |  |  H  |  |  |  H  |  |  |  H  |  |  |     H
    H     ·--|--·  H  ·--|--·  H  ·--|--·  H  ·--|--·     H
    H        |     H     |     H     |     H     |        H
    H  #===========H===========H===========H===========#  H
    H  H     |     H     |     H     |     H     |     H  H
    H  H  ·--|--·  H  ·--|--·  H  ·--|--·  H  ·--|--·  H  H
    H  H  |  |  |  H  |  |  |  H  |  |  |  H  |  |  |  H  H
    H  H--|--|--|--H--|--|--|--H--|--|--|--H--|--|--|--H  H
    H  H  |  |  |  H  |  |  |  H  |  |  |  H  |  |  |  H  H
    H  H  ·--|--·  H  ·--|--·  H  ·--|--·  H  ·--|--·  H  H
    H  H     |     H     |     H     |     H     |     H  H
    H==H===========H===========H===========H===========H==H
    H  H     |     H     |     H     |     H     |     H  H
    H  H  ·--|--·  H  ·--|--·  H  ·--|--·  H  ·--|--·  H  H
    H  H  |  |  |  H  |  |  |  H  |  |  |  H  |  |  |  H  H
    H  H--|--|--|--H--|--|--|--H--|--|--|--H--|--|--|--H  H
    H  H  |  |  |  H  |  |  |  H  |  |  |  H  |  |  |  H  H
    H  H  ·--|--·  H  ·--|--·  H  ·--|--·  H  ·--|--·  H  H
    H  H     |     H     |     H     |     H     |     H  H
    H  #===========H===========H===========H===========#  H
    H        |     H     |     H     |     H     |        H
    H     ·--|--·  H  ·--|--·  H  ·--|--·  H  ·--|--·     H
    H     |  |  |  H  |  |  |  H  |  |  |  H  |  |  |     H
    H-----|--|--|--H--|--|--|--H--|--|--|--H--|--|--|-----H
    H     |  |  |  H  |  |  |  H  |  |  |  H  |  |  |     H
    H     ·--|--·  H  ·--|--·  H  ·--|--·  H  ·--|--·     H
    H        |     H     |     H     |     H     |        H
    H        |     #===========H===========#     |        H
    H        |                 H                 |        H
    ·=====================================================#

For _eight_ letters (adding l) I place, in each of the 16 Cells, a
_lattice_, which is a reduced copy of the whole Diagram; and, just as
the 16 large Cells of the whole Diagram are assigned to the 16 Classes
abcd, abcd', &c., so the 16 little Cells of each lattice are assigned to
the 16 Classes ehkl, ehkl', &c. Thus, the lattice in the N.W. corner
serves to accommodate the 16 Classes abc'd'ehkl, abc'd'eh'kl', &c. This
Octoliteral Diagram (see next page) contains 256 Cells.

For _nine_ letters, I place 2 Octoliteral Diagrams side by side,
assigning one of them to m, and the other to m'. We have now got 512
Cells.
                                                                   pg179
#=====================================================================#
H          |                       H                       |          H
H          |       #===============H===============#       |          H
H          |       H       |       H       |       H       |          H
H       ·--|--·    H    ·--|--·    H    ·--|--·    H    ·--|--·       H
H       |  |  |    H    |  |  |    H    |  |  |    H    |  |  |       H
H    ·--|--|--|--· H ·--|--|--|--· H ·--|--|--|--· H ·--|--|--|--·    H
H    |  |  |  |  | H |  |  |  |  | H |  |  |  |  | H |  |  |  |  |    H
H----|--|--|--|--|-H-|--|--|--|--|-H-|--|--|--|--|-H-|--|--|--|--|----H
H    |  |  |  |  | H |  |  |  |  | H |  |  |  |  | H |  |  |  |  |    H
H    ·--|--|--|--· H ·--|--|--|--· H ·--|--|--|--· H ·--|--|--|--·    H
H       |  |  |    H    |  |  |    H    |  |  |    H    |  |  |       H
H       ·--|--·    H    ·--|--·    H    ·--|--·    H    ·--|--·       H
H          |       H       |       H       |       H       |          H
H  #===============H===============H===============H===============#  H
H  H       |       H       |       H       |       H       |       H  H
H  H    ·--|--·    H    ·--|--·    H    ·--|--·    H    ·--|--·    H  H
H  H    |  |  |    H    |  |  |    H    |  |  |    H    |  |  |    H  H
H  H ·--|--|--|--· H ·--|--|--|--· H ·--|--|--|--· H ·--|--|--|--· H  H
H  H |  |  |  |  | H |  |  |  |  | H |  |  |  |  | H |  |  |  |  | H  H
H  H-|--|--|--|--|-H-|--|--|--|--|-H-|--|--|--|--|-H-|--|--|--|--|-H  H
H  H |  |  |  |  | H |  |  |  |  | H |  |  |  |  | H |  |  |  |  | H  H
H  H ·--|--|--|--· H ·--|--|--|--· H ·--|--|--|--· H ·--|--|--|--· H  H
H  H    |  |  |    H    |  |  |    H    |  |  |    H    |  |  |    H  H
H  H    ·--|--·    H    ·--|--·    H    ·--|--·    H    ·--|--·    H  H
H  H       |       H       |       H       |       H       |       H  H
H==H===============H===============H===============H===============H==H
H  H       |       H       |       H       |       H       |       H  H
H  H    ·--|--·    H    ·--|--·    H    ·--|--·    H    ·--|--·    H  H
H  H    |  |  |    H    |  |  |    H    |  |  |    H    |  |  |    H  H
H  H ·--|--|--|--· H ·--|--|--|--· H ·--|--|--|--· H ·--|--|--|--· H  H
H  H |  |  |  |  | H |  |  |  |  | H |  |  |  |  | H |  |  |  |  | H  H
H  H-|--|--|--|--|-H-|--|--|--|--|-H-|--|--|--|--|-H-|--|--|--|--|-H  H
H  H |  |  |  |  | H |  |  |  |  | H |  |  |  |  | H |  |  |  |  | H  H
H  H ·--|--|--|--· H ·--|--|--|--· H ·--|--|--|--· H ·--|--|--|--· H  H
H  H    |  |  |    H    |  |  |    H    |  |  |    H    |  |  |    H  H
H  H    ·--|--·    H    ·--|--·    H    ·--|--·    H    ·--|--·    H  H
H  H       |       H       |       H       |       H       |       H  H
H  #===============H===============H===============H===============#  H
H          |       H       |       H       |       H       |          H
H       ·--|--·    H    ·--|--·    H    ·--|--·    H    ·--|--·       H
H       |  |  |    H    |  |  |    H    |  |  |    H    |  |  |       H
H    ·--|--|--|--· H ·--|--|--|--· H ·--|--|--|--· H ·--|--|--|--·    H
H    |  |  |  |  | H |  |  |  |  | H |  |  |  |  | H |  |  |  |  |    H
H----|--|--|--|--|-H-|--|--|--|--|-H-|--|--|--|--|-H-|--|--|--|--|----H
H    |  |  |  |  | H |  |  |  |  | H |  |  |  |  | H |  |  |  |  |    H
H    ·--|--|--|--· H ·--|--|--|--· H ·--|--|--|--· H ·--|--|--|--·    H
H       |  |  |    H    |  |  |    H    |  |  |    H    |  |  |       H
H       ·--|--·    H    ·--|--·    H    ·--|--·    H    ·--|--·       H
H          |       H       |       H       |       H       |          H
H          |       #===============H===============#       |          H
H          |                       H                       |          H
#=====================================================================#

Finally, for _ten_ letters, I arrange 4 Octoliteral Diagrams, like the
above, in a square, assigning them to the 4 Classes mn, mn', m'n, m'n'.
We have now got 1024 Cells.


§ 8.

_Solution of a Syllogism by various Methods._


The best way, I think, to exhibit the differences between these various
Methods of solving Syllogisms, will be to take a concrete example, and
solve it by each Method in turn. Let us take, as our example, No. 29
(see p. 102).

    "No philosophers are conceited;
     Some conceited persons are not gamblers.
       .'. Some persons, who are not gamblers, are not philosophers."

                                                                   pg180
(1) _Solution by ordinary Method._

These Premisses, as they stand, will give no Conclusion, as they are
both negative.

If by 'Permutation' or 'Obversion', we write the Minor Premiss thus,

    'Some conceited persons are not-gamblers,'

we can get a Conclusion in _Fresison_, viz.

    "No philosophers are conceited;
     Some conceited persons are not-gamblers.
       .'. Some not-gamblers are not philosophers"

This can be proved by reduction to _Ferio_, thus:--

    "No conceited persons are philosophers;
     Some not-gamblers are conceited.
       .'. Some not-gamblers are not philosophers".

The validity of _Ferio_ follows directly from the Axiom '_De Omni et
Nullo_'.


(2) _Symbolic Representation._

Before proceeding to discuss other Methods of Solution, it is necessary
to translate our Syllogism into an _abstract_ form.

Let us take "persons" as our 'Universe of Discourse'; and let
x = "philosophers", m = "conceited", and y = "gamblers."

Then the Syllogism may be written thus:--

    "No x are m;
     Some m are y'.
       .'. Some y' are x'."


(3) _Solution by Euler's Method of Diagrams._

The Major Premiss requires only _one_ Diagram, viz.

                 1
        _____         _____
      _/     \_     _/     \_
     /         \   /         \
    |     x     | |     m     |
     \_       _/   \_       _/
       \_____/       \_____/
                                                                   pg181
The Minor requires _three_, viz.

                 2
        _____         _____
      _/     \_     _/     \_
     /         \   /         \
    |     y     | |     m     |
     \_       _/   \_       _/
       \_____/       \_____/

              3
        _____   _____
      _/     \_/     \_
     /       / \       \
    |    y  |   |  m    |
     \_      \_/      _/
       \_____/ \_____/

          4
        _____
      _/ ___ \_
     /  / y \  \
    |   \___/   |
     \_   m   _/
       \_____/

The combination of Major and Minor, in every possible way requires
_nine_, viz.

Figs. 1 and 2 give

                        5
        _____         _____         _____
      _/     \_     _/     \_     _/     \_
     /         \   /         \   /         \
    |     x     | |     y     | |     m     |
     \_       _/   \_       _/   \_       _/
       \_____/       \_____/       \_____/

                        6
        _____   _____         _____
      _/     \_/     \_     _/     \_
     /       / \       \   /         \
    |    x  |   |  y    | |     m     |
     \_      \_/      _/   \_       _/
       \_____/ \_____/       \_____/

                 7
        _____         _____
      _/     \_     _/     \_
     /         \   /         \
    |     xy    | |     m     |
     \_       _/   \_       _/
       \_____/       \_____/

                 8
        _____         _____
      _/ ___ \_     _/     \_
     /  / x \  \   /         \
    |   \___/   | |     m     |
     \_   y   _/   \_       _/
       \_____/       \_____/

                 9
        _____         _____
      _/ ___ \_     _/     \_
     /  / y \  \   /         \
    |   \___/   | |     m     |
     \_   x   _/   \_       _/
       \_____/       \_____/

Figs. 1 and 3 give

                   10
        _____         _____   _____
      _/     \_     _/     \_/     \_
     /         \   /       / \       \
    |     x     | |    y  |   |  m    |
     \_       _/   \_      \_/      _/
       \_____/       \_____/ \_____/

                  11
        _____   _____   _____
      _/     \_/     \_/     \_
     /       / \     / \       \
    |    x  |   | y |   | m     |
     \_      \_/     \_/      _/
       \_____/ \_____/ \_____/

             12
        _____   _____
      _/___  \_/     \_
     / / x \ / \       \
    |  \___/|   |  m    |
     \_   y  \_/      _/
       \_____/ \_____/

Figs. 1 and 4 give

                13
        _____         _____
      _/     \_     _/ ___ \_
     /         \   /  / y \  \
    |     x     | |   \___/   |
     \_       _/   \_   m   _/
       \_____/       \_____/

From this group (Figs. 5 to 13) we have, by disregarding m, to find the
relation of x and y. On examination we find that Figs. 5, 10, 13 express
the relation of entire mutual exclusion; that Figs. 6, 11 express
partial inclusion and partial exclusion; that Fig. 7 expresses
coincidence; that Figs. 8, 12 express entire inclusion of x in y; and
that Fig. 9 expresses entire inclusion of y in x.
                                                                   pg182
We thus get five Biliteral Diagrams for x and y, viz.

                14
        _____         _____
      _/     \_     _/     \_
     /         \   /         \
    |     x     | |     y     |
     \_       _/   \_       _/
       \_____/       \_____/

             15
        _____   _____
      _/     \_/     \_
     /       / \       \
    |   x   |   |   y   |
     \_      \_/      _/
       \_____/ \_____/

         16
        _____
      _/     \_
     /         \
    |    xy     |
     \_       _/
       \_____/

         17
        _____
      _/ ___ \_
     /  / x \  \
    |   \___/   |
     \_   y   _/
       \_____/

         18
        _____
      _/ ___ \_
     /  / y \  \
    |   \___/   |
     \_   x   _/
       \_____/

where the only Proposition, represented by them all, is "Some not-y are
not-x," i.e. "Some persons, who are not gamblers, are not
philosophers"----a result which Euler would hardly have regarded as a
_valuable_ one, since he seems to have assumed that a Proposition of
this form is _always_ true!


(4) _Solution by Venn's Method of Diagrams._

The following Solution has been kindly supplied to me Mr. Venn himself.

"The Minor Premiss declares that some of the constituents in my' must be
saved: mark these constituents with a cross.

            _____
          _/  +  \_
        _/___   ___\_
      _/|##+#\_/    |\_
     /   \###/#\  _/   \
    | +    \|_#_|/      |
     \_  m   \_/   y  _/
       \_____/ \_____/

The Major declares that all xm must be destroyed; erase it.

Then, as some my' is to be saved, it must clearly be my'x'. That is,
there must exist my'x'; or eliminating m, y'x'. In common phraseology,

'Some y' are x',' or, 'Some not-gamblers are not-philosophers.'"

                                                                   pg183
(5) _Solution by my Method of Diagrams._

The first Premiss asserts that no xm exist: so we mark the
xm-Compartment as empty, by placing a 'O' in each of its Cells.

The second asserts that some my' exist: so we mark the my'-Compartment
as occupied, by placing a 'I' in its only available Cell.

    ·---------------·
    |       |       |
    |   ·---|---·   |
    |   |(O)|(O)|   |
    |---|---|---|---|
    |   |   |(I)|   |
    |   ·---|---·   |
    |       |       |
    ·---------------·

The only information, that this gives us as to x and y, is that the
x'y'-Compartment is _occupied_, i.e. that some x'y' exist.

Hence "Some x' are y'": i.e. "Some persons, who are not philosophers,
are not gamblers".


(6) _Solution by my Method of Subscripts._

    xm_{0} + my'_{1} ¶ x'y'_{1}

i.e. "Some persons, who are not philosophers, are not gamblers."


§ 9.

_My Method of treating Syllogisms and Sorites._


Of all the strange things, that are to be met with in the ordinary
text-books of Formal Logic, perhaps the strangest is the violent
contrast one finds to exist between their ways of dealing with these two
subjects. While they have elaborately discussed no less than _nineteen_
different forms of _Syllogisms_----each with its own special and
exasperating Rules, while the whole constitute an almost useless
machine, for practical purposes, many of the Conclusions being
incomplete, and many quite legitimate forms being ignored----they have
limited _Sorites_ to _two_ forms only, of childish simplicity; and these
they have dignified with special _names_, apparently under the
impression that no other possible forms existed!

As to _Syllogisms_, I find that their nineteen forms, with about a score
of others which they have ignored, can all be arranged under _three_
forms, each with a very simple Rule of its own; and the only question
the Reader has to settle, in working any one of the 101 Examples given
at p. 101 of this book, is "Does it belong to Fig. I., II., or III.?"
                                                                   pg184
As to _Sorites_, the only two forms, recognised by the text-books, are
the _Aristotelian_, whose Premisses are a series of Propositions in A,
so arranged that the Predicate of each is the Subject of the next, and
the _Goclenian_, whose Premisses are the very same series, written
backwards. Goclenius, it seems, was the first who noticed the startling
fact that it does not affect the force of a Syllogism to invert the
order of its Premisses, and who applied this discovery to a Sorites. If
we assume (as surely we may?) that he is the _same_ man as that
transcendent genius who first noticed that 4 times 5 is the same thing
as 5 times 4, we may apply to him what somebody (Edmund Yates, I think
it was) has said of Tupper, viz., "here is a man who, beyond all others
of his generation, has been favoured with Glimpses of the Obvious!"

These puerile----not to say infantine----forms of a Sorites I have, in
this book, ignored from the very first, and have not only admitted
freely Propositions in _E_, but have purposely stated the Premisses in
random order, leaving to the Reader the useful task of arranging them,
for himself, in an order which can be worked as a series of regular
Syllogisms. In doing this, he can begin with _any one_ of them he likes.

I have tabulated, for curiosity, the various orders in which the
Premisses of the Aristotelian Sorites

    1. All a are b;
    2. All b are c;
    3. All c are d;
    4. All d are e;
    5. All e are h.
       .'. All a are h.

may be syllogistically arranged, and I find there are no less than
_sixteen_ such orders, viz., 12345, 21345, 23145, 23415, 23451, 32145,
32415, 32451, 34215, 34251, 34521, 43215, 43251, 43521, 45321, 54321. Of
these the _first_ and the _last_ have been dignified with names; but the
other _fourteen_----first enumerated by an obscure Writer on Logic,
towards the end of the Nineteenth Century----remain without a name!

                                                                   pg185
§ 10.

_Some account of Parts II, III._


In Part II. will be found some of the matters mentioned in this
Appendix, viz., the "Existential Import" of Propositions, the use of a
_negative_ Copula, and the theory that "two negative Premisses prove
nothing." I shall also extend the range of Syllogisms, by introducing
Propositions containing alternatives (such as "Not-all x are y"),
Propositions containing 3 or more Terms (such as "All ab are c", which,
taken along with "Some bc' are d", would prove "Some d are a'"), &c. I
shall also discuss Sorites containing Entities, and the _very_ puzzling
subjects of Hypotheticals and Dilemmas. I hope, in the course of Part
II., to go over all the ground usually traversed in the text-books used
in our Schools and Universities, and to enable my Readers to solve
Problems of the same kind as, and far harder than, those that are at
present set in their Examinations.

In Part III. I hope to deal with many curious and out-of-the-way
subjects, some of which are not even alluded to in any of the treatises
I have met with. In this Part will be found such matters as the Analysis
of Propositions into their Elements (let the Reader, who has never gone
into this branch of the subject, try to make out for himself what
_additional_ Proposition would be needed to convert "Some a are b" into
"Some a are bc"), the treatment of Numerical and Geometrical Problems,
the construction of Problems, and the solution of Syllogisms and Sorites
containing Propositions more complex than any that I have used in Part
II.

I will conclude with eight Problems, as a taste of what is coming in
Part II. I shall be very glad to receive, from any Reader, who thinks he
has solved any one of them (more especially if he has done so _without_
using any Method of Symbols), what he conceives to be its complete
Conclusion.

It may be well to explain what I mean by the _complete_ Conclusion of a
Syllogism or a Sorites. I distinguish their Terms as being of two
kinds----those which _can_ be eliminated (e.g. the Middle Term of a
Syllogism), which I call the "Eliminands," and those which _cannot_,
which I call the "Retinends"; and I do not call the Conclusion
_complete_, unless it states _all_ the relations among the Retinends
only, which can be deduced from the Premisses.

                                                                   pg186
1.

All the boys, in a certain School, sit together in one large room every
evening. They are of no less than _five_ nationalities----English,
Scotch, Welsh, Irish, and German. One of the Monitors (who is a great
reader of Wilkie Collins' novels) is very observant, and takes MS. notes
of almost everything that happens, with the view of being a good
sensational witness, in case any conspiracy to commit a murder should be
on foot. The following are some of his notes:--

(1) Whenever some of the English boys are singing "Rule Britannia", and
some not, some of the Monitors are wide-awake;

(2) Whenever some of the Scotch are dancing reels, and some of the Irish
fighting, some of the Welsh are eating toasted cheese;

(3) Whenever all the Germans are playing chess, some of the Eleven are
_not_ oiling their bats;

(4) Whenever some of the Monitors are asleep, and some not, some of the
Irish are fighting;

(5) Whenever some of the Germans are playing chess, and none of the
Scotch are dancing reels, some of the Welsh are _not_ eating toasted
cheese;

(6) Whenever some of the Scotch are _not_ dancing reels, and some of the
Irish _not_ fighting, some of the Germans are playing chess;

(7) Whenever some of the Monitors are awake, and some of the Welsh are
eating toasted cheese, none of the Scotch are dancing reels;

(8) Whenever some of the Germans are _not_ playing chess, and some of
the Welsh are _not_ eating toasted cheese, none of the Irish are
fighting;
                                                                   pg187
(9) Whenever all the English are singing "Rule Britannia," and some of
the Scotch are _not_ dancing reels, none of the Germans are playing
chess;

(10) Whenever some of the English are singing "Rule Britannia", and some
of the Monitors are asleep, some of the Irish are _not_ fighting;

(11) Whenever some of the Monitors are awake, and some of the Eleven are
_not_ oiling their bats, some of the Scotch are dancing reels;

(12) Whenever some of the English are singing "Rule Britannia", and some
of the Scotch are _not_ dancing reels, * * * *

Here the MS. breaks off suddenly. The Problem is to complete the
sentence, if possible.

    [N.B. In solving this Problem, it is necessary to remember that
    the Proposition "All x are y" is a _Double_ Proposition, and is
    equivalent to "Some x are y, and none are y'." See p. 17.]


2.

(1) A logician, who eats pork-chops for supper, will probably lose
money;

(2) A gambler, whose appetite is not ravenous, will probably lose money;

(3) A man who is depressed, having lost money and being likely to lose
more, always rises at 5 a.m.;

(4) A man, who neither gambles nor eats pork-chops for supper, is sure
to have a ravenous appetite;

(5) A lively man, who goes to bed before 4 a.m., had better take to
cab-driving;

(6) A man with a ravenous appetite, who has not lost money and does not
rise at 5 a.m., always eats pork-chops for supper;

(7) A logician, who is in danger of losing money, had better take to
cab-driving;

(8) An earnest gambler, who is depressed though he has not lost money,
is in no danger of losing any;

(9) A man, who does not gamble, and whose appetite is not ravenous, is
always lively;
                                                                   pg188
(10) A lively logician, who is really in earnest, is in no danger of
losing money;

(11) A man with a ravenous appetite has no need to take to cab-driving,
if he is really in earnest;

(12) A gambler, who is depressed though in no danger of losing money,
sits up till 4 a.m.

(13) A man, who has lost money and does not eat pork-chops for supper,
had better take to cab-driving, unless he gets up at 5 a.m.

(14) A gambler, who goes to bed before 4 a.m., need not take to
cab-driving, unless he has a ravenous appetite;

(15) A man with a ravenous appetite, who is depressed though in no
danger of losing, is a gambler.

Univ. "men"; a = earnest; b = eating pork-chops for supper;
c = gamblers; d = getting up at 5; e = having lost money; h = having a
ravenous appetite; k = likely to lose money; l = lively; m = logicians;
n = men who had better take to cab-driving; r = sitting up till 4.

    [N.B. In this Problem, clauses, beginning with "though", are
    intended to be treated as _essential_ parts of the Propositions
    in which they occur, just as if they had begun with "and".]


3.

(1) When the day is fine, I tell Froggy "You're quite the dandy, old
chap!";

(2) Whenever I let Froggy forget that £10 he owes me, and he begins to
strut about like a peacock, his mother declares "He shall _not_ go out
a-wooing!";

(3) Now that Froggy's hair is out of curl, he has put away his gorgeous
waistcoat;

(4) Whenever I go out on the roof to enjoy a quiet cigar, I'm sure to
discover that my purse is empty;

(5) When my tailor calls with his little bill, and I remind Froggy of
that £10 he owes me, he does _not_ grin like a hyæna;
                                                                   pg189
(6) When it is very hot, the thermometer is high;

(7) When the day is fine, and I'm not in the humour for a cigar, and
Froggy is grinning like a hyæna, I never venture to hint that he's quite
the dandy;

(8) When my tailor calls with his little bill and finds me with an empty
purse, I remind Froggy of that £10 he owes me;

(9) My railway-shares are going up like anything!

(10) When my purse is empty, and when, noticing that Froggy has got his
gorgeous waistcoat on, I venture to remind him of that £10 he owes me,
things are apt to get rather warm;

(11) Now that it looks like rain, and Froggy is grinning like a hyæna, I
can do without my cigar;

(12) When the thermometer is high, you need not trouble yourself to take
an umbrella;

(13) When Froggy has his gorgeous waistcoat on, but is _not_ strutting
about like a peacock, I betake myself to a quiet cigar;

(14) When I tell Froggy that he's quite the dandy, he grins like a
hyæna;

(15) When my purse is tolerably full, and Froggy's hair is one mass of
curls, and when he is _not_ strutting about like a peacock, I go out on
the roof;

(16) When my railway-shares are going up, and when it is chilly and
looks like rain, I have a quiet cigar;

(17) When Froggy's mother lets him go a-wooing, he seems nearly mad with
joy, and puts on a waistcoat that is gorgeous beyond words;

(18) When it is going to rain, and I am having a quiet cigar, and Froggy
is _not_ intending to go a-wooing, you had better take an umbrella;

(19) When my railway-shares are going up, and Froggy seems nearly mad
with joy, _that_ is the time my tailor always chooses for calling with
his little bill;

(20) When the day is cool and the thermometer low, and I say nothing to
Froggy about his being quite the dandy, and there's not the ghost of a
grin on his face, I haven't the heart for my cigar!

                                                                   pg190
4.

(1) Any one, fit to be an M.P., who is not always speaking, is a public
benefactor;

(2) Clear-headed people, who express themselves well, have had a good
education;

(3) A woman, who deserves praise, is one who can keep a secret;

(4) People, who benefit the public, but do not use their influence for
good purpose, are not fit to go into Parliament;

(5) People, who are worth their weight in gold and who deserve praise,
are always unassuming;

(6) Public benefactors, who use their influence for good objects,
deserve praise;

(7) People, who are unpopular and not worth their weight in gold, never
can keep a secret;

(8) People, who can talk for ever and are fit to be Members of
Parliament, deserve praise;

(9) Any one, who can keep a secret and who is unassuming, is a
never-to-be-forgotten public benefactor;

(10) A woman, who benefits the public, is always popular;

(11) People, who are worth their weight in gold, who never leave off
talking, and whom it is impossible to forget, are just the people whose
photographs are in all the shop-windows;

(12) An ill-educated woman, who is not clear-headed, is not fit to go
into Parliament;

(13) Any one, who can keep a secret and is not for ever talking, is sure
to be unpopular;

(14) A clear-headed person, who has influence and uses it for good
objects, is a public benefactor;

(15) A public benefactor, who is unassuming, is not the sort of person
whose photograph is in every shop-window;

(16) People, who can keep a secret and who use their influence for good
purposes, are worth their weight in gold;

(17) A person, who has no power of expression and who cannot influence
others, is certainly not a _woman_;
                                                                   pg191
(18) People, who are popular and worthy of praise, either are public
benefactors or else are unassuming.

Univ. "persons"; a = able to keep a secret; b = clear-headed;
c = constantly talking; d = deserving praise; e = exhibited in
shop-windows; h = expressing oneself well; k = fit to be an M.P.;
l = influential; m = never-to-be-forgotten; n = popular; r = public
benefactors; s = unassuming; t = using one's influence for good objects;
v = well-educated; w = women; z = worth one's weight in gold.


5.

Six friends, and their six wives, are staying in the same hotel; and
they all walk out daily, in parties of various size and composition. To
ensure variety in these daily walks, they have agree to observe the
following Rules:--

(1) If Acres is with (i.e. is in the same party with) his wife, and
Barry with his, and Eden with Mrs. Hall, Cole must be with Mrs. Dix;

(2) If Acres is with his wife, and Hall with his, and Barry with Mrs.
Cole, Dix must _not_ be with Mrs. Eden;

(3) If Cole and Dix and their wives are all in the same party, and Acres
_not_ with Mrs. Barry, Eden must _not_ be with Mrs. Hall;

(4) If Acres is with his wife, and Dix with his, and Barry _not_ with
Mrs. Cole, Eden must be with Mrs. Hall;

(5) If Eden is with his wife, and Hall with his, and Cole with Mrs. Dix,
Acres must _not_ be with Mrs. Barry;

(6) If Barry and Cole and their wives are all in the same party, and
Eden _not_ with Mrs. Hall, Dix must be with Mrs. Eden.

The Problem is to prove that there must be, every day, at least _one_
married couple who are not in the same party.

                                                                   pg192
6.

After the six friends, named in Problem 5, had returned from their tour,
three of them, Barry, Cole, and Dix, agreed, with two other friends of
theirs, Lang and Mill, that the five should meet, every day, at a
certain _table d'hôte_. Remembering how much amusement they had derived
from their code of rules for walking-parties, they devised the following
rules to be observed whenever beef appeared on the table:--

(1) If Barry takes salt, then either Cole or Lang takes _one_ only of
the two condiments, salt and mustard: if he takes mustard, then either
Dix takes neither condiment, or Mill takes both.

(2) If Cole takes salt, then either Barry takes only _one_ condiment, or
Mill takes neither: if he takes mustard, then either Dix or Lang takes
both.

(3) If Dix takes salt, then either Barry takes neither condiment or Cole
take both: if he takes mustard, then either Lang or Mill takes neither.

(4) If Lang takes salt, then Barry or Dix takes only _one_ condiment: if
he takes mustard, then either Cole or Mill takes neither.

(5) If Mill takes salt, then either Barry or Lang takes both condiments:
if he takes mustard, then either Cole or Dix takes only _one_.

The Problem is to discover whether these rules are _compatible_; and, if
so, what arrangements are possible.

    [N.B. In this Problem, it is assumed that the phrase "if Barry
    takes salt" allows of _two_ possible cases, viz. (1) "he takes
    salt _only_"; (2) "he takes _both_ condiments". And so with all
    similar phrases.

    It is also assumed that the phrase "either Cole or Lang takes
    _one_ only of the two condiments" allows _three_ possible cases,
    viz. (1) "Cole takes _one_ only, Lang takes both or neither";
    (2) "Cole takes both or neither, Lang takes _one_ only"; (3)
    "Cole takes _one_ only, Lang takes _one_ only". And so with all
    similar phrases.

    It is also assumed that every rule is to be understood as
    implying the words "and _vice versâ_." Thus the first rule would
    imply the addition "and, if either Cole or Lang takes only _one_
    condiment, then Barry takes salt."]

                                                                   pg193
7.

(1) Brothers, who are much admired, are apt to be self-conscious;

(2) When two men of the same height are on opposite sides in Politics,
if one of them has his admirers, so also has the other;

(3) Brothers, who avoid general Society, look well when walking
together;

(4) Whenever you find two men, who differ in Politics and in their views
of Society, and who are not both of them ugly, you may be sure that they
look well when walking together;

(5) Ugly men, who look well when walking together, are not both of them
free from self-consciousness;

(6) Brothers, who differs in Politics, and are not both of them
handsome, never give themselves airs;

(7) John declines to go into Society, but never gives himself airs;

(8) Brothers, who are apt to be self-conscious, though not _both_ of
them handsome, usually dislike Society;

(9) Men of the same height, who do not give themselves airs, are free
from self-consciousness;

(10) Men, who agree on questions of Art, though they differ in Politics,
and who are not both of them ugly, are always admired;

(11) Men, who hold opposite views about Art and are not admired, always
give themselves airs;

(12) Brothers of the same height always differ in Politics;

(13) Two handsome men, who are neither both of them admired nor both of
them self-conscious, are no doubt of different heights;

(14) Brothers, who are self-conscious, and do not both of them like
Society, never look well when walking together.

    [N.B. See Note at end of Problem 2.]

                                                                   pg194
8.

(1) A man can always master his father;

(2) An inferior of a man's uncle owes that man money;

(3) The father of an enemy of a friend of a man owes that man nothing;

(4) A man is always persecuted by his son's creditors;

(5) An inferior of the master of a man's son is senior to that man;

(6) A grandson of a man's junior is not his nephew;

(7) A servant of an inferior of a friend of a man's enemy is never
persecuted by that man;

(8) A friend of a superior of the master of a man's victim is that man's
enemy;

(9) An enemy of a persecutor of a servant of a man's father is that
man's friend.

The Problem is to deduce some fact about great-grandsons.

    [N.B. In this Problem, it is assumed that all the men, here
    referred to, live in the same town, and that every pair of them
    are either "friends" or "enemies," that every pair are related
    as "senior and junior", "superior and inferior", and that
    certain pairs are related as "creditor and debtor", "father and
    son", "master and servant", "persecutor and victim", "uncle and
    nephew".]


9.

    "Jack Sprat could eat no fat:
       His wife could eat no lean:
     And so, between them both,
       They licked the platter clean."

Solve this as a Sorites-Problem, taking lines 3 and 4 as the Conclusion
to be proved. It is permitted to use, as Premisses, not only all that is
here _asserted_, but also all that we may reasonably understand to be
_implied_.

                                                                   pg195


NOTES TO APPENDIX.


(A) [See p. 167, line 6.]

It may, perhaps, occur to the Reader, who has studied Formal Logic that
the argument, here applied to the Propositions I and E, will apply
equally well to the Propositions I and A (since, in the ordinary
text-books, the Propositions "All xy are z" and "Some xy are not z" are
regarded as Contradictories). Hence it may appear to him that the
argument might have been put as follows:--

"We now have I and A 'asserting.' Hence, if the Proposition 'All xy are
z' be true, some things exist with the Attributes x and y: i.e. 'Some x
are y.'

"Also we know that, if the Proposition 'Some xy are not-z' be true the
same result follows.

"But these two Propositions are Contradictories, so that one or other of
them _must_ be true. Hence this result is always true: i.e. the
Proposition 'Some x are y' is _always_ true!

"_Quod est absurdum._ Hence I _cannot_ assert."

This matter will be discussed in Part II; but I may as well give here
what seems to me to be an irresistable proof that this view (that _A_
and _I_ are Contradictories), though adopted in the ordinary text-books,
is untenable. The proof is as follows:--

With regard to the relationship existing between the Class 'xy' and the
two Classes 'z' and 'not-z', there are _four_ conceivable states of
things, viz.

    (1) Some xy are z, and some are not-z;
    (2)    "      "        none     "
    (3) No xy     "        some     "
    (4)    "      "        none     "

Of these four, No. (2) is equivalent to "All xy are z", No. (3) is
equivalent to "All xy are not-z", and No. (4) is equivalent to "No xy
exist."

Now it is quite undeniable that, of these _four_ states of things, each
is, _a priori_, _possible_, some _one must_ be true, and the other three
_must_ be false.

Hence the Contradictory to (2) is "Either (1) or (3) or (4) is true."
Now the assertion "Either (1) or (3) is true" is equivalent to "Some xy
are not-z"; and the assertion "(4) is true" is equivalent to "No xy
exist." Hence the Contradictory to "All xy are z" may be expressed as
the Alternative Proposition "Either some xy are not-z, or no xy exist,"
but _not_ as the Categorical Proposition "Some y are not-z."

                                                                   pg196
(B) [See p. 171, at end of Section 2.]

There are yet _other_ views current among "The Logicians", as to the
"Existential Import" of Propositions, which have not been mentioned in
this Section.

One is, that the Proposition "some x are y" is to be interpreted,
neither as "Some x _exist_ and are y", nor yet as "If there _were_ any x
in existence, some of them _would_ be y", but merely as "Some x _can be_
y; i.e. the Attributes x and y are _compatible_". On _this_ theory,
there would be nothing offensive in my telling my friend Jones "Some of
your brothers are swindlers"; since, if he indignantly retorted "What do
you _mean_ by such insulting language, you scoundrel?", I should calmly
reply "I merely mean that the thing is _conceivable_----that some of
your brothers _might possibly_ be swindlers". But it may well be doubted
whether such an explanation would _entirely_ appease the wrath of Jones!

Another view is, that the Proposition "All x are y" _sometimes_ implies
the actual _existence_ of x, and _sometimes_ does _not_ imply it; and
that we cannot tell, without having it in _concrete_ form, _which_
interpretation we are to give to it. _This_ view is, I think, strongly
supported by common usage; and it will be fully discussed in Part II:
but the difficulties, which it introduces, seem to me too formidable to
be even alluded to in Part I, which I am trying to make, as far as
possible, easily intelligible to mere _beginners_.


(C) [See p. 173, § 4.]

The three Conclusions are

    "No conceited child of mine is greedy";
    "None of my boys could solve this problem";
    "Some unlearned boys are not choristers."

                                                                   pg197


INDEX.


§ 1.

_Tables._

   I. Biliteral Diagram. Attributes of Classes, and
        Compartments, or Cells, assigned to them                25

  II. do. Representation of Uniliteral Propositions of
        Existence                                               34

 III. do. Representation of Biliteral Propositions of
        Existence and of Relation                               35

  IV. Triliteral Diagram. Attributes of Classes, and
        Compartments, or Cells, assigned to them                42

   V. do. Representation of Particular and Universal
        Negative Propositions, of Existence and of Relation,
        in terms of x and m                                     46

  VI. do. do., in terms of y and m                              47

 VII. do. Representation of Universal Affirmative
        Propositions of Relation, in terms of x and m           48

VIII. do. do. in terms of y and m                               49

  IX. Method of Subscripts. Formulæ and Rules for Syllogisms    78


§ 2.

_Words &c. explained._

'Abstract' Proposition                                          59

'Adjuncts'                                                       1

'Affirmative' Proposition                                       10

'Attributes'                                                     1

'Biliteral' Diagram                                             22

     "      Proposition                                         27

'Class'                                                         1½

Classes, arbitrary limits of                                    3½

   "   , subdivision of                                          4
                                                                   pg198
'Classification'                                                1½

'Codivisional' Classes                                           3

'Complete' Conclusion of a Sorites                              85

'Conclusion' of a Sorites                                        "

     "        "   Syllogism                                     56

'Concrete' Proposition                                          59

'Consequent' in a Sorites                                       85

     "        "   Syllogism                                     56

'Converse' Propositions                                         31

'Conversion' of a Proposition                                    "

'Copula' of a Proposition                                        9

'Definition'                                                     6

'Dichotomy'                                                     3½

'Differentia'                                                   1½

'Division'                                                       3

'Eliminands' of a Sorites                                       85

     "        "   Syllogism                                     56

'Entity'                                                        70

'Equivalent' Propositions                                       17

'Fallacy'                                                       81

'Genus'                                                         1½

'Imaginary' Class                                                "

     "      Name                                                4½

'Individual'                                                     2

'Like', and 'Unlike', Signs of Terms                            70

'Name'                                                           4

'Negative' Proposition                                          10

'Normal' form of a Proposition                                   9

   "                    "      of Existence                     11

   "                    "      of Relation                      12

'Nullity'                                                       70

'Partial' Conclusion of a Sorites                               85

'Particular' Proposition                                         9

'Peculiar' Attributes                                           1½

'Predicate' of a Proposition                                     9

     "      of a Proposition of Existence                       11

     "                "         Relation                        12

'Premisses' of a Sorites                                        85

     "       "   Syllogism                                      56
                                                                   pg199
'Proposition'                                                    8

      "       'in _I_', 'in _E_', and 'in _A_'                   9

      "       'in terms of' certain Letters                     27

      "       of Existence                                      11

      "       of Relation                                       12

'Real' Class                                                    1½

'Retinends' of a Sorites                                        85

    "        "   Syllogism                                      56

'Sign of Quantity' in a Proposition                              9

'Sitting on the Fence'                                          26

'Some', technical meaning of                                     8

'Sorites'                                                       85

'Species'                                                       1½

'Subject' of a Proposition                                       9

    "              "       of Existence                         11

    "              "       of Relation                          12

'Subscripts' of Terms                                           70

'Syllogism'                                                     56

Symbol ".'."                                                     "

   "   "+" and "¶"                                              70

'Terms' of a Proposition                                         9

'Things'                                                         1

Translation of Proposition from 'concrete' to 'abstract'        59

     "              "           'abstract' to 'subscript'       72

'Triliteral' Diagram                                            39

'Underscoring' of letters                                       91

'Uniliteral' Proposition                                        27

'Universal'       "                                             10

'Universe of Discourse' (or 'Univ.')                            12

'Unreal' Class                                                  1½

'Unreal' Name                                                   4½


                                                                   pg200


THE END.



                                                                   px-1


                       WORKS BY LEWIS CARROLL.

                  *       *       *       *       *

                             PUBLISHED BY
                   MACMILLAN AND CO., LTD., LONDON.

                  *       *       *       *       *


ALICE'S ADVENTURES IN WONDERLAND. With Forty-two Illustrations by
TENNIEL. (First published in 1865.) Cr. 8vo, cloth, gilt edges, price
6_s._ net. Eighty-sixth Thousand.


THE SAME; PEOPLE'S EDITION. (First published in 1887.) Cr. 8vo, cloth,
price 2_s._ 6_d._ net. Forty-eighth Thousand.


AVENTURES D'ALICE AU PAYS DES MERVEILLES. Traduit de l'Anglais par HENRI
BUÉ. Ouvrage illustré de 42 Vignettes par JOHN TENNIEL. (First published
in 1869.) Cr. 8vo, cloth, gilt edges, price 6_s._ net. Second Thousand.


Alice's Abenteuer im Wunderland. Aus dem Englischen von Antonie
Zimmermann. Mit 42 Illustrationen von JOHN TENNIEL. (First published in
1869.) Crown 8vo, cloth, gilt edges, price 6_s._ net.


LE AVVENTURE D'ALICE NEL PAESE DELLE MERAVIGLIE. Tradotte dall' Inglese
da T. PIETROCOLA-ROSSETTI. Con 42 Vignette di GIOVANNI TENNIEL. (First
published in 1872.) Crown 8vo, cloth, gilt edges, price 6_s._ net.


ALICE'S ADVENTURES UNDER GROUND. Being a Facsimile of the original MS.
Book, which was afterwards developed into "Alice's Adventures in
Wonderland." With Thirty-seven Illustrations by the Author. (Begun, July
1862; finished, Feb. 1863; first published, in facsimile, in 1886.)
Crown 8vo, cloth, gilt edges, price 4_s._ net. Third Thousand.


THE NURSERY "ALICE." Containing Twenty Coloured Enlargements from
TENNIEL'S Illustrations to "Alice's Adventures in Wonderland." With text
adapted to Nursery Readers. Cover designed by E. GERTRUDE THOMSON.
(First published in 1890.) 4to, boards, price 1_s._ net. Eleventh
Thousand.
                                                                   px-2

THROUGH THE LOOKING-GLASS, AND WHAT ALICE FOUND THERE. With Fifty
Illustration by TENNIEL. (First published in 1871.) Cr. 8vo, cloth, gilt
edges, price 6_s._ net. Sixty-first Thousand.


THROUGH THE LOOKING-GLASS, AND WHAT ALICE FOUND THERE; PEOPLE'S EDITION.
(First published in 1887.) Crown 8vo, cloth, gilt edges, price 2_s._
6_d._ net. Thirtieth Thousand.


ALICE'S ADVENTURES IN WONDERLAND; AND THROUGH THE LOOKING-GLASS;
PEOPLE'S EDITIONS. Both Books together in One Volume. (First published
in 1887.) Crown 8vo, cloth, gilt edges, price 4_s._ 6_d._ net. Twelfth
Thousand.


THE HUNTING OF THE SNARK. An Agony in Eight Fits. With Nine
Illustrations, and two large gilt designs on cover, by HENRY HOLIDAY.
(First published in 1876.) Crown 8vo, cloth, gilt edges, price 4_s._
6_d._ net. Twentieth Thousand.


RHYME? AND REASON? With Sixty-five Illustrations by ARTHUR B. FROST, and
nine by HENRY HOLIDAY. (First published in 1883, being a reprint, with a
few additions, of the comic portion of "Phantasmagoria and other Poems,"
published in 1869, and of "The Hunting of the Snark," published in
1876.) Crown 8vo, cloth, gilt edges, price 4_s._ 6_d._ net. Sixth
Thousand.


SYMBOLIC LOGIC. In three Parts, which will be issued separately:--

    PART I.   Elementary. (First published in 1896.) Crown 8vo, limp
              cloth, price 2_s._ net. Second Thousand, Fourth Edition.
    PART II.  Advanced.       }
    PART III. Transcendental. }                       [_In preparation._

N.B.--An envelope, containing two blank Diagrams (Biliteral and
Triliteral) and 9 Counters (4 Red and 5 Grey) can be had for 3_d._, by
post 4_d._
                                                                   px-3

A TANGLED TALE. Reprinted from _The Monthly Packet_. With Six
Illustrations by ARTHUR B. FROST. (First published in 1885.) Crown 8vo,
cloth, gilt edges, price 4_s._ 6_d._ net. Fourth Thousand.


SYLVIE AND BRUNO. With Forty-six Illustrations by HARRY FURNISS. (First
published in 1889.) Crown 8vo, cloth, gilt edges, price 7_s._ 6_d._ net.
Twelfth Thousand.

N.B.--This book contains 395 pages--nearly as much as the two
Alice' books put together.


SYLVIE AND BRUNO CONCLUDED. With Forty-six Illustrations by HARRY
FURNISS. (First published in 1893.) Crown 8vo, cloth, gilt edges, price
7_s._ 6_d._ net. Third Thousand.

N.B.--This book contains 411 pages.


ORIGINAL GAMES AND PUZZLES. Crown 8vo, cloth, gilt
edges.                                                [_In preparation._


THREE SUNSETS, and Other Poems. With Twelve Illustrations by E. GERTRUDE
THOMSON. Fcap. 4to, cloth, gilt edges.

N.B.--This will be a reprint, possibly with a few additions, of the
serious portion of "Phantasmagoria, and other Poems," published in 1869.


                  *       *       *       *       *

                          ADVICE TO WRITERS.

Buy "THE WONDERLAND CASE FOR POSTAGE-STAMPS," invented by LEWIS CARROL,
Oct. 29, 1888, size 4 inches by 3, containing 12 separate pockets for
stamps of different values, 2 Coloured Pictorial Surprises taken
from _Alice in Wonderland_, and 8 or 9 Wise Words about Letter-Writing.
It is published by Messrs. EMBERLIN & SON, 4 Magdalene Street, Oxford.
Price 1_s._

N.B.--If ordered by Post, an additional payment will be required, to
cover cost of postage, as follows:--

One copy, 1½_d._ Two or three do., 2_d._ Four do., 2½_d._ Five to
fourteen do., 3_d._ Each subsequent fourteen or fraction thereof, 1½_d._



                  *       *       *       *       *
                  *       *       *       *       *

Transcriber's Note

This book makes extensive use of page references. To assist the reader,
page markers in the forms "pg-ix", "pg193" & "px-3" have been included
in the right margin at points corresponding closely to the tops of the
original pages. These may be searched for to locate the material
referred to. In the main section, these page markers are always given
with 3 digits including, if necessary, leading zeroes.

This book contains a large number of line drawn illustrations which are
un-credited. As these cannot be rendered here in the original manner
they have been reproduced as well as possible in the manner known as
"ASCII art".


A number of transcription errors were found in the original book. As
these were clearly not part of the Author's intention they have, as far
as possible, been identified and corrected in accordance with the
methods given by the Author. These corrections are listed here below
with their locations and original text. In these notes the word
'natural' identifies a letter symbol occurring without a prime mark.

Page viii: "189" corrected to "194".
Page viii: "188" corrected to "192".
Page xv, '=Real=' and '=Unreal=', or '=Imaginary=', Classes: "1½"
          corrected to "2".
Page xix, Propositions beginning with "Some": "18" corrected to "19".
Page xix, Rules: "19" corrected to "20".
Page xix, The West and East Halves ...: "24" corrected to "23".
Page xxi, The Proposition "All x are y" ...: was originally shown as
          occurring in page 34.
Page xxii, And of three other similar arrangements: "37" corrected to
          "36".
Page xxiii, The Proposition 'No xm exist': "43" corrected to "44".
Page 060: "contruct" corrected to "construct".
Page 094, Paper V: missing word "it" supplied.
Page 111, #28: "No h are k-natural" corrected to "No h are k-prime".
Page 111, #30: "No a are h-natural" corrected to "No a are h-prime".
Page 111, #30: "No c are n-natural" corrected to "No c are n-prime".
Page 123, #57 (d): "mortally offended if I fail to notice them"
          corrected to "mortally offended".
Page 128, #34: "Some x-prime are y" corrected to "Some x-natural are y".
Page 146, #30: "x_{1}m-prime_{0}" corrected to "x_{1}m-natural_{0}".
Page 147, #32: "xm-natural_{0}" corrected to "xm-prime_{0}".
Page 156, #18 (4/1): "be" corrected to "be-sub:zero".
Page 156, #22 (5/1): "ch" corrected to "ch-sub:zero".
Page 157, #23 (5/2): second underline corrected from single to double.
Page 157, #23 (2/2): first underline corrected from single to double.
Page 157, #23 (¶2): "h_{1}c" corrected to "h_{1}c-sub:zero".
Page 157, #26 (5/1): "a_{1}c-natural_{0}" corrected to
          "a_{1}c-prime_{0}".
Page 157, #26 (¶2): "e_{1}c-natural_{0}" corrected to
          "e_{1}c-prime_{0}".
Page 157, #29 (8/2): first underline corrected from single to double.
Page 161, #36 (4/2): "e'd-prime" corrected to "e'd-natural".
Page 161, #39 (1/2): "c-prime+d" corrected to "c-natural+d".
Page 161, #40: "a" and "b" interchanged.
Page 161, #43 (1/1): "b-natural_{1}e_{0}" corrected to
          "b-prime_{1}e_{0}".
Page 162, #52 (3/1): "h'k-prime_{0}" corrected to "h'k-natural_{0}".
Page 163, #55 (3/2): "c'd-prime" corrected to "c'd-natural".
Page 163, #57 (1/2): "h-natural+d'" corrected to "h-prime+d'".


In the original book at the top of page 97, the following text occurred:

    [N.B. The numbers at the foot of each page indicate the pages
    where the corresponding matter may be found.]

In accordance with the un-paged medium here this has been changed to:

    [N.B. Reference tags for Examples, Answers & Solutions will be
    found in the right margin.]

The part of the book to which this relates contains, by sections,
"Examples" (Exercises for the student), "Answers" (to the Examples) &
"Solutions" (Worked Answers). All Example sections have corresponding
Answer sections. For Sections 2 & 3, worked Solutions are not supplied;
for Sections 4-7, Solutions are given by 2 different methods. In
association with this, the original text contained editorial notes at
the foot of each page giving the page numbers for the related Sections.
In this version, these notes are replaced with marginal tags such as
EX3, AN4, SL5, & SL6-A and SL7-B which are placed at the top of each
Section to identify the current location. As with page tags, these may
be searched for to locate the material refered to. (A search for "SL4"
should find successively both "SL4-A" & "SL4-B".) These tags are unique
regardless of case.






End of the Project Gutenberg EBook of Symbolic Logic, by Lewis Carroll

*** END OF THIS PROJECT GUTENBERG EBOOK SYMBOLIC LOGIC ***

***** This file should be named 28696-8.txt or 28696-8.zip *****
This and all associated files of various formats will be found in:
        https://www.gutenberg.org/2/8/6/9/28696/

Produced by Tony Browne, Geetu Melwani, Greg Weeks, L.
Lynn Smith and the Online Distributed Proofreading Team
at https://www.pgdp.net


Updated editions will replace the previous one--the old editions
will be renamed.

Creating the works from public domain print editions means that no
one owns a United States copyright in these works, so the Foundation
(and you!) can copy and distribute it in the United States without
permission and without paying copyright royalties.  Special rules,
set forth in the General Terms of Use part of this license, apply to
copying and distributing Project Gutenberg-tm electronic works to
protect the PROJECT GUTENBERG-tm concept and trademark.  Project
Gutenberg is a registered trademark, and may not be used if you
charge for the eBooks, unless you receive specific permission.  If you
do not charge anything for copies of this eBook, complying with the
rules is very easy.  You may use this eBook for nearly any purpose
such as creation of derivative works, reports, performances and
research.  They may be modified and printed and given away--you may do
practically ANYTHING with public domain eBooks.  Redistribution is
subject to the trademark license, especially commercial
redistribution.



*** START: FULL LICENSE ***

THE FULL PROJECT GUTENBERG LICENSE
PLEASE READ THIS BEFORE YOU DISTRIBUTE OR USE THIS WORK

To protect the Project Gutenberg-tm mission of promoting the free
distribution of electronic works, by using or distributing this work
(or any other work associated in any way with the phrase "Project
Gutenberg"), you agree to comply with all the terms of the Full Project
Gutenberg-tm License (available with this file or online at
https://gutenberg.org/license).


Section 1.  General Terms of Use and Redistributing Project Gutenberg-tm
electronic works

1.A.  By reading or using any part of this Project Gutenberg-tm
electronic work, you indicate that you have read, understand, agree to
and accept all the terms of this license and intellectual property
(trademark/copyright) agreement.  If you do not agree to abide by all
the terms of this agreement, you must cease using and return or destroy
all copies of Project Gutenberg-tm electronic works in your possession.
If you paid a fee for obtaining a copy of or access to a Project
Gutenberg-tm electronic work and you do not agree to be bound by the
terms of this agreement, you may obtain a refund from the person or
entity to whom you paid the fee as set forth in paragraph 1.E.8.

1.B.  "Project Gutenberg" is a registered trademark.  It may only be
used on or associated in any way with an electronic work by people who
agree to be bound by the terms of this agreement.  There are a few
things that you can do with most Project Gutenberg-tm electronic works
even without complying with the full terms of this agreement.  See
paragraph 1.C below.  There are a lot of things you can do with Project
Gutenberg-tm electronic works if you follow the terms of this agreement
and help preserve free future access to Project Gutenberg-tm electronic
works.  See paragraph 1.E below.

1.C.  The Project Gutenberg Literary Archive Foundation ("the Foundation"
or PGLAF), owns a compilation copyright in the collection of Project
Gutenberg-tm electronic works.  Nearly all the individual works in the
collection are in the public domain in the United States.  If an
individual work is in the public domain in the United States and you are
located in the United States, we do not claim a right to prevent you from
copying, distributing, performing, displaying or creating derivative
works based on the work as long as all references to Project Gutenberg
are removed.  Of course, we hope that you will support the Project
Gutenberg-tm mission of promoting free access to electronic works by
freely sharing Project Gutenberg-tm works in compliance with the terms of
this agreement for keeping the Project Gutenberg-tm name associated with
the work.  You can easily comply with the terms of this agreement by
keeping this work in the same format with its attached full Project
Gutenberg-tm License when you share it without charge with others.

1.D.  The copyright laws of the place where you are located also govern
what you can do with this work.  Copyright laws in most countries are in
a constant state of change.  If you are outside the United States, check
the laws of your country in addition to the terms of this agreement
before downloading, copying, displaying, performing, distributing or
creating derivative works based on this work or any other Project
Gutenberg-tm work.  The Foundation makes no representations concerning
the copyright status of any work in any country outside the United
States.

1.E.  Unless you have removed all references to Project Gutenberg:

1.E.1.  The following sentence, with active links to, or other immediate
access to, the full Project Gutenberg-tm License must appear prominently
whenever any copy of a Project Gutenberg-tm work (any work on which the
phrase "Project Gutenberg" appears, or with which the phrase "Project
Gutenberg" is associated) is accessed, displayed, performed, viewed,
copied or distributed:

This eBook is for the use of anyone anywhere at no cost and with
almost no restrictions whatsoever.  You may copy it, give it away or
re-use it under the terms of the Project Gutenberg License included
with this eBook or online at www.gutenberg.org

1.E.2.  If an individual Project Gutenberg-tm electronic work is derived
from the public domain (does not contain a notice indicating that it is
posted with permission of the copyright holder), the work can be copied
and distributed to anyone in the United States without paying any fees
or charges.  If you are redistributing or providing access to a work
with the phrase "Project Gutenberg" associated with or appearing on the
work, you must comply either with the requirements of paragraphs 1.E.1
through 1.E.7 or obtain permission for the use of the work and the
Project Gutenberg-tm trademark as set forth in paragraphs 1.E.8 or
1.E.9.

1.E.3.  If an individual Project Gutenberg-tm electronic work is posted
with the permission of the copyright holder, your use and distribution
must comply with both paragraphs 1.E.1 through 1.E.7 and any additional
terms imposed by the copyright holder.  Additional terms will be linked
to the Project Gutenberg-tm License for all works posted with the
permission of the copyright holder found at the beginning of this work.

1.E.4.  Do not unlink or detach or remove the full Project Gutenberg-tm
License terms from this work, or any files containing a part of this
work or any other work associated with Project Gutenberg-tm.

1.E.5.  Do not copy, display, perform, distribute or redistribute this
electronic work, or any part of this electronic work, without
prominently displaying the sentence set forth in paragraph 1.E.1 with
active links or immediate access to the full terms of the Project
Gutenberg-tm License.

1.E.6.  You may convert to and distribute this work in any binary,
compressed, marked up, nonproprietary or proprietary form, including any
word processing or hypertext form.  However, if you provide access to or
distribute copies of a Project Gutenberg-tm work in a format other than
"Plain Vanilla ASCII" or other format used in the official version
posted on the official Project Gutenberg-tm web site (www.gutenberg.org),
you must, at no additional cost, fee or expense to the user, provide a
copy, a means of exporting a copy, or a means of obtaining a copy upon
request, of the work in its original "Plain Vanilla ASCII" or other
form.  Any alternate format must include the full Project Gutenberg-tm
License as specified in paragraph 1.E.1.

1.E.7.  Do not charge a fee for access to, viewing, displaying,
performing, copying or distributing any Project Gutenberg-tm works
unless you comply with paragraph 1.E.8 or 1.E.9.

1.E.8.  You may charge a reasonable fee for copies of or providing
access to or distributing Project Gutenberg-tm electronic works provided
that

- You pay a royalty fee of 20% of the gross profits you derive from
     the use of Project Gutenberg-tm works calculated using the method
     you already use to calculate your applicable taxes.  The fee is
     owed to the owner of the Project Gutenberg-tm trademark, but he
     has agreed to donate royalties under this paragraph to the
     Project Gutenberg Literary Archive Foundation.  Royalty payments
     must be paid within 60 days following each date on which you
     prepare (or are legally required to prepare) your periodic tax
     returns.  Royalty payments should be clearly marked as such and
     sent to the Project Gutenberg Literary Archive Foundation at the
     address specified in Section 4, "Information about donations to
     the Project Gutenberg Literary Archive Foundation."

- You provide a full refund of any money paid by a user who notifies
     you in writing (or by e-mail) within 30 days of receipt that s/he
     does not agree to the terms of the full Project Gutenberg-tm
     License.  You must require such a user to return or
     destroy all copies of the works possessed in a physical medium
     and discontinue all use of and all access to other copies of
     Project Gutenberg-tm works.

- You provide, in accordance with paragraph 1.F.3, a full refund of any
     money paid for a work or a replacement copy, if a defect in the
     electronic work is discovered and reported to you within 90 days
     of receipt of the work.

- You comply with all other terms of this agreement for free
     distribution of Project Gutenberg-tm works.

1.E.9.  If you wish to charge a fee or distribute a Project Gutenberg-tm
electronic work or group of works on different terms than are set
forth in this agreement, you must obtain permission in writing from
both the Project Gutenberg Literary Archive Foundation and Michael
Hart, the owner of the Project Gutenberg-tm trademark.  Contact the
Foundation as set forth in Section 3 below.

1.F.

1.F.1.  Project Gutenberg volunteers and employees expend considerable
effort to identify, do copyright research on, transcribe and proofread
public domain works in creating the Project Gutenberg-tm
collection.  Despite these efforts, Project Gutenberg-tm electronic
works, and the medium on which they may be stored, may contain
"Defects," such as, but not limited to, incomplete, inaccurate or
corrupt data, transcription errors, a copyright or other intellectual
property infringement, a defective or damaged disk or other medium, a
computer virus, or computer codes that damage or cannot be read by
your equipment.

1.F.2.  LIMITED WARRANTY, DISCLAIMER OF DAMAGES - Except for the "Right
of Replacement or Refund" described in paragraph 1.F.3, the Project
Gutenberg Literary Archive Foundation, the owner of the Project
Gutenberg-tm trademark, and any other party distributing a Project
Gutenberg-tm electronic work under this agreement, disclaim all
liability to you for damages, costs and expenses, including legal
fees.  YOU AGREE THAT YOU HAVE NO REMEDIES FOR NEGLIGENCE, STRICT
LIABILITY, BREACH OF WARRANTY OR BREACH OF CONTRACT EXCEPT THOSE
PROVIDED IN PARAGRAPH F3.  YOU AGREE THAT THE FOUNDATION, THE
TRADEMARK OWNER, AND ANY DISTRIBUTOR UNDER THIS AGREEMENT WILL NOT BE
LIABLE TO YOU FOR ACTUAL, DIRECT, INDIRECT, CONSEQUENTIAL, PUNITIVE OR
INCIDENTAL DAMAGES EVEN IF YOU GIVE NOTICE OF THE POSSIBILITY OF SUCH
DAMAGE.

1.F.3.  LIMITED RIGHT OF REPLACEMENT OR REFUND - If you discover a
defect in this electronic work within 90 days of receiving it, you can
receive a refund of the money (if any) you paid for it by sending a
written explanation to the person you received the work from.  If you
received the work on a physical medium, you must return the medium with
your written explanation.  The person or entity that provided you with
the defective work may elect to provide a replacement copy in lieu of a
refund.  If you received the work electronically, the person or entity
providing it to you may choose to give you a second opportunity to
receive the work electronically in lieu of a refund.  If the second copy
is also defective, you may demand a refund in writing without further
opportunities to fix the problem.

1.F.4.  Except for the limited right of replacement or refund set forth
in paragraph 1.F.3, this work is provided to you 'AS-IS' WITH NO OTHER
WARRANTIES OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO
WARRANTIES OF MERCHANTIBILITY OR FITNESS FOR ANY PURPOSE.

1.F.5.  Some states do not allow disclaimers of certain implied
warranties or the exclusion or limitation of certain types of damages.
If any disclaimer or limitation set forth in this agreement violates the
law of the state applicable to this agreement, the agreement shall be
interpreted to make the maximum disclaimer or limitation permitted by
the applicable state law.  The invalidity or unenforceability of any
provision of this agreement shall not void the remaining provisions.

1.F.6.  INDEMNITY - You agree to indemnify and hold the Foundation, the
trademark owner, any agent or employee of the Foundation, anyone
providing copies of Project Gutenberg-tm electronic works in accordance
with this agreement, and any volunteers associated with the production,
promotion and distribution of Project Gutenberg-tm electronic works,
harmless from all liability, costs and expenses, including legal fees,
that arise directly or indirectly from any of the following which you do
or cause to occur: (a) distribution of this or any Project Gutenberg-tm
work, (b) alteration, modification, or additions or deletions to any
Project Gutenberg-tm work, and (c) any Defect you cause.


Section  2.  Information about the Mission of Project Gutenberg-tm

Project Gutenberg-tm is synonymous with the free distribution of
electronic works in formats readable by the widest variety of computers
including obsolete, old, middle-aged and new computers.  It exists
because of the efforts of hundreds of volunteers and donations from
people in all walks of life.

Volunteers and financial support to provide volunteers with the
assistance they need are critical to reaching Project Gutenberg-tm's
goals and ensuring that the Project Gutenberg-tm collection will
remain freely available for generations to come.  In 2001, the Project
Gutenberg Literary Archive Foundation was created to provide a secure
and permanent future for Project Gutenberg-tm and future generations.
To learn more about the Project Gutenberg Literary Archive Foundation
and how your efforts and donations can help, see Sections 3 and 4
and the Foundation web page at https://www.pglaf.org.


Section 3.  Information about the Project Gutenberg Literary Archive
Foundation

The Project Gutenberg Literary Archive Foundation is a non profit
501(c)(3) educational corporation organized under the laws of the
state of Mississippi and granted tax exempt status by the Internal
Revenue Service.  The Foundation's EIN or federal tax identification
number is 64-6221541.  Its 501(c)(3) letter is posted at
https://pglaf.org/fundraising.  Contributions to the Project Gutenberg
Literary Archive Foundation are tax deductible to the full extent
permitted by U.S. federal laws and your state's laws.

The Foundation's principal office is located at 4557 Melan Dr. S.
Fairbanks, AK, 99712., but its volunteers and employees are scattered
throughout numerous locations.  Its business office is located at
809 North 1500 West, Salt Lake City, UT 84116, (801) 596-1887, email
[email protected].  Email contact links and up to date contact
information can be found at the Foundation's web site and official
page at https://pglaf.org

For additional contact information:
     Dr. Gregory B. Newby
     Chief Executive and Director
     [email protected]


Section 4.  Information about Donations to the Project Gutenberg
Literary Archive Foundation

Project Gutenberg-tm depends upon and cannot survive without wide
spread public support and donations to carry out its mission of
increasing the number of public domain and licensed works that can be
freely distributed in machine readable form accessible by the widest
array of equipment including outdated equipment.  Many small donations
($1 to $5,000) are particularly important to maintaining tax exempt
status with the IRS.

The Foundation is committed to complying with the laws regulating
charities and charitable donations in all 50 states of the United
States.  Compliance requirements are not uniform and it takes a
considerable effort, much paperwork and many fees to meet and keep up
with these requirements.  We do not solicit donations in locations
where we have not received written confirmation of compliance.  To
SEND DONATIONS or determine the status of compliance for any
particular state visit https://pglaf.org

While we cannot and do not solicit contributions from states where we
have not met the solicitation requirements, we know of no prohibition
against accepting unsolicited donations from donors in such states who
approach us with offers to donate.

International donations are gratefully accepted, but we cannot make
any statements concerning tax treatment of donations received from
outside the United States.  U.S. laws alone swamp our small staff.

Please check the Project Gutenberg Web pages for current donation
methods and addresses.  Donations are accepted in a number of other
ways including including checks, online payments and credit card
donations.  To donate, please visit: https://pglaf.org/donate


Section 5.  General Information About Project Gutenberg-tm electronic
works.

Professor Michael S. Hart was the originator of the Project Gutenberg-tm
concept of a library of electronic works that could be freely shared
with anyone.  For thirty years, he produced and distributed Project
Gutenberg-tm eBooks with only a loose network of volunteer support.


Project Gutenberg-tm eBooks are often created from several printed
editions, all of which are confirmed as Public Domain in the U.S.
unless a copyright notice is included.  Thus, we do not necessarily
keep eBooks in compliance with any particular paper edition.


Most people start at our Web site which has the main PG search facility:

     https://www.gutenberg.org

This Web site includes information about Project Gutenberg-tm,
including how to make donations to the Project Gutenberg Literary
Archive Foundation, how to help produce our new eBooks, and how to
subscribe to our email newsletter to hear about new eBooks.