Solving for the Analytic Piecewise Extension
of Tetration and the Super-logarithm
©2005 Andrew Robbins
Abstract
An overview of previous extensions of tetration is
presented. Specific conditions for differentiability and
piecewise continuity are shown. This leads to a way of
generating approximations of the super-logarithm. These
approximations are shown to converge to a function that
satisfies two basic properties of extensions of tetration.
This paper was broken into parts because of restrictions on file sizes, but now you can get a complete version all in one file:
But, if you still want the broken-up version, here it is:
LI(Part 1,
[Cover-sheet, Introduction, Background, and Extensions])
LI(Part 2,
[Beginning of Results])
LI(Part 3,
[End of Results, Generalization, and Conclusion])
LI(Part 4,
[Appendix A (Code) and B (Graphs)])
LI(Part 5,
[Appendix C (Data), D (Identities), and References])
