The first four hyperoperations are shown here, with tetration being considered the fourth in the series. The unary operation succession, defined as ${\displaystyle a'=a+1}$, is considered to be the zeroth operation.

1. Addition $${\displaystyle a+n=a+\underbrace {1+1+\cdots +1} _{n}}$$ n copies of 1 added to a combined by succession.
2. Multiplication $${\displaystyle a\times n=\underbrace {a+a+\cdots +a} _{n}}$$ n copies of a combined by addition.
3. Exponentiation $${\displaystyle a^{n}=\underbrace {a\times a\times \cdots \times a} _{n}}$$ n copies of a combined by multiplication.
4. Tetration $${\displaystyle {^{n}a}=\underbrace {a^{a^{\cdot ^{\cdot ^{a}}}}} _{n}}$$ n copies of a combined by exponentiation, right-to-left.

Importantly, nested exponents are interpreted from the top down: ⁠${\displaystyle a^{b^{c}}}$⁠ means ⁠${\displaystyle a^{\left(b^{c}\right)}}$⁠ and not ⁠${\displaystyle \left(a^{b}\right)^{c}.}$⁠

Succession, ${\displaystyle a_{n+1}=a_{n}+1}$, is the most basic operation; while addition (${\displaystyle a+n}$) is a primary operation, for addition of natural numbers it can be thought of as a chained succession of ${\displaystyle n}$ successors of ${\displaystyle a}$; multiplication (${\displaystyle a\times n}$) is also a primary operation, though for natural numbers it can analogously be thought of as a chained addition involving ${\displaystyle n}$ numbers of ${\displaystyle a}$. Exponentiation can be thought of as a chained multiplication involving ${\displaystyle n}$ numbers of ${\displaystyle a}$ and tetration (${\displaystyle ^{n}a}$) as a chained power involving ${\displaystyle n}$ numbers ${\displaystyle a}$. Each of the operations above are defined by iterating the previous one;^[1] however, unlike the operations before it, tetration is not an elementary function.

The parameter ${\displaystyle a}$ is referred to as the base, while the parameter ${\displaystyle n}$ may be referred to as the height. In the original definition of tetration, the height parameter must be a natural number; for instance, it would be illogical to say "three raised to itself negative five times" or "four raised to itself one half of a time." However, just as addition, multiplication, and exponentiation can be defined in ways that allow for extensions to real and complex numbers, several attempts have been made to generalize tetration to negative numbers, real numbers, and complex numbers. One such way for doing so is using a recursive definition for tetration; for any positive real ${\displaystyle a>0}$ and non-negative integer ${\displaystyle n\geq 0}$, we can define ${\displaystyle \,\!{^{n}a}}$ recursively as:^[1]

${\displaystyle {^{n}a}:={\begin{cases}1&{\text{if }}n=0\\a^{\left(^{(n-1)}a\right)}&{\text{if }}n>0\end{cases}}}$

The recursive definition is equivalent to repeated exponentiation for natural heights; however, this definition allows for extensions to the other heights such as ${\displaystyle ^{0}a}$, ${\displaystyle ^{-1}a}$, and ${\displaystyle ^{i}a}$ as well – many of these extensions are areas of active research.

There are many terms for tetration, each of which has some logic behind it, but some have not become commonly used for one reason or another. Here is a comparison of each term with its rationale and counter-rationale.

• The term tetration, introduced by Goodstein in his 1947 paper Transfinite Ordinals in Recursive Number Theory^[2] (generalizing the recursive base-representation used in Goodstein's theorem to use higher operations), has gained dominance. It was also popularized in Rudy Rucker's Infinity and the Mind.
• The term superexponentiation was published by Bromer in his paper Superexponentiation in 1987.^[3] It was used earlier by Ed Nelson in his book Predicative Arithmetic, Princeton University Press, 1986.
• The term hyperpower^[4] is a natural combination of hyper and power, which aptly describes tetration. The problem lies in the meaning of hyper with respect to the hyperoperation sequence. When considering hyperoperations, the term hyper refers to all ranks, and the term super refers to rank 4, or tetration. So under these considerations hyperpower is misleading, since it is only referring to tetration.
• The term power tower^[5] is occasionally used, in the form "the power tower of order n" for ${\displaystyle {\ \atop {\ }}{{\underbrace {a^{a^{\cdot ^{\cdot ^{a}}}}} } \atop n}}$. Exponentiation is easily misconstrued: note that the operation of raising to a power is right-associative (see below). Tetration is iterated exponentiation (call this right-associative operation ^), starting from the top right side of the expression with an instance a^a (call this value c). Exponentiating the next leftward a (call this the 'next base' b), is to work leftward after obtaining the new value b^c. Working to the left, use the next a to the left, as the base b, and evaluate the new b^c. 'Descend down the tower' in turn, with the new value for c on the next downward step.

Owing in part to some shared terminology and similar notational symbolism, tetration is often confused with closely related functions and expressions. Here are a few related terms:

Terms related to tetration

Terminology	Form
Tetration	${\displaystyle a^{a^{\cdot ^{\cdot ^{a^{a}}}}}}$
Iterated exponentials	${\displaystyle a^{a^{\cdot ^{\cdot ^{a^{x}}}}}}$
Nested exponentials (also towers)	${\displaystyle a_{1}^{a_{2}^{\cdot ^{\cdot ^{a_{n}}}}}}$
Infinite exponentials (also towers)	${\displaystyle a_{1}^{a_{2}^{a_{3}^{\cdot ^{\cdot ^{\cdot }}}}}}$

In the first two expressions a is the base, and the number of times a appears is the height (add one for x). In the third expression, n is the height, but each of the bases is different.

Care must be taken when referring to iterated exponentials, as it is common to call expressions of this form iterated exponentiation, which is ambiguous, as this can either mean iterated powers or iterated exponentials.

There are many different notation styles that can be used to express tetration. Some notations can also be used to describe other hyperoperations, while some are limited to tetration and have no immediate extension.

Notation styles for tetration

Name	Form	Description
Knuth's up-arrow notation	${\displaystyle {\begin{aligned}a{\uparrow \uparrow }n\\a{\uparrow }^{2}n\end{aligned}}}$	Allows extension by putting more arrows, or, even more powerfully, an indexed arrow.
Conway chained arrow notation	${\displaystyle a\rightarrow n\rightarrow 2}$	Allows extension by increasing the number 2 (equivalent with the extensions above), but also, even more powerfully, by extending the chain.
Ackermann function	${\displaystyle {}^{n}2=\operatorname {A} (4,n-3)+3}$	Allows the special case ${\displaystyle a=2}$ to be written in terms of the Ackermann function.
Iterated exponential notation	${\displaystyle \exp _{a}^{n}(1)}$	Allows simple extension to iterated exponentials from initial values other than 1.
Hooshmand notations[6]	${\displaystyle {\begin{aligned}&\operatorname {uxp} _{a}n\\[2pt]&a^{\frac {n}{}}\end{aligned}}}$	Used by M. H. Hooshmand [2006].
Hyperoperation notations	${\displaystyle {\begin{aligned}&a[4]n\\[2pt]&H_{4}(a,n)\end{aligned}}}$	Allows extension by increasing the number 4; this gives the family of hyperoperations.
Double caret notation	a^^n	Since the up-arrow is used identically to the caret (^), tetration may be written as (^^); convenient for ASCII.

One notation above uses iterated exponential notation; this is defined in general as follows:

${\displaystyle \exp _{a}^{n}(x)=a^{a^{\cdot ^{\cdot ^{a^{x}}}}}}$ with n as.

There are not as many notations for iterated exponentials, but here are a few:

Notation styles for iterated exponentials

Name	Form	Description
Standard notation	${\displaystyle \exp _{a}^{n}(x)}$	Euler coined the notation ${\displaystyle \exp _{a}(x)=a^{x}}$, and iteration notation ${\displaystyle f^{n}(x)}$ has been around about as long.
Knuth's up-arrow notation	${\displaystyle (a{\uparrow }^{2}(x))}$	Allows for super-powers and super-exponential function by increasing the number of arrows; used in the article on large numbers.
Text notation	exp_a^n(x)	Based on standard notation; convenient for ASCII.
J notation	x^^:(n-1)x	Repeats the exponentiation. See J (programming language).[7]
Infinity barrier notation	${\displaystyle a\uparrow \uparrow n|x}$	Jonathan Bowers coined this,[8] and it can be extended to higher hyper-operations.

Because of the extremely fast growth of tetration, most values in the following table are too large to write in scientific notation. In these cases, iterated exponential notation is used to express them in base 10. The values containing a decimal point are approximate. Usually, the limit that can be calculated in a numerical calculation program such as Wolfram Alpha is 3↑↑4, and the number of digits up to 3↑↑5 can be expressed.

Examples of tetration

${\displaystyle x}$	${\displaystyle {}^{2}x}$	${\displaystyle {}^{3}x}$	${\displaystyle {}^{4}x}$	${\displaystyle {}^{5}x}$	${\displaystyle {}^{6}x}$	${\displaystyle {}^{7}x}$
1	1	1	1	1	1	1
2	4 (22)	16 (24)	65,536 (216)	2.00353 × 1019,728	${\displaystyle \exp _{10}^{3}(4.29508)}$ (106.03123×1019,727)	${\displaystyle \exp _{10}^{4}(4.29508)}$
3	27 (33)	7,625,597,484,987 (327)	1.25801 × 103,638,334,640,024 [9]	${\displaystyle \exp _{10}^{4}(1.09902)}$ (106.00225×103,638,334,640,023)	${\displaystyle \exp _{10}^{5}(1.09902)}$	${\displaystyle \exp _{10}^{6}(1.09902)}$
4	256 (44)	1.34078 × 10154 (4256)	${\displaystyle \exp _{10}^{3}(2.18726)}$ (108.0723×10153)	${\displaystyle \exp _{10}^{4}(2.18726)}$	${\displaystyle \exp _{10}^{5}(2.18726)}$	${\displaystyle \exp _{10}^{6}(2.18726)}$
5	3,125 (55)	1.91101 × 102,184 (53,125)	${\displaystyle \exp _{10}^{3}(3.33928)}$ (101.33574×102,184)	${\displaystyle \exp _{10}^{4}(3.33928)}$	${\displaystyle \exp _{10}^{5}(3.33928)}$	${\displaystyle \exp _{10}^{6}(3.33928)}$
6	46,656 (66)	2.65912 × 1036,305 (646,656)	${\displaystyle \exp _{10}^{3}(4.55997)}$ (102.0692×1036,305)	${\displaystyle \exp _{10}^{4}(4.55997)}$	${\displaystyle \exp _{10}^{5}(4.55997)}$	${\displaystyle \exp _{10}^{6}(4.55997)}$
7	823,543 (77)	3.75982 × 10695,974 (7823,543)	${\displaystyle \exp _{10}^{3}(5.84259)}$ (3.17742 × 10695,974 digits)	${\displaystyle \exp _{10}^{4}(5.84259)}$	${\displaystyle \exp _{10}^{5}(5.84259)}$	${\displaystyle \exp _{10}^{6}(5.84259)}$
8	16,777,216 (88)	6.01452 × 1015,151,335	${\displaystyle \exp _{10}^{3}(7.18045)}$ (5.43165 × 1015,151,335 digits)	${\displaystyle \exp _{10}^{4}(7.18045)}$	${\displaystyle \exp _{10}^{5}(7.18045)}$	${\displaystyle \exp _{10}^{6}(7.18045)}$
9	387,420,489 (99)	4.28125 × 10369,693,099	${\displaystyle \exp _{10}^{3}(8.56784)}$ (4.08535 × 10369,693,099 digits)	${\displaystyle \exp _{10}^{4}(8.56784)}$	${\displaystyle \exp _{10}^{5}(8.56784)}$	${\displaystyle \exp _{10}^{6}(8.56784)}$
10	10,000,000,000 (1010)	1010,000,000,000	${\displaystyle \exp _{10}^{4}(1)}$ (1010,000,000,000 + 1 digits)	${\displaystyle \exp _{10}^{5}(1)}$	${\displaystyle \exp _{10}^{6}(1)}$	${\displaystyle \exp _{10}^{7}(1)}$

Remark: If x does not differ from 10 by orders of magnitude, then for all ${\displaystyle k\geq 3,~^{m}x=\exp _{10}^{k}z,~z>1~\Rightarrow ~^{m+1}x=\exp _{10}^{k+1}z'{\text{ with }}z'\approx z}$. For example, ${\displaystyle z-z'<1.5\cdot 10^{-15}{\text{ for }}x=3=k,~m=4}$ in the above table, and the difference is even smaller for the following rows.

Tetration can be extended in two different ways; in the equation ${\displaystyle ^{n}a\!}$, both the base a and the height n can be generalized using the definition and properties of tetration. Although the base and the height can be extended beyond the non-negative integers to different domains, including ${\displaystyle {^{n}0}}$, complex functions such as ${\displaystyle {}^{n}i}$, and heights of infinite n, the more limited properties of tetration reduce the ability to extend tetration.

The exponential ${\displaystyle 0^{0}}$ is not consistently defined. Thus, the tetrations ${\displaystyle \,{^{n}0}}$ are not clearly defined by the formula given earlier. However, ${\displaystyle \lim _{x\rightarrow 0}{}^{n}x}$ is well defined, and exists:^[10]

${\displaystyle \lim _{x\rightarrow 0}{}^{n}x={\begin{cases}1,&n{\text{ even}}\\0,&n{\text{ odd}}\end{cases}}}$

Thus we could consistently define ${\displaystyle {}^{n}0=\lim _{x\rightarrow 0}{}^{n}x}$. This is analogous to defining ${\displaystyle 0^{0}=1}$.

Under this extension, ${\displaystyle {}^{0}0=1}$, so the rule ${\displaystyle {^{0}a}=1}$ from the original definition still holds.

Since complex numbers can be raised to powers, tetration can be applied to bases of the form z = a + bi (where a and b are real). For example, in ⁿz with z = i, tetration is achieved by using the principal branch of the natural logarithm; using Euler's formula we get the relation:

${\displaystyle i^{a+bi}=e^{{\frac {1}{2}}{\pi i}(a+bi)}=e^{-{\frac {1}{2}}{\pi b}}\left(\cos {\frac {\pi a}{2}}+i\sin {\frac {\pi a}{2}}\right)}$

This suggests a recursive definition for ⁿ⁺¹i = a′ + b′i given any ⁿi = a + bi:

${\displaystyle {\begin{aligned}a'&=e^{-{\frac {1}{2}}{\pi b}}\cos {\frac {\pi a}{2}}\\[2pt]b'&=e^{-{\frac {1}{2}}{\pi b}}\sin {\frac {\pi a}{2}}\end{aligned}}}$

The following approximate values can be derived:

Values of tetration of complex bases

${\textstyle {}^{n}i}$	Approximate value
${\textstyle {}^{1}i=i}$	i
${\textstyle {}^{2}i=i^{\left({}^{1}i\right)}}$	0.2079
${\textstyle {}^{3}i=i^{\left({}^{2}i\right)}}$	0.9472 + 0.3208i
${\textstyle {}^{4}i=i^{\left({}^{3}i\right)}}$	0.0501 + 0.6021i
${\textstyle {}^{5}i=i^{\left({}^{4}i\right)}}$	0.3872 + 0.0305i
${\textstyle {}^{6}i=i^{\left({}^{5}i\right)}}$	0.7823 + 0.5446i
${\textstyle {}^{7}i=i^{\left({}^{6}i\right)}}$	0.1426 + 0.4005i
${\textstyle {}^{8}i=i^{\left({}^{7}i\right)}}$	0.5198 + 0.1184i
${\textstyle {}^{9}i=i^{\left({}^{8}i\right)}}$	0.5686 + 0.6051i

Solving the inverse relation, as in the previous section, yields the expected ⁰i = 1 and ⁻¹i = 0, with negative values of n giving infinite results on the imaginary axis.^{[citation needed]} Plotted in the complex plane, the entire sequence spirals to the limit 0.4383 + 0.3606i, which could be interpreted as the value where n is infinite.

Such tetration sequences have been studied since the time of Euler, but are poorly understood due to their chaotic behavior. Most published research historically has focused on the convergence of the infinitely iterated exponential function. Current research has greatly benefited by the advent of powerful computers with fractal and symbolic mathematics software. Much of what is known about tetration comes from general knowledge of complex dynamics and specific research of the exponential map.^{[citation needed]}

Tetration can be extended to infinite heights; i.e., for certain a and n values in ${\displaystyle {}^{n}a}$, there exists a well defined result for an infinite n. This is because for bases within a certain interval, tetration converges to a finite value as the height tends to infinity. For example, ${\displaystyle {\sqrt {2}}^{{\sqrt {2}}^{{\sqrt {2}}^{\cdot ^{\cdot ^{\cdot }}}}}}$ converges to 2, and can therefore be said to be equal to 2. The trend towards 2 can be seen by evaluating a small finite tower:

${\displaystyle {\begin{aligned}{\sqrt {2}}^{{\sqrt {2}}^{{\sqrt {2}}^{{\sqrt {2}}^{{\sqrt {2}}^{1.414}}}}}&\approx {\sqrt {2}}^{{\sqrt {2}}^{{\sqrt {2}}^{{\sqrt {2}}^{1.63}}}}\\&\approx {\sqrt {2}}^{{\sqrt {2}}^{{\sqrt {2}}^{1.76}}}\\&\approx {\sqrt {2}}^{{\sqrt {2}}^{1.84}}\\&\approx {\sqrt {2}}^{1.89}\\&\approx 1.93\end{aligned}}}$

In general, the infinitely iterated exponential ${\displaystyle x^{x^{\cdot ^{\cdot ^{\cdot }}}}\!\!}$, defined as the limit of ${\displaystyle {}^{n}x}$ as n goes to infinity, converges for e^−e ≤ x ≤ e^1/e, roughly the interval from 0.066 to 1.44, a result shown by Leonhard Euler.^[11] The limit, should it exist, is a positive real solution of the equation y = x^y. Thus, x = y^1/y. The limit defining the infinite exponential of x does not exist when x > e^1/e because the maximum of y^1/y is e^1/e. The limit also fails to exist when 0 < x < e^−e.

This may be extended to complex numbers z with the definition:

${\displaystyle {}^{\infty }z=z^{z^{\cdot ^{\cdot ^{\cdot }}}}={\frac {\mathrm {W} (-\ln {z})}{-\ln {z}}}~,}$

where W represents Lambert's W function.

As the limit y = ^∞x (if existent on the positive real line, i.e. for e^−e ≤ x ≤ e^1/e) must satisfy x^y = y we see that x ↦ y = ^∞x is (the lower branch of) the inverse function of y ↦ x = y^1/y.

We can use the recursive rule for tetration,

${\displaystyle {^{k+1}a}=a^{\left({^{k}a}\right)},}$

to prove ${\displaystyle {}^{-1}a}$:

${\displaystyle ^{k}a=\log _{a}\left(^{k+1}a\right);}$

Substituting −1 for k gives

${\displaystyle {}^{-1}a=\log _{a}\left({}^{0}a\right)=\log _{a}1=0}$.^[12]

Smaller negative values cannot be well defined in this way. Substituting −2 for k in the same equation gives

${\displaystyle {}^{-2}a=\log _{a}\left({}^{-1}a\right)=\log _{a}0=-\infty }$

which is not well defined. They can, however, sometimes be considered sets.^[12]

For ${\displaystyle n=1}$, any definition of ${\displaystyle \,\!{^{-1}1}}$ is consistent with the rule because

${\displaystyle {^{0}1}=1=1^{n}}$ for any ${\displaystyle \,\!n={^{-1}1}}$.

A linear approximation (solution to the continuity requirement, approximation to the differentiability requirement) is given by:

${\displaystyle {}^{x}a\approx {\begin{cases}\log _{a}\left(^{x+1}a\right)&x\leq -1\\1+x&-1<x\leq 0\\a^{\left(^{x-1}a\right)}&0<x\end{cases}}}$

hence:

Linear approximation values

Approximation	Domain
${\textstyle {}^{x}a\approx x+1}$	for −1 < x < 0
${\textstyle {}^{x}a\approx a^{x}}$	for 0 < x < 1
${\textstyle {}^{x}a\approx a^{a^{(x-1)}}}$	for 1 < x < 2

and so on. However, it is only piecewise differentiable; at integer values of x, the derivative is multiplied by ${\displaystyle \ln {a}}$. It is continuously differentiable for ${\displaystyle x>-2}$ if and only if ${\displaystyle a=e}$. For example, using these methods ${\displaystyle {}^{\frac {\pi }{2}}e\approx 5.868...}$ and ${\displaystyle {}^{-4.3}0.5\approx 4.03335...}$

A main theorem in Hooshmand's paper^[6] states: Let ${\displaystyle 0<a\neq 1}$. If ${\displaystyle f:(-2,+\infty )\rightarrow \mathbb {R} }$ is continuous and satisfies the conditions:

• ${\displaystyle f(x)=a^{f(x-1)}\;\;{\text{for all}}\;\;x>-1,\;f(0)=1,}$
• ${\displaystyle f}$ is differentiable on (−1, 0),
• ${\displaystyle f^{\prime }}$ is a nondecreasing or nonincreasing function on (−1, 0),
• ${\displaystyle f^{\prime }\left(0^{+}\right)=(\ln a)f^{\prime }\left(0^{-}\right){\text{ or }}f^{\prime }\left(-1^{+}\right)=f^{\prime }\left(0^{-}\right).}$

then ${\displaystyle f}$ is uniquely determined through the equation

${\displaystyle f(x)=\exp _{a}^{[x]}\left(a^{(x)}\right)=\exp _{a}^{[x+1]}((x))\quad {\text{for all}}\;\;x>-2,}$

where ${\displaystyle (x)=x-[x]}$ denotes the fractional part of x and ${\displaystyle \exp _{a}^{[x]}}$ is the ${\displaystyle [x]}$-iterated function of the function ${\displaystyle \exp _{a}}$.

The proof is that the second through fourth conditions trivially imply that f is a linear function on [−1, 0].

The linear approximation to natural tetration function ${\displaystyle {}^{x}e}$ is continuously differentiable, but its second derivative does not exist at integer values of its argument. Hooshmand derived another uniqueness theorem for it which states:

If ${\displaystyle f:(-2,+\infty )\rightarrow \mathbb {R} }$ is a continuous function that satisfies:

• ${\displaystyle f(x)=e^{f(x-1)}\;\;{\text{for all}}\;\;x>-1,\;f(0)=1,}$
• ${\displaystyle f}$ is convex on (−1, 0),
• ${\displaystyle f^{\prime }\left(0^{-}\right)\leq f^{\prime }\left(0^{+}\right).}$

then ${\displaystyle f={\text{uxp}}}$. [Here ${\displaystyle f={\text{uxp}}}$ is Hooshmand's name for the linear approximation to the natural tetration function.]

The proof is much the same as before; the recursion equation ensures that ${\displaystyle f^{\prime }(-1^{+})=f^{\prime }(0^{+}),}$ and then the convexity condition implies that ${\displaystyle f}$ is linear on (−1, 0).

Therefore, the linear approximation to natural tetration is the only solution of the equation ${\displaystyle f(x)=e^{f(x-1)}\;\;(x>-1)}$ and ${\displaystyle f(0)=1}$ which is convex on (−1, +∞). All other sufficiently-differentiable solutions must have an inflection point on the interval (−1, 0).

Beyond linear approximations, a quadratic approximation (to the differentiability requirement) is given by:

${\displaystyle {}^{x}a\approx {\begin{cases}\log _{a}\left({}^{x+1}a\right)&x\leq -1\\1+{\frac {2\ln(a)}{1\;+\;\ln(a)}}x-{\frac {1\;-\;\ln(a)}{1\;+\;\ln(a)}}x^{2}&-1<x\leq 0\\a^{\left({}^{x-1}a\right)}&x>0\end{cases}}}$

which is differentiable for all ${\displaystyle x>0}$, but not twice differentiable. For example, ${\displaystyle {}^{\frac {1}{2}}2\approx 1.45933...}$ If ${\displaystyle a=e}$ this is the same as the linear approximation.^[1]

Because of the way it is calculated, this function does not "cancel out", contrary to exponents, where ${\displaystyle \left(a^{\frac {1}{n}}\right)^{n}=a}$. Namely,

${\displaystyle {}^{n}\left({}^{\frac {1}{n}}a\right)=\underbrace {\left({}^{\frac {1}{n}}a\right)^{\left({}^{\frac {1}{n}}a\right)^{\cdot ^{\cdot ^{\cdot ^{\cdot ^{\left({}^{\frac {1}{n}}a\right)}}}}}}} _{n}\neq a}$.

Just as there is a quadratic approximation, cubic approximations and methods for generalizing to approximations of degree n also exist, although they are much more unwieldy.^[1][13]

In 2017, it was proved^[14] that there exists a unique function ${\displaystyle F}$ satisfying ${\displaystyle F(z+1)=\exp {\bigl (}F(z){\bigr )}}$ (equivalently ${\displaystyle F(z+1)=b^{F(z)}}$ when ${\displaystyle b=e}$), with the auxiliary conditions ${\displaystyle F(0)=1}$, and ${\displaystyle F(z)\to \xi _{\pm }}$ (the attracting/repelling fixed points of the logarithm, roughly ${\displaystyle 0.318\pm 1.337\,\mathrm {i} }$) as ${\displaystyle z\to \pm i\infty }$. Moreover, ${\displaystyle F}$ is holomorphic on all of ${\displaystyle \mathbb {C} }$ except for the cut along the real axis at ${\displaystyle z\leq -2}$. This construction was first conjectured by Kouznetsov (2009)^[15] and rigorously carried out by Kneser in 1950.^[16] Paulsen & Cowgill’s proof extends Kneser’s original construction to any base ${\displaystyle b>e^{1/e}\approx 1.445}$, and subsequent work showed how to allow ${\displaystyle b\in \mathbb {C} }$ with ${\displaystyle |b|>e^{1/e}}$.^[17]

In May 2025, Vey gave a unified, holomorphic extension for arbitrary complex bases ${\displaystyle b\in \mathbb {C} \setminus \{0,1\}}$ and complex heights ${\displaystyle z\in \mathbb {C} }$ by means of Schröder’s equation. In particular, one constructs a linearizing coordinate near the attracting (or repelling) fixed point of the map ${\displaystyle f(w)=b^{w}}$, and then patches together two analytic expansions (one around each fixed point) to produce a single function ${\displaystyle F_{b}(z)}$ that satisfies ${\displaystyle F_{b}(z+1)=b^{\,F_{b}(z)}}$ and ${\displaystyle F_{b}(0)=1}$ on all of ${\displaystyle \mathbb {C} }$. The key step is to define ${\displaystyle \displaystyle \Phi _{b}(w)=\lim _{n\to \infty }\;s^{n}{\Bigl (}f^{\circ n}(w)-\alpha {\Bigr )},}$ where ${\displaystyle \alpha }$ is a fixed point of ${\displaystyle f(w)=b^{w}}$, ${\displaystyle s=f'(\alpha )}$, and ${\displaystyle f^{\circ n}}$ denotes ${\displaystyle n}$-fold iteration. One then solves Schröder’s functional equation ${\displaystyle \Phi _{b}{\bigl (}b^{\,w}{\bigr )}\;=\;s\;\Phi _{b}(w)}$ locally (for ${\displaystyle w}$ near ${\displaystyle \alpha }$), extends both branches holomorphically, and glues them so that there is no monodromy except the known cut-lines. Vey also provides explicit series for the coefficients ${\displaystyle a_{n}^{(b)}}$ in the local Schröder expansion: ${\displaystyle \Phi _{b}(w)=\sum _{n=0}^{\infty }a_{n}^{(b)}\,(w-\alpha )^{n},}$ and gives rigorous bounds proving factorial convergence of ${\displaystyle a_{n}^{(b)}}$.^[18]

Using Kneser’s (and Vey’s) tetration, example values include ${\displaystyle {}^{\tfrac {\pi }{2}}e\approx 5.82366\ldots }$, ${\displaystyle {}^{\tfrac {1}{2}}2\approx 1.45878\ldots }$, and ${\displaystyle {}^{\tfrac {1}{2}}e\approx 1.64635\ldots }$.

The requirement that tetration be holomorphic on all of ${\displaystyle \mathbb {C} }$ (except for the known cuts) is essential for uniqueness. If one relaxes holomorphicity, there are infinitely many real‐analytic “solutions” obtained by pre‐ or post‐composing with almost‐periodic perturbations. For example, for any fast‐decaying real sequences ${\displaystyle \{\alpha _{n}\}}$ and ${\displaystyle \{\beta _{n}\}}$, one can set ${\displaystyle S(z)=F_{b}{\Bigl (}\,z+\sum _{n=1}^{\infty }\sin(2\pi n\,z)\,\alpha _{n}+\sum _{n=1}^{\infty }{\bigl [}1-\cos(2\pi n\,z){\bigr ]}\,\beta _{n}{\Bigr )},}$ which still satisfies ${\displaystyle S(z+1)=b^{S(z)}}$ and ${\displaystyle S(0)=1}$, but has additional singularities creeping in from the imaginary direction.

<!-- Example of “calling” Vey’s solution in pseudocode (series form) -->
function ComplexTetration(b, z):
    # 1) Find attracting fixed point alpha of w ↦ b^w
    α ← the unique solution of α = b^α near the real line
    # 2) Compute multiplier s = b^α · ln(b)
    s ← b**α * log(b)
    # 3) Solve Schröder’s equation coefficients {a_n} around α:
    #    Φ_b(w) = ∑_{n=0}^∞ a_n · (w − α)^n,   Φ_b(b^w) = s · Φ_b(w)
    {a_n} ← SolveLinearSystemSchroeder(b, α, s)
    # 4) Define inverse φ_b⁻¹ via the local power series around 0
    φ_inv(u) = α + ∑_{n=1}^∞ c_n · u^n   # (coefficients c_n from series inversion)
    # 5) Put F_b(z) = φ_b⁻¹(s^(-z) · Φ_b(1))
    return φ_inv( s^(−z) * ∑_{n=0}^∞ a_n · (1 − α)^n )

Tetration can be defined for ordinal numbers via transfinite induction. For all α and all β > 0: $${\displaystyle {}^{0}\alpha =1}$$ $${\displaystyle {}^{\beta }\alpha =\sup(\{\alpha ^{{}^{\gamma }\alpha }:\gamma <\beta \})\,.}$$

Tetration (restricted to ${\displaystyle \mathbb {N} ^{2}}$) is not an elementary recursive function. One can prove by induction that for every elementary recursive function f, there is a constant c such that

${\displaystyle f(x)\leq \underbrace {2^{2^{\cdot ^{\cdot ^{x}}}}} _{c}.}$

We denote the right hand side by ${\displaystyle g(c,x)}$. Suppose on the contrary that tetration is elementary recursive. ${\displaystyle g(x,x)+1}$ is also elementary recursive. By the above inequality, there is a constant c such that ${\displaystyle g(x,x)+1\leq g(c,x)}$. By letting ${\displaystyle x=c}$, we have that ${\displaystyle g(c,c)+1\leq g(c,c)}$, a contradiction.

Exponentiation has two inverse operations; roots and logarithms. Analogously, the inverses of tetration are often called the super-root, and the super-logarithm (In fact, all hyperoperations greater than or equal to 3 have analogous inverses); e.g., in the function ${\displaystyle {^{3}}y=x}$, the two inverses are the cube super-root of y and the super-logarithm base y of x.

The super-root is the inverse operation of tetration with respect to the base: if ${\displaystyle ^{n}y=x}$, then y is an nth super-root of x (${\displaystyle {\sqrt[{n}]{x}}_{s}}$ or ${\displaystyle {\sqrt[{4}]{x}}_{s}}$).

For example,

${\displaystyle ^{4}2=2^{2^{2^{2}}}=65{,}536}$

so 2 is the 4th super-root of 65,536 ${\displaystyle \left({\sqrt[{4}]{65{,}536}}_{s}=2\right)}$.

The 2nd-order super-root, square super-root, or super square root has two equivalent notations, ${\displaystyle \mathrm {ssrt} (x)}$ and ${\displaystyle {\sqrt {x}}_{s}}$. It is the inverse of ${\displaystyle ^{2}x=x^{x}}$ and can be represented with the Lambert W function:^[19]

${\displaystyle \mathrm {ssrt} (x)=\exp(W(\ln x))={\frac {\ln x}{W(\ln x)}}}$ or

${\displaystyle {\sqrt {x}}_{s}=e^{W(\ln x)}}$

The function also illustrates the reflective nature of the root and logarithm functions as the equation below only holds true when ${\displaystyle y=\mathrm {ssrt} (x)}$:

${\displaystyle {\sqrt[{y}]{x}}=\log _{y}x}$

Like square roots, the square super-root of x may not have a single solution. Unlike square roots, determining the number of square super-roots of x may be difficult. In general, if ${\displaystyle e^{-1/e}<x<1}$, then x has two positive square super-roots between 0 and 1 calculated using formulas:${\displaystyle {\sqrt {x}}_{s}=\left\{e^{W_{-1}(\ln x)};e^{W_{0}(\ln x)}\right\}}$; and if ${\displaystyle x>1}$, then x has one positive square super-root greater than 1 calculated using formulas: ${\displaystyle {\sqrt {x}}_{s}=e^{W_{0}(\ln x)}}$. If x is positive and less than ${\displaystyle e^{-1/e}}$ it does not have any real square super-roots, but the formula given above yields countably infinitely many complex ones for any finite x not equal to 1.^[19] The function has been used to determine the size of data clusters.^[20]

At ${\displaystyle x=1}$:

$${\displaystyle \mathrm {ssrt} (x)=1+(x-1)-(x-1)^{2}+{\frac {3}{2}}(x-1)^{3}-{\frac {17}{6}}(x-1)^{4}+{\frac {37}{6}}(x-1)^{5}-{\frac {1759}{120}}(x-1)^{6}+{\frac {13279}{360}}(x-1)^{7}+{\mathcal {O}}{\left((x-1)^{8}\right)}}$$

One of the simpler and faster formulas for a third-degree super-root is the recursive formula. If ${\displaystyle y=x^{x^{x}}}$ then one can use:

• ${\displaystyle x_{0}=1}$
• ${\displaystyle x_{n+1}=\exp(W(W(x_{n}\ln y)))}$

For each integer n > 2, the function ⁿx is defined and increasing for x ≥ 1, and ⁿ1 = 1, so that the nth super-root of x, ${\displaystyle {\sqrt[{n}]{x}}_{s}}$, exists for x ≥ 1.

However, if the linear approximation above is used, then ${\displaystyle ^{y}x=y+1}$ if −1 < y ≤ 0, so ${\displaystyle ^{y}{\sqrt {y+1}}_{s}}$ cannot exist.

In the same way as the square super-root, terminology for other super-roots can be based on the normal roots: "cube super-roots" can be expressed as ${\displaystyle {\sqrt[{3}]{x}}_{s}}$; the "4th super-root" can be expressed as ${\displaystyle {\sqrt[{4}]{x}}_{s}}$; and the "nth super-root" is ${\displaystyle {\sqrt[{n}]{x}}_{s}}$. Note that ${\displaystyle {\sqrt[{n}]{x}}_{s}}$ may not be uniquely defined, because there may be more than one n^th root. For example, x has a single (real) super-root if n is odd, and up to two if n is even.^{[citation needed]}

Just as with the extension of tetration to infinite heights, the super-root can be extended to n = ∞, being well-defined if 1/e ≤ x ≤ e. Note that ${\displaystyle x={^{\infty }y}=y^{\left[^{\infty }y\right]}=y^{x},}$ and thus that ${\displaystyle y=x^{1/x}}$. Therefore, when it is well defined, ${\displaystyle {\sqrt[{\infty }]{x}}_{s}=x^{1/x}}$ and, unlike normal tetration, is an elementary function. For example, ${\displaystyle {\sqrt[{\infty }]{2}}_{s}=2^{1/2}={\sqrt {2}}}$.

It follows from the Gelfond–Schneider theorem that super-root ${\displaystyle {\sqrt {n}}_{s}}$ for any positive integer n is either integer or transcendental, and ${\displaystyle {\sqrt[{3}]{n}}_{s}}$ is either integer or irrational.^[21] It is still an open question whether irrational super-roots are transcendental in the latter case.

Once a continuous increasing (in x) definition of tetration, ^xa, is selected, the corresponding super-logarithm ${\displaystyle \operatorname {slog} _{a}x}$ or ${\displaystyle \log _{a}^{4}x}$ is defined for all real numbers x, and a > 1.

The function slog_a x satisfies:

${\displaystyle {\begin{aligned}\operatorname {slog} _{a}{^{x}a}&=x\\\operatorname {slog} _{a}a^{x}&=1+\operatorname {slog} _{a}x\\\operatorname {slog} _{a}x&=1+\operatorname {slog} _{a}\log _{a}x\\\operatorname {slog} _{a}x&\geq -2\end{aligned}}}$

Other than the problems with the extensions of tetration, there are several open questions concerning tetration, particularly when concerning the relations between number systems such as integers and irrational numbers:

• It is not known whether there is an integer ${\displaystyle n\geq 4}$ for which ⁿπ is an integer, because we could not calculate precisely enough the numbers of digits after the decimal points of ${\displaystyle \pi }$.^{[22][additional citation(s) needed]} It is similar for ⁿe for ${\displaystyle n\geq 5}$, as we are not aware of any other methods besides some direct computation. In fact, since ${\displaystyle \log _{10}(e)\cdot {}^{3}e=1656520.36764}$, then ${\displaystyle {}^{4}e>2\cdot 10^{1656520}}$. Given ${\displaystyle {}^{3}\pi <1.35\cdot 10^{18}\ll 10^{1656520}}$ and ${\displaystyle \pi <e^{2}}$, then ${\displaystyle {}^{4}\pi <{}^{n}e}$ for ${\displaystyle n\geq 5}$. It is believed that ⁿe is not an integer for any positive integer n, due to the algebraic independence of ${\displaystyle e,{}^{2}e,{}^{3}e,\dots }$, given Schanuel's conjecture.^[23]
• It is not known whether ⁿq is rational for any positive integer n and positive non-integer rational q.^[21] For example, it is not known whether the positive root of the equation ⁴x = 2 is a rational number.^{[citation needed]}
• It is not known whether ^eπ or ^πe (defined using Kneser's extension) are rationals or not.

For each graph H on h vertices and each ε > 0, define

${\displaystyle D=2\uparrow \uparrow 5h^{4}\log(1/\varepsilon ).}$

Then each graph G on n vertices with at most n^h/D copies of H can be made H-free by removing at most εn² edges.^[24]

Wikimedia Commons has media related to tetration.

Look up tetration in Wiktionary, the free dictionary.

• Ackermann function
• Big O notation
• Double exponential function
• Hyperoperation
• Iterated logarithm
• Symmetric level-index arithmetic