No CrossRef data available.
Article contents
Extract
In its most simple and general form the proof by recurrence of a formula containing constants and one variable consists in giving a number of successive integral values to the variable, and showing by trial that the formula is true for those values. The next step is to show that the form of the result remains the same when n+1 is substituted for n, or that each result depends upon the preceding one. If this second step is neglected, as it often used to be, the proof seems to be invalid.
This proof by mathematical or successive induction has been very generally accepted by mathematicians and neglected by logicians.
- Type
- Research Article
- Information
- Copyright
- Copyright © The Mathematical Association 1911
References
Page 142 of note 1 Algebra, 272, 288.
Page 143 of note 1 Science and Hypothesis, 9 et seq.
Page 143 of note 2 Logic, i. 325.
Page 143 of note 3 Principles of Science, 231.
Page 143 of note 4 Ninth Bridgewater Treatise, 34.
Page 146 of note 1 Calcul des Probabilités, 172.
Page 146 of note 2 Laws of Thought, xx.
Page 146 of note 3 Logic, 267.
Page 146 of note 4 Logic, III. i. and ii.
Page 147 of note 1 Horsley, iv. 540.