  We study subsets of countable recursively saturated models of $\mathsf{PA}$
which can be defined using pathologies in satisfaction classes. More precisely,
we characterize those subsets $X$ such that there is a satisfaction class $S$
where $S$ behaves correctly on an idempotent disjunction of length $c$ if and
only if $c \in X$. We generalize this result to characterize several types of
pathologies including double negations, blocks of extraneous quantifiers, and
binary disjunctions and conjunctions. We find a surprising relationship between
the cuts which can be defined in this way and arithmetic saturation: namely, a
countable nonstandard model is arithmetically saturated if and only if every
cut can be the "idempotent disjunctively correct cut" in some satisfaction
class. We describe the relationship between types of pathologies and the
closure properties of the cuts defined by these pathologies.
