Is there a known result to the effect that it cannot be the case that for some natural $n$, there is a formula of length $n$ such that all cardinals can be defined by a formula whose length is shorter than $n$?


I'm speaking in the milieu of some fragment of a standard set theory extending first order logic with identity and membership, for example $\text{ZF-Regularity}$.


I've always expected that as regards the $\aleph\_\alpha$ numbers the bigger it is the longer is the shortest definition of it. Or in general there cannot be a finite bound on definability of all of them. Is that correct?


Should the above be un-attainable, then is there a known argument against for example $n=10$ being such an upper bound?


Related is the following question: is it the case that definability of being ***strictly subnumerous to $\aleph\_\alpha$*** is always equal or greater than definability of being ***strictly subnumerous to $\aleph\_\beta$*** for all $ \beta >\alpha$? By 'definability' I mean the shortest defining expression of course.


***After-note:*** that Joel David Hamkins mentioned that the above linear assumption is FALSE, then my last question is:


is it the case that the definition of $< \aleph\_i$ is always shorter than or equal in length to the defintion of $< \aleph\_j$ as long as $i,j$ are both finite naturals and $i<j$?



Can there be an upper bound on definability of cardinal numbers in ZF?
Yes. This is an easy consequence of the reflection theorem. The point is that we can reason about definability with respect to a small collection of formulas within a model.


Put all formulas of length $\leq n$ (up to renaming variables) in a finite set $S$. Let $V\_\alpha$ be such that for all $\phi(x) \in S$, and all $a \in V\_\alpha$, $V\_\alpha \models \phi(a) \Leftrightarrow V\models \phi(a)$. $V$ can see that there are only finitely many cardinals that can be defined by a formula in $S$ in the structure $V\_\alpha$. By the absoluteness of $V\_\alpha$ with respect to $S$, the same holds for $V$, so that there is a cardinal $\kappa$ such which is not defined in $V$ by a formula in $S$.


This also shows that only finitely many natural numbers can be defined by a formula in $S$. And the same kind of reasoning can be carried out in the language of PA. We can also draw the same kind of conclusion about Levy complexity.


On the other hand, if $\alpha$ is the least ordinal such that $L\_\alpha \models \text{ZFC}$, then every element of $L\_\alpha$ is definable. So while ZFC can express, for each $n$ separately, "x is definable by a formula of length/complexity $\leq n$," it cannot express simply, "x is definable."


