Summary: We show that for every countable recursively saturated model \(M\) of Peano arithmetic and every subset \(A\subseteq M\), there exists a full satisfaction class \(S_A \subseteq M^2\) such that \(A\) is definable in \((M,S_A)\) without parameters. It follows that in every such model, there exists a full satisfaction class which makes every element definable, and thus the expanded model is minimal and rigid. On the other hand, as observed by R. Kossak [Notre Dame J. Formal Logic 26, 1–8 (1985; Zbl 0562.03040)], for every full satisfaction class \(S\) there are two elements which have the same arithmetical type, but exactly one of them is in \(S\). In particular, the automorphism group of a model expanded with a satisfaction class is never equal to the automorphism group of the original model. The analogue of the first result proved here for full satisfaction classes was obtained also by Roman Kossak [loc. cit.] for partial inductive satisfaction classes. However, the proof relied on the induction scheme in a crucial way, so recapturing the result in the setting of full satisfaction classes requires quite different arguments.