 Many also believe that all of finitism is captured by PRA, but others believe finitism can be extended to forms of recursion beyond primitive recursion, up to ε0, which is the proof-theoretic ordinal of Peano arithmetic.PRA's proof theoretic ordinal is ωω, where ω is the smallest transfinite ordinal.PRA is sometimes called Skolem arithmetic.