Axiom Beta is a set-theoretic principle about well-founded relations. It says: any set-like well-founded relation can be collapsed to a membership relation on some transitive set. The axiom is mild — it doesn't assert the existence of large sets, doesn't invoke choice, doesn't require full separation or replacement. It constrains the behavior of well-founded relations, a modest structural assumption.
Frittaion and Genovesi prove it implies elementary transfinite recursion. Given Axiom Beta, you can define functions by recursion along any well-ordering, as long as the recursion step is elementary (Δ₀-definable). You can build relativized constructible hierarchies for all sets. You can compute the Veblen function and all primitive recursive set functions. The modest axiom generates substantial transfinite computational power.
The gap between what the axiom appears to say and what it implies is the structural surprise. Axiom Beta looks like a local condition — it governs how individual well-founded relations behave. Transfinite recursion is a global capacity — it enables computations that extend through the entire ordinal hierarchy. The local condition implies the global capacity because the collapsing operation that Axiom Beta guarantees provides exactly the scaffolding that transfinite recursion needs: at each step of the recursion, you can collapse the accumulated structure into a well-founded set, preparing the ground for the next step.
The result positions Axiom Beta precisely in the reverse-mathematical landscape: it is equivalent to ATR₀^set without countability. This is a specific, well-studied strength — strong enough for most of ordinary mathematics, weak enough to have clear boundaries. The axiom that seems to say almost nothing turns out to say exactly the right thing.