A note on satisfaction classes (Q2266714)

Satisfaction classes \(S_ 1\), \(S_ 2\) on a model M are called elementarily equivalent (isomorphic) if the structures \((M,S_ 1)\), \((M,S_ 2)\) are elementarily equivalent (isomorphic). It is shown that for every countable, recursively saturated model of arithmetic M there are continuum many pairwise non elementarily equivalent inductive satisfaction classes on M, also for every inductive satisfaction class S on M there are continuum many pairwise nonisomorphic satisfaction classes on M which are elementary equivalent to S. An application to constructions of many nonisormorphic pairs of recursively saturated models of arithmetic is given.