We give an explicit Gimel recursion for cardinal exponentiation. First recover the continuum function by induction on infinite cardinals. At a regular ,
because . At a singular , put and , whose value is already known. A cofinal sequence gives
Indeed , while gives the reverse inequality after raising to .
If the supremum is attained, the continuum function is eventually constant below , and we may choose with and . Then . If it is not attained, the increasing cofinal power values show . To verify the reverse cofinality bound, fewer than such lower power values have indices bounded below , and cannot be cofinal in ; the upper bound comes from . Consequently
Every singular-stage value is therefore determined by the previously computed powers and the given Gimel function.
Now fix an infinite exponent and recurse on the infinite base . If , then , already known. For a successor base , every function has bounded range, and each bounded range has size at most . Hence
This is the Hausdorff formula for cardinal exponentiation. For a limit base , put and . If , all ranges are bounded and counting over those bounds gives (here ).
If , then . To see the nontrivial upper bound, use a cofinal sequence of bounds . A function is coded by the assignment of each argument to one of these bounds, together with padded functions into the corresponding bounds. The assignment has at most possibilities, and the functions have at most possibilities. Conversely and , giving the lower bound. If is attained as , then by currying; otherwise by the same cofinal-index argument as above. Thus
Only smaller-base powers occur in , so this is a genuine recursion, not an implicit appeal to the unknown power.
Finally, finite positive exponents give for infinite ; finite bases at infinite exponents satisfy for . The cases with base or , exponent , or both arguments finite are elementary, with under the empty-function convention. The Gimel function therefore determines both requested class functions completely.
The Beth numbers form a strictly increasing continuous sequence: strictness comes from Cantor theorem, and at a limit one has . A cofinal sequence in of length therefore induces a cofinal sequence in , giving .
Conversely, let be cofinal in . For each choose with . The indices must be cofinal in ; otherwise all would be bounded by a single smaller Beth number. Thus , and
This is the cofinality of a continuous cardinal hierarchy at a nonzero limit index; the limit hypothesis is essential to the supremum argument.
Let . This set is stationary: in any club set, choose a strictly increasing countable sequence and take its supremum, which lies in the club set and has cofinality . For each choose an increasing cofinal sequence .
Fix . For every above , some exceeds . Partition this stationary tail by the least such . A countable union of nonstationary sets is nonstationary, because fewer than club sets have club filter completeness, so some cell is stationary. On it the regressive function has, by Fodor lemma, a stationary fiber at a value .
Let . The preceding argument says is unbounded in . Since , at least one is unbounded and therefore has size . Its fibers are pairwise disjoint stationary sets. Enumerate of them as , , and define for , while
Adding a remainder preserves stationarity and introduces no overlap. Consequently
This proves the stationary partition by cofinal-sequence fibers directly for every regular uncountable .
The bounding number is the least size of an unbounded family in . The almost disjointness number is the least size of an infinite maximal almost disjoint family on omega of infinite subsets of . Requiring the family to be infinite excludes trivial finite maximal partitions.
A countable family is bounded by . Thus .
Suppose an infinite almost disjoint family on omega has size less than . Choose distinct members and put . These are infinite and pairwise disjoint. For each , define whenever the intersection is finite. If at the exceptional index , set . These are the only possible infinite intersections. A single eventually dominates every , because there are fewer than of them. Pick with and put .
For not among the selected , only finitely many can lie in . The same is true for , with its single exceptional index ignored. Thus is infinite and almost disjoint from every member of , so the family was not maximal. This bounding-to-almost-disjointness inequality proves .
Finally start with an infinite pairwise disjoint family and use Zorn's lemma to extend it to a maximal almost disjoint family on omega. It is a family of subsets of , so has cardinality at most . Therefore
The axiom of infinity excludes and all smaller stages, so the cardinal is uncountable. Full semantics for second-order logic is decisive: every externally specified functional relation whose ordered pairs lie in is an allowed class parameter, even if the relation itself is not an element of .
If , choose an external cofinal function . Its graph is an allowed class parameter: each input, output and ordered pair has rank of a set below the infinite cardinal , which is a limit ordinal. The domain belongs to . The second-order form of Axiom schema of replacement would give its range as an element of . But a cofinal subset of has rank of a set and cannot belong to . Therefore .
If for a cardinal , choice supplies an external surjection . The domain belongs to and the ordered pairs of its graph have ranks below . Applying Axiom schema of replacement to this external functional class would put its range, the ordinal , in , again impossible. Hence for every .
Consequently
These are exactly the defining conditions for a strongly inaccessible cardinal. This full second-order replacement rank obstruction would not follow from Henkin semantics, where the available class relations may exclude the external functions just used.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact