Science and Hypothesis

Question

"The syllogism can teach us nothing essentially new," Poincaré declares. If this is true, what specific aspects of mathematical activity or discovery does this statement challenge, and how might one begin to explain the generation of genuinely new mathematical knowledge?

Synthesized answer

The statement that "the syllogism can teach us nothing essentially new" [1] challenges the very nature of mathematical activity and discovery by questioning its potential for generating genuinely new knowledge. If syllogistic reasoning is merely analytical and incapable of adding to given data [2], then mathematics, if reducible to syllogisms, would only present truths already contained within its axioms or intuitions [2]. Mathematical activity would then become a process of disguising borrowed knowledge [1, 2] or a series of verifications that lead to nothing new, as the conclusion is merely a translation of the premises [5]. The "creative virtue" of mathematical reasoning, which distinguishes it from the syllogism, is therefore challenged [1].

The passages suggest that the generation of genuinely new mathematical knowledge might arise from methods beyond purely analytical or syllogistic processes. Mathematical reasoning has a "creative virtue" [1]. While analytical instruments like algebraical calculus are incapable of teaching anything new [4], and verification is analytical and leads to nothing [5], real proofs are described as fruitful because the conclusion is "in a sense…

Synthesized from the book passages below. Chat with the book on Feynman for follow-up.

From the book

ould we not therefore have reason for asking if the syllogistic apparatus serves only to disguise what we have borrowed? The contradiction will strike us the more if we open any book on mathematics; on every page the author announces his intention of generalising some proposition already known. Does the mathematical method proceed from the particular to the general, and, if so, how can it be called deductive? ​ Finally, if the science of number were merely analytical, or could be analytically derived from a few synthetic intuitions, it seems that a sufficiently powerful mind could with a…
Passage [4]
direct ways of saying that A is A? No doubt we may refer back to axioms which are at the source of all these reasonings. If it is felt that they cannot be reduced to the principle of contradiction, if we decline to see in them any more than experimental facts which have no part or lot in mathematical necessity, there is still one resource left to us: we may class them among à priori synthetic views. But this is no solution of the difficulty it is merely giving it a name; and even if the nature of the synthetic views had no longer for us any mystery, the contradiction would not have…
Passage [3]
tains as particular cases all the majors. This unending series of syllogisms is thus reduced to a phrase of a few lines. It is now easy to understand why every particular consequence of a theorem may, as I have above explained, be verified by purely analytical processes. If, instead of proving that our theorem is true for all numbers, we only wish to show that it is true for the number 6 for instance, it will be enough to establish the first five syllogisms in our cascade. We shall require 9 if we wish to prove it for the number 10; for a greater number we shall require more still; but…
Passage [14]
gs vividly to light the process, which is uniform, ​ and is met again at every step. The process is proof by recurrence. We first show that a theorem is true for n = 1; we then show that if it is true for n - 1 it is true for n , and we conclude that it is true for all integers. We have now seen how it may be used for the proof of the rules of addition and multiplication—that is to say, for the rules of the algebraical calculus. This calculus is an instrument of transformation which lends itself to many more different combinations than the simple syllogism; but it is still a purely analytical…
Passage [12]
one or other of two purely conventional definitions, and we have verified their identity; nothing new has been learned. Verification differs from proof precisely because it is analytical, and because it leads to nothing. It leads to nothing because the conclusion is nothing but the premisses translated into another language. A real proof, on the other hand, is fruitful, because the conclusion is in a sense more general than the premisses. The equality 2 + 2 = 4 can be verified because it is particular. Each individual enunciation in mathematics may be always verified in the same way. But if…
Passage [6]

More questions about this book