A note on the variety of satisfaction classes (Q2639847): Difference between revisions

A technique which was developed by \textit{H. Kotlarski} and \textit{Z. Ratajczyk} [Ann. Pure Appl. Logic 47, No.3, 199-223 (1990; Zbl 0708.03014)] to construct full inductive satisfaction classes on recursively saturated models of arithmetic, is used here to prove that every countable recursively saturated model M of PA has infinitely many incompatible full inductive satisfaction classes. The main theorem is applied to obtain results about the variety of expansions of recursively saturated models of PA to models of some fragments of second-order arithmetic.