display all the ideas for this combination of texts
2 ideas
| 13358 | Ordinary or mathematical induction assumes for the first, then always for the next, and hence for all [Bostock] |
| Full Idea: The principle of mathematical (or ordinary) induction says suppose the first number, 0, has a property; suppose that if any number has that property, then so does the next; then it follows that all numbers have the property. | |
| From: David Bostock (Intermediate Logic [1997], 2.8) | |
| A reaction: Ordinary induction is also known as 'weak' induction. Compare Idea 13359 for 'strong' or complete induction. The number sequence must have a first element, so this doesn't work for the integers. |
| 13359 | Complete induction assumes for all numbers less than n, then also for n, and hence for all numbers [Bostock] |
| Full Idea: The principle of complete induction says suppose that for every number, if all the numbers less than it have a property, then so does it; it then follows that every number has the property. | |
| From: David Bostock (Intermediate Logic [1997], 2.8) | |
| A reaction: Complete induction is also known as 'strong' induction. Compare Idea 13358 for 'weak' or mathematical induction. The number sequence need have no first element. |