References
- Ackermann, W. (1928). Zum Hilbertschen Aufbau der reellen Zahlen. Math. Ann. 99: 118–133. DOI: 10.1007/BF01459088.
- Ackermann Function. mathworld.wolfram.com/AckermannFunction.html
- Buck, R. C. (1963). Mathematical induction and recursive definitions. Amer. Math. Monthly. 70: 128–135. DOI: 10.2307/2312881.
- Eulerian Numbers. oeis.org/A000295
- Friedman, H. (2002). Internal finite tree embeddings. Reflections on the Foundations of Mathematics (Stanford, CA, 1998). Lecture Notes in Logic, vol. 15, Association for Symbolic Logic, Urbana, IL, pp. 60–91.
- Knuth, D. (1976). Mathematics and computer science: Coping with finiteness. Science. 194(4271): 1235–1242. DOI: 10.1126/science.194.4271.1235.
- Kruskal, J. (1960). Well-quasi-ordering, the tree theorem, and Vazsonyi’s conjecture (PDF). Trans. Amer. Math. Soc. 95(2): 210–225. DOI: 10.1090/S0002-9947-1960-0111704-1.
- The Enormous TREE(3). https://www.numberphile.com/videos/the-enormous-tree3
- Tree Sequence. googology.wikia.com/wiki/TREE_sequence