Timeline for Strong induction without a base case
Current License: CC BY-SA 2.5
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 25, 2010 at 0:11 | comment | added | Andreas Blass | It seems to me that, when you use the improved (non-case-splitting) definition of the hierarchy, the particular facts you mention at the end --- transitivity and monotonicity --- can be proved without any induction at all (provided you know that the < relation on ordinals is transitive). But I agree that other facts about the hierarchy become provable by non-case-splitting inductions. | |
| Jan 17, 2010 at 0:31 | history | edited | Joel David Hamkins | CC BY-SA 2.5 |
added 297 characters in body
|
| Jan 17, 2010 at 0:12 | history | answered | Joel David Hamkins | CC BY-SA 2.5 |