Fast Growing Hierarchy Calculator ((exclusive)) Site

, it proves that the algorithm's correctness cannot be demonstrated using standard Peano Arithmetic. 2. Proof Theory

is an ordinal. The standard definition (often using the Wainer hierarchy convention) starts with a base function and builds upward through three rules: f0(n)=n+1f sub 0 of n equals n plus 1 This is simple successor addition. Successor Ordinals: fast growing hierarchy calculator