Is tetration and quintation etc. of infinite cardinals well defined? I would like to know whether tetration and quintation functions are well defined for infinite cardinals, thus, for example, $$\aleph_0 \text{ [tet] } \aleph_0 =  \aleph_0 ^ {\aleph_0 ^ {\aleph_0^{\dots}}}$$ taken $\aleph_0$ times and compounded from top to bottom, to produce a higher cardinality power set upon every recursive iteration.  
In an analogous manner, $$\aleph_0 \text{ [quint] }\aleph_0 = \aleph_0 \text{ [tet] } (\aleph_0  \text{ [tet] } (\aleph_0 \text{ [tet] } \dots))$$ taken recursively $\aleph_0$ times, again compounded from top to bottom.
Since as one moves to ever higher compouding operations like tetration, quintation, sextation etc. the series of new cardinals so producded would cleary increase MUCH faster than under an operation as "slow" as "mere" exponentially recursive power set taking, do we perhaps get the production of new huge cardinals that are of a different order and character than those generated by applying infinite power set operartions?  Would all of these much larger cardinals, including even $\aleph_0\, [\aleph_0\text{ compounding operation}] \,\aleph_0$, itself compounded $\aleph_0$ times etc. still be smaller than other better known large cardinals defined in some other manner?  
I hope these questions are fairly easy to comprehend. They hardly go much beyond elementary set theory. Thanks for reading and let me know if you can answer any of them!
 A: dot dot dots are problematic in expressions because we require all expressions to be finite in length.  A reasonable way to interpret the first part of your question is $$\aleph_0 \text{ [tet] } \aleph_0 = \sup\{\aleph_0, \aleph_0 ^ {\aleph_0},\aleph_0 ^ {\aleph_0 ^ {\aleph_0}},\dots\}$$  This is less than or equal to the first strong inaccessible (assuming it exists).  A standard result is that if the exponent is infinite we can replace any base less than or equal to the cofinality of the exponent with $2$ so now we have 
$$\aleph_0 \text{ [tet] } \aleph_0 = \sup\{\aleph_0, 2 ^ {\aleph_0},2 ^ {2 ^ {\aleph_0}},\dots\}$$  If $\kappa$ is strongly inaccessible, we have $2^\alpha \lt \kappa$ whenever $\alpha \lt \kappa$ so the $\sup$ is at most $\kappa$.  It must be lower because this is an increasing chain of length $\aleph_0$ so the cofiniality of the $\sup$ is $\aleph_0$ and the $\sup$ is not inaccessible.
A: Assuming the GCH, the tetration example is tantamount to $\aleph_\omega$. If you rewrite the GCH as a tetration formula, then the pentation gets you the sequence $\aleph_\omega$, $\aleph_{\omega_\omega}$... until you get the first fixed point of the aleph function. (This is because $\aleph_0 \uparrow\uparrow \aleph_0$ gets you $\aleph_{\aleph_0}$ by replacing the index with the given factor, so then $\aleph_0 \uparrow\uparrow \aleph_{\aleph_0}$ would be $\aleph_{\aleph_{\aleph_0}}$, etc.)* But even waiving the GCH, the other posters are right, you never get higher than various $\beth$ numbers and their like, based on higher operations, without presupposing an inaccessible number (as the index of your operator) in the first place.
Major edit: even a compounded operation like $\aleph_0 \uparrow^{\aleph_0 \uparrow^{\aleph_0}\aleph_0} \aleph_0$ or an infinite such tower would give a cardinal cofinal with $\aleph_0$ and hence not an inaccessible cardinal.
Second major edit: consider $2 \uparrow^n m$, for $m$ greater than 2. This tends towards $\omega$ as $n$ increases, but without presupposing $\omega$ in place of $n$, this sequence never actually reaches it. Likewise, the smallest uncountable inaccessible must be presupposed as the index of the operation that "accesses" it. Let $\kappa$ be the smallest uncountable inaccessible. Then write $\aleph_{\alpha<\kappa} \uparrow^{\beta<\kappa} \lambda < \kappa$, when $\lambda$ is < $\kappa$ also. This expresses how without starting from $\kappa$ somewhere in one's arithmetic, one will not reach it. So one might parse "inaccessible" as "inaccessible without presupposition," hence the need for an axiom of inaccessible cardinality.
*Start with the fact that $2^{\aleph_0} = \aleph_0^{\aleph_0} = \aleph_0 \uparrow\uparrow 2$, or $\aleph_0 \uparrow\uparrow 1+1$. Then the GCH (for the $\aleph_n$ anyway) in tetration format would be $\aleph_n \uparrow\uparrow 1 + m = \aleph_{n+m}.$ For example, $2^{\aleph_2} = \aleph_2^{\aleph_2} = \aleph_2 \uparrow\uparrow 2$, so the formula gives the successor cardinal in this case again, and so on. In the infinite case, $1 + \aleph_0 = \aleph_0$, so $\aleph_0 \uparrow\uparrow \aleph_0 = \aleph_{0+\aleph_0}$. Note that $n+\aleph_0 = \aleph_0$, for all natural numbers $n$. So here $\aleph_2 \uparrow\uparrow \aleph_0$ also gives $\aleph_{\omega}$, and so on for all the $\aleph_n$. But $\aleph_0 \uparrow\uparrow \aleph_2 = \aleph_{\omega_2}$, here, etc.
Last edit: it turns out, though, that these formulae break down at the first fixed point of the aleph function, $\aleph_{\omega_{\omega_{\omega...}}}$. I will call this $\aleph_f$ or just then $f$ since $\aleph_f = f$ (this is its fixed-point character). Even in ZFC, we can establish some hypothetical bounds on powersets, like Shelah's $2^{\aleph_n} < \aleph_{\omega} \rightarrow 2^{\aleph_{\omega}} < \aleph_{\omega_4}$. We can also express failures of the GCH at various points. See Moti Gitik's "No bound for the first fixed point" for a model where the GCH holds up to $f$ but there is no bound as such on the powerset of $f$. Analogously, on our tetration model, $f \uparrow\uparrow f = f \uparrow^5 2$; I will leave to you the exercise of showing that our tetration formula gives a directly impossible result thereby. Note that here $\aleph_0 \uparrow\uparrow \aleph_f = \aleph_{\aleph_f} = \aleph_f = f$. The GCH would have $f^f = f^+$, which I think would be $\aleph_{f+1}$, which I think isn't a fixed point. But all this gives us that $f \uparrow\uparrow 2 = \aleph_{f+1}$. Now what happens then if our formula adds $f$ to itself?
