A countable model M of PA is recursively saturated iff M has an expansion to a model of PAI. Theorem B. There is a sentence α in the language obtained by adding a unary predicate I(x) to the language of arithmetic such that given any nonstandard model M of PA of any cardinality, ...