An Ordinal Analysis of Admissible Set Theory Using Recursion on Ordinal Notations
journal contributionposted on 2001-05-23, 00:00 authored by Jeremy AvigadJeremy Avigad
The notion of a function from ℕ to ℕ defined by recursion on ordinal notations is fundamental in proof theory. Here this notion is generalized to functions on the universe of sets, using notations for well orderings longer than the class of ordinals. The generalization is used to bound the rate of growth of any function on the universe of sets that is Σ1-definable in Kripke–Platek admissible set theory with an axiom of infinity. Formalizing the argument provides an ordinal analysis.