WeRead Powered by ReaderPub
The principles of science cover

The principles of science

Chapter 59: Second Example.
Open in WeRead

About This Book

The work offers a systematic account of formal logic and scientific method, opening with the fundamental laws of thought, the principle of substitution, and a combinational view of logical processes. It presents mechanical and symbolic means for representing logical relations and develops probability theory—highlighting the inverse method—as the proper framework for inductive inference, treating induction as inverse deduction. It addresses quantitative practice including measurement, error elimination, probable means, and a theory of approximation. Finally, it examines experiment, observation, hypothesis formation, and verification, emphasizing how hypothesis-driven deduction combined with careful quantitative testing yields reliable scientific laws.

“By him who stampt The Four upon the Mind,
  The Four, the fount of Nature’s endless stream.”

Now four and the higher powers of duality do represent in this logical system the numbers of combinations which can be generated in the absence of logical restrictions. The followers of Pythagoras may have shrouded their master’s doctrines in mysterious and superstitious notions, but in many points these doctrines seem to have some basis in logical philosophy.

The Logical Slate.

To a person who has once comprehended the extreme significance and utility of the Logical Alphabet the indirect process of inference becomes reduced to the repetition of a few uniform operations of classification, selection, and elimination of contradictories. Logical deduction, even in the most complicated questions, becomes a matter of mere routine, and the amount of labour required is the only impediment, when once the meaning of the premises is rendered clear. But the amount of labour is often found to be considerable. The mere writing down of sixty-four combinations of six letters each is no small task, and, if we had a problem of five premises, each of the sixty-four combinations would have to be examined in connection with each premise. The requisite comparison is often of a very tedious character, and considerable chance of error intervenes.

I have given much attention, therefore, to lessening both the manual and mental labour of the process, and I shall describe several devices which may be adopted for saving trouble and risk of mistake.

In the first place, as the same sets of combinations occur over and over again in different problems, we may avoid the labour of writing them out by having the sets of letters ready printed upon small sheets of writing-paper. It has also been suggested by a correspondent that, if any one series of combinations were marked upon the margin of a sheet of paper, and a slit cut between each pair of combinations, it would be easy to fold down any particular combination, and thus strike it out of view. The combinations consistent with the premises would then remain in a broken series. This method answers sufficiently well for occasional use.

A more convenient mode, however, is to have the series of letters shown on p. 94, engraved upon a common school writing slate, of such a size, that the letters may occupy only about a third of the space on the left hand side of the slate. The conditions of the problem can then be written down on the unoccupied part of the slate, and the proper series of combinations being chosen, the contradictory combinations can be struck out with the pencil. I have used a slate of this kind, which I call a Logical Slate, for more than twelve years, and it has saved me much trouble. It is hardly possible to apply this process to problems of more than six terms, owing to the large number of combinations which would require examination.

Abstraction of Indifferent Circumstances.

There is a simple but highly important process of inference which enables us to abstract, eliminate or disregard all circumstances indifferently present and absent. Thus if I were to state that “a triangle is a three-sided rectilinear figure, either large or not large,” these two alternatives would be superfluous, because, by the Law of Duality, I know that everything must be either large or not large. To add the qualification gives no new knowledge, since the existence of the two alternatives will be understood in the absence of any information to the contrary. Accordingly, when two alternatives differ only as regards a single component term which is positive in one and negative in the other, we may reduce them to one term by striking out their indifferent part. It is really a process of substitution which enables us to do this; for having any proposition of the form

A = ABC ꖌ ABc,
(1)

we know by the Law of Duality that

AB = ABC ꖌ ABc.
(2)

As the second member of this is identical with the second member of (1) we may substitute, obtaining

A = AB.

This process of reducing useless alternatives may be applied again and again; for it is plain that

A = AB (CD ꖌ CdcD ꖌ cd)

communicates no more information than that A is B. Abstraction of indifferent terms is in fact the converse process to that of development described in p. 89; and it is one of the most important operations in the whole sphere of reasoning.

The reader should observe that in the proposition

AC = BC

we cannot abstract C and infer

A = B;

but from

AC ꖌ Ac = BC ꖌ Bc

we may abstract all reference to the term C.

It ought to be carefully remarked, however, that alternatives which seem to be without meaning often imply important knowledge. Thus if I say that “a triangle is a three-sided rectilinear figure, with or without three equal angles,” the last alternatives really express a property of triangles, namely, that some triangles have three equal angles, and some do not have them. If we put P = “Some,” meaning by the indefinite adjective “Some,” one or more of the undefined properties of triangles with three equal angles, and take

A = triangle
B = three-sided rectilinear figure
C = with three equal angles,

then the knowledge implied is expressed in the two propositions

PA = PBC
pA = pBc.

These may also be thrown into the form of one proposition, namely,

A = PBC ꖌ pBc;

but these alternatives cannot be reduced, and the proposition is quite different from

A = BC ꖌ Bc.

Illustrations of the Indirect Method.

A great variety of arguments and logical problems might be introduced here to show the comprehensive character and powers of the Indirect Method. We can treat either a single premise or a series of premises.

Take in the first place a simple definition, such as “a triangle is a three-sided rectilinear figure.” Let

A = triangle
B = three-sided
C = rectilinear figure,

then the definition is of the form

A = BC.

If we take the series of eight combinations of three letters in the Logical Alphabet (p. 94) and strike out those which are inconsistent with the definition, we have the following result:‍—

ABC
aBc
abC
abc.

For the description of the class C we have

C = ABC ꖌ abC,

that is, “a rectilinear figure is either a triangle and three-sided, or not a triangle and not three-sided.”

For the class b we have

b = abC ꖌ abc.

To the second side of this we may apply the process of simplification by abstraction described in the last section; for by the Law of Duality

ab = abC ꖌ abc;

and as we have two propositions identical in the second side of each we may substitute, getting

b = ab,

or what is not three-sided is not a triangle (whether it be rectilinear or not).

Second Example.

Let us treat by this method the following argument:‍—

“Blende is not an elementary substance; elementary substances are those which are undecomposable; blende, therefore, is decomposable.”

Taking our letters thus—

A = blende,
B = elementary substance,
C = undecomposable,

the premises are of the forms

A = Ab,
(1)
B = C.
(2)

No immediate substitution can be made; but if we take the contrapositive of (2) (see p. 86), namely

b = c,
(3)

we can substitute in (1) obtaining the conclusion

A = Ac.

But the same result may be obtained by taking the eight combinations of A, B, C, of the Logical Alphabet; it will be found that only three combinations, namely,

Abc
aBC
abc,

are consistent with the premises, whence it results that

A = Abc,

or by the process of Ellipsis before described (p. 57)

A = Ac.

Third Example.

As a somewhat more complex example I take the argument thus stated, one which could not be thrown into the syllogistic form:‍—

“All metals except gold and silver are opaque; therefore what is not opaque is either gold or silver or is not-metal.”

There is more implied in this statement than is distinctly asserted, the full meaning being as follows:

All metals not gold or silver are opaque,
(1)
Gold is not opaque but is a metal,
(2)
Silver is not opaque but is a metal,
(3)
Gold is not silver.
(4)

Taking our letters thus—

A = metal C = silver
B = gold D = opaque,

we may state the premises in the forms

Abc
 = AbcD
(1)
B
 = ABd
(2)
C
 = ACd
(3)
B
 = Bc.
(4)

To obtain a complete solution of the question we take the sixteen combinations of A, B, C, D, and striking out those which are inconsistent with the premises, there remain only

ABcd
AbCd
AbcD
abcD
abcd.

The expression for not-opaque things consists of the three combinations containing d, thus

d
 = ABcd ꖌ AbCd ꖌ abcd,
or
d
 = Ad (Bc ꖌ bC) ꖌ abcd.

In ordinary language, what is not-opaque is either metal which is gold, and then not-silver, or silver and then not-gold, or else it is not-metal and neither gold nor silver.

Fourth Example.

A good example for the illustration of the Indirect Method is to be found in De Morgan’s Formal Logic (p. 123), the premises being substantially as follows:‍—

From A follows B, and from C follows D; but B and D are inconsistent with each other; therefore A and C are inconsistent.

The meaning no doubt is that where A is, B will be found, or that every A is a B, and similarly every C is a D; but B and D cannot occur together. The premises therefore appear to be of the forms

A = AB,
(1)
C = CD,
(2)
B = Bd.
(3)

On examining the series of sixteen combinations, only five are found to be consistent with the above conditions, namely,

ABcd
aBcd
abCD
abcD
abcd.

In these combinations the only A which appears is joined to c, and similarly C is joined to a, or A is inconsistent with C.

Fifth Example.

A more complex argument, also given by De Morgan,‍78 contains five terms, and is as stated below, except that the letters are altered.

Every A is one only of the two B or C; D is both B and C, except when B is E, and then it is neither; therefore no A is D.

The meaning of the above premises is difficult to interpret, but seems to be capable of expression in the following symbolic forms—

A
 = ABc ꖌ AbC,
(1)
De
 = DeBC,
(2)
DE
 = DEbc.
(3)

As five terms enter into these premises it is requisite to treat their thirty-two combinations, and it will be found that fourteen of them remain consistent with the premises, namely

ABcdE aBCDe abCdE
ABcde aBCdE abCde
AbCdE aBCde abcDE
AbCde aBcdE abcdE
aBcde abcde.

If we examine the first four combinations, all of which contain A, we find that they none of them contain D; or again, if we select those which contain D, we have only two, thus—

D = aBCDeabcDE.

Hence it is clear that no A is D, and vice versâ no D is A. We might draw many other conclusions from the same premises; for instance—

DE = abcDE,

or D and E never meet but in the absence of A, B, and C.

Fallacies analysed by the Indirect Method.

It has been sufficiently shown, perhaps, that we can by the Indirect Method of Inference extract the whole truth from a series of propositions, and exhibit it anew in any required form of conclusion. But it may also need to be shown by examples that so long as we follow correctly the almost mechanical rules of the method, we cannot fall into any of the fallacies or paralogisms which are often committed in ordinary discussion. Let us take the example of a fallacious argument, previously treated by the Method of Direct Inference (p. 62),

Granite is not a sedimentary rock,
(1)
Basalt is not a sedimentary rock,
(2)

and let us ascertain whether any precise conclusion can be drawn concerning the relation of granite and basalt. Taking as before

A = granite,
B = sedimentary rock,
C = basalt,

the premises become

A = Ab,
(1)
C = Cb.
(2)

Of the eight conceivable combinations of A, B, C, five agree with these conditions, namely

AbC
aBc
Abc
abC
abc.

Selecting the combinations which contain A, we find the description of granite to be

A = AbC ꖌ Abc = Ab(C ꖌ c),

that is, granite is not a sedimentary rock, and is either basalt or not-basalt. If we want a description of basalt the answer is of like form

C = AbC ꖌ abC = bC(A ꖌ a),

that is basalt is not a sedimentary rock, and is either granite or not-granite. As it is already perfectly evident that basalt must be either granite or not, and vice versâ, the premises fail to give us any information on the point, that is to say the Method of Indirect Inference saves us from falling into any fallacious conclusions. This example sufficiently illustrates both the fallacy of Negative premises and that of Undistributed Middle of the old logic.

The fallacy called the Illicit Process of the Major Term is also incapable of commission in following the rules of the method. Our example was (p. 65)

All planets are subject to gravity,
(1)
Fixed stars are not planets.
(2)

The false conclusion is that “fixed stars are not subject to gravity.” The terms are

A = planet
B = fixed star
C = subject to gravity.

And the premises are

A = AC,
(1)
B = aB.
(2)

The combinations which remain uncontradicted on comparison with these premises are

AbC
aBc
aBC
abC
abc.

For fixed star we have the description

B = aBC ꖌ aBc,

that is, “a fixed star is not a planet, but is either subject or not, as the case may be, to gravity.” Here we have no conclusion concerning the connection of fixed stars and gravity.

The Logical Abacus.

The Indirect Method of Inference has now been sufficiently described, and a careful examination of its powers will show that it is capable of giving a full analysis and solution of every question involving only logical relations. The chief difficulty of the method consists in the great number of combinations which may have to be examined; not only may the requisite labour become formidable, but a considerable chance of mistake arises. I have therefore given much attention to modes of facilitating the work, and have succeeded in reducing the method to an almost mechanical form. It soon appeared obvious that if the conceivable combinations of the Logical Alphabet, for any number of letters, instead of being printed in fixed order on a piece of paper or slate, were marked upon light movable pieces of wood, mechanical arrangements could readily be devised for selecting any required class of the combinations. The labour of comparison and rejection might thus be immensely reduced. This idea was first carried out in the Logical Abacus, which I have found useful in the lecture-room for exhibiting the complete solution of logical problems. A minute description of the construction and use of the Abacus, together with figures of the parts, has already been given in my essay called The Substitution of Similars,‍79 and I will here give only a general description.

The Logical Abacus consists of a common school black-board placed in a sloping position and furnished with four horizontal and equi-distant ledges. The combinations of the letters shown in the first four columns of the Logical Alphabet are printed in somewhat large type, so that each letter is about an inch from the neighbouring one, but the letters are placed one above the other instead of being in horizontal lines as in p. 94. Each combination of letters is separately fixed to the surface of a thin slip of wood one inch broad and about one-eighth inch thick. Short steel pins are then driven in an inclined position into the wood. When a letter is a large capital representing a positive term, the pin is fixed in the upper part of its space; when the letter is a small italic representing a negative term, the pin is fixed in the lower part of the space. Now, if one of the series of combinations be ranged upon a ledge of the black-board, the sharp edge of a flat rule can be inserted beneath the pins belonging to any one letter—say A, so that all the combinations marked A can be lifted out and placed upon a separate ledge. Thus we have represented the act of thought which separates the class A from what is not-A. The operation can be repeated; out of the A’s we can in like manner select those which are B’s, obtaining the AB’s; and in like manner we may select any other classes such as the aB’s, the ab’s, or the abc’s.

If now we take the series of eight combinations of the letters A, B, C, a, b, c, and wish to analyse the argument anciently called Barbara, having the premises

A = AB
(1)
B = BC,
(2)

we proceed as follows—We raise the combinations marked a, leaving the A’s behind; out of these A’s we move to a lower ledge such as are b’s, and to the remaining AB’s we join the a’s which have been raised. The result is that we have divided all the combinations into two classes, namely, the Ab’s which are incapable of existing consistently with premise (1), and the combinations which are consistent with the premise. Turning now to the second premise, we raise out of those which agree with (1) the b’s, then we lower the Bc’s; lastly we join the b’s to the BC’s. We now find our combinations arranged as below.

A
a
a
a
B
B
b
b
C C C c
A A A a
B
b
b B
c C c c

The lower line contains all the combinations which are inconsistent with either premise; we have carried out in a mechanical manner that exclusion of self-contradictories which was formerly done upon the slate or upon paper. Accordingly, from the combinations remaining in the upper line we can draw any inference which the premises yield. If we raise the A’s we find only one, and that is C, so that A must be C. If we select the c’s we again find only one, which is a and also b; thus we prove that not-C is not-A and not-B.

When a disjunctive proposition occurs among the premises the requisite movements become rather more complicated. Take the disjunctive argument

A is either B or C or D,
A is not C and not D,
Therefore A is B.

The premises are represented accurately as follows:‍—

A = AB ꖌ AC ꖌ AD
(1)
A = Ac
(2)
A = Ad.
(3)

As there are four terms, we choose the series of sixteen combinations and place them on the highest ledge of the board but one. We raise the a’s and out of the A’s, which remain, we lower the b’s. But we are not to reject all the Ab’s as contradictory, because by the first premise A’s may be either B’s or C’s or D’s. Accordingly out of the Ab’s we must select the c’s, and out of these again the d’s, so that only Abcd will remain to be rejected finally. Joining all the other fifteen combinations together again, and proceeding to premise (2), we raise the a’s and lower the AC’s, and thus reject the combinations inconsistent with (2); similarly we reject the AD’s which are inconsistent with (3). It will be found that there remain, in addition to all the eight combinations containing a, only one containing A, namely

ABcd,

whence it is apparent that A must be B, the ordinary conclusion of the argument.

In my “Substitution of Similars” (pp. 56–59) I have described the working upon the Abacus of two other logical problems, which it would be tedious to repeat in this place.

The Logical Machine.

Although the Logical Abacus considerably reduced the labour of using the Indirect Method, it was not free from the possibility of error. I thought moreover that it would afford a conspicuous proof of the generality and power of the method if I could reduce it to a purely mechanical form. Logicians had long been accustomed to speak of Logic as an Organon or Instrument, and even Lord Bacon, while he rejected the old syllogistic logic, had insisted, in the second aphorism of his “New Instrument,” that the mind required some kind of systematic aid. In the kindred science of mathematics mechanical assistance of one kind or another had long been employed. Orreries, globes, mechanical clocks, and such like instruments, are really aids to calculation and are of considerable antiquity. The Arithmetical Abacus is still in common use in Russia and China. The calculating machine of Pascal is more than two centuries old, having been constructed in 1642–45. M. Thomas of Colmar manufactures an arithmetical machine on Pascal’s principles which is employed by engineers and others who need frequently to multiply or divide. To Babbage and Scheutz is due the merit of embodying the Calculus of Differences in a machine, which thus became capable of calculating the most complicated tables of figures. It seemed strange that in the more intricate science of quantity mechanism should be applicable, whereas in the simple science of qualitative reasoning, the syllogism was only called an instrument by a figure of speech. It is true that Swift satirically described the Professors of Laputa as in possession of a thinking machine, and in 1851 Mr. Alfred Smee actually proposed the construction of a Relational machine and a Differential machine, the first of which would be a mechanical dictionary and the second a mode of comparing ideas; but with these exceptions I have not yet met with so much as a suggestion of a reasoning machine. It may be added that Mr. Smee’s designs, though highly ingenious, appear to be impracticable, and in any case they do not attempt the performance of logical inference.‍80

The Logical Abacus soon suggested the notion of a Logical Machine, which, after two unsuccessful attempts, I succeeded in constructing in a comparatively simple and effective form. The details of the Logical Machine have been fully described by the aid of plates in the Philosophical Transactions,‍81 and it would be needless to repeat the account of the somewhat intricate movements of the machine in this place.

The general appearance of the machine is shown in a plate facing the title-page of this volume. It somewhat resembles a very small upright piano or organ, and has a keyboard containing twenty-one keys. These keys are of two kinds, sixteen of them representing the terms or letters A, a, B, b, C, c, D, d, which have so often been employed in our logical notation. When letters occur on the left-hand side of a proposition, formerly called the subject, each is represented by a key on the left-hand half of the keyboard; but when they occur on the right-hand side, or as it used to be called the predicate of the proposition, the letter-keys on the right-hand side of the keyboard are the proper representatives. The five other keys may be called operation keys, to distinguish them from the letter or term keys. They stand for the stops, copula, and disjunctive conjunctions of a proposition. The middle key of all is the copula, to be pressed when the verb is or the sign = is met. The key to the extreme right-hand is called the Full Stop, because it should be pressed when a proposition is completed, in fact in the proper place of the full stop. The key to the extreme left-hand is used to terminate an argument or to restore the machine to its initial condition; it is called the Finis key. The last keys but one on the right and left complete the whole series, and represent the conjunction or in its unexclusive meaning, or the sign ꖌ which I have employed, according as it occurs in the right or left hand side of the proposition. The whole keyboard is arranged as shown on the next page—

Finis. Left-hand side of Proposition. Cupola. Right-hand side of Proposition. Fullstop.

Or
d D c C b B a A A a B b C c D d
Or

To work the machine it is only requisite to press the keys in succession as indicated by the letters and signs of a symbolical proposition. All the premises of an argument are supposed to be reduced to the simple notation which has been employed in the previous pages. Taking then such a simple proposition as

A = AB,

we press the keys A (left), copula, A (right), B (right), and full stop.

If there be a second premise, for instance

B = BC,

we press in like manner the keys—

B (left), copula, B (right), C (right), full stop.

The process is exactly the same however numerous the premises may be. When they are completed the operator will see indicated on the face of the machine the exact combinations of letters which are consistent with the premises according to the principles of thought.

As shown in the figure opposite the title-page, the machine exhibits in front a Logical Alphabet of sixteen combinations, exactly like that of the Abacus, except that the letters of each combination are separated by a certain interval. After the above problem has been worked upon the machine the Logical Alphabet will have been modified so as to present the following appearance—

 
A A
  
  
  
  
  
  
a a
  
  
a a a a
 
B B B B b b b b
 
C C C C C C c c
 
D d D d D d D d
 

The operator will readily collect the various conclusions in the manner described in previous pages, as, for instance that A is always C, that not-C is not-B and not-A; and not-B is not-A but either C or not-C. The results are thus to be read off exactly as in the case of the Logical Slate, or the Logical Abacus.

Disjunctive propositions are to be treated in an exactly similar manner. Thus, to work the premises

A = 
AB ꖌ AC
B ꖌ C = 
BD ꖌ CD,

it is only necessary to press in succession the keys

A (left), copula, A (right), B, ꖌ, A, C, full stop.
B (left), ꖌ, C, copula, B (right), D, ꖌ, C, D, full stop.

The combinations then remaining will be as follows

ABCD aBCD abcD
ABcD aBcD abcd.
AcCD abCD

On pressing the left-hand key A, all the possible combinations which do not contain A will disappear, and the description of A may be gathered from what remain, namely that it is always D. The full-stop key restores all combinations consistent with the premises and any other selection may be made, as say not-D, which will be found to be always not-A, not-B, and not-C.

At the end of every problem, when no further questions need be addressed to the machine, we press the Finis key, which has the effect of bringing into view the whole of the conceivable combinations of the alphabet. This key in fact obliterates the conditions impressed upon the machine by moving back into their ordinary places those combinations which had been rejected as inconsistent with the premises. Before beginning any new problem it is requisite to observe that the whole sixteen combinations are visible. After the Finis key has been used the machine represents a mind endowed with powers of thought, but wholly devoid of knowledge. It would not in that condition give any answer but such as would consist in the primary laws of thought themselves. But when any proposition is worked upon the keys, the machine analyses and digests the meaning of it and becomes charged with the knowledge embodied in that proposition. Accordingly it is able to return as an answer any description of a term or class so far as furnished by that proposition in accordance with the Laws of Thought. The machine is thus the embodiment of a true logical system. The combinations are classified, selected or rejected, just as they should be by a reasoning mind, so that at each step in a problem, the Logical Alphabet represents the proper condition of a mind exempt from mistake. It cannot be asserted indeed that the machine entirely supersedes the agency of conscious thought; mental labour is required in interpreting the meaning of grammatical expressions, and in correctly impressing that meaning on the machine; it is further required in gathering the conclusion from the remaining combinations. Nevertheless the true process of logical inference is really accomplished in a purely mechanical manner.

It is worthy of remark that the machine can detect any self-contradiction existing between the premises presented to it; should the premises be self-contradictory it will be found that one or more of the letter-terms disappears entirely from the Logical Alphabet. Thus if we work the two propositions, A is B, and A is not-B, and then inquire for a description of A, the machine will refuse to give it by exhibiting no combination at all containing A. This result is in agreement with the law, which I have explained, that every term must have its negative (p. 74). Accordingly, whenever any one of the letters A, B, C, D, a, b, c, d, wholly disappears from the alphabet, it may be safely inferred that some act of self-contradiction has been committed.

It ought to be carefully observed that the logical machine cannot receive a simple identity of the form A = B except in the double form of A = B and B = A. To work the proposition A = B, it is therefore necessary to press the keys—

A (left), copula, B (right), full stop;
B (left), copula, A (right), full stop.

The same double operation will be necessary whenever the proposition is not of the kind called a partial identity (p. 40). Thus AB = CD, AB = AC, A = B ꖌ C, A ꖌ B = C ꖌ D, all require to be read from both ends separately.

The proper rule for using the machine may in fact be given in the following way:—(1) Read each proposition as it stands, and play the corresponding keys: (2) Convert the proposition and read and play the keys again in the transposed order of the terms. So long as this rule is observed the true result must always be obtained. There can be no mistake. But it will be found that in the case of partial identities, and some other similar forms of propositions, the transposed reading has no effect upon the combinations of the Logical Alphabet. One reading is in such cases all that is practically needful. After some experience has been gained in the use of the machine, the worker naturally saves himself the trouble of the second reading when possible.

It is no doubt a remarkable fact that a simple identity cannot be impressed upon the machine except in the form of two partial identities, and this may be thought by some logicians to militate against the equational mode of representing propositions.

Before leaving the subject I may remark that these mechanical devices are not likely to possess much practical utility. We do not require in common life to be constantly solving complex logical questions. Even in mathematical calculation the ordinary rules of arithmetic are generally sufficient, and a calculating machine can only be used with advantage in peculiar cases. But the machine and abacus have nevertheless two important uses.

In the first place I hope that the time is not very far distant when the predominance of the ancient Aristotelian Logic will be a matter of history only, and when the teaching of logic will be placed on a footing more worthy of its supreme importance. It will then be found that the solution of logical questions is an exercise of mind at least as valuable and necessary as mathematical calculation. I believe that these mechanical devices, or something of the same kind, will then become useful for exhibiting to a class of students a clear and visible analysis of logical problems of any degree of complexity, the nature of each step being rendered plain to the eyes of the students. I often used the machine or abacus for this purpose in my class lectures while I was Professor of Logic at Owens College.

Secondly, the more immediate importance of the machine seems to consist in the unquestionable proof which it affords that correct views of the fundamental principles of reasoning have now been attained, although they were unknown to Aristotle and his followers. The time must come when the inevitable results of the admirable investigations of the late Dr. Boole must be recognised at their true value, and the plain and palpable form in which the machine presents those results will, I hope, hasten the time. Undoubtedly Boole’s life marks an era in the science of human reason. It may seem strange that it had remained for him first to set forth in its full extent the problem of logic, but I am not aware that anyone before him had treated logic as a symbolic method for evolving from any premises the description of any class whatsoever as defined by those premises. In spite of several serious errors into which he fell, it will probably be allowed that Boole discovered the true and general form of logic, and put the science substantially into the form which it must hold for evermore. He thus effected a reform with which there is hardly anything comparable in the history of logic between his time and the remote age of Aristotle.

Nevertheless, Boole’s quasi-mathematical system could hardly be regarded as a final and unexceptionable solution of the problem. Not only did it require the manipulation of mathematical symbols in a very intricate and perplexing manner, but the results when obtained were devoid of demonstrative force, because they turned upon the employment of unintelligible symbols, acquiring meaning only by analogy. I have also pointed out that he imported into his system a condition concerning the exclusive nature of alternatives (p. 70), which is not necessarily true of logical terms. I shall have to show in the next chapter that logic is really the basis of the whole science of mathematical reasoning, so that Boole inverted the true order of proof when he proposed to infer logical truths by algebraic processes. It is wonderful evidence of his mental power that by methods fundamentally false he should have succeeded in reaching true conclusions and widening the sphere of reason.

The mechanical performance of logical inference affords a demonstration both of the truth of Boole’s results and of the mistaken nature of his mode of deducing them. Conclusions which he could obtain only by pages of intricate calculation, are exhibited by the machine after one or two minutes of manipulation. And not only are those conclusions easily reached, but they are demonstratively true, because every step of the process involves nothing more obscure than the three fundamental Laws of Thought.

The Order of Premises.

Before quitting the subject of deductive reasoning, I may remark that the order in which the premises of an argument are placed is a matter of logical indifference. Much discussion has taken place at various times concerning the arrangement of the premises of a syllogism; and it has been generally held, in accordance with the opinion of Aristotle, that the so-called major premise, containing the major term, or the predicate of the conclusion, should stand first. This distinction however falls to the ground in our system, since the proposition is reduced to an identical form, in which there is no distinction of subject and predicate. In a strictly logical point of view the order of statement is wholly devoid of significance. The premises are simultaneously coexistent, and are not related to each other according to the properties of space and time. Just as the qualities of the same object are neither before nor after each other in nature (p. 33), and are only thought of in some one order owing to the limited capacity of mind, so the premises of an argument are neither before nor after each other, and are only thought of in succession because the mind cannot grasp many ideas at once. The combinations of the logical alphabet are exactly the same in whatever order the premises be treated on the logical slate or machine. Some difference may doubtless exist as regards convenience to human memory. The mind may take in the results of an argument more easily in one mode of statement than another, although there is no real difference in the logical results. But in this point of view I think that Aristotle and the old logicians were clearly wrong. It is more easy to gather the conclusion that “all A’s are C’s” from “all A’s are B’s and all B’s are C’s,” than from the same propositions in inverted order, “all B’s are C’s and all A’s are B’s.”

The Equivalence of Propositions.

One great advantage which arises from the study of this Indirect Method of Inference consists in the clear notion which we gain of the Equivalence of Propositions. The older logicians showed how from certain simple premises we might draw an inference, but they failed to point out whether that inference contained the whole, or only a part, of the information embodied in the premises. Any one proposition or group of propositions may be classed with respect to another proposition or group of propositions, as