Kernels, truth and satisfaction

The Kotlarski–Krajewski–Lachlan Theorem says that every resplendent model of Peano Arithmetic has a full satisfaction class. Enayat and Visser gave a more model-theoretic proof of this theorem. We redo their proof using kernels of directed graphs.