We give a condition on T ⊇ PA which is equivalent (for countable and recursively saturated M ⊨ T) to the existence of a full inductive satisfaction class for M. Similarly for Σn-inductive full satisfaction classes. The condition is in terms of consistency of some system of ω-logic, iterated to the transfinite.
