Not only natural numbers, but also ordinal numbers are well-ordered. The usual recursion can be extended to ordinal numbers. However, functions defined like are only of theoretical interest, since they have only little to do with practical combinatorial problems like it was the case for usual recursive functions.
| | | | | created: 2020-07-12 10:16:31 | modified: 2020-07-12 10:20:41 | by: bookofproofs | references: 
 Toenniessen, Fridtjof: “Topologie”, Springer, 2017