Inductive full satisfaction classes (Q920081)

An arithmetized system of \(\omega\)-logic was used by the first author in Z. Math. Logik Gundlagen Math. 32, 531-544 (1986; Zbl 0622.03025) in order to characterize those countable models of PA which have full \(\Delta_ 0\)-inductive satisfaction classes. The present authors extend this system to obtain a complete characterization of models which have full \(\Sigma_ n\)-inductive satisfaction classes. The characterization is in terms of consistency of appropriate systems and proofs are given via a careful proof theoretic analysis of some rapidly growing functions which are defined in a natural way in the language of PA with a predicate symbol for a satisfaction class.